./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/Fibonacci04.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/Fibonacci04.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8d19306ce3d42a6a85ce0e73aaa2bade9eaab24620b40f9180d62be222dc7b30 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 03:11:26,403 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 03:11:26,485 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 03:11:26,493 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 03:11:26,493 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 03:11:26,525 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 03:11:26,526 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 03:11:26,526 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 03:11:26,527 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 03:11:26,527 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 03:11:26,527 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 03:11:26,527 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 03:11:26,528 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 03:11:26,528 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 03:11:26,528 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 03:11:26,529 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 03:11:26,529 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 03:11:26,529 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 03:11:26,529 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 03:11:26,530 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 03:11:26,530 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 03:11:26,530 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 03:11:26,531 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 03:11:26,531 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 03:11:26,531 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 03:11:26,531 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 03:11:26,531 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 03:11:26,532 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 03:11:26,532 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 03:11:26,532 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 03:11:26,532 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 03:11:26,532 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 03:11:26,533 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 03:11:26,533 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 03:11:26,533 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 03:11:26,533 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 03:11:26,534 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 03:11:26,534 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 03:11:26,534 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 03:11:26,534 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 03:11:26,534 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 03:11:26,535 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 03:11:26,535 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: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8d19306ce3d42a6a85ce0e73aaa2bade9eaab24620b40f9180d62be222dc7b30 [2024-10-14 03:11:26,728 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 03:11:26,753 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 03:11:26,756 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 03:11:26,756 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 03:11:26,757 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 03:11:26,758 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/Fibonacci04.c [2024-10-14 03:11:28,156 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 03:11:28,412 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 03:11:28,412 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/Fibonacci04.c [2024-10-14 03:11:28,421 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a487840e4/6a6c17c56c384928a4336aa7f932d52a/FLAGb89b07125 [2024-10-14 03:11:28,438 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a487840e4/6a6c17c56c384928a4336aa7f932d52a [2024-10-14 03:11:28,441 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 03:11:28,443 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 03:11:28,449 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 03:11:28,449 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 03:11:28,453 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 03:11:28,458 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 03:11:28" (1/1) ... [2024-10-14 03:11:28,460 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78ba9641 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:11:28, skipping insertion in model container [2024-10-14 03:11:28,460 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 03:11:28" (1/1) ... [2024-10-14 03:11:28,487 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 03:11:28,722 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/Fibonacci04.c[780,793] [2024-10-14 03:11:28,726 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 03:11:28,744 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 03:11:28,757 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/Fibonacci04.c[780,793] [2024-10-14 03:11:28,759 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 03:11:28,773 INFO L204 MainTranslator]: Completed translation [2024-10-14 03:11:28,774 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:11:28 WrapperNode [2024-10-14 03:11:28,774 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 03:11:28,775 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 03:11:28,779 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 03:11:28,779 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 03:11:28,789 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:11:28" (1/1) ... [2024-10-14 03:11:28,804 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:11:28" (1/1) ... [2024-10-14 03:11:28,831 INFO L138 Inliner]: procedures = 13, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 23 [2024-10-14 03:11:28,832 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 03:11:28,836 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 03:11:28,839 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 03:11:28,839 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 03:11:28,847 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:11:28" (1/1) ... [2024-10-14 03:11:28,848 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:11:28" (1/1) ... [2024-10-14 03:11:28,848 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:11:28" (1/1) ... [2024-10-14 03:11:28,863 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]. [2024-10-14 03:11:28,864 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:11:28" (1/1) ... [2024-10-14 03:11:28,864 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:11:28" (1/1) ... [2024-10-14 03:11:28,866 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:11:28" (1/1) ... [2024-10-14 03:11:28,869 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:11:28" (1/1) ... [2024-10-14 03:11:28,870 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:11:28" (1/1) ... [2024-10-14 03:11:28,871 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:11:28" (1/1) ... [2024-10-14 03:11:28,872 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 03:11:28,873 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 03:11:28,873 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 03:11:28,874 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 03:11:28,874 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:11:28" (1/1) ... [2024-10-14 03:11:28,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 03:11:28,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:11:28,928 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) [2024-10-14 03:11:28,930 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 [2024-10-14 03:11:29,010 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2024-10-14 03:11:29,014 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2024-10-14 03:11:29,014 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 03:11:29,014 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 03:11:29,015 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 03:11:29,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 03:11:29,083 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 03:11:29,084 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 03:11:29,157 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-10-14 03:11:29,157 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 03:11:29,172 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 03:11:29,172 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-14 03:11:29,173 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 03:11:29 BoogieIcfgContainer [2024-10-14 03:11:29,173 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 03:11:29,174 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 03:11:29,175 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 03:11:29,177 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 03:11:29,177 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 03:11:28" (1/3) ... [2024-10-14 03:11:29,178 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62064b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 03:11:29, skipping insertion in model container [2024-10-14 03:11:29,178 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:11:28" (2/3) ... [2024-10-14 03:11:29,178 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62064b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 03:11:29, skipping insertion in model container [2024-10-14 03:11:29,178 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 03:11:29" (3/3) ... [2024-10-14 03:11:29,179 INFO L112 eAbstractionObserver]: Analyzing ICFG Fibonacci04.c [2024-10-14 03:11:29,192 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 03:11:29,192 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 03:11:29,232 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 03:11:29,238 INFO L333 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, 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;@303ea115, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 03:11:29,238 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 03:11:29,241 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) [2024-10-14 03:11:29,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-14 03:11:29,247 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:11:29,247 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:11:29,248 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:11:29,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:11:29,252 INFO L85 PathProgramCache]: Analyzing trace with hash -1615401540, now seen corresponding path program 1 times [2024-10-14 03:11:29,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:11:29,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584769535] [2024-10-14 03:11:29,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:11:29,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:11:29,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:29,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:11:29,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:29,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:11:29,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:11:29,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584769535] [2024-10-14 03:11:29,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [584769535] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:11:29,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:11:29,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 03:11:29,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567169438] [2024-10-14 03:11:29,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:11:29,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 03:11:29,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:11:29,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 03:11:29,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:11:29,498 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) [2024-10-14 03:11:29,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:11:29,583 INFO L93 Difference]: Finished difference Result 27 states and 35 transitions. [2024-10-14 03:11:29,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 03:11:29,586 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 [2024-10-14 03:11:29,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:11:29,592 INFO L225 Difference]: With dead ends: 27 [2024-10-14 03:11:29,593 INFO L226 Difference]: Without dead ends: 19 [2024-10-14 03:11:29,595 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:11:29,597 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 5 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:11:29,598 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 31 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:11:29,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2024-10-14 03:11:29,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2024-10-14 03:11:29,627 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) [2024-10-14 03:11:29,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2024-10-14 03:11:29,629 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 9 [2024-10-14 03:11:29,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:11:29,630 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2024-10-14 03:11:29,630 INFO L472 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) [2024-10-14 03:11:29,630 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2024-10-14 03:11:29,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-14 03:11:29,631 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:11:29,631 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:11:29,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 03:11:29,632 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:11:29,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:11:29,633 INFO L85 PathProgramCache]: Analyzing trace with hash -2136894566, now seen corresponding path program 1 times [2024-10-14 03:11:29,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:11:29,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113226407] [2024-10-14 03:11:29,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:11:29,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:11:29,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:29,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:11:29,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:29,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:11:29,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:11:29,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113226407] [2024-10-14 03:11:29,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113226407] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:11:29,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:11:29,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 03:11:29,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025911680] [2024-10-14 03:11:29,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:11:29,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 03:11:29,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:11:29,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 03:11:29,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:11:29,834 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) [2024-10-14 03:11:29,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:11:29,872 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2024-10-14 03:11:29,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 03:11:29,873 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 [2024-10-14 03:11:29,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:11:29,874 INFO L225 Difference]: With dead ends: 23 [2024-10-14 03:11:29,874 INFO L226 Difference]: Without dead ends: 19 [2024-10-14 03:11:29,874 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:11:29,875 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 4 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:11:29,876 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 29 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:11:29,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2024-10-14 03:11:29,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2024-10-14 03:11:29,880 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) [2024-10-14 03:11:29,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2024-10-14 03:11:29,880 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 10 [2024-10-14 03:11:29,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:11:29,881 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2024-10-14 03:11:29,881 INFO L472 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) [2024-10-14 03:11:29,881 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2024-10-14 03:11:29,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-14 03:11:29,882 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:11:29,882 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:11:29,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 03:11:29,882 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:11:29,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:11:29,883 INFO L85 PathProgramCache]: Analyzing trace with hash -338238899, now seen corresponding path program 1 times [2024-10-14 03:11:29,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:11:29,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999739603] [2024-10-14 03:11:29,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:11:29,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:11:29,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:29,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:11:29,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:29,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:11:29,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:29,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 03:11:30,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:30,002 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 03:11:30,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:11:30,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999739603] [2024-10-14 03:11:30,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999739603] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 03:11:30,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [53357620] [2024-10-14 03:11:30,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:11:30,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 03:11:30,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:11:30,005 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) [2024-10-14 03:11:30,009 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-14 03:11:30,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:30,066 INFO L255 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-14 03:11:30,074 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 03:11:30,149 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 03:11:30,149 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 03:11:30,336 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-14 03:11:30,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [53357620] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 03:11:30,337 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 03:11:30,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 13 [2024-10-14 03:11:30,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614427862] [2024-10-14 03:11:30,337 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 03:11:30,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-14 03:11:30,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:11:30,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-14 03:11:30,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2024-10-14 03:11:30,341 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) [2024-10-14 03:11:30,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:11:30,491 INFO L93 Difference]: Finished difference Result 45 states and 68 transitions. [2024-10-14 03:11:30,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-14 03:11:30,491 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 [2024-10-14 03:11:30,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:11:30,493 INFO L225 Difference]: With dead ends: 45 [2024-10-14 03:11:30,494 INFO L226 Difference]: Without dead ends: 28 [2024-10-14 03:11:30,495 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2024-10-14 03:11:30,495 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 17 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:11:30,496 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 60 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:11:30,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-10-14 03:11:30,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2024-10-14 03:11:30,508 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) [2024-10-14 03:11:30,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2024-10-14 03:11:30,509 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 22 [2024-10-14 03:11:30,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:11:30,509 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2024-10-14 03:11:30,509 INFO L472 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) [2024-10-14 03:11:30,510 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2024-10-14 03:11:30,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-10-14 03:11:30,514 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:11:30,514 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 7, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1] [2024-10-14 03:11:30,530 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-14 03:11:30,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 03:11:30,719 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:11:30,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:11:30,720 INFO L85 PathProgramCache]: Analyzing trace with hash 255154638, now seen corresponding path program 1 times [2024-10-14 03:11:30,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:11:30,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618932408] [2024-10-14 03:11:30,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:11:30,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:11:30,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:30,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:11:30,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:30,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:11:30,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:30,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:11:30,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:30,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 03:11:30,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:30,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-14 03:11:30,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:30,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:11:31,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:31,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 03:11:31,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:31,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:11:31,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:31,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 03:11:31,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:31,034 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 44 proven. 63 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2024-10-14 03:11:31,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:11:31,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618932408] [2024-10-14 03:11:31,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618932408] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 03:11:31,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [96329370] [2024-10-14 03:11:31,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:11:31,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 03:11:31,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:11:31,041 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) [2024-10-14 03:11:31,042 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-14 03:11:31,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:31,089 INFO L255 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-14 03:11:31,093 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 03:11:31,164 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 16 proven. 75 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2024-10-14 03:11:31,165 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 03:11:31,477 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 16 proven. 82 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2024-10-14 03:11:31,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [96329370] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 03:11:31,477 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 03:11:31,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 9] total 18 [2024-10-14 03:11:31,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838760091] [2024-10-14 03:11:31,478 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 03:11:31,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-14 03:11:31,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:11:31,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-14 03:11:31,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=231, Unknown=0, NotChecked=0, Total=306 [2024-10-14 03:11:31,479 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) [2024-10-14 03:11:31,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:11:31,652 INFO L93 Difference]: Finished difference Result 72 states and 117 transitions. [2024-10-14 03:11:31,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-14 03:11:31,652 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 [2024-10-14 03:11:31,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:11:31,654 INFO L225 Difference]: With dead ends: 72 [2024-10-14 03:11:31,654 INFO L226 Difference]: Without dead ends: 44 [2024-10-14 03:11:31,655 INFO L431 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 [2024-10-14 03:11:31,656 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 45 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:11:31,656 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 73 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:11:31,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-10-14 03:11:31,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 41. [2024-10-14 03:11:31,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 28 states have internal predecessors, (32), 7 states have call successors, (7), 3 states have call predecessors, (7), 6 states have return successors, (20), 9 states have call predecessors, (20), 7 states have call successors, (20) [2024-10-14 03:11:31,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 59 transitions. [2024-10-14 03:11:31,663 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 59 transitions. Word has length 64 [2024-10-14 03:11:31,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:11:31,664 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 59 transitions. [2024-10-14 03:11:31,664 INFO L472 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) [2024-10-14 03:11:31,664 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 59 transitions. [2024-10-14 03:11:31,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-10-14 03:11:31,667 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:11:31,667 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 14, 10, 10, 10, 10, 10, 10, 10, 7, 4, 1, 1, 1, 1, 1, 1] [2024-10-14 03:11:31,680 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-14 03:11:31,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2024-10-14 03:11:31,868 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:11:31,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:11:31,869 INFO L85 PathProgramCache]: Analyzing trace with hash 240087370, now seen corresponding path program 2 times [2024-10-14 03:11:31,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:11:31,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434508380] [2024-10-14 03:11:31,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:11:31,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:11:31,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:31,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:11:31,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:32,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:11:32,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:32,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:11:32,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:32,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:11:32,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:32,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:11:32,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:32,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 03:11:32,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:32,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-14 03:11:32,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:32,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 03:11:32,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:32,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:11:32,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:32,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 03:11:32,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:32,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 03:11:32,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:32,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:11:32,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:32,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:11:32,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:32,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:11:32,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:32,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:11:32,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:32,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 03:11:32,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:32,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-14 03:11:32,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:32,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 03:11:32,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:32,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:11:32,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:32,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 03:11:32,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:32,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 03:11:32,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:32,255 INFO L134 CoverageAnalysis]: Checked inductivity of 1111 backedges. 100 proven. 219 refuted. 0 times theorem prover too weak. 792 trivial. 0 not checked. [2024-10-14 03:11:32,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:11:32,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434508380] [2024-10-14 03:11:32,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434508380] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 03:11:32,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1299846582] [2024-10-14 03:11:32,256 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-14 03:11:32,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 03:11:32,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:11:32,257 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) [2024-10-14 03:11:32,260 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-14 03:11:32,325 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-14 03:11:32,326 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 03:11:32,327 INFO L255 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-14 03:11:32,330 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 03:11:32,401 INFO L134 CoverageAnalysis]: Checked inductivity of 1111 backedges. 79 proven. 263 refuted. 0 times theorem prover too weak. 769 trivial. 0 not checked. [2024-10-14 03:11:32,401 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 03:11:33,137 INFO L134 CoverageAnalysis]: Checked inductivity of 1111 backedges. 79 proven. 275 refuted. 0 times theorem prover too weak. 757 trivial. 0 not checked. [2024-10-14 03:11:33,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1299846582] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 03:11:33,137 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 03:11:33,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 11] total 17 [2024-10-14 03:11:33,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866648394] [2024-10-14 03:11:33,137 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 03:11:33,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-14 03:11:33,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:11:33,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-14 03:11:33,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2024-10-14 03:11:33,139 INFO L87 Difference]: Start difference. First operand 41 states and 59 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) [2024-10-14 03:11:33,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:11:33,355 INFO L93 Difference]: Finished difference Result 104 states and 163 transitions. [2024-10-14 03:11:33,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-14 03:11:33,356 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 143 [2024-10-14 03:11:33,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:11:33,358 INFO L225 Difference]: With dead ends: 104 [2024-10-14 03:11:33,358 INFO L226 Difference]: Without dead ends: 65 [2024-10-14 03:11:33,360 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 345 GetRequests, 317 SyntacticMatches, 5 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=182, Invalid=418, Unknown=0, NotChecked=0, Total=600 [2024-10-14 03:11:33,362 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 30 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:11:33,363 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 80 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:11:33,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-10-14 03:11:33,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 59. [2024-10-14 03:11:33,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 39 states have (on average 1.1794871794871795) internal successors, (46), 39 states have internal predecessors, (46), 11 states have call successors, (11), 5 states have call predecessors, (11), 8 states have return successors, (27), 14 states have call predecessors, (27), 11 states have call successors, (27) [2024-10-14 03:11:33,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 84 transitions. [2024-10-14 03:11:33,373 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 84 transitions. Word has length 143 [2024-10-14 03:11:33,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:11:33,374 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 84 transitions. [2024-10-14 03:11:33,374 INFO L472 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) [2024-10-14 03:11:33,374 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 84 transitions. [2024-10-14 03:11:33,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-10-14 03:11:33,376 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:11:33,376 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 16, 9, 9, 9, 9, 9, 9, 9, 7, 3, 1, 1, 1, 1, 1, 1] [2024-10-14 03:11:33,390 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-14 03:11:33,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 03:11:33,581 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:11:33,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:11:33,582 INFO L85 PathProgramCache]: Analyzing trace with hash 1783907871, now seen corresponding path program 3 times [2024-10-14 03:11:33,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:11:33,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040760633] [2024-10-14 03:11:33,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:11:33,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:11:33,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:33,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:11:33,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:33,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:11:33,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:33,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:11:33,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:33,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:11:33,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:33,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:11:33,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:33,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 03:11:33,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:33,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 03:11:33,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:33,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 03:11:33,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:33,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:11:33,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:33,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 03:11:33,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:33,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-14 03:11:33,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:33,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:11:33,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:34,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:11:34,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:34,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:11:34,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:34,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 03:11:34,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:34,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-14 03:11:34,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:34,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 03:11:34,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:34,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:11:34,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:34,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 03:11:34,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:11:34,084 INFO L134 CoverageAnalysis]: Checked inductivity of 948 backedges. 255 proven. 89 refuted. 0 times theorem prover too weak. 604 trivial. 0 not checked. [2024-10-14 03:11:34,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:11:34,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040760633] [2024-10-14 03:11:34,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040760633] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 03:11:34,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1491597296] [2024-10-14 03:11:34,085 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-14 03:11:34,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 03:11:34,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:11:34,086 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) [2024-10-14 03:11:34,087 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-14 03:11:34,138 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2024-10-14 03:11:34,139 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 03:11:34,140 INFO L255 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-14 03:11:34,142 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 03:11:34,237 INFO L134 CoverageAnalysis]: Checked inductivity of 948 backedges. 262 proven. 57 refuted. 0 times theorem prover too weak. 629 trivial. 0 not checked. [2024-10-14 03:11:34,237 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 03:11:35,109 INFO L134 CoverageAnalysis]: Checked inductivity of 948 backedges. 262 proven. 74 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-14 03:11:35,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1491597296] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 03:11:35,110 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 03:11:35,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8, 11] total 18 [2024-10-14 03:11:35,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073336342] [2024-10-14 03:11:35,110 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 03:11:35,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-14 03:11:35,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:11:35,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-14 03:11:35,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=202, Unknown=0, NotChecked=0, Total=306 [2024-10-14 03:11:35,112 INFO L87 Difference]: Start difference. First operand 59 states and 84 transitions. Second operand has 18 states, 18 states have (on average 2.7777777777777777) internal successors, (50), 18 states have internal predecessors, (50), 10 states have call successors, (17), 1 states have call predecessors, (17), 6 states have return successors, (21), 13 states have call predecessors, (21), 10 states have call successors, (21) [2024-10-14 03:11:35,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:11:35,215 INFO L93 Difference]: Finished difference Result 132 states and 222 transitions. [2024-10-14 03:11:35,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-14 03:11:35,215 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), 10 states have call successors, (17), 1 states have call predecessors, (17), 6 states have return successors, (21), 13 states have call predecessors, (21), 10 states have call successors, (21) Word has length 133 [2024-10-14 03:11:35,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:11:35,216 INFO L225 Difference]: With dead ends: 132 [2024-10-14 03:11:35,216 INFO L226 Difference]: Without dead ends: 55 [2024-10-14 03:11:35,217 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 292 SyntacticMatches, 5 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=121, Invalid=221, Unknown=0, NotChecked=0, Total=342 [2024-10-14 03:11:35,218 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 20 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:11:35,218 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 90 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:11:35,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-10-14 03:11:35,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2024-10-14 03:11:35,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 36 states have internal predecessors, (42), 8 states have call successors, (8), 7 states have call predecessors, (8), 7 states have return successors, (15), 11 states have call predecessors, (15), 8 states have call successors, (15) [2024-10-14 03:11:35,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 65 transitions. [2024-10-14 03:11:35,224 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 65 transitions. Word has length 133 [2024-10-14 03:11:35,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:11:35,225 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 65 transitions. [2024-10-14 03:11:35,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.7777777777777777) internal successors, (50), 18 states have internal predecessors, (50), 10 states have call successors, (17), 1 states have call predecessors, (17), 6 states have return successors, (21), 13 states have call predecessors, (21), 10 states have call successors, (21) [2024-10-14 03:11:35,225 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 65 transitions. [2024-10-14 03:11:35,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-14 03:11:35,226 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:11:35,226 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 12, 7, 7, 7, 7, 7, 7, 7, 5, 3, 1, 1, 1, 1, 1, 1] [2024-10-14 03:11:35,247 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-14 03:11:35,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 03:11:35,427 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:11:35,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:11:35,427 INFO L85 PathProgramCache]: Analyzing trace with hash -82417497, now seen corresponding path program 4 times [2024-10-14 03:11:35,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:11:35,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154896741] [2024-10-14 03:11:35,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:11:35,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:11:35,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 03:11:35,437 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 03:11:35,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 03:11:35,457 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-14 03:11:35,458 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-14 03:11:35,459 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-14 03:11:35,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 03:11:35,462 INFO L407 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1] [2024-10-14 03:11:35,484 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 03:11:35,486 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 03:11:35 BoogieIcfgContainer [2024-10-14 03:11:35,486 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 03:11:35,486 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 03:11:35,486 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 03:11:35,487 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 03:11:35,487 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 03:11:29" (3/4) ... [2024-10-14 03:11:35,487 INFO L133 WitnessPrinter]: Generating witness for reachability counterexample [2024-10-14 03:11:35,523 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-14 03:11:35,523 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 03:11:35,524 INFO L158 Benchmark]: Toolchain (without parser) took 7081.13ms. Allocated memory was 243.3MB in the beginning and 323.0MB in the end (delta: 79.7MB). Free memory was 174.5MB in the beginning and 206.8MB in the end (delta: -32.3MB). Peak memory consumption was 49.1MB. Max. memory is 16.1GB. [2024-10-14 03:11:35,524 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 127.9MB. Free memory is still 93.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 03:11:35,524 INFO L158 Benchmark]: CACSL2BoogieTranslator took 325.82ms. Allocated memory is still 243.3MB. Free memory was 174.2MB in the beginning and 163.3MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-14 03:11:35,524 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.94ms. Allocated memory is still 243.3MB. Free memory was 163.0MB in the beginning and 161.9MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 03:11:35,524 INFO L158 Benchmark]: Boogie Preprocessor took 36.03ms. Allocated memory is still 243.3MB. Free memory was 161.6MB in the beginning and 160.2MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 03:11:35,525 INFO L158 Benchmark]: RCFGBuilder took 299.75ms. Allocated memory is still 243.3MB. Free memory was 160.2MB in the beginning and 148.7MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-14 03:11:35,525 INFO L158 Benchmark]: TraceAbstraction took 6311.56ms. Allocated memory was 243.3MB in the beginning and 323.0MB in the end (delta: 79.7MB). Free memory was 148.0MB in the beginning and 209.9MB in the end (delta: -61.9MB). Peak memory consumption was 19.8MB. Max. memory is 16.1GB. [2024-10-14 03:11:35,525 INFO L158 Benchmark]: Witness Printer took 36.97ms. Allocated memory is still 323.0MB. Free memory was 209.9MB in the beginning and 206.8MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 03:11:35,526 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.12ms. Allocated memory is still 127.9MB. Free memory is still 93.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 325.82ms. Allocated memory is still 243.3MB. Free memory was 174.2MB in the beginning and 163.3MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 60.94ms. Allocated memory is still 243.3MB. Free memory was 163.0MB in the beginning and 161.9MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.03ms. Allocated memory is still 243.3MB. Free memory was 161.6MB in the beginning and 160.2MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 299.75ms. Allocated memory is still 243.3MB. Free memory was 160.2MB in the beginning and 148.7MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 6311.56ms. Allocated memory was 243.3MB in the beginning and 323.0MB in the end (delta: 79.7MB). Free memory was 148.0MB in the beginning and 209.9MB in the end (delta: -61.9MB). Peak memory consumption was 19.8MB. Max. memory is 16.1GB. * Witness Printer took 36.97ms. Allocated memory is still 323.0MB. Free memory was 209.9MB in the beginning and 206.8MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * 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] [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] [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] [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] [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] [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] [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] [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] [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) [L35] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 17 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.2s, OverallIterations: 7, TraceHistogramMax: 21, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 134 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 121 mSDsluCounter, 363 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 273 mSDsCounter, 141 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 745 IncrementalHoareTripleChecker+Invalid, 886 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 141 mSolverCounterUnsat, 90 mSDtfsCounter, 745 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 894 GetRequests, 797 SyntacticMatches, 13 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 357 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=59occurred in iteration=5, InterpolantAutomatonStates: 65, 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, 13 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 4.0s InterpolantComputationTime, 848 NumberOfCodeBlocks, 800 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 1091 ConstructedInterpolants, 0 QuantifiedInterpolants, 1873 SizeOfPredicates, 9 NumberOfNonLiveVariables, 788 ConjunctsInSsa, 34 ConjunctsInUnsatCore, 14 InterpolantComputations, 2 PerfectInterpolantSequences, 5567/6780 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! [2024-10-14 03:11:35,547 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE