/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/locks/test_locks_6.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-07 00:52:42,686 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-07 00:52:42,687 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-07 00:52:42,704 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-07 00:52:42,704 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-07 00:52:42,705 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-07 00:52:42,706 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-07 00:52:42,707 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-07 00:52:42,708 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-07 00:52:42,709 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-07 00:52:42,709 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-07 00:52:42,710 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-07 00:52:42,710 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-07 00:52:42,711 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-07 00:52:42,714 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-07 00:52:42,714 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-07 00:52:42,715 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-07 00:52:42,715 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-07 00:52:42,716 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-07 00:52:42,717 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-07 00:52:42,718 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-07 00:52:42,719 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-07 00:52:42,720 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-07 00:52:42,720 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-07 00:52:42,721 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-07 00:52:42,722 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-07 00:52:42,722 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-07 00:52:42,723 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-07 00:52:42,723 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-07 00:52:42,723 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-07 00:52:42,724 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-07 00:52:42,724 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-07 00:52:42,724 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-07 00:52:42,725 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-07 00:52:42,725 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-07 00:52:42,726 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-07 00:52:42,726 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-07 00:52:42,726 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-07 00:52:42,726 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-07 00:52:42,727 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-07 00:52:42,727 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-07 00:52:42,730 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-07 00:52:42,730 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-07 00:52:42,736 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-07 00:52:42,736 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-07 00:52:42,737 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-07 00:52:42,737 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-07 00:52:42,737 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-07 00:52:42,737 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-07 00:52:42,737 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-07 00:52:42,737 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-07 00:52:42,737 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-07 00:52:42,737 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-07 00:52:42,737 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-07 00:52:42,738 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-07 00:52:42,738 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-07 00:52:42,738 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-07 00:52:42,738 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-07 00:52:42,738 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 00:52:42,738 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-07 00:52:42,738 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-07 00:52:42,738 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-07 00:52:42,738 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-07 00:52:42,739 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-07 00:52:42,739 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-07 00:52:42,739 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-07 00:52:42,916 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-07 00:52:42,932 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-07 00:52:42,933 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-07 00:52:42,934 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-07 00:52:42,935 INFO L275 PluginConnector]: CDTParser initialized [2022-04-07 00:52:42,935 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_6.c [2022-04-07 00:52:42,983 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18bea9edb/236ab95e9ab642a8acb52b4dc580ac02/FLAG9eee4d510 [2022-04-07 00:52:43,268 INFO L306 CDTParser]: Found 1 translation units. [2022-04-07 00:52:43,268 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_6.c [2022-04-07 00:52:43,274 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18bea9edb/236ab95e9ab642a8acb52b4dc580ac02/FLAG9eee4d510 [2022-04-07 00:52:43,714 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18bea9edb/236ab95e9ab642a8acb52b4dc580ac02 [2022-04-07 00:52:43,716 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-07 00:52:43,717 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-07 00:52:43,718 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-07 00:52:43,718 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-07 00:52:43,722 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-07 00:52:43,723 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 12:52:43" (1/1) ... [2022-04-07 00:52:43,724 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ae1c165 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:52:43, skipping insertion in model container [2022-04-07 00:52:43,724 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 12:52:43" (1/1) ... [2022-04-07 00:52:43,728 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-07 00:52:43,738 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-07 00:52:43,835 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_6.c[2544,2557] [2022-04-07 00:52:43,837 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 00:52:43,854 INFO L203 MainTranslator]: Completed pre-run [2022-04-07 00:52:43,889 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_6.c[2544,2557] [2022-04-07 00:52:43,890 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 00:52:43,915 INFO L208 MainTranslator]: Completed translation [2022-04-07 00:52:43,915 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:52:43 WrapperNode [2022-04-07 00:52:43,915 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-07 00:52:43,918 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-07 00:52:43,918 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-07 00:52:43,918 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-07 00:52:43,931 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:52:43" (1/1) ... [2022-04-07 00:52:43,931 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:52:43" (1/1) ... [2022-04-07 00:52:43,935 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:52:43" (1/1) ... [2022-04-07 00:52:43,935 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:52:43" (1/1) ... [2022-04-07 00:52:43,938 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:52:43" (1/1) ... [2022-04-07 00:52:43,941 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:52:43" (1/1) ... [2022-04-07 00:52:43,942 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:52:43" (1/1) ... [2022-04-07 00:52:43,943 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-07 00:52:43,945 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-07 00:52:43,945 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-07 00:52:43,945 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-07 00:52:43,946 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:52:43" (1/1) ... [2022-04-07 00:52:43,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 00:52:43,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 00:52:43,968 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-07 00:52:43,969 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-07 00:52:43,990 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-07 00:52:43,990 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-07 00:52:43,990 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-07 00:52:43,991 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-07 00:52:43,991 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-07 00:52:43,991 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-07 00:52:43,991 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-07 00:52:43,991 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-07 00:52:43,991 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-07 00:52:43,991 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-07 00:52:43,991 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-07 00:52:43,991 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-07 00:52:43,991 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-07 00:52:43,992 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-07 00:52:43,992 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-07 00:52:43,992 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-07 00:52:44,033 INFO L234 CfgBuilder]: Building ICFG [2022-04-07 00:52:44,034 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-07 00:52:44,125 INFO L275 CfgBuilder]: Performing block encoding [2022-04-07 00:52:44,130 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-07 00:52:44,130 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-07 00:52:44,131 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 12:52:44 BoogieIcfgContainer [2022-04-07 00:52:44,131 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-07 00:52:44,132 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-07 00:52:44,133 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-07 00:52:44,135 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-07 00:52:44,135 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.04 12:52:43" (1/3) ... [2022-04-07 00:52:44,136 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@145229c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 12:52:44, skipping insertion in model container [2022-04-07 00:52:44,136 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:52:43" (2/3) ... [2022-04-07 00:52:44,136 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@145229c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 12:52:44, skipping insertion in model container [2022-04-07 00:52:44,136 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 12:52:44" (3/3) ... [2022-04-07 00:52:44,137 INFO L111 eAbstractionObserver]: Analyzing ICFG test_locks_6.c [2022-04-07 00:52:44,140 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-07 00:52:44,140 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-07 00:52:44,168 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-07 00:52:44,172 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-07 00:52:44,172 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-07 00:52:44,182 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 27 states have (on average 1.8148148148148149) internal successors, (49), 28 states have internal predecessors, (49), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 00:52:44,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-07 00:52:44,187 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 00:52:44,188 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 00:52:44,188 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 00:52:44,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 00:52:44,191 INFO L85 PathProgramCache]: Analyzing trace with hash 1747552289, now seen corresponding path program 1 times [2022-04-07 00:52:44,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-07 00:52:44,197 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1820858368] [2022-04-07 00:52:44,204 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-07 00:52:44,204 INFO L85 PathProgramCache]: Analyzing trace with hash 1747552289, now seen corresponding path program 2 times [2022-04-07 00:52:44,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 00:52:44,206 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194656928] [2022-04-07 00:52:44,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 00:52:44,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 00:52:44,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:52:44,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 00:52:44,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:52:44,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 00:52:44,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 00:52:44,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194656928] [2022-04-07 00:52:44,375 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194656928] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:52:44,375 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:52:44,375 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:52:44,377 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-07 00:52:44,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1820858368] [2022-04-07 00:52:44,377 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1820858368] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:52:44,377 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:52:44,378 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:52:44,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87641427] [2022-04-07 00:52:44,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 00:52:44,381 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 00:52:44,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-07 00:52:44,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 00:52:44,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 00:52:44,409 INFO L87 Difference]: Start difference. First operand has 33 states, 27 states have (on average 1.8148148148148149) internal successors, (49), 28 states have internal predecessors, (49), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:52:44,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 00:52:44,548 INFO L93 Difference]: Finished difference Result 64 states and 103 transitions. [2022-04-07 00:52:44,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 00:52:44,550 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-07 00:52:44,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 00:52:44,560 INFO L225 Difference]: With dead ends: 64 [2022-04-07 00:52:44,562 INFO L226 Difference]: Without dead ends: 49 [2022-04-07 00:52:44,565 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-07 00:52:44,568 INFO L913 BasicCegarLoop]: 56 mSDtfsCounter, 106 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-07 00:52:44,569 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [106 Valid, 65 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-07 00:52:44,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-04-07 00:52:44,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 35. [2022-04-07 00:52:44,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 31 states have (on average 1.7741935483870968) internal successors, (55), 31 states have internal predecessors, (55), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:52:44,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 58 transitions. [2022-04-07 00:52:44,594 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 58 transitions. Word has length 17 [2022-04-07 00:52:44,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 00:52:44,595 INFO L478 AbstractCegarLoop]: Abstraction has 35 states and 58 transitions. [2022-04-07 00:52:44,595 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:52:44,595 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 58 transitions. [2022-04-07 00:52:44,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-07 00:52:44,595 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 00:52:44,596 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 00:52:44,596 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-07 00:52:44,596 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 00:52:44,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 00:52:44,597 INFO L85 PathProgramCache]: Analyzing trace with hash -1867356637, now seen corresponding path program 1 times [2022-04-07 00:52:44,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-07 00:52:44,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [752721658] [2022-04-07 00:52:44,598 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-07 00:52:44,598 INFO L85 PathProgramCache]: Analyzing trace with hash -1867356637, now seen corresponding path program 2 times [2022-04-07 00:52:44,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 00:52:44,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715749730] [2022-04-07 00:52:44,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 00:52:44,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 00:52:44,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:52:44,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 00:52:44,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:52:44,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 00:52:44,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 00:52:44,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715749730] [2022-04-07 00:52:44,652 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715749730] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:52:44,652 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:52:44,652 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:52:44,652 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-07 00:52:44,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [752721658] [2022-04-07 00:52:44,653 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [752721658] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:52:44,653 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:52:44,654 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:52:44,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653010188] [2022-04-07 00:52:44,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 00:52:44,655 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 00:52:44,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-07 00:52:44,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 00:52:44,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 00:52:44,656 INFO L87 Difference]: Start difference. First operand 35 states and 58 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:52:44,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 00:52:44,736 INFO L93 Difference]: Finished difference Result 78 states and 133 transitions. [2022-04-07 00:52:44,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 00:52:44,738 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-07 00:52:44,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 00:52:44,738 INFO L225 Difference]: With dead ends: 78 [2022-04-07 00:52:44,739 INFO L226 Difference]: Without dead ends: 49 [2022-04-07 00:52:44,739 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-07 00:52:44,740 INFO L913 BasicCegarLoop]: 56 mSDtfsCounter, 88 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-07 00:52:44,740 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [88 Valid, 63 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-07 00:52:44,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-04-07 00:52:44,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2022-04-07 00:52:44,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 43 states have (on average 1.744186046511628) internal successors, (75), 43 states have internal predecessors, (75), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:52:44,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 78 transitions. [2022-04-07 00:52:44,749 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 78 transitions. Word has length 17 [2022-04-07 00:52:44,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 00:52:44,749 INFO L478 AbstractCegarLoop]: Abstraction has 47 states and 78 transitions. [2022-04-07 00:52:44,749 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:52:44,749 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 78 transitions. [2022-04-07 00:52:44,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-07 00:52:44,750 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 00:52:44,750 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 00:52:44,750 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-07 00:52:44,750 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 00:52:44,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 00:52:44,753 INFO L85 PathProgramCache]: Analyzing trace with hash -1660239210, now seen corresponding path program 1 times [2022-04-07 00:52:44,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-07 00:52:44,755 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1450324367] [2022-04-07 00:52:44,756 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-07 00:52:44,756 INFO L85 PathProgramCache]: Analyzing trace with hash -1660239210, now seen corresponding path program 2 times [2022-04-07 00:52:44,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 00:52:44,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953796702] [2022-04-07 00:52:44,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 00:52:44,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 00:52:44,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:52:44,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 00:52:44,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:52:44,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 00:52:44,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 00:52:44,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953796702] [2022-04-07 00:52:44,806 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953796702] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:52:44,806 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:52:44,806 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:52:44,807 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-07 00:52:44,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1450324367] [2022-04-07 00:52:44,807 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1450324367] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:52:44,807 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:52:44,807 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:52:44,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8971911] [2022-04-07 00:52:44,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 00:52:44,808 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 00:52:44,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-07 00:52:44,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 00:52:44,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 00:52:44,808 INFO L87 Difference]: Start difference. First operand 47 states and 78 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:52:44,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 00:52:44,871 INFO L93 Difference]: Finished difference Result 73 states and 118 transitions. [2022-04-07 00:52:44,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 00:52:44,871 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-07 00:52:44,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 00:52:44,873 INFO L225 Difference]: With dead ends: 73 [2022-04-07 00:52:44,873 INFO L226 Difference]: Without dead ends: 52 [2022-04-07 00:52:44,873 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-07 00:52:44,876 INFO L913 BasicCegarLoop]: 66 mSDtfsCounter, 79 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 00:52:44,879 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [79 Valid, 73 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 00:52:44,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-07 00:52:44,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 50. [2022-04-07 00:52:44,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 46 states have (on average 1.673913043478261) internal successors, (77), 46 states have internal predecessors, (77), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:52:44,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 80 transitions. [2022-04-07 00:52:44,895 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 80 transitions. Word has length 18 [2022-04-07 00:52:44,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 00:52:44,895 INFO L478 AbstractCegarLoop]: Abstraction has 50 states and 80 transitions. [2022-04-07 00:52:44,895 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:52:44,896 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 80 transitions. [2022-04-07 00:52:44,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-07 00:52:44,896 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 00:52:44,896 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 00:52:44,896 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-07 00:52:44,896 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 00:52:44,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 00:52:44,897 INFO L85 PathProgramCache]: Analyzing trace with hash -2053266220, now seen corresponding path program 1 times [2022-04-07 00:52:44,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-07 00:52:44,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2146877504] [2022-04-07 00:52:44,897 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-07 00:52:44,898 INFO L85 PathProgramCache]: Analyzing trace with hash -2053266220, now seen corresponding path program 2 times [2022-04-07 00:52:44,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 00:52:44,898 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667627222] [2022-04-07 00:52:44,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 00:52:44,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 00:52:44,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:52:44,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 00:52:44,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:52:44,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 00:52:44,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 00:52:44,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667627222] [2022-04-07 00:52:44,953 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667627222] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:52:44,954 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:52:44,954 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:52:44,954 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-07 00:52:44,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2146877504] [2022-04-07 00:52:44,954 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2146877504] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:52:44,954 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:52:44,954 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:52:44,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408249607] [2022-04-07 00:52:44,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 00:52:44,955 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 00:52:44,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-07 00:52:44,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 00:52:44,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 00:52:44,957 INFO L87 Difference]: Start difference. First operand 50 states and 80 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:52:45,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 00:52:45,015 INFO L93 Difference]: Finished difference Result 130 states and 216 transitions. [2022-04-07 00:52:45,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 00:52:45,015 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-07 00:52:45,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 00:52:45,019 INFO L225 Difference]: With dead ends: 130 [2022-04-07 00:52:45,019 INFO L226 Difference]: Without dead ends: 89 [2022-04-07 00:52:45,021 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-07 00:52:45,023 INFO L913 BasicCegarLoop]: 48 mSDtfsCounter, 95 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 00:52:45,024 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [95 Valid, 55 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 00:52:45,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-04-07 00:52:45,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 87. [2022-04-07 00:52:45,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 83 states have (on average 1.6626506024096386) internal successors, (138), 83 states have internal predecessors, (138), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:52:45,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 141 transitions. [2022-04-07 00:52:45,042 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 141 transitions. Word has length 18 [2022-04-07 00:52:45,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 00:52:45,042 INFO L478 AbstractCegarLoop]: Abstraction has 87 states and 141 transitions. [2022-04-07 00:52:45,044 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:52:45,044 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 141 transitions. [2022-04-07 00:52:45,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-07 00:52:45,045 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 00:52:45,045 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 00:52:45,045 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-07 00:52:45,046 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 00:52:45,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 00:52:45,046 INFO L85 PathProgramCache]: Analyzing trace with hash 1561642706, now seen corresponding path program 1 times [2022-04-07 00:52:45,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-07 00:52:45,046 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [589238282] [2022-04-07 00:52:45,048 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-07 00:52:45,048 INFO L85 PathProgramCache]: Analyzing trace with hash 1561642706, now seen corresponding path program 2 times [2022-04-07 00:52:45,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 00:52:45,050 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611438022] [2022-04-07 00:52:45,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 00:52:45,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 00:52:45,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:52:45,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 00:52:45,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:52:45,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 00:52:45,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 00:52:45,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611438022] [2022-04-07 00:52:45,111 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611438022] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:52:45,111 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:52:45,111 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:52:45,112 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-07 00:52:45,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [589238282] [2022-04-07 00:52:45,112 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [589238282] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:52:45,112 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:52:45,112 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:52:45,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49737001] [2022-04-07 00:52:45,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 00:52:45,112 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 00:52:45,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-07 00:52:45,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 00:52:45,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 00:52:45,113 INFO L87 Difference]: Start difference. First operand 87 states and 141 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:52:45,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 00:52:45,167 INFO L93 Difference]: Finished difference Result 111 states and 179 transitions. [2022-04-07 00:52:45,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 00:52:45,168 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-07 00:52:45,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 00:52:45,169 INFO L225 Difference]: With dead ends: 111 [2022-04-07 00:52:45,169 INFO L226 Difference]: Without dead ends: 109 [2022-04-07 00:52:45,169 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-07 00:52:45,170 INFO L913 BasicCegarLoop]: 73 mSDtfsCounter, 62 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 00:52:45,171 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [62 Valid, 80 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 00:52:45,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-04-07 00:52:45,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 87. [2022-04-07 00:52:45,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 83 states have (on average 1.6385542168674698) internal successors, (136), 83 states have internal predecessors, (136), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:52:45,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 139 transitions. [2022-04-07 00:52:45,230 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 139 transitions. Word has length 18 [2022-04-07 00:52:45,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 00:52:45,230 INFO L478 AbstractCegarLoop]: Abstraction has 87 states and 139 transitions. [2022-04-07 00:52:45,230 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:52:45,231 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 139 transitions. [2022-04-07 00:52:45,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-07 00:52:45,232 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 00:52:45,232 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 00:52:45,232 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-07 00:52:45,232 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 00:52:45,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 00:52:45,239 INFO L85 PathProgramCache]: Analyzing trace with hash 773471640, now seen corresponding path program 1 times [2022-04-07 00:52:45,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-07 00:52:45,239 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [443145227] [2022-04-07 00:52:45,239 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-07 00:52:45,239 INFO L85 PathProgramCache]: Analyzing trace with hash 773471640, now seen corresponding path program 2 times [2022-04-07 00:52:45,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 00:52:45,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433706728] [2022-04-07 00:52:45,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 00:52:45,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 00:52:45,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:52:45,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 00:52:45,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:52:45,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 00:52:45,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 00:52:45,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433706728] [2022-04-07 00:52:45,281 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433706728] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:52:45,283 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:52:45,283 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:52:45,284 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-07 00:52:45,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [443145227] [2022-04-07 00:52:45,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [443145227] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:52:45,284 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:52:45,284 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:52:45,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049264737] [2022-04-07 00:52:45,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 00:52:45,284 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 00:52:45,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-07 00:52:45,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 00:52:45,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 00:52:45,285 INFO L87 Difference]: Start difference. First operand 87 states and 139 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:52:45,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 00:52:45,335 INFO L93 Difference]: Finished difference Result 155 states and 251 transitions. [2022-04-07 00:52:45,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 00:52:45,335 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-07 00:52:45,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 00:52:45,336 INFO L225 Difference]: With dead ends: 155 [2022-04-07 00:52:45,336 INFO L226 Difference]: Without dead ends: 153 [2022-04-07 00:52:45,336 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-07 00:52:45,337 INFO L913 BasicCegarLoop]: 45 mSDtfsCounter, 86 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 00:52:45,338 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [86 Valid, 52 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 00:52:45,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2022-04-07 00:52:45,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 119. [2022-04-07 00:52:45,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 115 states have (on average 1.617391304347826) internal successors, (186), 115 states have internal predecessors, (186), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:52:45,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 189 transitions. [2022-04-07 00:52:45,358 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 189 transitions. Word has length 19 [2022-04-07 00:52:45,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 00:52:45,358 INFO L478 AbstractCegarLoop]: Abstraction has 119 states and 189 transitions. [2022-04-07 00:52:45,358 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:52:45,358 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 189 transitions. [2022-04-07 00:52:45,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-07 00:52:45,362 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 00:52:45,362 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 00:52:45,362 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-07 00:52:45,362 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 00:52:45,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 00:52:45,362 INFO L85 PathProgramCache]: Analyzing trace with hash 1453530010, now seen corresponding path program 1 times [2022-04-07 00:52:45,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-07 00:52:45,363 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2128868272] [2022-04-07 00:52:45,363 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-07 00:52:45,363 INFO L85 PathProgramCache]: Analyzing trace with hash 1453530010, now seen corresponding path program 2 times [2022-04-07 00:52:45,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 00:52:45,363 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281948042] [2022-04-07 00:52:45,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 00:52:45,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 00:52:45,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:52:45,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 00:52:45,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:52:45,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 00:52:45,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 00:52:45,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281948042] [2022-04-07 00:52:45,415 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281948042] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:52:45,415 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:52:45,416 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:52:45,416 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-07 00:52:45,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2128868272] [2022-04-07 00:52:45,416 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2128868272] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:52:45,416 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:52:45,417 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:52:45,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767936325] [2022-04-07 00:52:45,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 00:52:45,419 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 00:52:45,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-07 00:52:45,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 00:52:45,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 00:52:45,420 INFO L87 Difference]: Start difference. First operand 119 states and 189 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:52:45,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 00:52:45,468 INFO L93 Difference]: Finished difference Result 271 states and 435 transitions. [2022-04-07 00:52:45,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 00:52:45,468 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-07 00:52:45,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 00:52:45,469 INFO L225 Difference]: With dead ends: 271 [2022-04-07 00:52:45,469 INFO L226 Difference]: Without dead ends: 161 [2022-04-07 00:52:45,470 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-07 00:52:45,471 INFO L913 BasicCegarLoop]: 60 mSDtfsCounter, 76 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 00:52:45,471 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [76 Valid, 67 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 00:52:45,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2022-04-07 00:52:45,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 159. [2022-04-07 00:52:45,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 155 states have (on average 1.5741935483870968) internal successors, (244), 155 states have internal predecessors, (244), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:52:45,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 247 transitions. [2022-04-07 00:52:45,486 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 247 transitions. Word has length 19 [2022-04-07 00:52:45,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 00:52:45,486 INFO L478 AbstractCegarLoop]: Abstraction has 159 states and 247 transitions. [2022-04-07 00:52:45,486 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:52:45,487 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 247 transitions. [2022-04-07 00:52:45,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-07 00:52:45,487 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 00:52:45,488 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 00:52:45,488 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-07 00:52:45,488 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 00:52:45,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 00:52:45,488 INFO L85 PathProgramCache]: Analyzing trace with hash -1791967575, now seen corresponding path program 1 times [2022-04-07 00:52:45,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-07 00:52:45,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [824750694] [2022-04-07 00:52:45,489 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-07 00:52:45,489 INFO L85 PathProgramCache]: Analyzing trace with hash -1791967575, now seen corresponding path program 2 times [2022-04-07 00:52:45,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 00:52:45,489 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159579245] [2022-04-07 00:52:45,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 00:52:45,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 00:52:45,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:52:45,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 00:52:45,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:52:45,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 00:52:45,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 00:52:45,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159579245] [2022-04-07 00:52:45,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159579245] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:52:45,536 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:52:45,536 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:52:45,537 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-07 00:52:45,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [824750694] [2022-04-07 00:52:45,537 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [824750694] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:52:45,537 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:52:45,537 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:52:45,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908753891] [2022-04-07 00:52:45,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 00:52:45,537 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 00:52:45,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-07 00:52:45,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 00:52:45,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 00:52:45,538 INFO L87 Difference]: Start difference. First operand 159 states and 247 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:52:45,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 00:52:45,583 INFO L93 Difference]: Finished difference Result 241 states and 373 transitions. [2022-04-07 00:52:45,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 00:52:45,583 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-07 00:52:45,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 00:52:45,585 INFO L225 Difference]: With dead ends: 241 [2022-04-07 00:52:45,585 INFO L226 Difference]: Without dead ends: 167 [2022-04-07 00:52:45,587 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-07 00:52:45,587 INFO L913 BasicCegarLoop]: 60 mSDtfsCounter, 77 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 00:52:45,588 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [77 Valid, 67 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 00:52:45,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2022-04-07 00:52:45,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 165. [2022-04-07 00:52:45,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 161 states have (on average 1.5403726708074534) internal successors, (248), 161 states have internal predecessors, (248), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:52:45,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 251 transitions. [2022-04-07 00:52:45,601 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 251 transitions. Word has length 20 [2022-04-07 00:52:45,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 00:52:45,601 INFO L478 AbstractCegarLoop]: Abstraction has 165 states and 251 transitions. [2022-04-07 00:52:45,601 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:52:45,601 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 251 transitions. [2022-04-07 00:52:45,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-07 00:52:45,601 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 00:52:45,601 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 00:52:45,602 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-07 00:52:45,602 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 00:52:45,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 00:52:45,602 INFO L85 PathProgramCache]: Analyzing trace with hash 2109972711, now seen corresponding path program 1 times [2022-04-07 00:52:45,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-07 00:52:45,602 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1704233161] [2022-04-07 00:52:45,602 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-07 00:52:45,602 INFO L85 PathProgramCache]: Analyzing trace with hash 2109972711, now seen corresponding path program 2 times [2022-04-07 00:52:45,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 00:52:45,603 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619863047] [2022-04-07 00:52:45,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 00:52:45,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 00:52:45,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:52:45,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 00:52:45,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:52:45,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 00:52:45,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 00:52:45,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619863047] [2022-04-07 00:52:45,639 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619863047] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:52:45,639 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:52:45,639 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:52:45,640 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-07 00:52:45,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1704233161] [2022-04-07 00:52:45,640 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1704233161] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:52:45,640 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:52:45,640 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:52:45,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819591913] [2022-04-07 00:52:45,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 00:52:45,640 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 00:52:45,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-07 00:52:45,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 00:52:45,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 00:52:45,641 INFO L87 Difference]: Start difference. First operand 165 states and 251 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:52:45,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 00:52:45,691 INFO L93 Difference]: Finished difference Result 285 states and 437 transitions. [2022-04-07 00:52:45,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 00:52:45,692 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-07 00:52:45,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 00:52:45,694 INFO L225 Difference]: With dead ends: 285 [2022-04-07 00:52:45,694 INFO L226 Difference]: Without dead ends: 283 [2022-04-07 00:52:45,694 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-07 00:52:45,695 INFO L913 BasicCegarLoop]: 44 mSDtfsCounter, 79 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 00:52:45,696 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [79 Valid, 51 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 00:52:45,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2022-04-07 00:52:45,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 233. [2022-04-07 00:52:45,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 229 states have (on average 1.502183406113537) internal successors, (344), 229 states have internal predecessors, (344), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:52:45,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 347 transitions. [2022-04-07 00:52:45,710 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 347 transitions. Word has length 20 [2022-04-07 00:52:45,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 00:52:45,710 INFO L478 AbstractCegarLoop]: Abstraction has 233 states and 347 transitions. [2022-04-07 00:52:45,711 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:52:45,711 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 347 transitions. [2022-04-07 00:52:45,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-07 00:52:45,711 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 00:52:45,711 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 00:52:45,711 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-07 00:52:45,711 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 00:52:45,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 00:52:45,712 INFO L85 PathProgramCache]: Analyzing trace with hash -1504936215, now seen corresponding path program 1 times [2022-04-07 00:52:45,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-07 00:52:45,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1145515756] [2022-04-07 00:52:45,713 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-07 00:52:45,713 INFO L85 PathProgramCache]: Analyzing trace with hash -1504936215, now seen corresponding path program 2 times [2022-04-07 00:52:45,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 00:52:45,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498270374] [2022-04-07 00:52:45,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 00:52:45,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 00:52:45,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:52:45,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 00:52:45,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:52:45,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 00:52:45,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 00:52:45,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498270374] [2022-04-07 00:52:45,749 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498270374] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:52:45,750 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:52:45,750 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:52:45,750 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-07 00:52:45,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1145515756] [2022-04-07 00:52:45,750 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1145515756] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:52:45,750 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:52:45,750 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:52:45,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872232013] [2022-04-07 00:52:45,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 00:52:45,750 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 00:52:45,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-07 00:52:45,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 00:52:45,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 00:52:45,751 INFO L87 Difference]: Start difference. First operand 233 states and 347 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:52:45,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 00:52:45,806 INFO L93 Difference]: Finished difference Result 525 states and 781 transitions. [2022-04-07 00:52:45,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 00:52:45,806 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-07 00:52:45,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 00:52:45,808 INFO L225 Difference]: With dead ends: 525 [2022-04-07 00:52:45,808 INFO L226 Difference]: Without dead ends: 307 [2022-04-07 00:52:45,809 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-07 00:52:45,809 INFO L913 BasicCegarLoop]: 62 mSDtfsCounter, 70 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 00:52:45,810 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [70 Valid, 69 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 00:52:45,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2022-04-07 00:52:45,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 305. [2022-04-07 00:52:45,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 301 states have (on average 1.4485049833887043) internal successors, (436), 301 states have internal predecessors, (436), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:52:45,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 439 transitions. [2022-04-07 00:52:45,846 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 439 transitions. Word has length 20 [2022-04-07 00:52:45,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 00:52:45,846 INFO L478 AbstractCegarLoop]: Abstraction has 305 states and 439 transitions. [2022-04-07 00:52:45,846 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:52:45,846 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 439 transitions. [2022-04-07 00:52:45,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-07 00:52:45,847 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 00:52:45,847 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 00:52:45,847 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-07 00:52:45,847 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 00:52:45,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 00:52:45,847 INFO L85 PathProgramCache]: Analyzing trace with hash 984860303, now seen corresponding path program 1 times [2022-04-07 00:52:45,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-07 00:52:45,847 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2020880536] [2022-04-07 00:52:45,848 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-07 00:52:45,848 INFO L85 PathProgramCache]: Analyzing trace with hash 984860303, now seen corresponding path program 2 times [2022-04-07 00:52:45,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 00:52:45,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67702927] [2022-04-07 00:52:45,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 00:52:45,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 00:52:45,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:52:45,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 00:52:45,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:52:45,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 00:52:45,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 00:52:45,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67702927] [2022-04-07 00:52:45,870 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67702927] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:52:45,870 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:52:45,870 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:52:45,870 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-07 00:52:45,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2020880536] [2022-04-07 00:52:45,871 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2020880536] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:52:45,871 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:52:45,871 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:52:45,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184833833] [2022-04-07 00:52:45,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 00:52:45,871 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 00:52:45,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-07 00:52:45,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 00:52:45,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 00:52:45,871 INFO L87 Difference]: Start difference. First operand 305 states and 439 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:52:45,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 00:52:45,918 INFO L93 Difference]: Finished difference Result 457 states and 653 transitions. [2022-04-07 00:52:45,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 00:52:45,919 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-07 00:52:45,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 00:52:45,920 INFO L225 Difference]: With dead ends: 457 [2022-04-07 00:52:45,920 INFO L226 Difference]: Without dead ends: 315 [2022-04-07 00:52:45,920 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-07 00:52:45,921 INFO L913 BasicCegarLoop]: 57 mSDtfsCounter, 76 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 00:52:45,921 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [76 Valid, 64 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 00:52:45,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2022-04-07 00:52:45,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 313. [2022-04-07 00:52:45,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 309 states have (on average 1.4110032362459546) internal successors, (436), 309 states have internal predecessors, (436), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:52:45,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 439 transitions. [2022-04-07 00:52:45,937 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 439 transitions. Word has length 21 [2022-04-07 00:52:45,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 00:52:45,938 INFO L478 AbstractCegarLoop]: Abstraction has 313 states and 439 transitions. [2022-04-07 00:52:45,938 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:52:45,938 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 439 transitions. [2022-04-07 00:52:45,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-07 00:52:45,940 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 00:52:45,940 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 00:52:45,940 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-07 00:52:45,940 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 00:52:45,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 00:52:45,940 INFO L85 PathProgramCache]: Analyzing trace with hash 591833293, now seen corresponding path program 1 times [2022-04-07 00:52:45,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-07 00:52:45,941 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1573341399] [2022-04-07 00:52:45,941 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-07 00:52:45,941 INFO L85 PathProgramCache]: Analyzing trace with hash 591833293, now seen corresponding path program 2 times [2022-04-07 00:52:45,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 00:52:45,941 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025272886] [2022-04-07 00:52:45,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 00:52:45,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 00:52:45,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:52:45,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 00:52:45,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:52:45,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 00:52:45,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 00:52:45,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025272886] [2022-04-07 00:52:45,976 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025272886] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:52:45,976 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:52:45,976 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:52:45,976 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-07 00:52:45,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1573341399] [2022-04-07 00:52:45,976 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1573341399] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:52:45,977 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:52:45,977 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:52:45,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819665249] [2022-04-07 00:52:45,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 00:52:45,977 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 00:52:45,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-07 00:52:45,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 00:52:45,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 00:52:45,978 INFO L87 Difference]: Start difference. First operand 313 states and 439 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:52:46,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 00:52:46,041 INFO L93 Difference]: Finished difference Result 525 states and 737 transitions. [2022-04-07 00:52:46,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 00:52:46,042 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-07 00:52:46,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 00:52:46,043 INFO L225 Difference]: With dead ends: 525 [2022-04-07 00:52:46,043 INFO L226 Difference]: Without dead ends: 523 [2022-04-07 00:52:46,044 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-07 00:52:46,044 INFO L913 BasicCegarLoop]: 43 mSDtfsCounter, 72 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 00:52:46,044 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [72 Valid, 50 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 00:52:46,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2022-04-07 00:52:46,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 457. [2022-04-07 00:52:46,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 457 states, 453 states have (on average 1.3686534216335542) internal successors, (620), 453 states have internal predecessors, (620), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:52:46,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 623 transitions. [2022-04-07 00:52:46,086 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 623 transitions. Word has length 21 [2022-04-07 00:52:46,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 00:52:46,087 INFO L478 AbstractCegarLoop]: Abstraction has 457 states and 623 transitions. [2022-04-07 00:52:46,087 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:52:46,087 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 623 transitions. [2022-04-07 00:52:46,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-07 00:52:46,088 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 00:52:46,088 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 00:52:46,088 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-07 00:52:46,088 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 00:52:46,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 00:52:46,088 INFO L85 PathProgramCache]: Analyzing trace with hash 1271891663, now seen corresponding path program 1 times [2022-04-07 00:52:46,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-07 00:52:46,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [353479490] [2022-04-07 00:52:46,089 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-07 00:52:46,089 INFO L85 PathProgramCache]: Analyzing trace with hash 1271891663, now seen corresponding path program 2 times [2022-04-07 00:52:46,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 00:52:46,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511353404] [2022-04-07 00:52:46,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 00:52:46,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 00:52:46,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:52:46,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 00:52:46,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:52:46,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 00:52:46,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 00:52:46,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511353404] [2022-04-07 00:52:46,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511353404] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:52:46,116 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:52:46,116 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:52:46,116 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-07 00:52:46,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [353479490] [2022-04-07 00:52:46,116 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [353479490] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:52:46,116 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:52:46,116 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:52:46,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380708934] [2022-04-07 00:52:46,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 00:52:46,116 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 00:52:46,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-07 00:52:46,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 00:52:46,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 00:52:46,117 INFO L87 Difference]: Start difference. First operand 457 states and 623 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:52:46,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 00:52:46,176 INFO L93 Difference]: Finished difference Result 1021 states and 1377 transitions. [2022-04-07 00:52:46,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 00:52:46,176 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-07 00:52:46,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 00:52:46,178 INFO L225 Difference]: With dead ends: 1021 [2022-04-07 00:52:46,178 INFO L226 Difference]: Without dead ends: 587 [2022-04-07 00:52:46,179 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-07 00:52:46,180 INFO L913 BasicCegarLoop]: 64 mSDtfsCounter, 64 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 00:52:46,180 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [64 Valid, 71 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 00:52:46,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2022-04-07 00:52:46,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 585. [2022-04-07 00:52:46,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 585 states, 581 states have (on average 1.3012048192771084) internal successors, (756), 581 states have internal predecessors, (756), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:52:46,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 759 transitions. [2022-04-07 00:52:46,217 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 759 transitions. Word has length 21 [2022-04-07 00:52:46,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 00:52:46,217 INFO L478 AbstractCegarLoop]: Abstraction has 585 states and 759 transitions. [2022-04-07 00:52:46,217 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:52:46,217 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 759 transitions. [2022-04-07 00:52:46,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-07 00:52:46,218 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 00:52:46,219 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 00:52:46,219 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-07 00:52:46,219 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 00:52:46,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 00:52:46,219 INFO L85 PathProgramCache]: Analyzing trace with hash 1167178942, now seen corresponding path program 1 times [2022-04-07 00:52:46,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-07 00:52:46,219 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [524572757] [2022-04-07 00:52:46,220 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-07 00:52:46,220 INFO L85 PathProgramCache]: Analyzing trace with hash 1167178942, now seen corresponding path program 2 times [2022-04-07 00:52:46,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 00:52:46,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550647621] [2022-04-07 00:52:46,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 00:52:46,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 00:52:46,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:52:46,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 00:52:46,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:52:46,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 00:52:46,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 00:52:46,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550647621] [2022-04-07 00:52:46,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550647621] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:52:46,240 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:52:46,240 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:52:46,240 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-07 00:52:46,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [524572757] [2022-04-07 00:52:46,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [524572757] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:52:46,240 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:52:46,240 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:52:46,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221413831] [2022-04-07 00:52:46,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 00:52:46,241 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 00:52:46,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-07 00:52:46,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 00:52:46,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 00:52:46,242 INFO L87 Difference]: Start difference. First operand 585 states and 759 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:52:46,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 00:52:46,299 INFO L93 Difference]: Finished difference Result 877 states and 1129 transitions. [2022-04-07 00:52:46,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 00:52:46,299 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-07 00:52:46,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 00:52:46,301 INFO L225 Difference]: With dead ends: 877 [2022-04-07 00:52:46,302 INFO L226 Difference]: Without dead ends: 603 [2022-04-07 00:52:46,302 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-07 00:52:46,303 INFO L913 BasicCegarLoop]: 54 mSDtfsCounter, 75 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 00:52:46,303 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [75 Valid, 61 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 00:52:46,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2022-04-07 00:52:46,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 601. [2022-04-07 00:52:46,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 601 states, 597 states have (on average 1.2663316582914572) internal successors, (756), 597 states have internal predecessors, (756), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:52:46,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 759 transitions. [2022-04-07 00:52:46,336 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 759 transitions. Word has length 22 [2022-04-07 00:52:46,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 00:52:46,336 INFO L478 AbstractCegarLoop]: Abstraction has 601 states and 759 transitions. [2022-04-07 00:52:46,336 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:52:46,337 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 759 transitions. [2022-04-07 00:52:46,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-07 00:52:46,337 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 00:52:46,337 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 00:52:46,337 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-07 00:52:46,338 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 00:52:46,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 00:52:46,338 INFO L85 PathProgramCache]: Analyzing trace with hash 774151932, now seen corresponding path program 1 times [2022-04-07 00:52:46,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-07 00:52:46,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [253018595] [2022-04-07 00:52:46,339 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-07 00:52:46,339 INFO L85 PathProgramCache]: Analyzing trace with hash 774151932, now seen corresponding path program 2 times [2022-04-07 00:52:46,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 00:52:46,339 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532003453] [2022-04-07 00:52:46,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 00:52:46,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 00:52:46,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:52:46,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 00:52:46,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:52:46,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 00:52:46,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 00:52:46,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532003453] [2022-04-07 00:52:46,363 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532003453] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:52:46,363 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:52:46,363 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:52:46,364 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-07 00:52:46,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [253018595] [2022-04-07 00:52:46,364 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [253018595] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:52:46,364 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:52:46,364 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:52:46,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868411281] [2022-04-07 00:52:46,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 00:52:46,365 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 00:52:46,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-07 00:52:46,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 00:52:46,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 00:52:46,365 INFO L87 Difference]: Start difference. First operand 601 states and 759 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:52:46,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 00:52:46,449 INFO L93 Difference]: Finished difference Result 971 states and 1208 transitions. [2022-04-07 00:52:46,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 00:52:46,450 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-07 00:52:46,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 00:52:46,452 INFO L225 Difference]: With dead ends: 971 [2022-04-07 00:52:46,452 INFO L226 Difference]: Without dead ends: 969 [2022-04-07 00:52:46,454 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-07 00:52:46,455 INFO L913 BasicCegarLoop]: 41 mSDtfsCounter, 64 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 00:52:46,455 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [64 Valid, 48 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 00:52:46,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 969 states. [2022-04-07 00:52:46,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 969 to 905. [2022-04-07 00:52:46,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 905 states, 901 states have (on average 1.2297447280799112) internal successors, (1108), 901 states have internal predecessors, (1108), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:52:46,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1111 transitions. [2022-04-07 00:52:46,516 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1111 transitions. Word has length 22 [2022-04-07 00:52:46,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 00:52:46,516 INFO L478 AbstractCegarLoop]: Abstraction has 905 states and 1111 transitions. [2022-04-07 00:52:46,516 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:52:46,516 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1111 transitions. [2022-04-07 00:52:46,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-07 00:52:46,517 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 00:52:46,517 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 00:52:46,517 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-07 00:52:46,517 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 00:52:46,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 00:52:46,518 INFO L85 PathProgramCache]: Analyzing trace with hash 1454210302, now seen corresponding path program 1 times [2022-04-07 00:52:46,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-07 00:52:46,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [227645351] [2022-04-07 00:52:46,518 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-07 00:52:46,518 INFO L85 PathProgramCache]: Analyzing trace with hash 1454210302, now seen corresponding path program 2 times [2022-04-07 00:52:46,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 00:52:46,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311764319] [2022-04-07 00:52:46,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 00:52:46,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 00:52:46,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:52:46,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 00:52:46,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:52:46,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 00:52:46,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 00:52:46,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311764319] [2022-04-07 00:52:46,539 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311764319] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:52:46,539 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:52:46,540 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:52:46,540 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-07 00:52:46,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [227645351] [2022-04-07 00:52:46,540 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [227645351] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:52:46,540 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:52:46,540 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:52:46,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187789491] [2022-04-07 00:52:46,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 00:52:46,540 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 00:52:46,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-07 00:52:46,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 00:52:46,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 00:52:46,541 INFO L87 Difference]: Start difference. First operand 905 states and 1111 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:52:46,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 00:52:46,625 INFO L93 Difference]: Finished difference Result 1993 states and 2391 transitions. [2022-04-07 00:52:46,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 00:52:46,625 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-07 00:52:46,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 00:52:46,626 INFO L225 Difference]: With dead ends: 1993 [2022-04-07 00:52:46,626 INFO L226 Difference]: Without dead ends: 0 [2022-04-07 00:52:46,628 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-07 00:52:46,628 INFO L913 BasicCegarLoop]: 65 mSDtfsCounter, 55 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 00:52:46,628 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [55 Valid, 72 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 00:52:46,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-07 00:52:46,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-07 00:52:46,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-07 00:52:46,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-07 00:52:46,629 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2022-04-07 00:52:46,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 00:52:46,629 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-07 00:52:46,629 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 00:52:46,629 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-07 00:52:46,629 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 00:52:46,631 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-07 00:52:46,632 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-07 00:52:46,633 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-07 00:52:54,592 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 3) no Hoare annotation was computed. [2022-04-07 00:52:54,592 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 3) no Hoare annotation was computed. [2022-04-07 00:52:54,592 INFO L882 garLoopResultBuilder]: For program point reach_errorFINAL(line 3) no Hoare annotation was computed. [2022-04-07 00:52:54,592 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-07 00:52:54,592 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-07 00:52:54,592 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-07 00:52:54,593 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-07 00:52:54,593 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-07 00:52:54,593 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-07 00:52:54,593 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-07 00:52:54,594 INFO L878 garLoopResultBuilder]: At program point L60-1(lines 29 104) the Hoare annotation is: (let ((.cse5 (= main_~lk1~0 1)) (.cse0 (= main_~lk4~0 1)) (.cse1 (= main_~lk3~0 1)) (.cse3 (= main_~p2~0 0)) (.cse4 (= main_~p4~0 0)) (.cse2 (= main_~p1~0 0)) (.cse6 (= main_~p3~0 0)) (.cse7 (= main_~lk2~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse1 .cse3) (and .cse5 .cse0 .cse6 .cse7) (and .cse4 .cse2 .cse3 .cse6) (and .cse4 .cse1 .cse2 .cse3) (and .cse0 .cse2 .cse3 .cse6) (and .cse5 .cse0 .cse3 .cse6) (and .cse4 .cse5 .cse6 .cse7) (and .cse5 .cse0 .cse1 .cse7) (and .cse4 .cse1 .cse2 .cse7) (and .cse0 .cse1 .cse2 .cse7) (and .cse4 .cse5 .cse3 .cse6) (and .cse0 .cse2 .cse6 .cse7) (and .cse4 .cse5 .cse1 .cse7) (and .cse5 .cse0 .cse1 .cse3) (and .cse4 .cse2 .cse6 .cse7))) [2022-04-07 00:52:54,594 INFO L885 garLoopResultBuilder]: At program point mainEXIT(lines 6 109) the Hoare annotation is: true [2022-04-07 00:52:54,594 INFO L878 garLoopResultBuilder]: At program point L85(line 85) the Hoare annotation is: (let ((.cse1 (= main_~p4~0 0)) (.cse2 (= main_~lk5~0 1)) (.cse5 (= main_~lk6~0 1)) (.cse0 (not (= main_~p3~0 0))) (.cse7 (= main_~lk4~0 1)) (.cse3 (= main_~lk3~0 1)) (.cse6 (= main_~p5~0 0)) (.cse4 (= main_~p6~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse2 .cse3 .cse5) (and .cse0 .cse1 .cse3 .cse6 .cse5) (and .cse0 .cse2 .cse7 .cse3 .cse5) (and .cse0 .cse1 .cse3 .cse6 .cse4) (and .cse0 .cse2 .cse7 .cse3 .cse4) (and .cse0 .cse7 .cse3 .cse6 .cse5) (and .cse0 .cse7 .cse3 .cse6 .cse4))) [2022-04-07 00:52:54,594 INFO L878 garLoopResultBuilder]: At program point L52-1(lines 29 104) the Hoare annotation is: (let ((.cse0 (= main_~lk1~0 1)) (.cse3 (= main_~p2~0 0)) (.cse2 (= main_~p1~0 0)) (.cse1 (= main_~lk2~0 1))) (or (and .cse0 .cse1) (and .cse2 .cse3) (and .cse0 .cse3) (and .cse2 .cse1))) [2022-04-07 00:52:54,594 INFO L878 garLoopResultBuilder]: At program point L94-1(lines 29 104) the Hoare annotation is: (or (= main_~p6~0 0) (= main_~lk6~0 1)) [2022-04-07 00:52:54,594 INFO L878 garLoopResultBuilder]: At program point L95(line 95) the Hoare annotation is: (let ((.cse0 (not (= main_~p5~0 0))) (.cse1 (= main_~lk5~0 1))) (or (and .cse0 .cse1 (= main_~p6~0 0)) (and .cse0 .cse1 (= main_~lk6~0 1)))) [2022-04-07 00:52:54,595 INFO L878 garLoopResultBuilder]: At program point L79-1(lines 29 104) the Hoare annotation is: (let ((.cse1 (= main_~p5~0 0)) (.cse2 (= main_~lk6~0 1)) (.cse0 (= main_~p4~0 0)) (.cse6 (= main_~lk3~0 1)) (.cse4 (= main_~lk5~0 1)) (.cse5 (= main_~lk4~0 1)) (.cse7 (= main_~p6~0 0)) (.cse3 (= main_~p3~0 0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse6 .cse1 .cse7) (and .cse5 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse7 .cse3) (and .cse0 .cse4 .cse2 .cse3) (and .cse0 .cse6 .cse1 .cse2) (and .cse5 .cse6 .cse1 .cse2) (and .cse4 .cse5 .cse2 .cse3) (and .cse5 .cse6 .cse1 .cse7) (and .cse0 .cse4 .cse6 .cse2) (and .cse5 .cse1 .cse7 .cse3) (and .cse0 .cse4 .cse7 .cse3) (and .cse4 .cse5 .cse6 .cse2) (and .cse0 .cse4 .cse6 .cse7) (and .cse4 .cse5 .cse7 .cse3))) [2022-04-07 00:52:54,595 INFO L885 garLoopResultBuilder]: At program point mainFINAL(lines 6 109) the Hoare annotation is: true [2022-04-07 00:52:54,595 INFO L878 garLoopResultBuilder]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 107) the Hoare annotation is: false [2022-04-07 00:52:54,595 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 6 109) the Hoare annotation is: true [2022-04-07 00:52:54,595 INFO L878 garLoopResultBuilder]: At program point L80(line 80) the Hoare annotation is: (let ((.cse0 (= main_~p4~0 0)) (.cse1 (= main_~p5~0 0)) (.cse2 (= main_~lk6~0 1)) (.cse3 (= main_~p3~0 0)) (.cse6 (= main_~lk5~0 1)) (.cse7 (= main_~lk4~0 1)) (.cse8 (= main_~lk3~0 1)) (.cse5 (= main_~p6~0 0)) (.cse4 (= main_~lk2~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse5 .cse3 .cse4) (and .cse0 .cse6 .cse5 .cse3 .cse4) (and .cse6 .cse7 .cse8 .cse2 .cse4) (and .cse6 .cse7 .cse5 .cse3 .cse4) (and .cse7 .cse8 .cse1 .cse2 .cse4) (and .cse0 .cse8 .cse1 .cse2 .cse4) (and .cse7 .cse1 .cse5 .cse3 .cse4) (and .cse6 .cse7 .cse2 .cse3 .cse4) (and .cse0 .cse6 .cse8 .cse2 .cse4) (and .cse7 .cse8 .cse1 .cse5 .cse4) (and .cse0 .cse6 .cse2 .cse3 .cse4) (and .cse0 .cse6 .cse8 .cse5 .cse4) (and .cse0 .cse8 .cse1 .cse5 .cse4) (and .cse7 .cse1 .cse2 .cse3 .cse4) (and .cse6 .cse7 .cse8 .cse5 .cse4))) [2022-04-07 00:52:54,595 INFO L885 garLoopResultBuilder]: At program point L105(lines 7 109) the Hoare annotation is: true [2022-04-07 00:52:54,595 INFO L885 garLoopResultBuilder]: At program point L31(lines 31 33) the Hoare annotation is: true [2022-04-07 00:52:54,595 INFO L878 garLoopResultBuilder]: At program point L64-1(lines 29 104) the Hoare annotation is: (let ((.cse9 (= main_~lk2~0 1)) (.cse4 (= main_~p3~0 0)) (.cse5 (= main_~p4~0 0)) (.cse0 (= main_~lk5~0 1)) (.cse1 (= main_~lk1~0 1)) (.cse2 (= main_~lk4~0 1)) (.cse6 (= main_~lk3~0 1)) (.cse8 (= main_~p1~0 0)) (.cse7 (= main_~p5~0 0)) (.cse3 (= main_~p2~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse1 .cse6 .cse7 .cse3) (and .cse1 .cse2 .cse7 .cse3 .cse4) (and .cse2 .cse8 .cse7 .cse4 .cse9) (and .cse0 .cse2 .cse8 .cse3 .cse4) (and .cse5 .cse0 .cse8 .cse4 .cse9) (and .cse0 .cse2 .cse6 .cse8 .cse9) (and .cse5 .cse1 .cse7 .cse3 .cse4) (and .cse5 .cse6 .cse8 .cse7 .cse9) (and .cse0 .cse1 .cse2 .cse6 .cse3) (and .cse5 .cse0 .cse6 .cse8 .cse3) (and .cse0 .cse1 .cse2 .cse4 .cse9) (and .cse0 .cse1 .cse2 .cse6 .cse9) (and .cse5 .cse0 .cse1 .cse6 .cse9) (and .cse1 .cse2 .cse6 .cse7 .cse9) (and .cse1 .cse2 .cse7 .cse4 .cse9) (and .cse5 .cse0 .cse6 .cse8 .cse9) (and .cse0 .cse2 .cse6 .cse8 .cse3) (and .cse5 .cse0 .cse8 .cse3 .cse4) (and .cse5 .cse1 .cse7 .cse4 .cse9) (and .cse5 .cse8 .cse7 .cse3 .cse4) (and .cse2 .cse6 .cse8 .cse7 .cse9) (and .cse5 .cse0 .cse1 .cse4 .cse9) (and .cse2 .cse8 .cse7 .cse3 .cse4) (and .cse5 .cse1 .cse6 .cse7 .cse9) (and .cse1 .cse2 .cse6 .cse7 .cse3) (and .cse0 .cse2 .cse8 .cse4 .cse9) (and .cse5 .cse8 .cse7 .cse4 .cse9) (and .cse5 .cse6 .cse8 .cse7 .cse3) (and .cse5 .cse0 .cse1 .cse3 .cse4) (and .cse5 .cse0 .cse1 .cse6 .cse3) (and .cse2 .cse6 .cse8 .cse7 .cse3))) [2022-04-07 00:52:54,595 INFO L878 garLoopResultBuilder]: At program point L89-1(lines 29 104) the Hoare annotation is: (let ((.cse0 (= main_~lk5~0 1)) (.cse3 (= main_~lk6~0 1)) (.cse2 (= main_~p5~0 0)) (.cse1 (= main_~p6~0 0))) (or (and .cse0 .cse1) (and .cse2 .cse3) (and .cse0 .cse3) (and .cse2 .cse1))) [2022-04-07 00:52:54,595 INFO L878 garLoopResultBuilder]: At program point L56-1(lines 29 104) the Hoare annotation is: (let ((.cse4 (= main_~p1~0 0)) (.cse2 (= main_~p3~0 0)) (.cse5 (= main_~lk2~0 1)) (.cse0 (= main_~lk1~0 1)) (.cse3 (= main_~lk3~0 1)) (.cse1 (= main_~p2~0 0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse5) (and .cse4 .cse1 .cse2) (and .cse0 .cse3 .cse5) (and .cse3 .cse4 .cse1) (and .cse0 .cse2 .cse5) (and .cse4 .cse2 .cse5) (and .cse0 .cse3 .cse1))) [2022-04-07 00:52:54,595 INFO L885 garLoopResultBuilder]: At program point L48(lines 48 50) the Hoare annotation is: true [2022-04-07 00:52:54,596 INFO L878 garLoopResultBuilder]: At program point L48-2(lines 29 104) the Hoare annotation is: (or (= main_~lk1~0 1) (= main_~p1~0 0)) [2022-04-07 00:52:54,596 INFO L878 garLoopResultBuilder]: At program point L90(line 90) the Hoare annotation is: (let ((.cse3 (= main_~p6~0 0)) (.cse4 (= main_~p5~0 0)) (.cse0 (= main_~lk5~0 1)) (.cse1 (not (= main_~p4~0 0))) (.cse2 (= main_~lk4~0 1)) (.cse5 (= main_~lk6~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse1 .cse2 .cse4 .cse3) (and .cse1 .cse2 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse5))) [2022-04-07 00:52:54,596 INFO L878 garLoopResultBuilder]: At program point L74-1(lines 29 104) the Hoare annotation is: (let ((.cse8 (= main_~p4~0 0)) (.cse2 (= main_~p2~0 0)) (.cse6 (= main_~p5~0 0)) (.cse3 (= main_~lk6~0 1)) (.cse4 (= main_~p3~0 0)) (.cse0 (= main_~lk5~0 1)) (.cse1 (= main_~lk4~0 1)) (.cse5 (= main_~lk3~0 1)) (.cse7 (= main_~p6~0 0)) (.cse9 (= main_~lk2~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse5 .cse6 .cse2 .cse7) (and .cse0 .cse1 .cse5 .cse2 .cse7) (and .cse8 .cse5 .cse6 .cse2 .cse7) (and .cse8 .cse6 .cse3 .cse4 .cse9) (and .cse8 .cse5 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse2 .cse7 .cse4) (and .cse8 .cse6 .cse7 .cse4 .cse9) (and .cse8 .cse0 .cse7 .cse4 .cse9) (and .cse0 .cse1 .cse5 .cse3 .cse9) (and .cse8 .cse6 .cse2 .cse7 .cse4) (and .cse0 .cse1 .cse7 .cse4 .cse9) (and .cse1 .cse5 .cse6 .cse3 .cse9) (and .cse8 .cse5 .cse6 .cse3 .cse9) (and .cse1 .cse6 .cse2 .cse7 .cse4) (and .cse1 .cse6 .cse7 .cse4 .cse9) (and .cse8 .cse6 .cse2 .cse3 .cse4) (and .cse1 .cse5 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse3 .cse4 .cse9) (and .cse8 .cse0 .cse5 .cse3 .cse9) (and .cse1 .cse5 .cse6 .cse7 .cse9) (and .cse8 .cse0 .cse5 .cse2 .cse7) (and .cse8 .cse0 .cse3 .cse4 .cse9) (and .cse1 .cse6 .cse2 .cse3 .cse4) (and .cse8 .cse0 .cse2 .cse7 .cse4) (and .cse0 .cse1 .cse5 .cse2 .cse3) (and .cse8 .cse0 .cse5 .cse7 .cse9) (and .cse8 .cse0 .cse2 .cse3 .cse4) (and .cse8 .cse5 .cse6 .cse7 .cse9) (and .cse8 .cse0 .cse5 .cse2 .cse3) (and .cse1 .cse6 .cse3 .cse4 .cse9) (and .cse0 .cse1 .cse5 .cse7 .cse9))) [2022-04-07 00:52:54,596 INFO L885 garLoopResultBuilder]: At program point L99-1(lines 29 104) the Hoare annotation is: true [2022-04-07 00:52:54,596 INFO L878 garLoopResultBuilder]: At program point L75(line 75) the Hoare annotation is: (let ((.cse8 (= main_~p5~0 0)) (.cse7 (= main_~lk4~0 1)) (.cse10 (= main_~p2~0 0)) (.cse4 (= main_~p6~0 0)) (.cse5 (= main_~p3~0 0)) (.cse0 (= main_~p4~0 0)) (.cse1 (= main_~lk5~0 1)) (.cse2 (not (= main_~p1~0 0))) (.cse3 (= main_~lk1~0 1)) (.cse11 (= main_~lk3~0 1)) (.cse9 (= main_~lk6~0 1)) (.cse6 (= main_~lk2~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse2 .cse3 .cse7 .cse8 .cse9 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse10 .cse9 .cse5) (and .cse2 .cse3 .cse7 .cse8 .cse4 .cse5 .cse6) (and .cse2 .cse3 .cse7 .cse11 .cse8 .cse4 .cse6) (and .cse2 .cse3 .cse7 .cse8 .cse10 .cse4 .cse5) (and .cse0 .cse2 .cse3 .cse8 .cse10 .cse4 .cse5) (and .cse2 .cse3 .cse7 .cse8 .cse10 .cse9 .cse5) (and .cse0 .cse2 .cse3 .cse11 .cse8 .cse9 .cse6) (and .cse2 .cse3 .cse7 .cse11 .cse8 .cse10 .cse4) (and .cse0 .cse2 .cse3 .cse11 .cse8 .cse4 .cse6) (and .cse1 .cse2 .cse3 .cse7 .cse11 .cse10 .cse4) (and .cse0 .cse1 .cse2 .cse3 .cse11 .cse4 .cse6) (and .cse0 .cse2 .cse3 .cse11 .cse8 .cse10 .cse4) (and .cse0 .cse1 .cse2 .cse3 .cse9 .cse5 .cse6) (and .cse1 .cse2 .cse3 .cse7 .cse10 .cse9 .cse5) (and .cse1 .cse2 .cse3 .cse7 .cse9 .cse5 .cse6) (and .cse1 .cse2 .cse3 .cse7 .cse11 .cse10 .cse9) (and .cse2 .cse3 .cse7 .cse11 .cse8 .cse9 .cse6) (and .cse0 .cse2 .cse3 .cse8 .cse10 .cse9 .cse5) (and .cse0 .cse2 .cse3 .cse8 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse11 .cse10 .cse4) (and .cse1 .cse2 .cse3 .cse7 .cse11 .cse4 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse11 .cse10 .cse9) (and .cse0 .cse2 .cse3 .cse8 .cse9 .cse5 .cse6) (and .cse1 .cse2 .cse3 .cse7 .cse11 .cse9 .cse6) (and .cse0 .cse2 .cse3 .cse11 .cse8 .cse10 .cse9) (and .cse2 .cse3 .cse7 .cse11 .cse8 .cse10 .cse9) (and .cse1 .cse2 .cse3 .cse7 .cse4 .cse5 .cse6) (and .cse1 .cse2 .cse3 .cse7 .cse10 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse3 .cse10 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse3 .cse11 .cse9 .cse6))) [2022-04-07 00:52:54,596 INFO L878 garLoopResultBuilder]: At program point L100(line 100) the Hoare annotation is: (= main_~lk6~0 1) [2022-04-07 00:52:54,596 INFO L878 garLoopResultBuilder]: At program point L100-1(lines 7 109) the Hoare annotation is: false [2022-04-07 00:52:54,596 INFO L878 garLoopResultBuilder]: At program point L84-1(lines 29 104) the Hoare annotation is: (let ((.cse0 (= main_~p4~0 0)) (.cse4 (= main_~p5~0 0)) (.cse2 (= main_~p6~0 0)) (.cse1 (= main_~lk5~0 1)) (.cse5 (= main_~lk4~0 1)) (.cse3 (= main_~lk6~0 1))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse1 .cse3) (and .cse0 .cse4 .cse2) (and .cse5 .cse4 .cse3) (and .cse0 .cse4 .cse3) (and .cse1 .cse5 .cse2) (and .cse5 .cse4 .cse2) (and .cse1 .cse5 .cse3))) [2022-04-07 00:52:54,596 INFO L878 garLoopResultBuilder]: At program point L68-1(lines 29 104) the Hoare annotation is: (let ((.cse3 (= main_~p2~0 0)) (.cse7 (= main_~p4~0 0)) (.cse0 (= main_~lk5~0 1)) (.cse9 (= main_~p1~0 0)) (.cse4 (= main_~lk6~0 1)) (.cse8 (= main_~lk3~0 1)) (.cse1 (= main_~lk1~0 1)) (.cse2 (= main_~lk4~0 1)) (.cse11 (= main_~p5~0 0)) (.cse6 (= main_~p6~0 0)) (.cse5 (= main_~p3~0 0)) (.cse10 (= main_~lk2~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse3 .cse6 .cse5) (and .cse7 .cse0 .cse8 .cse9 .cse6 .cse10) (and .cse7 .cse8 .cse9 .cse11 .cse3 .cse4) (and .cse7 .cse1 .cse8 .cse11 .cse6 .cse10) (and .cse0 .cse2 .cse9 .cse4 .cse5 .cse10) (and .cse7 .cse1 .cse11 .cse4 .cse5 .cse10) (and .cse7 .cse0 .cse1 .cse3 .cse6 .cse5) (and .cse7 .cse0 .cse9 .cse3 .cse6 .cse5) (and .cse7 .cse0 .cse9 .cse6 .cse5 .cse10) (and .cse2 .cse8 .cse9 .cse11 .cse6 .cse10) (and .cse7 .cse1 .cse11 .cse3 .cse4 .cse5) (and .cse7 .cse0 .cse1 .cse4 .cse5 .cse10) (and .cse1 .cse2 .cse8 .cse11 .cse3 .cse6) (and .cse0 .cse1 .cse2 .cse8 .cse4 .cse10) (and .cse7 .cse0 .cse8 .cse9 .cse3 .cse6) (and .cse0 .cse2 .cse8 .cse9 .cse4 .cse10) (and .cse7 .cse9 .cse11 .cse3 .cse6 .cse5) (and .cse7 .cse0 .cse8 .cse9 .cse3 .cse4) (and .cse7 .cse8 .cse9 .cse11 .cse6 .cse10) (and .cse2 .cse9 .cse11 .cse4 .cse5 .cse10) (and .cse7 .cse0 .cse1 .cse8 .cse4 .cse10) (and .cse7 .cse1 .cse11 .cse3 .cse6 .cse5) (and .cse7 .cse0 .cse8 .cse9 .cse4 .cse10) (and .cse1 .cse2 .cse11 .cse4 .cse5 .cse10) (and .cse7 .cse9 .cse11 .cse4 .cse5 .cse10) (and .cse7 .cse8 .cse9 .cse11 .cse4 .cse10) (and .cse7 .cse1 .cse8 .cse11 .cse3 .cse6) (and .cse0 .cse2 .cse9 .cse6 .cse5 .cse10) (and .cse1 .cse2 .cse11 .cse3 .cse4 .cse5) (and .cse0 .cse2 .cse9 .cse3 .cse6 .cse5) (and .cse0 .cse2 .cse9 .cse3 .cse4 .cse5) (and .cse1 .cse2 .cse8 .cse11 .cse3 .cse4) (and .cse0 .cse2 .cse8 .cse9 .cse3 .cse6) (and .cse0 .cse1 .cse2 .cse8 .cse6 .cse10) (and .cse7 .cse0 .cse1 .cse8 .cse3 .cse4) (and .cse7 .cse9 .cse11 .cse6 .cse5 .cse10) (and .cse7 .cse0 .cse1 .cse6 .cse5 .cse10) (and .cse7 .cse0 .cse1 .cse8 .cse3 .cse6) (and .cse7 .cse0 .cse9 .cse3 .cse4 .cse5) (and .cse7 .cse0 .cse1 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse8 .cse3 .cse6) (and .cse0 .cse2 .cse8 .cse9 .cse6 .cse10) (and .cse2 .cse8 .cse9 .cse11 .cse3 .cse6) (and .cse7 .cse0 .cse1 .cse8 .cse6 .cse10) (and .cse2 .cse9 .cse11 .cse6 .cse5 .cse10) (and .cse7 .cse1 .cse11 .cse6 .cse5 .cse10) (and .cse2 .cse9 .cse11 .cse3 .cse6 .cse5) (and .cse7 .cse9 .cse11 .cse3 .cse4 .cse5) (and .cse7 .cse8 .cse9 .cse11 .cse3 .cse6) (and .cse2 .cse8 .cse9 .cse11 .cse3 .cse4) (and .cse7 .cse1 .cse8 .cse11 .cse4 .cse10) (and .cse0 .cse1 .cse2 .cse6 .cse5 .cse10) (and .cse2 .cse8 .cse9 .cse11 .cse4 .cse10) (and .cse1 .cse2 .cse8 .cse11 .cse4 .cse10) (and .cse1 .cse2 .cse11 .cse3 .cse6 .cse5) (and .cse0 .cse1 .cse2 .cse8 .cse3 .cse4) (and .cse2 .cse9 .cse11 .cse3 .cse4 .cse5) (and .cse7 .cse1 .cse8 .cse11 .cse3 .cse4) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse10) (and .cse0 .cse2 .cse8 .cse9 .cse3 .cse4) (and .cse7 .cse0 .cse9 .cse4 .cse5 .cse10) (and .cse1 .cse2 .cse8 .cse11 .cse6 .cse10) (and .cse1 .cse2 .cse11 .cse6 .cse5 .cse10))) [2022-04-07 00:52:54,598 INFO L719 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2] [2022-04-07 00:52:54,602 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-07 00:52:54,611 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.04 12:52:54 BoogieIcfgContainer [2022-04-07 00:52:54,611 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-07 00:52:54,611 INFO L158 Benchmark]: Toolchain (without parser) took 10894.36ms. Allocated memory was 191.9MB in the beginning and 576.7MB in the end (delta: 384.8MB). Free memory was 134.6MB in the beginning and 339.9MB in the end (delta: -205.3MB). Peak memory consumption was 321.8MB. Max. memory is 8.0GB. [2022-04-07 00:52:54,612 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 191.9MB. Free memory is still 150.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-07 00:52:54,613 INFO L158 Benchmark]: CACSL2BoogieTranslator took 199.42ms. Allocated memory was 191.9MB in the beginning and 252.7MB in the end (delta: 60.8MB). Free memory was 134.4MB in the beginning and 225.5MB in the end (delta: -91.1MB). Peak memory consumption was 18.1MB. Max. memory is 8.0GB. [2022-04-07 00:52:54,613 INFO L158 Benchmark]: Boogie Preprocessor took 25.40ms. Allocated memory is still 252.7MB. Free memory was 225.5MB in the beginning and 224.0MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-07 00:52:54,614 INFO L158 Benchmark]: RCFGBuilder took 186.31ms. Allocated memory is still 252.7MB. Free memory was 223.8MB in the beginning and 212.0MB in the end (delta: 11.8MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-07 00:52:54,614 INFO L158 Benchmark]: TraceAbstraction took 10478.36ms. Allocated memory was 252.7MB in the beginning and 576.7MB in the end (delta: 324.0MB). Free memory was 211.4MB in the beginning and 339.9MB in the end (delta: -128.5MB). Peak memory consumption was 337.6MB. Max. memory is 8.0GB. [2022-04-07 00:52:54,615 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 191.9MB. Free memory is still 150.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 199.42ms. Allocated memory was 191.9MB in the beginning and 252.7MB in the end (delta: 60.8MB). Free memory was 134.4MB in the beginning and 225.5MB in the end (delta: -91.1MB). Peak memory consumption was 18.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 25.40ms. Allocated memory is still 252.7MB. Free memory was 225.5MB in the beginning and 224.0MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 186.31ms. Allocated memory is still 252.7MB. Free memory was 223.8MB in the beginning and 212.0MB in the end (delta: 11.8MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 10478.36ms. Allocated memory was 252.7MB in the beginning and 576.7MB in the end (delta: 324.0MB). Free memory was 211.4MB in the beginning and 339.9MB in the end (delta: -128.5MB). Peak memory consumption was 337.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 107]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 36 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.4s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 8.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1224 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1224 mSDsluCounter, 1008 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 114 mSDsCounter, 38 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 614 IncrementalHoareTripleChecker+Invalid, 652 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 38 mSolverCounterUnsat, 894 mSDtfsCounter, 614 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 112 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=905occurred in iteration=15, InterpolantAutomatonStates: 64, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 16 MinimizatonAttempts, 268 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 33 LocationsWithAnnotation, 33 PreInvPairs, 1162 NumberOfFragments, 4131 HoareAnnotationTreeSize, 33 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 2.6s HoareSimplificationTime, 33 FomulaSimplificationsInter, 38507 FormulaSimplificationTreeSizeReductionInter, 5.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 7]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 29]: Loop Invariant Derived loop invariant: 1 - ProcedureContractResult [Line: 6]: Procedure Contract for main Derived contract for procedure main: 1 RESULT: Ultimate proved your program to be correct! [2022-04-07 00:52:54,651 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...