/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.use.bitabs.translation false -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/recursive/Fibonacci04.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-16 05:47:22,387 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 05:47:22,452 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-12-16 05:47:22,457 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 05:47:22,457 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 05:47:22,478 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 05:47:22,479 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 05:47:22,479 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 05:47:22,479 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 05:47:22,483 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 05:47:22,483 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 05:47:22,483 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 05:47:22,484 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 05:47:22,485 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 05:47:22,485 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 05:47:22,485 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 05:47:22,485 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 05:47:22,485 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-16 05:47:22,485 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-16 05:47:22,486 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-16 05:47:22,486 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 05:47:22,486 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 05:47:22,486 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 05:47:22,486 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 05:47:22,487 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 05:47:22,487 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-16 05:47:22,487 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 05:47:22,487 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 05:47:22,487 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 05:47:22,487 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 05:47:22,488 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 05:47:22,488 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 05:47:22,488 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 05:47:22,489 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 05:47:22,489 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 05:47:22,489 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 05:47:22,489 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-16 05:47:22,490 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-16 05:47:22,490 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 05:47:22,490 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 05:47:22,490 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 05:47:22,490 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 05:47:22,490 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 05:47:22,490 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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.plugins.generator.cacsl2boogietranslator: Use bitabs translation -> false [2023-12-16 05:47:22,672 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 05:47:22,690 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 05:47:22,692 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 05:47:22,693 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 05:47:22,693 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 05:47:22,694 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive/Fibonacci04.c [2023-12-16 05:47:23,762 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 05:47:23,950 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 05:47:23,950 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive/Fibonacci04.c [2023-12-16 05:47:23,955 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5bebba3b8/3f94a255320048a3b1e241d94a6f2756/FLAG92e3e08db [2023-12-16 05:47:23,965 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5bebba3b8/3f94a255320048a3b1e241d94a6f2756 [2023-12-16 05:47:23,966 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 05:47:23,967 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 05:47:23,968 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 05:47:23,968 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 05:47:23,971 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 05:47:23,971 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 05:47:23" (1/1) ... [2023-12-16 05:47:23,972 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c84c736 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:47:23, skipping insertion in model container [2023-12-16 05:47:23,972 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 05:47:23" (1/1) ... [2023-12-16 05:47:23,984 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 05:47:24,082 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/recursive/Fibonacci04.c[780,793] [2023-12-16 05:47:24,085 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 05:47:24,092 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 05:47:24,101 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/recursive/Fibonacci04.c[780,793] [2023-12-16 05:47:24,102 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 05:47:24,111 INFO L206 MainTranslator]: Completed translation [2023-12-16 05:47:24,112 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:47:24 WrapperNode [2023-12-16 05:47:24,112 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 05:47:24,113 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 05:47:24,113 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 05:47:24,113 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 05:47:24,118 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:47:24" (1/1) ... [2023-12-16 05:47:24,124 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:47:24" (1/1) ... [2023-12-16 05:47:24,144 INFO L138 Inliner]: procedures = 13, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 23 [2023-12-16 05:47:24,144 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 05:47:24,145 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 05:47:24,145 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 05:47:24,145 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 05:47:24,152 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:47:24" (1/1) ... [2023-12-16 05:47:24,152 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:47:24" (1/1) ... [2023-12-16 05:47:24,153 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:47:24" (1/1) ... [2023-12-16 05:47:24,160 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-12-16 05:47:24,160 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:47:24" (1/1) ... [2023-12-16 05:47:24,160 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:47:24" (1/1) ... [2023-12-16 05:47:24,175 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:47:24" (1/1) ... [2023-12-16 05:47:24,176 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:47:24" (1/1) ... [2023-12-16 05:47:24,176 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:47:24" (1/1) ... [2023-12-16 05:47:24,177 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:47:24" (1/1) ... [2023-12-16 05:47:24,178 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 05:47:24,178 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 05:47:24,178 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 05:47:24,179 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 05:47:24,179 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:47:24" (1/1) ... [2023-12-16 05:47:24,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 05:47:24,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 05:47:24,205 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-16 05:47:24,217 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-16 05:47:24,233 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2023-12-16 05:47:24,233 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2023-12-16 05:47:24,234 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 05:47:24,234 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 05:47:24,234 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 05:47:24,234 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-16 05:47:24,291 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 05:47:24,293 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 05:47:24,387 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 05:47:24,401 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 05:47:24,401 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-12-16 05:47:24,401 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 05:47:24 BoogieIcfgContainer [2023-12-16 05:47:24,401 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 05:47:24,403 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 05:47:24,403 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 05:47:24,405 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 05:47:24,405 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 05:47:23" (1/3) ... [2023-12-16 05:47:24,410 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e18521e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 05:47:24, skipping insertion in model container [2023-12-16 05:47:24,410 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:47:24" (2/3) ... [2023-12-16 05:47:24,410 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e18521e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 05:47:24, skipping insertion in model container [2023-12-16 05:47:24,411 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 05:47:24" (3/3) ... [2023-12-16 05:47:24,412 INFO L112 eAbstractionObserver]: Analyzing ICFG Fibonacci04.c [2023-12-16 05:47:24,425 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 05:47:24,425 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-16 05:47:24,461 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 05:47:24,468 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@61dbb2b5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 05:47:24,468 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-16 05:47:24,472 INFO L276 IsEmpty]: Start isEmpty. Operand has 17 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 05:47:24,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-12-16 05:47:24,478 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 05:47:24,479 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 05:47:24,479 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 05:47:24,486 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 05:47:24,487 INFO L85 PathProgramCache]: Analyzing trace with hash -1615401540, now seen corresponding path program 1 times [2023-12-16 05:47:24,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 05:47:24,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99829271] [2023-12-16 05:47:24,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 05:47:24,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 05:47:24,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:47:24,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-16 05:47:24,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:47:24,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 05:47:24,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 05:47:24,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99829271] [2023-12-16 05:47:24,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99829271] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 05:47:24,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 05:47:24,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 05:47:24,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109929035] [2023-12-16 05:47:24,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 05:47:24,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 05:47:24,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 05:47:24,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 05:47:24,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 05:47:24,754 INFO L87 Difference]: Start difference. First operand has 17 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-16 05:47:24,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 05:47:24,864 INFO L93 Difference]: Finished difference Result 26 states and 32 transitions. [2023-12-16 05:47:24,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 05:47:24,866 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 9 [2023-12-16 05:47:24,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 05:47:24,871 INFO L225 Difference]: With dead ends: 26 [2023-12-16 05:47:24,871 INFO L226 Difference]: Without dead ends: 17 [2023-12-16 05:47:24,873 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-16 05:47:24,877 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 9 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 05:47:24,878 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 26 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 05:47:24,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2023-12-16 05:47:24,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2023-12-16 05:47:24,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2023-12-16 05:47:24,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2023-12-16 05:47:24,908 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 9 [2023-12-16 05:47:24,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 05:47:24,908 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2023-12-16 05:47:24,908 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-16 05:47:24,908 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2023-12-16 05:47:24,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-12-16 05:47:24,909 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 05:47:24,909 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 05:47:24,910 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-16 05:47:24,910 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 05:47:24,910 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 05:47:24,910 INFO L85 PathProgramCache]: Analyzing trace with hash -2136894566, now seen corresponding path program 1 times [2023-12-16 05:47:24,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 05:47:24,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477227920] [2023-12-16 05:47:24,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 05:47:24,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 05:47:24,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:47:24,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-16 05:47:24,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:47:24,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 05:47:24,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 05:47:24,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477227920] [2023-12-16 05:47:24,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477227920] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 05:47:24,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 05:47:24,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 05:47:24,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242825399] [2023-12-16 05:47:24,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 05:47:24,990 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 05:47:24,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 05:47:24,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 05:47:24,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 05:47:24,991 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-16 05:47:25,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 05:47:25,042 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2023-12-16 05:47:25,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 05:47:25,043 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2023-12-16 05:47:25,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 05:47:25,045 INFO L225 Difference]: With dead ends: 23 [2023-12-16 05:47:25,045 INFO L226 Difference]: Without dead ends: 19 [2023-12-16 05:47:25,045 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-16 05:47:25,047 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 7 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 05:47:25,048 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 26 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 05:47:25,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2023-12-16 05:47:25,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2023-12-16 05:47:25,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2023-12-16 05:47:25,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2023-12-16 05:47:25,053 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 10 [2023-12-16 05:47:25,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 05:47:25,053 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2023-12-16 05:47:25,053 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-16 05:47:25,054 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2023-12-16 05:47:25,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-12-16 05:47:25,055 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 05:47:25,055 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 05:47:25,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-16 05:47:25,055 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 05:47:25,056 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 05:47:25,056 INFO L85 PathProgramCache]: Analyzing trace with hash -338238899, now seen corresponding path program 1 times [2023-12-16 05:47:25,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 05:47:25,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488855841] [2023-12-16 05:47:25,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 05:47:25,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 05:47:25,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:47:25,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-16 05:47:25,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:47:25,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-16 05:47:25,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:47:25,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-16 05:47:25,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:47:25,219 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-16 05:47:25,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 05:47:25,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488855841] [2023-12-16 05:47:25,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488855841] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 05:47:25,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [733116856] [2023-12-16 05:47:25,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 05:47:25,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 05:47:25,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 05:47:25,222 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-16 05:47:25,243 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-16 05:47:25,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:47:25,277 INFO L262 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-16 05:47:25,281 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 05:47:25,362 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-16 05:47:25,362 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 05:47:25,589 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-16 05:47:25,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [733116856] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 05:47:25,592 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-16 05:47:25,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 13 [2023-12-16 05:47:25,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813674288] [2023-12-16 05:47:25,595 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-16 05:47:25,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-16 05:47:25,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 05:47:25,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-16 05:47:25,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2023-12-16 05:47:25,598 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand has 13 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 13 states have internal predecessors, (34), 7 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (9), 5 states have call predecessors, (9), 7 states have call successors, (9) [2023-12-16 05:47:25,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 05:47:25,730 INFO L93 Difference]: Finished difference Result 45 states and 68 transitions. [2023-12-16 05:47:25,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-16 05:47:25,730 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 13 states have internal predecessors, (34), 7 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (9), 5 states have call predecessors, (9), 7 states have call successors, (9) Word has length 22 [2023-12-16 05:47:25,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 05:47:25,731 INFO L225 Difference]: With dead ends: 45 [2023-12-16 05:47:25,731 INFO L226 Difference]: Without dead ends: 28 [2023-12-16 05:47:25,732 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=108, Invalid=272, Unknown=0, NotChecked=0, Total=380 [2023-12-16 05:47:25,733 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 29 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 05:47:25,733 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 54 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 05:47:25,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2023-12-16 05:47:25,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2023-12-16 05:47:25,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 20 states have internal predecessors, (22), 5 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2023-12-16 05:47:25,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2023-12-16 05:47:25,739 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 22 [2023-12-16 05:47:25,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 05:47:25,739 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2023-12-16 05:47:25,739 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 13 states have internal predecessors, (34), 7 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (9), 5 states have call predecessors, (9), 7 states have call successors, (9) [2023-12-16 05:47:25,739 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2023-12-16 05:47:25,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-12-16 05:47:25,741 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 05:47:25,741 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 7, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1] [2023-12-16 05:47:25,752 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-16 05:47:25,949 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 05:47:25,949 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 05:47:25,950 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 05:47:25,950 INFO L85 PathProgramCache]: Analyzing trace with hash 255154638, now seen corresponding path program 1 times [2023-12-16 05:47:25,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 05:47:25,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837907743] [2023-12-16 05:47:25,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 05:47:25,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 05:47:25,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:47:26,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-16 05:47:26,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:47:26,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-16 05:47:26,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:47:26,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-16 05:47:26,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:47:26,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-16 05:47:26,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:47:26,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-16 05:47:26,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:47:26,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-16 05:47:26,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:47:26,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-16 05:47:26,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:47:26,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-16 05:47:26,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:47:26,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-16 05:47:26,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:47:26,581 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 44 proven. 63 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2023-12-16 05:47:26,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 05:47:26,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837907743] [2023-12-16 05:47:26,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837907743] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 05:47:26,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [829225376] [2023-12-16 05:47:26,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 05:47:26,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 05:47:26,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 05:47:26,629 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-16 05:47:26,681 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-16 05:47:26,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:47:26,697 INFO L262 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-16 05:47:26,699 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 05:47:26,755 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 16 proven. 75 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2023-12-16 05:47:26,756 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 05:47:27,001 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 16 proven. 82 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2023-12-16 05:47:27,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [829225376] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 05:47:27,001 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-16 05:47:27,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 9] total 18 [2023-12-16 05:47:27,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042935683] [2023-12-16 05:47:27,002 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-16 05:47:27,002 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-12-16 05:47:27,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 05:47:27,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-12-16 05:47:27,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=231, Unknown=0, NotChecked=0, Total=306 [2023-12-16 05:47:27,003 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand has 18 states, 18 states have (on average 2.7777777777777777) internal successors, (50), 18 states have internal predecessors, (50), 11 states have call successors, (14), 1 states have call predecessors, (14), 7 states have return successors, (18), 11 states have call predecessors, (18), 11 states have call successors, (18) [2023-12-16 05:47:27,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 05:47:27,132 INFO L93 Difference]: Finished difference Result 72 states and 117 transitions. [2023-12-16 05:47:27,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-16 05:47:27,133 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.7777777777777777) internal successors, (50), 18 states have internal predecessors, (50), 11 states have call successors, (14), 1 states have call predecessors, (14), 7 states have return successors, (18), 11 states have call predecessors, (18), 11 states have call successors, (18) Word has length 64 [2023-12-16 05:47:27,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 05:47:27,135 INFO L225 Difference]: With dead ends: 72 [2023-12-16 05:47:27,135 INFO L226 Difference]: Without dead ends: 43 [2023-12-16 05:47:27,136 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 137 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=160, Invalid=392, Unknown=0, NotChecked=0, Total=552 [2023-12-16 05:47:27,136 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 45 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 05:47:27,136 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 73 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 05:47:27,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2023-12-16 05:47:27,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2023-12-16 05:47:27,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 7 states have call successors, (7), 4 states have call predecessors, (7), 6 states have return successors, (19), 9 states have call predecessors, (19), 7 states have call successors, (19) [2023-12-16 05:47:27,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 60 transitions. [2023-12-16 05:47:27,143 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 60 transitions. Word has length 64 [2023-12-16 05:47:27,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 05:47:27,143 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 60 transitions. [2023-12-16 05:47:27,143 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.7777777777777777) internal successors, (50), 18 states have internal predecessors, (50), 11 states have call successors, (14), 1 states have call predecessors, (14), 7 states have return successors, (18), 11 states have call predecessors, (18), 11 states have call successors, (18) [2023-12-16 05:47:27,143 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 60 transitions. [2023-12-16 05:47:27,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-12-16 05:47:27,145 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 05:47:27,145 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 11, 8, 8, 8, 8, 8, 8, 8, 6, 3, 1, 1, 1, 1, 1, 1] [2023-12-16 05:47:27,151 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-12-16 05:47:27,356 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2023-12-16 05:47:27,356 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 05:47:27,357 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 05:47:27,357 INFO L85 PathProgramCache]: Analyzing trace with hash 1673517238, now seen corresponding path program 2 times [2023-12-16 05:47:27,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 05:47:27,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197995912] [2023-12-16 05:47:27,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 05:47:27,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 05:47:27,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:47:27,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-16 05:47:27,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:47:27,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-16 05:47:27,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:47:27,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-16 05:47:27,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:47:27,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-16 05:47:27,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:47:27,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-16 05:47:27,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:47:27,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-16 05:47:27,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:47:27,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-16 05:47:27,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:47:27,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-16 05:47:27,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:47:27,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-16 05:47:27,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:47:27,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-16 05:47:27,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:47:27,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-12-16 05:47:27,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:47:27,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-16 05:47:27,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:47:27,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-16 05:47:27,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:47:27,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-16 05:47:27,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:47:27,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-16 05:47:27,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:47:27,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-16 05:47:27,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:47:27,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-16 05:47:27,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:47:27,698 INFO L134 CoverageAnalysis]: Checked inductivity of 711 backedges. 90 proven. 152 refuted. 0 times theorem prover too weak. 469 trivial. 0 not checked. [2023-12-16 05:47:27,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 05:47:27,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197995912] [2023-12-16 05:47:27,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197995912] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 05:47:27,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1124393610] [2023-12-16 05:47:27,698 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-16 05:47:27,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 05:47:27,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 05:47:27,699 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-16 05:47:27,732 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-16 05:47:27,762 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-16 05:47:27,762 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 05:47:27,763 INFO L262 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-16 05:47:27,766 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 05:47:27,830 INFO L134 CoverageAnalysis]: Checked inductivity of 711 backedges. 69 proven. 192 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2023-12-16 05:47:27,830 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 05:47:28,264 INFO L134 CoverageAnalysis]: Checked inductivity of 711 backedges. 69 proven. 204 refuted. 0 times theorem prover too weak. 438 trivial. 0 not checked. [2023-12-16 05:47:28,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1124393610] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 05:47:28,265 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-16 05:47:28,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 11] total 17 [2023-12-16 05:47:28,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429616] [2023-12-16 05:47:28,265 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-16 05:47:28,266 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-12-16 05:47:28,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 05:47:28,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-12-16 05:47:28,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2023-12-16 05:47:28,267 INFO L87 Difference]: Start difference. First operand 43 states and 60 transitions. Second operand has 17 states, 17 states have (on average 2.8823529411764706) internal successors, (49), 17 states have internal predecessors, (49), 10 states have call successors, (15), 1 states have call predecessors, (15), 7 states have return successors, (20), 11 states have call predecessors, (20), 10 states have call successors, (20) [2023-12-16 05:47:28,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 05:47:28,421 INFO L93 Difference]: Finished difference Result 100 states and 149 transitions. [2023-12-16 05:47:28,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-16 05:47:28,421 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.8823529411764706) internal successors, (49), 17 states have internal predecessors, (49), 10 states have call successors, (15), 1 states have call predecessors, (15), 7 states have return successors, (20), 11 states have call predecessors, (20), 10 states have call successors, (20) Word has length 116 [2023-12-16 05:47:28,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 05:47:28,422 INFO L225 Difference]: With dead ends: 100 [2023-12-16 05:47:28,423 INFO L226 Difference]: Without dead ends: 59 [2023-12-16 05:47:28,423 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 255 SyntacticMatches, 5 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=182, Invalid=418, Unknown=0, NotChecked=0, Total=600 [2023-12-16 05:47:28,424 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 33 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 05:47:28,424 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 79 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 05:47:28,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2023-12-16 05:47:28,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 43. [2023-12-16 05:47:28,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 7 states have call successors, (7), 4 states have call predecessors, (7), 6 states have return successors, (16), 9 states have call predecessors, (16), 7 states have call successors, (16) [2023-12-16 05:47:28,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 57 transitions. [2023-12-16 05:47:28,430 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 57 transitions. Word has length 116 [2023-12-16 05:47:28,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 05:47:28,430 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 57 transitions. [2023-12-16 05:47:28,430 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.8823529411764706) internal successors, (49), 17 states have internal predecessors, (49), 10 states have call successors, (15), 1 states have call predecessors, (15), 7 states have return successors, (20), 11 states have call predecessors, (20), 10 states have call successors, (20) [2023-12-16 05:47:28,430 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 57 transitions. [2023-12-16 05:47:28,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2023-12-16 05:47:28,432 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 05:47:28,432 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 17, 10, 10, 10, 10, 10, 10, 10, 7, 4, 1, 1, 1, 1, 1, 1] [2023-12-16 05:47:28,447 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-12-16 05:47:28,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 05:47:28,637 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 05:47:28,637 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 05:47:28,637 INFO L85 PathProgramCache]: Analyzing trace with hash -1393310086, now seen corresponding path program 3 times [2023-12-16 05:47:28,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 05:47:28,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37272094] [2023-12-16 05:47:28,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 05:47:28,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 05:47:28,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:47:28,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-16 05:47:28,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:47:28,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-16 05:47:28,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:47:28,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-16 05:47:28,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:47:28,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-16 05:47:28,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:47:28,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-16 05:47:28,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:47:28,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-16 05:47:28,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:47:28,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-16 05:47:28,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:47:28,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-16 05:47:28,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:47:28,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-16 05:47:28,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:47:28,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-16 05:47:28,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:47:28,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-12-16 05:47:28,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:47:28,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-16 05:47:28,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:47:28,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-16 05:47:28,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:47:28,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-16 05:47:28,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:47:28,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-16 05:47:28,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:47:28,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-16 05:47:28,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:47:28,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-16 05:47:28,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:47:28,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-16 05:47:28,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:47:28,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-16 05:47:28,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:47:28,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-16 05:47:28,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:47:28,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-12-16 05:47:28,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:47:28,973 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 320 proven. 96 refuted. 0 times theorem prover too weak. 740 trivial. 0 not checked. [2023-12-16 05:47:28,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 05:47:28,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37272094] [2023-12-16 05:47:28,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37272094] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 05:47:28,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [594902408] [2023-12-16 05:47:28,973 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-16 05:47:28,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 05:47:28,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 05:47:28,974 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-16 05:47:28,979 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-12-16 05:47:29,033 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2023-12-16 05:47:29,033 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 05:47:29,034 INFO L262 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-16 05:47:29,036 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 05:47:29,080 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 340 proven. 33 refuted. 0 times theorem prover too weak. 783 trivial. 0 not checked. [2023-12-16 05:47:29,081 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 05:47:29,484 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 340 proven. 34 refuted. 0 times theorem prover too weak. 782 trivial. 0 not checked. [2023-12-16 05:47:29,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [594902408] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 05:47:29,484 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-16 05:47:29,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8, 9] total 18 [2023-12-16 05:47:29,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637271086] [2023-12-16 05:47:29,485 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-16 05:47:29,485 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-12-16 05:47:29,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 05:47:29,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-12-16 05:47:29,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2023-12-16 05:47:29,486 INFO L87 Difference]: Start difference. First operand 43 states and 57 transitions. Second operand has 18 states, 18 states have (on average 3.0) internal successors, (54), 18 states have internal predecessors, (54), 8 states have call successors, (15), 1 states have call predecessors, (15), 7 states have return successors, (19), 13 states have call predecessors, (19), 8 states have call successors, (19) [2023-12-16 05:47:29,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 05:47:29,632 INFO L93 Difference]: Finished difference Result 100 states and 159 transitions. [2023-12-16 05:47:29,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-16 05:47:29,633 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.0) internal successors, (54), 18 states have internal predecessors, (54), 8 states have call successors, (15), 1 states have call predecessors, (15), 7 states have return successors, (19), 13 states have call predecessors, (19), 8 states have call successors, (19) Word has length 146 [2023-12-16 05:47:29,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 05:47:29,634 INFO L225 Difference]: With dead ends: 100 [2023-12-16 05:47:29,634 INFO L226 Difference]: Without dead ends: 48 [2023-12-16 05:47:29,635 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 324 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=135, Invalid=327, Unknown=0, NotChecked=0, Total=462 [2023-12-16 05:47:29,635 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 18 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 05:47:29,635 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 113 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 05:47:29,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2023-12-16 05:47:29,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2023-12-16 05:47:29,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 34 states have (on average 1.0588235294117647) internal successors, (36), 32 states have internal predecessors, (36), 7 states have call successors, (7), 6 states have call predecessors, (7), 6 states have return successors, (12), 9 states have call predecessors, (12), 7 states have call successors, (12) [2023-12-16 05:47:29,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 55 transitions. [2023-12-16 05:47:29,640 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 55 transitions. Word has length 146 [2023-12-16 05:47:29,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 05:47:29,640 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 55 transitions. [2023-12-16 05:47:29,640 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.0) internal successors, (54), 18 states have internal predecessors, (54), 8 states have call successors, (15), 1 states have call predecessors, (15), 7 states have return successors, (19), 13 states have call predecessors, (19), 8 states have call successors, (19) [2023-12-16 05:47:29,641 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2023-12-16 05:47:29,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-12-16 05:47:29,641 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 05:47:29,641 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 12, 7, 7, 7, 7, 7, 7, 7, 5, 3, 1, 1, 1, 1, 1, 1] [2023-12-16 05:47:29,649 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-12-16 05:47:29,846 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 05:47:29,847 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 05:47:29,847 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 05:47:29,847 INFO L85 PathProgramCache]: Analyzing trace with hash -82417497, now seen corresponding path program 4 times [2023-12-16 05:47:29,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 05:47:29,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352773644] [2023-12-16 05:47:29,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 05:47:29,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 05:47:29,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-16 05:47:29,858 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-16 05:47:29,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-16 05:47:29,879 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-16 05:47:29,879 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-16 05:47:29,880 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-16 05:47:29,881 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-16 05:47:29,883 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1] [2023-12-16 05:47:29,885 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-16 05:47:29,913 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 05:47:29 BoogieIcfgContainer [2023-12-16 05:47:29,913 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-16 05:47:29,914 INFO L158 Benchmark]: Toolchain (without parser) took 5946.40ms. Allocated memory was 305.1MB in the beginning and 392.2MB in the end (delta: 87.0MB). Free memory was 265.1MB in the beginning and 196.8MB in the end (delta: 68.3MB). Peak memory consumption was 154.8MB. Max. memory is 8.0GB. [2023-12-16 05:47:29,914 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 169.9MB. Free memory is still 118.4MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 05:47:29,914 INFO L158 Benchmark]: CACSL2BoogieTranslator took 144.14ms. Allocated memory is still 305.1MB. Free memory was 264.6MB in the beginning and 253.6MB in the end (delta: 11.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-16 05:47:29,914 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.69ms. Allocated memory is still 305.1MB. Free memory was 253.6MB in the beginning and 252.0MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-12-16 05:47:29,914 INFO L158 Benchmark]: Boogie Preprocessor took 33.16ms. Allocated memory is still 305.1MB. Free memory was 252.0MB in the beginning and 250.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-16 05:47:29,914 INFO L158 Benchmark]: RCFGBuilder took 223.14ms. Allocated memory is still 305.1MB. Free memory was 250.5MB in the beginning and 240.0MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2023-12-16 05:47:29,914 INFO L158 Benchmark]: TraceAbstraction took 5510.20ms. Allocated memory was 305.1MB in the beginning and 392.2MB in the end (delta: 87.0MB). Free memory was 239.5MB in the beginning and 196.8MB in the end (delta: 42.6MB). Peak memory consumption was 129.7MB. Max. memory is 8.0GB. [2023-12-16 05:47:29,915 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 169.9MB. Free memory is still 118.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 144.14ms. Allocated memory is still 305.1MB. Free memory was 264.6MB in the beginning and 253.6MB in the end (delta: 11.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 31.69ms. Allocated memory is still 305.1MB. Free memory was 253.6MB in the beginning and 252.0MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 33.16ms. Allocated memory is still 305.1MB. Free memory was 252.0MB in the beginning and 250.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 223.14ms. Allocated memory is still 305.1MB. Free memory was 250.5MB in the beginning and 240.0MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 5510.20ms. Allocated memory was 305.1MB in the beginning and 392.2MB in the end (delta: 87.0MB). Free memory was 239.5MB in the beginning and 196.8MB in the end (delta: 42.6MB). Peak memory consumption was 129.7MB. 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 - CounterExampleResult [Line: 35]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L30] int x = __VERIFIER_nondet_int(); [L31] CALL, EXPR fibonacci(x) VAL [\old(n)=5] [L19] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L21] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L24] CALL, EXPR fibonacci(n-1) VAL [\old(n)=4] [L19] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L21] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L24] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L19] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L21] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L24] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L19] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L21] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L24] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L19] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L21] COND TRUE n == 1 [L22] return 1; VAL [\old(n)=1, \result=1, n=1] [L24] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, n=2] [L24] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L19] COND TRUE n < 1 [L20] return 0; VAL [\old(n)=0, \result=0, n=0] [L24] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, n=2] [L24] return fibonacci(n-1) + fibonacci(n-2); [L24] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, n=3] [L24] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L19] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L21] COND TRUE n == 1 [L22] return 1; VAL [\old(n)=1, \result=1, n=1] [L24] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, n=3] [L24] return fibonacci(n-1) + fibonacci(n-2); [L24] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, n=4] [L24] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L19] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L21] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L24] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L19] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L21] COND TRUE n == 1 [L22] return 1; VAL [\old(n)=1, \result=1, n=1] [L24] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, n=2] [L24] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L19] COND TRUE n < 1 [L20] return 0; VAL [\old(n)=0, \result=0, n=0] [L24] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, n=2] [L24] return fibonacci(n-1) + fibonacci(n-2); [L24] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, n=4] [L24] return fibonacci(n-1) + fibonacci(n-2); [L24] RET, EXPR fibonacci(n-1) VAL [\old(n)=5, n=5] [L24] CALL, EXPR fibonacci(n-2) VAL [\old(n)=3] [L19] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L21] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L24] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L19] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L21] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L24] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L19] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L21] COND TRUE n == 1 [L22] return 1; VAL [\old(n)=1, \result=1, n=1] [L24] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, n=2] [L24] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L19] COND TRUE n < 1 [L20] return 0; VAL [\old(n)=0, \result=0, n=0] [L24] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, n=2] [L24] return fibonacci(n-1) + fibonacci(n-2); [L24] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, n=3] [L24] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L19] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L21] COND TRUE n == 1 [L22] return 1; VAL [\old(n)=1, \result=1, n=1] [L24] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, n=3] [L24] return fibonacci(n-1) + fibonacci(n-2); [L24] RET, EXPR fibonacci(n-2) VAL [\old(n)=5, n=5] [L24] return fibonacci(n-1) + fibonacci(n-2); [L31] RET, EXPR fibonacci(x) VAL [x=5] [L31] int result = fibonacci(x); [L32] COND FALSE !(x != 5 || result == 3) VAL [result=5, x=5] [L35] reach_error() VAL [result=5, x=5] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 17 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.4s, OverallIterations: 7, TraceHistogramMax: 21, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 155 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 141 mSDsluCounter, 371 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 281 mSDsCounter, 137 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 733 IncrementalHoareTripleChecker+Invalid, 870 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 137 mSolverCounterUnsat, 90 mSDtfsCounter, 733 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 871 GetRequests, 768 SyntacticMatches, 12 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 367 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=48occurred in iteration=6, InterpolantAutomatonStates: 66, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 18 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 820 NumberOfCodeBlocks, 763 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 1049 ConstructedInterpolants, 0 QuantifiedInterpolants, 1759 SizeOfPredicates, 12 NumberOfNonLiveVariables, 737 ConjunctsInSsa, 32 ConjunctsInUnsatCore, 14 InterpolantComputations, 2 PerfectInterpolantSequences, 5257/6204 InterpolantCoveringCapability, 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 RESULT: Ultimate proved your program to be incorrect! [2023-12-16 05:47:29,940 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...