/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-21 10:14:00,773 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-21 10:14:00,853 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-21 10:14:00,858 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-21 10:14:00,859 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-21 10:14:00,892 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-21 10:14:00,893 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-21 10:14:00,893 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-21 10:14:00,894 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-21 10:14:00,897 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-21 10:14:00,898 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-21 10:14:00,898 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-21 10:14:00,899 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-21 10:14:00,900 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-21 10:14:00,900 INFO L153 SettingsManager]: * Use SBE=true [2023-12-21 10:14:00,900 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-21 10:14:00,901 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-21 10:14:00,901 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-21 10:14:00,901 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-21 10:14:00,901 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-21 10:14:00,902 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-21 10:14:00,902 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-21 10:14:00,902 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-21 10:14:00,902 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-21 10:14:00,903 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-21 10:14:00,903 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-21 10:14:00,903 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-21 10:14:00,903 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-21 10:14:00,904 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-21 10:14:00,904 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-21 10:14:00,905 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-21 10:14:00,905 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-21 10:14:00,905 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 10:14:00,906 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-21 10:14:00,906 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-21 10:14:00,906 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-21 10:14:00,906 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-21 10:14:00,906 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-21 10:14:00,906 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-21 10:14:00,907 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-21 10:14:00,907 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-21 10:14:00,907 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-21 10:14:00,907 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-21 10:14:00,908 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-21 10:14:01,123 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-21 10:14:01,146 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-21 10:14:01,148 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-21 10:14:01,149 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-21 10:14:01,149 INFO L274 PluginConnector]: CDTParser initialized [2023-12-21 10:14:01,150 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive/Fibonacci04.c [2023-12-21 10:14:02,311 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-21 10:14:02,513 INFO L384 CDTParser]: Found 1 translation units. [2023-12-21 10:14:02,514 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive/Fibonacci04.c [2023-12-21 10:14:02,525 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee3ddaefd/0cbc10b1b662435ea435110a6379fdb9/FLAG5d141d829 [2023-12-21 10:14:02,540 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee3ddaefd/0cbc10b1b662435ea435110a6379fdb9 [2023-12-21 10:14:02,543 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-21 10:14:02,544 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-21 10:14:02,547 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-21 10:14:02,547 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-21 10:14:02,554 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-21 10:14:02,555 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 10:14:02" (1/1) ... [2023-12-21 10:14:02,556 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71b6fcf5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:14:02, skipping insertion in model container [2023-12-21 10:14:02,556 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 10:14:02" (1/1) ... [2023-12-21 10:14:02,576 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-21 10:14:02,709 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-21 10:14:02,713 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 10:14:02,722 INFO L202 MainTranslator]: Completed pre-run [2023-12-21 10:14:02,733 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-21 10:14:02,733 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 10:14:02,745 INFO L206 MainTranslator]: Completed translation [2023-12-21 10:14:02,746 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:14:02 WrapperNode [2023-12-21 10:14:02,746 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-21 10:14:02,747 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-21 10:14:02,747 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-21 10:14:02,747 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-21 10:14:02,754 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:14:02" (1/1) ... [2023-12-21 10:14:02,760 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:14:02" (1/1) ... [2023-12-21 10:14:02,782 INFO L138 Inliner]: procedures = 13, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 23 [2023-12-21 10:14:02,783 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-21 10:14:02,783 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-21 10:14:02,783 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-21 10:14:02,784 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-21 10:14:02,795 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:14:02" (1/1) ... [2023-12-21 10:14:02,795 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:14:02" (1/1) ... [2023-12-21 10:14:02,797 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:14:02" (1/1) ... [2023-12-21 10:14:02,811 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-21 10:14:02,811 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:14:02" (1/1) ... [2023-12-21 10:14:02,812 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:14:02" (1/1) ... [2023-12-21 10:14:02,814 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:14:02" (1/1) ... [2023-12-21 10:14:02,816 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:14:02" (1/1) ... [2023-12-21 10:14:02,817 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:14:02" (1/1) ... [2023-12-21 10:14:02,818 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:14:02" (1/1) ... [2023-12-21 10:14:02,824 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-21 10:14:02,825 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-21 10:14:02,826 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-21 10:14:02,826 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-21 10:14:02,827 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:14:02" (1/1) ... [2023-12-21 10:14:02,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 10:14:02,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 10:14:02,857 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-21 10:14:02,877 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-21 10:14:02,891 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2023-12-21 10:14:02,891 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2023-12-21 10:14:02,891 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-21 10:14:02,891 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-21 10:14:02,891 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-21 10:14:02,891 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-21 10:14:02,943 INFO L241 CfgBuilder]: Building ICFG [2023-12-21 10:14:02,946 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-21 10:14:03,026 INFO L282 CfgBuilder]: Performing block encoding [2023-12-21 10:14:03,045 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-21 10:14:03,045 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-12-21 10:14:03,046 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 10:14:03 BoogieIcfgContainer [2023-12-21 10:14:03,046 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-21 10:14:03,048 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-21 10:14:03,048 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-21 10:14:03,051 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-21 10:14:03,051 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.12 10:14:02" (1/3) ... [2023-12-21 10:14:03,052 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62ebc9a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 10:14:03, skipping insertion in model container [2023-12-21 10:14:03,052 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:14:02" (2/3) ... [2023-12-21 10:14:03,052 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62ebc9a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 10:14:03, skipping insertion in model container [2023-12-21 10:14:03,052 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 10:14:03" (3/3) ... [2023-12-21 10:14:03,053 INFO L112 eAbstractionObserver]: Analyzing ICFG Fibonacci04.c [2023-12-21 10:14:03,068 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-21 10:14:03,069 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-21 10:14:03,122 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-21 10:14:03,130 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;@37117d77, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-21 10:14:03,130 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-21 10:14:03,134 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-21 10:14:03,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-12-21 10:14:03,151 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 10:14:03,151 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 10:14:03,152 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 10:14:03,157 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 10:14:03,158 INFO L85 PathProgramCache]: Analyzing trace with hash -1615401540, now seen corresponding path program 1 times [2023-12-21 10:14:03,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 10:14:03,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113950592] [2023-12-21 10:14:03,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 10:14:03,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 10:14:03,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:03,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 10:14:03,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:03,471 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-21 10:14:03,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 10:14:03,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113950592] [2023-12-21 10:14:03,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113950592] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 10:14:03,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 10:14:03,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-21 10:14:03,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181942094] [2023-12-21 10:14:03,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 10:14:03,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-21 10:14:03,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 10:14:03,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-21 10:14:03,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-21 10:14:03,503 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-21 10:14:03,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 10:14:03,590 INFO L93 Difference]: Finished difference Result 26 states and 32 transitions. [2023-12-21 10:14:03,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 10:14:03,593 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-21 10:14:03,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 10:14:03,599 INFO L225 Difference]: With dead ends: 26 [2023-12-21 10:14:03,599 INFO L226 Difference]: Without dead ends: 17 [2023-12-21 10:14:03,602 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-21 10:14:03,605 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 9 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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.0s IncrementalHoareTripleChecker+Time [2023-12-21 10:14:03,605 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.0s Time] [2023-12-21 10:14:03,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2023-12-21 10:14:03,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2023-12-21 10:14:03,633 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-21 10:14:03,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2023-12-21 10:14:03,635 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 9 [2023-12-21 10:14:03,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 10:14:03,635 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2023-12-21 10:14:03,635 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-21 10:14:03,635 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2023-12-21 10:14:03,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-12-21 10:14:03,637 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 10:14:03,637 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 10:14:03,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-21 10:14:03,637 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 10:14:03,638 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 10:14:03,638 INFO L85 PathProgramCache]: Analyzing trace with hash -2136894566, now seen corresponding path program 1 times [2023-12-21 10:14:03,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 10:14:03,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617221975] [2023-12-21 10:14:03,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 10:14:03,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 10:14:03,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:03,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 10:14:03,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:03,735 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-21 10:14:03,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 10:14:03,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617221975] [2023-12-21 10:14:03,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617221975] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 10:14:03,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 10:14:03,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-21 10:14:03,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569919196] [2023-12-21 10:14:03,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 10:14:03,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-21 10:14:03,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 10:14:03,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-21 10:14:03,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-21 10:14:03,738 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-21 10:14:03,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 10:14:03,796 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2023-12-21 10:14:03,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 10:14:03,797 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-21 10:14:03,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 10:14:03,798 INFO L225 Difference]: With dead ends: 23 [2023-12-21 10:14:03,798 INFO L226 Difference]: Without dead ends: 19 [2023-12-21 10:14:03,799 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-21 10:14:03,800 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-21 10:14:03,800 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-21 10:14:03,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2023-12-21 10:14:03,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2023-12-21 10:14:03,805 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-21 10:14:03,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2023-12-21 10:14:03,806 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 10 [2023-12-21 10:14:03,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 10:14:03,806 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2023-12-21 10:14:03,807 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-21 10:14:03,807 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2023-12-21 10:14:03,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-12-21 10:14:03,808 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 10:14:03,808 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 10:14:03,808 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-21 10:14:03,808 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 10:14:03,809 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 10:14:03,809 INFO L85 PathProgramCache]: Analyzing trace with hash -338238899, now seen corresponding path program 1 times [2023-12-21 10:14:03,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 10:14:03,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224431194] [2023-12-21 10:14:03,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 10:14:03,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 10:14:03,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:03,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 10:14:03,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:03,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:14:03,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:04,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-21 10:14:04,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:04,030 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-21 10:14:04,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 10:14:04,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224431194] [2023-12-21 10:14:04,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224431194] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 10:14:04,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2133045670] [2023-12-21 10:14:04,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 10:14:04,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 10:14:04,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 10:14:04,038 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-21 10:14:04,048 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-21 10:14:04,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:04,102 INFO L262 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-21 10:14:04,106 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 10:14:04,200 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-21 10:14:04,200 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 10:14:04,403 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-21 10:14:04,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2133045670] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 10:14:04,404 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-21 10:14:04,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 13 [2023-12-21 10:14:04,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648766828] [2023-12-21 10:14:04,404 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-21 10:14:04,406 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-21 10:14:04,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 10:14:04,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-21 10:14:04,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2023-12-21 10:14:04,409 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-21 10:14:04,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 10:14:04,605 INFO L93 Difference]: Finished difference Result 45 states and 68 transitions. [2023-12-21 10:14:04,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-21 10:14:04,606 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-21 10:14:04,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 10:14:04,609 INFO L225 Difference]: With dead ends: 45 [2023-12-21 10:14:04,609 INFO L226 Difference]: Without dead ends: 28 [2023-12-21 10:14:04,611 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-21 10:14:04,616 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-21 10:14:04,617 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-21 10:14:04,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2023-12-21 10:14:04,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2023-12-21 10:14:04,627 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-21 10:14:04,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2023-12-21 10:14:04,631 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 22 [2023-12-21 10:14:04,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 10:14:04,631 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2023-12-21 10:14:04,632 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-21 10:14:04,632 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2023-12-21 10:14:04,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-12-21 10:14:04,638 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 10:14:04,638 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-21 10:14:04,649 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-21 10:14:04,844 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-21 10:14:04,845 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 10:14:04,845 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 10:14:04,845 INFO L85 PathProgramCache]: Analyzing trace with hash 255154638, now seen corresponding path program 1 times [2023-12-21 10:14:04,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 10:14:04,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331042553] [2023-12-21 10:14:04,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 10:14:04,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 10:14:04,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:04,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 10:14:04,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:05,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:14:05,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:05,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:14:05,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:05,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-21 10:14:05,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:05,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-21 10:14:05,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:05,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:14:05,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:05,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-21 10:14:05,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:05,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:14:05,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:05,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-21 10:14:05,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:05,154 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-21 10:14:05,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 10:14:05,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331042553] [2023-12-21 10:14:05,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331042553] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 10:14:05,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [672023104] [2023-12-21 10:14:05,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 10:14:05,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 10:14:05,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 10:14:05,157 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-21 10:14:05,164 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-21 10:14:05,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:05,211 INFO L262 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-21 10:14:05,214 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 10:14:05,303 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-21 10:14:05,303 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 10:14:05,694 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-21 10:14:05,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [672023104] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 10:14:05,696 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-21 10:14:05,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 9] total 18 [2023-12-21 10:14:05,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880261569] [2023-12-21 10:14:05,697 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-21 10:14:05,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-12-21 10:14:05,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 10:14:05,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-12-21 10:14:05,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=231, Unknown=0, NotChecked=0, Total=306 [2023-12-21 10:14:05,703 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-21 10:14:05,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 10:14:05,877 INFO L93 Difference]: Finished difference Result 72 states and 117 transitions. [2023-12-21 10:14:05,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-21 10:14:05,878 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-21 10:14:05,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 10:14:05,880 INFO L225 Difference]: With dead ends: 72 [2023-12-21 10:14:05,880 INFO L226 Difference]: Without dead ends: 43 [2023-12-21 10:14:05,881 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 137 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=160, Invalid=392, Unknown=0, NotChecked=0, Total=552 [2023-12-21 10:14:05,882 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 45 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 10:14:05,882 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 73 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 10:14:05,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2023-12-21 10:14:05,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2023-12-21 10:14:05,889 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-21 10:14:05,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 60 transitions. [2023-12-21 10:14:05,891 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 60 transitions. Word has length 64 [2023-12-21 10:14:05,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 10:14:05,891 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 60 transitions. [2023-12-21 10:14:05,891 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-21 10:14:05,891 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 60 transitions. [2023-12-21 10:14:05,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-12-21 10:14:05,893 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 10:14:05,893 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-21 10:14:05,904 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-21 10:14:06,099 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-21 10:14:06,100 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 10:14:06,100 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 10:14:06,101 INFO L85 PathProgramCache]: Analyzing trace with hash 1673517238, now seen corresponding path program 2 times [2023-12-21 10:14:06,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 10:14:06,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482496981] [2023-12-21 10:14:06,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 10:14:06,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 10:14:06,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:06,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 10:14:06,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:06,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:14:06,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:06,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:14:06,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:06,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:14:06,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:06,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:14:06,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:06,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-21 10:14:06,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:06,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-21 10:14:06,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:06,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-21 10:14:06,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:06,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:14:06,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:06,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-21 10:14:06,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:06,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-12-21 10:14:06,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:06,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:14:06,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:06,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:14:06,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:06,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:14:06,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:06,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-21 10:14:06,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:06,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-21 10:14:06,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:06,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-21 10:14:06,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:06,432 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-21 10:14:06,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 10:14:06,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482496981] [2023-12-21 10:14:06,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482496981] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 10:14:06,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [465479812] [2023-12-21 10:14:06,433 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-21 10:14:06,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 10:14:06,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 10:14:06,437 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-21 10:14:06,458 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-21 10:14:06,517 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-21 10:14:06,517 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 10:14:06,519 INFO L262 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-21 10:14:06,530 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 10:14:06,608 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-21 10:14:06,609 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 10:14:07,157 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-21 10:14:07,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [465479812] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 10:14:07,158 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-21 10:14:07,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 11] total 17 [2023-12-21 10:14:07,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518334991] [2023-12-21 10:14:07,158 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-21 10:14:07,159 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-12-21 10:14:07,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 10:14:07,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-12-21 10:14:07,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2023-12-21 10:14:07,161 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-21 10:14:07,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 10:14:07,345 INFO L93 Difference]: Finished difference Result 100 states and 149 transitions. [2023-12-21 10:14:07,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-21 10:14:07,346 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-21 10:14:07,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 10:14:07,348 INFO L225 Difference]: With dead ends: 100 [2023-12-21 10:14:07,348 INFO L226 Difference]: Without dead ends: 59 [2023-12-21 10:14:07,355 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-21 10:14:07,356 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-21 10:14:07,356 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-21 10:14:07,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2023-12-21 10:14:07,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 43. [2023-12-21 10:14:07,371 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-21 10:14:07,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 57 transitions. [2023-12-21 10:14:07,374 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 57 transitions. Word has length 116 [2023-12-21 10:14:07,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 10:14:07,376 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 57 transitions. [2023-12-21 10:14:07,376 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-21 10:14:07,376 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 57 transitions. [2023-12-21 10:14:07,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2023-12-21 10:14:07,382 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 10:14:07,382 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-21 10:14:07,388 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-12-21 10:14:07,588 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-21 10:14:07,588 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 10:14:07,588 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 10:14:07,589 INFO L85 PathProgramCache]: Analyzing trace with hash -1393310086, now seen corresponding path program 3 times [2023-12-21 10:14:07,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 10:14:07,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104736154] [2023-12-21 10:14:07,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 10:14:07,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 10:14:07,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:07,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 10:14:07,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:07,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:14:07,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:07,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:14:07,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:07,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:14:07,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:07,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:14:07,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:07,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-21 10:14:07,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:07,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-21 10:14:07,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:07,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-21 10:14:07,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:07,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:14:07,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:07,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-21 10:14:07,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:07,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-12-21 10:14:07,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:07,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:14:07,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:08,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:14:08,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:08,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:14:08,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:08,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:14:08,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:08,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-21 10:14:08,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:08,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-21 10:14:08,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:08,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-21 10:14:08,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:08,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:14:08,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:08,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-21 10:14:08,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:08,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-12-21 10:14:08,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:14:08,123 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-21 10:14:08,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 10:14:08,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104736154] [2023-12-21 10:14:08,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104736154] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 10:14:08,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [295693892] [2023-12-21 10:14:08,125 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-21 10:14:08,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 10:14:08,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 10:14:08,133 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-21 10:14:08,155 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-21 10:14:08,210 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2023-12-21 10:14:08,210 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 10:14:08,211 INFO L262 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-21 10:14:08,218 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 10:14:08,302 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-21 10:14:08,302 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 10:14:08,741 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-21 10:14:08,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [295693892] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 10:14:08,741 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-21 10:14:08,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8, 9] total 18 [2023-12-21 10:14:08,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070874567] [2023-12-21 10:14:08,742 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-21 10:14:08,743 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-12-21 10:14:08,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 10:14:08,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-12-21 10:14:08,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2023-12-21 10:14:08,746 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-21 10:14:08,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 10:14:08,934 INFO L93 Difference]: Finished difference Result 100 states and 159 transitions. [2023-12-21 10:14:08,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-21 10:14:08,935 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-21 10:14:08,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 10:14:08,938 INFO L225 Difference]: With dead ends: 100 [2023-12-21 10:14:08,938 INFO L226 Difference]: Without dead ends: 48 [2023-12-21 10:14:08,939 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 324 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=135, Invalid=327, Unknown=0, NotChecked=0, Total=462 [2023-12-21 10:14:08,940 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 18 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 10:14:08,940 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 123 Invalid, 273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 10:14:08,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2023-12-21 10:14:08,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2023-12-21 10:14:08,949 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-21 10:14:08,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 55 transitions. [2023-12-21 10:14:08,951 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 55 transitions. Word has length 146 [2023-12-21 10:14:08,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 10:14:08,952 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 55 transitions. [2023-12-21 10:14:08,953 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-21 10:14:08,953 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2023-12-21 10:14:08,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-12-21 10:14:08,955 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 10:14:08,955 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-21 10:14:08,967 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-21 10:14:09,161 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-21 10:14:09,162 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 10:14:09,162 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 10:14:09,162 INFO L85 PathProgramCache]: Analyzing trace with hash -82417497, now seen corresponding path program 4 times [2023-12-21 10:14:09,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 10:14:09,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751391763] [2023-12-21 10:14:09,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 10:14:09,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 10:14:09,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-21 10:14:09,177 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-21 10:14:09,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-21 10:14:09,205 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-21 10:14:09,206 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-21 10:14:09,207 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-21 10:14:09,208 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-21 10:14:09,211 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1] [2023-12-21 10:14:09,215 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-21 10:14:09,270 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.12 10:14:09 BoogieIcfgContainer [2023-12-21 10:14:09,271 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-21 10:14:09,271 INFO L158 Benchmark]: Toolchain (without parser) took 6727.03ms. Allocated memory was 288.4MB in the beginning and 346.0MB in the end (delta: 57.7MB). Free memory was 241.8MB in the beginning and 241.4MB in the end (delta: 390.1kB). Peak memory consumption was 59.1MB. Max. memory is 8.0GB. [2023-12-21 10:14:09,271 INFO L158 Benchmark]: CDTParser took 0.54ms. Allocated memory is still 185.6MB. Free memory is still 138.5MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-21 10:14:09,272 INFO L158 Benchmark]: CACSL2BoogieTranslator took 199.32ms. Allocated memory is still 288.4MB. Free memory was 241.4MB in the beginning and 230.8MB in the end (delta: 10.6MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2023-12-21 10:14:09,272 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.74ms. Allocated memory is still 288.4MB. Free memory was 230.8MB in the beginning and 229.4MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-12-21 10:14:09,272 INFO L158 Benchmark]: Boogie Preprocessor took 40.70ms. Allocated memory is still 288.4MB. Free memory was 229.4MB in the beginning and 227.7MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-21 10:14:09,272 INFO L158 Benchmark]: RCFGBuilder took 220.46ms. Allocated memory is still 288.4MB. Free memory was 227.7MB in the beginning and 217.9MB in the end (delta: 9.9MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2023-12-21 10:14:09,273 INFO L158 Benchmark]: TraceAbstraction took 6222.76ms. Allocated memory was 288.4MB in the beginning and 346.0MB in the end (delta: 57.7MB). Free memory was 217.3MB in the beginning and 241.4MB in the end (delta: -24.2MB). Peak memory consumption was 33.9MB. Max. memory is 8.0GB. [2023-12-21 10:14:09,275 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.54ms. Allocated memory is still 185.6MB. Free memory is still 138.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 199.32ms. Allocated memory is still 288.4MB. Free memory was 241.4MB in the beginning and 230.8MB in the end (delta: 10.6MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 35.74ms. Allocated memory is still 288.4MB. Free memory was 230.8MB in the beginning and 229.4MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 40.70ms. Allocated memory is still 288.4MB. Free memory was 229.4MB in the beginning and 227.7MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 220.46ms. Allocated memory is still 288.4MB. Free memory was 227.7MB in the beginning and 217.9MB in the end (delta: 9.9MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * TraceAbstraction took 6222.76ms. Allocated memory was 288.4MB in the beginning and 346.0MB in the end (delta: 57.7MB). Free memory was 217.3MB in the beginning and 241.4MB in the end (delta: -24.2MB). Peak memory consumption was 33.9MB. 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: 6.1s, OverallIterations: 7, TraceHistogramMax: 21, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 154 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 141 mSDsluCounter, 381 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 290 mSDsCounter, 136 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 752 IncrementalHoareTripleChecker+Invalid, 888 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 136 mSolverCounterUnsat, 91 mSDtfsCounter, 752 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.8s 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.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 18 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.5s 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-21 10:14:09,292 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...