./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive-simple/fibo_2calls_5-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 803cd42f 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 ../sv-benchmarks/c/recursive-simple/fibo_2calls_5-2.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 eb57cc67b4a5d1052a722feccb00a81098424cf4bc0bbd7bfe756405ab740d43 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 02:09:51,424 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 02:09:51,505 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-22 02:09:51,510 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 02:09:51,511 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 02:09:51,531 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 02:09:51,533 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 02:09:51,533 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 02:09:51,534 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 02:09:51,534 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 02:09:51,534 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 02:09:51,534 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 02:09:51,534 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 02:09:51,535 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 02:09:51,535 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 02:09:51,536 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 02:09:51,537 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-22 02:09:51,539 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 02:09:51,539 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-22 02:09:51,539 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 02:09:51,539 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 02:09:51,540 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-22 02:09:51,541 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 02:09:51,541 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-22 02:09:51,542 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 02:09:51,542 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 02:09:51,542 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-22 02:09:51,542 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 02:09:51,542 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 02:09:51,542 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 02:09:51,543 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 02:09:51,543 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 02:09:51,543 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 02:09:51,543 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 02:09:51,543 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 02:09:51,543 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-22 02:09:51,543 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-22 02:09:51,543 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-22 02:09:51,544 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 02:09:51,544 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 02:09:51,544 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 02:09:51,545 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 02:09:51,545 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 -> eb57cc67b4a5d1052a722feccb00a81098424cf4bc0bbd7bfe756405ab740d43 [2024-11-22 02:09:51,741 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 02:09:51,758 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 02:09:51,760 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 02:09:51,761 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 02:09:51,762 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 02:09:51,762 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive-simple/fibo_2calls_5-2.c [2024-11-22 02:09:53,033 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 02:09:53,180 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 02:09:53,180 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_2calls_5-2.c [2024-11-22 02:09:53,186 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/74026f678/0a06e99ed495486a99bb1785863011d7/FLAG7fa869a02 [2024-11-22 02:09:53,201 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/74026f678/0a06e99ed495486a99bb1785863011d7 [2024-11-22 02:09:53,203 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 02:09:53,205 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 02:09:53,211 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 02:09:53,211 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 02:09:53,216 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 02:09:53,217 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 02:09:53" (1/1) ... [2024-11-22 02:09:53,219 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b5da149 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:09:53, skipping insertion in model container [2024-11-22 02:09:53,219 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 02:09:53" (1/1) ... [2024-11-22 02:09:53,235 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 02:09:53,384 WARN L250 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-simple/fibo_2calls_5-2.c[946,959] [2024-11-22 02:09:53,388 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 02:09:53,399 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 02:09:53,425 WARN L250 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-simple/fibo_2calls_5-2.c[946,959] [2024-11-22 02:09:53,426 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 02:09:53,447 INFO L204 MainTranslator]: Completed translation [2024-11-22 02:09:53,451 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:09:53 WrapperNode [2024-11-22 02:09:53,451 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 02:09:53,452 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 02:09:53,452 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 02:09:53,452 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 02:09:53,458 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:09:53" (1/1) ... [2024-11-22 02:09:53,488 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:09:53" (1/1) ... [2024-11-22 02:09:53,506 INFO L138 Inliner]: procedures = 14, calls = 12, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 20 [2024-11-22 02:09:53,506 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 02:09:53,507 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 02:09:53,507 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 02:09:53,507 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 02:09:53,517 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:09:53" (1/1) ... [2024-11-22 02:09:53,517 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:09:53" (1/1) ... [2024-11-22 02:09:53,523 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:09:53" (1/1) ... [2024-11-22 02:09:53,535 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-11-22 02:09:53,537 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:09:53" (1/1) ... [2024-11-22 02:09:53,537 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:09:53" (1/1) ... [2024-11-22 02:09:53,543 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:09:53" (1/1) ... [2024-11-22 02:09:53,544 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:09:53" (1/1) ... [2024-11-22 02:09:53,549 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:09:53" (1/1) ... [2024-11-22 02:09:53,550 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:09:53" (1/1) ... [2024-11-22 02:09:53,555 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 02:09:53,556 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 02:09:53,556 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 02:09:53,557 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 02:09:53,558 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:09:53" (1/1) ... [2024-11-22 02:09:53,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 02:09:53,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 02:09:53,587 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-11-22 02:09:53,589 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-11-22 02:09:53,623 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 02:09:53,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-22 02:09:53,624 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2024-11-22 02:09:53,624 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2024-11-22 02:09:53,624 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2024-11-22 02:09:53,624 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2024-11-22 02:09:53,624 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 02:09:53,625 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 02:09:53,668 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 02:09:53,669 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 02:09:53,766 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-22 02:09:53,766 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 02:09:53,775 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 02:09:53,776 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-22 02:09:53,777 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 02:09:53 BoogieIcfgContainer [2024-11-22 02:09:53,777 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 02:09:53,779 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 02:09:53,779 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 02:09:53,781 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 02:09:53,781 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 02:09:53" (1/3) ... [2024-11-22 02:09:53,782 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@488a4a96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 02:09:53, skipping insertion in model container [2024-11-22 02:09:53,782 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:09:53" (2/3) ... [2024-11-22 02:09:53,782 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@488a4a96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 02:09:53, skipping insertion in model container [2024-11-22 02:09:53,783 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 02:09:53" (3/3) ... [2024-11-22 02:09:53,783 INFO L112 eAbstractionObserver]: Analyzing ICFG fibo_2calls_5-2.c [2024-11-22 02:09:53,794 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 02:09:53,795 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-22 02:09:53,831 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 02:09:53,836 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;@29371d5f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 02:09:53,837 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-22 02:09:53,839 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-22 02:09:53,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-22 02:09:53,844 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 02:09:53,845 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 02:09:53,845 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 02:09:53,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 02:09:53,849 INFO L85 PathProgramCache]: Analyzing trace with hash 1123300790, now seen corresponding path program 1 times [2024-11-22 02:09:53,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 02:09:53,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353281782] [2024-11-22 02:09:53,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 02:09:53,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 02:09:53,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 02:09:54,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 02:09:54,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 02:09:54,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353281782] [2024-11-22 02:09:54,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353281782] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 02:09:54,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 02:09:54,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 02:09:54,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912064691] [2024-11-22 02:09:54,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 02:09:54,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 02:09:54,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 02:09:54,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 02:09:54,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 02:09:54,111 INFO L87 Difference]: Start difference. First operand has 29 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 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-11-22 02:09:54,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 02:09:54,149 INFO L93 Difference]: Finished difference Result 39 states and 48 transitions. [2024-11-22 02:09:54,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 02:09:54,151 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 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-11-22 02:09:54,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 02:09:54,157 INFO L225 Difference]: With dead ends: 39 [2024-11-22 02:09:54,157 INFO L226 Difference]: Without dead ends: 27 [2024-11-22 02:09:54,159 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-11-22 02:09:54,162 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 0 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 02:09:54,162 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 124 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 02:09:54,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-11-22 02:09:54,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-11-22 02:09:54,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2024-11-22 02:09:54,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2024-11-22 02:09:54,197 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 34 transitions. Word has length 10 [2024-11-22 02:09:54,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 02:09:54,197 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 34 transitions. [2024-11-22 02:09:54,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 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-11-22 02:09:54,198 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 34 transitions. [2024-11-22 02:09:54,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-22 02:09:54,199 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 02:09:54,199 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 02:09:54,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-22 02:09:54,200 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 02:09:54,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 02:09:54,201 INFO L85 PathProgramCache]: Analyzing trace with hash 1177745932, now seen corresponding path program 1 times [2024-11-22 02:09:54,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 02:09:54,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018514644] [2024-11-22 02:09:54,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 02:09:54,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 02:09:54,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 02:09:54,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 02:09:54,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 02:09:54,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018514644] [2024-11-22 02:09:54,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018514644] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 02:09:54,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 02:09:54,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 02:09:54,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613277260] [2024-11-22 02:09:54,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 02:09:54,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 02:09:54,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 02:09:54,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 02:09:54,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 02:09:54,302 INFO L87 Difference]: Start difference. First operand 27 states and 34 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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-11-22 02:09:54,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 02:09:54,320 INFO L93 Difference]: Finished difference Result 33 states and 41 transitions. [2024-11-22 02:09:54,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 02:09:54,321 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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 11 [2024-11-22 02:09:54,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 02:09:54,322 INFO L225 Difference]: With dead ends: 33 [2024-11-22 02:09:54,322 INFO L226 Difference]: Without dead ends: 29 [2024-11-22 02:09:54,322 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-11-22 02:09:54,323 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 0 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 02:09:54,324 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 125 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 02:09:54,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-11-22 02:09:54,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2024-11-22 02:09:54,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2024-11-22 02:09:54,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2024-11-22 02:09:54,332 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 34 transitions. Word has length 11 [2024-11-22 02:09:54,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 02:09:54,332 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 34 transitions. [2024-11-22 02:09:54,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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-11-22 02:09:54,333 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 34 transitions. [2024-11-22 02:09:54,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-22 02:09:54,335 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 02:09:54,335 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 02:09:54,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-22 02:09:54,336 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 02:09:54,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 02:09:54,337 INFO L85 PathProgramCache]: Analyzing trace with hash 2110588723, now seen corresponding path program 1 times [2024-11-22 02:09:54,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 02:09:54,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264500952] [2024-11-22 02:09:54,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 02:09:54,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 02:09:54,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 02:09:54,462 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-22 02:09:54,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 02:09:54,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264500952] [2024-11-22 02:09:54,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264500952] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 02:09:54,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1237827773] [2024-11-22 02:09:54,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 02:09:54,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 02:09:54,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 02:09:54,466 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-11-22 02:09:54,467 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-11-22 02:09:54,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 02:09:54,515 INFO L255 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-22 02:09:54,521 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 02:09:54,606 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-22 02:09:54,607 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 02:09:54,850 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-22 02:09:54,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1237827773] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 02:09:54,851 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 02:09:54,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 12 [2024-11-22 02:09:54,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840078772] [2024-11-22 02:09:54,851 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 02:09:54,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-22 02:09:54,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 02:09:54,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-22 02:09:54,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-11-22 02:09:54,852 INFO L87 Difference]: Start difference. First operand 27 states and 34 transitions. Second operand has 12 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 12 states have internal predecessors, (30), 8 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-22 02:09:54,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 02:09:54,980 INFO L93 Difference]: Finished difference Result 55 states and 75 transitions. [2024-11-22 02:09:54,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-22 02:09:54,981 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 12 states have internal predecessors, (30), 8 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 8 states have call successors, (8) Word has length 23 [2024-11-22 02:09:54,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 02:09:54,981 INFO L225 Difference]: With dead ends: 55 [2024-11-22 02:09:54,982 INFO L226 Difference]: Without dead ends: 31 [2024-11-22 02:09:54,982 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2024-11-22 02:09:54,983 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 22 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 02:09:54,983 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 105 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 02:09:54,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-11-22 02:09:54,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2024-11-22 02:09:54,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 21 states have internal predecessors, (23), 5 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2024-11-22 02:09:54,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2024-11-22 02:09:54,990 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 36 transitions. Word has length 23 [2024-11-22 02:09:54,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 02:09:54,991 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 36 transitions. [2024-11-22 02:09:54,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 12 states have internal predecessors, (30), 8 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-22 02:09:54,992 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2024-11-22 02:09:54,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-22 02:09:54,993 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 02:09:54,993 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 02:09:55,001 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-22 02:09:55,193 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-11-22 02:09:55,194 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 02:09:55,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 02:09:55,194 INFO L85 PathProgramCache]: Analyzing trace with hash 1277869167, now seen corresponding path program 1 times [2024-11-22 02:09:55,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 02:09:55,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931345382] [2024-11-22 02:09:55,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 02:09:55,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 02:09:55,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 02:09:55,266 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-22 02:09:55,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 02:09:55,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931345382] [2024-11-22 02:09:55,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931345382] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 02:09:55,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [907657] [2024-11-22 02:09:55,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 02:09:55,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 02:09:55,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 02:09:55,270 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-11-22 02:09:55,271 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-11-22 02:09:55,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 02:09:55,309 INFO L255 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-22 02:09:55,310 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 02:09:55,341 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-22 02:09:55,341 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 02:09:55,470 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-22 02:09:55,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [907657] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 02:09:55,470 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 02:09:55,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 10 [2024-11-22 02:09:55,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572400916] [2024-11-22 02:09:55,471 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 02:09:55,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-22 02:09:55,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 02:09:55,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-22 02:09:55,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-11-22 02:09:55,472 INFO L87 Difference]: Start difference. First operand 29 states and 36 transitions. Second operand has 10 states, 8 states have (on average 3.125) internal successors, (25), 10 states have internal predecessors, (25), 5 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-22 02:09:55,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 02:09:55,572 INFO L93 Difference]: Finished difference Result 40 states and 52 transitions. [2024-11-22 02:09:55,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-22 02:09:55,573 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 3.125) internal successors, (25), 10 states have internal predecessors, (25), 5 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 5 states have call successors, (5) Word has length 24 [2024-11-22 02:09:55,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 02:09:55,574 INFO L225 Difference]: With dead ends: 40 [2024-11-22 02:09:55,574 INFO L226 Difference]: Without dead ends: 36 [2024-11-22 02:09:55,576 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-22 02:09:55,577 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 13 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 02:09:55,577 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 135 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 02:09:55,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-11-22 02:09:55,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34. [2024-11-22 02:09:55,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 6 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (13), 7 states have call predecessors, (13), 6 states have call successors, (13) [2024-11-22 02:09:55,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 45 transitions. [2024-11-22 02:09:55,589 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 45 transitions. Word has length 24 [2024-11-22 02:09:55,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 02:09:55,589 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 45 transitions. [2024-11-22 02:09:55,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 3.125) internal successors, (25), 10 states have internal predecessors, (25), 5 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-22 02:09:55,589 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 45 transitions. [2024-11-22 02:09:55,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-22 02:09:55,590 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 02:09:55,590 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 02:09:55,597 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-11-22 02:09:55,791 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-11-22 02:09:55,791 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 02:09:55,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 02:09:55,792 INFO L85 PathProgramCache]: Analyzing trace with hash -2061621832, now seen corresponding path program 1 times [2024-11-22 02:09:55,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 02:09:55,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454848031] [2024-11-22 02:09:55,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 02:09:55,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 02:09:55,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 02:09:55,872 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-22 02:09:55,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 02:09:55,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454848031] [2024-11-22 02:09:55,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454848031] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 02:09:55,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [867419000] [2024-11-22 02:09:55,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 02:09:55,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 02:09:55,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 02:09:55,876 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-11-22 02:09:55,877 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-11-22 02:09:55,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 02:09:55,916 INFO L255 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-22 02:09:55,918 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 02:09:55,995 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-22 02:09:55,995 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 02:09:56,280 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-22 02:09:56,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [867419000] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 02:09:56,281 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 02:09:56,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 9] total 14 [2024-11-22 02:09:56,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804795834] [2024-11-22 02:09:56,281 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 02:09:56,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-22 02:09:56,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 02:09:56,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-22 02:09:56,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2024-11-22 02:09:56,283 INFO L87 Difference]: Start difference. First operand 34 states and 45 transitions. Second operand has 14 states, 11 states have (on average 4.090909090909091) internal successors, (45), 14 states have internal predecessors, (45), 11 states have call successors, (13), 1 states have call predecessors, (13), 5 states have return successors, (13), 3 states have call predecessors, (13), 11 states have call successors, (13) [2024-11-22 02:09:56,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 02:09:56,404 INFO L93 Difference]: Finished difference Result 69 states and 100 transitions. [2024-11-22 02:09:56,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-22 02:09:56,405 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 11 states have (on average 4.090909090909091) internal successors, (45), 14 states have internal predecessors, (45), 11 states have call successors, (13), 1 states have call predecessors, (13), 5 states have return successors, (13), 3 states have call predecessors, (13), 11 states have call successors, (13) Word has length 36 [2024-11-22 02:09:56,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 02:09:56,407 INFO L225 Difference]: With dead ends: 69 [2024-11-22 02:09:56,407 INFO L226 Difference]: Without dead ends: 38 [2024-11-22 02:09:56,407 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 64 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2024-11-22 02:09:56,408 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 18 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 02:09:56,408 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 146 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 02:09:56,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-11-22 02:09:56,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 36. [2024-11-22 02:09:56,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 23 states have (on average 1.173913043478261) internal successors, (27), 26 states have internal predecessors, (27), 6 states have call successors, (6), 2 states have call predecessors, (6), 6 states have return successors, (14), 7 states have call predecessors, (14), 6 states have call successors, (14) [2024-11-22 02:09:56,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 47 transitions. [2024-11-22 02:09:56,415 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 47 transitions. Word has length 36 [2024-11-22 02:09:56,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 02:09:56,418 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 47 transitions. [2024-11-22 02:09:56,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 11 states have (on average 4.090909090909091) internal successors, (45), 14 states have internal predecessors, (45), 11 states have call successors, (13), 1 states have call predecessors, (13), 5 states have return successors, (13), 3 states have call predecessors, (13), 11 states have call successors, (13) [2024-11-22 02:09:56,418 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 47 transitions. [2024-11-22 02:09:56,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-22 02:09:56,420 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 02:09:56,421 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 02:09:56,427 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-22 02:09:56,621 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-11-22 02:09:56,622 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 02:09:56,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 02:09:56,622 INFO L85 PathProgramCache]: Analyzing trace with hash 1167294498, now seen corresponding path program 1 times [2024-11-22 02:09:56,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 02:09:56,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333288488] [2024-11-22 02:09:56,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 02:09:56,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 02:09:56,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 02:09:56,739 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-22 02:09:56,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 02:09:56,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333288488] [2024-11-22 02:09:56,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333288488] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 02:09:56,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [379558932] [2024-11-22 02:09:56,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 02:09:56,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 02:09:56,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 02:09:56,744 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-11-22 02:09:56,746 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-11-22 02:09:56,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 02:09:56,779 INFO L255 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-22 02:09:56,781 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 02:09:56,841 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-22 02:09:56,841 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 02:09:57,108 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-22 02:09:57,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [379558932] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 02:09:57,109 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 02:09:57,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 18 [2024-11-22 02:09:57,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829027883] [2024-11-22 02:09:57,109 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 02:09:57,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-22 02:09:57,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 02:09:57,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-22 02:09:57,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2024-11-22 02:09:57,111 INFO L87 Difference]: Start difference. First operand 36 states and 47 transitions. Second operand has 18 states, 16 states have (on average 3.125) internal successors, (50), 18 states have internal predecessors, (50), 11 states have call successors, (13), 1 states have call predecessors, (13), 7 states have return successors, (13), 6 states have call predecessors, (13), 11 states have call successors, (13) [2024-11-22 02:09:57,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 02:09:57,465 INFO L93 Difference]: Finished difference Result 101 states and 161 transitions. [2024-11-22 02:09:57,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-22 02:09:57,465 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 3.125) internal successors, (50), 18 states have internal predecessors, (50), 11 states have call successors, (13), 1 states have call predecessors, (13), 7 states have return successors, (13), 6 states have call predecessors, (13), 11 states have call successors, (13) Word has length 37 [2024-11-22 02:09:57,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 02:09:57,467 INFO L225 Difference]: With dead ends: 101 [2024-11-22 02:09:57,467 INFO L226 Difference]: Without dead ends: 68 [2024-11-22 02:09:57,468 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 69 SyntacticMatches, 3 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=124, Invalid=578, Unknown=0, NotChecked=0, Total=702 [2024-11-22 02:09:57,468 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 39 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 396 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 02:09:57,468 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 300 Invalid, 442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 396 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-22 02:09:57,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-11-22 02:09:57,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 56. [2024-11-22 02:09:57,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 39 states have internal predecessors, (41), 11 states have call successors, (11), 3 states have call predecessors, (11), 9 states have return successors, (34), 13 states have call predecessors, (34), 11 states have call successors, (34) [2024-11-22 02:09:57,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 86 transitions. [2024-11-22 02:09:57,478 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 86 transitions. Word has length 37 [2024-11-22 02:09:57,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 02:09:57,479 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 86 transitions. [2024-11-22 02:09:57,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 3.125) internal successors, (50), 18 states have internal predecessors, (50), 11 states have call successors, (13), 1 states have call predecessors, (13), 7 states have return successors, (13), 6 states have call predecessors, (13), 11 states have call successors, (13) [2024-11-22 02:09:57,479 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 86 transitions. [2024-11-22 02:09:57,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-22 02:09:57,480 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 02:09:57,481 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 02:09:57,488 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-22 02:09:57,684 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-11-22 02:09:57,685 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 02:09:57,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 02:09:57,685 INFO L85 PathProgramCache]: Analyzing trace with hash 384535367, now seen corresponding path program 1 times [2024-11-22 02:09:57,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 02:09:57,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690438765] [2024-11-22 02:09:57,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 02:09:57,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 02:09:57,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 02:09:57,802 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-22 02:09:57,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 02:09:57,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690438765] [2024-11-22 02:09:57,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690438765] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 02:09:57,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [578185195] [2024-11-22 02:09:57,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 02:09:57,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 02:09:57,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 02:09:57,806 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 02:09:57,807 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-22 02:09:57,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 02:09:57,847 INFO L255 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-22 02:09:57,848 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 02:09:57,906 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-22 02:09:57,906 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 02:09:58,305 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 28 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-22 02:09:58,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [578185195] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 02:09:58,305 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 02:09:58,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 11] total 16 [2024-11-22 02:09:58,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107499926] [2024-11-22 02:09:58,305 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 02:09:58,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-22 02:09:58,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 02:09:58,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-22 02:09:58,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2024-11-22 02:09:58,309 INFO L87 Difference]: Start difference. First operand 56 states and 86 transitions. Second operand has 16 states, 15 states have (on average 3.6) internal successors, (54), 16 states have internal predecessors, (54), 11 states have call successors, (13), 1 states have call predecessors, (13), 8 states have return successors, (17), 8 states have call predecessors, (17), 11 states have call successors, (17) [2024-11-22 02:09:58,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 02:09:58,466 INFO L93 Difference]: Finished difference Result 102 states and 193 transitions. [2024-11-22 02:09:58,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-22 02:09:58,466 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.6) internal successors, (54), 16 states have internal predecessors, (54), 11 states have call successors, (13), 1 states have call predecessors, (13), 8 states have return successors, (17), 8 states have call predecessors, (17), 11 states have call successors, (17) Word has length 51 [2024-11-22 02:09:58,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 02:09:58,468 INFO L225 Difference]: With dead ends: 102 [2024-11-22 02:09:58,468 INFO L226 Difference]: Without dead ends: 98 [2024-11-22 02:09:58,469 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 92 SyntacticMatches, 5 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=330, Unknown=0, NotChecked=0, Total=420 [2024-11-22 02:09:58,469 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 32 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 02:09:58,469 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 121 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 02:09:58,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-22 02:09:58,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 64. [2024-11-22 02:09:58,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 40 states have (on average 1.15) internal successors, (46), 44 states have internal predecessors, (46), 12 states have call successors, (12), 3 states have call predecessors, (12), 11 states have return successors, (48), 16 states have call predecessors, (48), 12 states have call successors, (48) [2024-11-22 02:09:58,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 106 transitions. [2024-11-22 02:09:58,485 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 106 transitions. Word has length 51 [2024-11-22 02:09:58,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 02:09:58,486 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 106 transitions. [2024-11-22 02:09:58,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.6) internal successors, (54), 16 states have internal predecessors, (54), 11 states have call successors, (13), 1 states have call predecessors, (13), 8 states have return successors, (17), 8 states have call predecessors, (17), 11 states have call successors, (17) [2024-11-22 02:09:58,486 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 106 transitions. [2024-11-22 02:09:58,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-22 02:09:58,488 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 02:09:58,488 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 6, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 02:09:58,496 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-22 02:09:58,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 02:09:58,689 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 02:09:58,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 02:09:58,690 INFO L85 PathProgramCache]: Analyzing trace with hash -586612948, now seen corresponding path program 1 times [2024-11-22 02:09:58,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 02:09:58,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216059575] [2024-11-22 02:09:58,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 02:09:58,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 02:09:58,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 02:09:58,798 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 32 proven. 43 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2024-11-22 02:09:58,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 02:09:58,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216059575] [2024-11-22 02:09:58,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216059575] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 02:09:58,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1273334441] [2024-11-22 02:09:58,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 02:09:58,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 02:09:58,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 02:09:58,803 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 02:09:58,804 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-22 02:09:58,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 02:09:58,858 INFO L255 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-22 02:09:58,859 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 02:09:58,888 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 32 proven. 43 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2024-11-22 02:09:58,889 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 02:09:59,168 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 32 proven. 45 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2024-11-22 02:09:59,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1273334441] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 02:09:59,168 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 02:09:59,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 9] total 11 [2024-11-22 02:09:59,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53856203] [2024-11-22 02:09:59,169 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 02:09:59,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-22 02:09:59,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 02:09:59,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-22 02:09:59,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-22 02:09:59,170 INFO L87 Difference]: Start difference. First operand 64 states and 106 transitions. Second operand has 11 states, 10 states have (on average 4.5) internal successors, (45), 11 states have internal predecessors, (45), 7 states have call successors, (12), 1 states have call predecessors, (12), 4 states have return successors, (12), 6 states have call predecessors, (12), 7 states have call successors, (12) [2024-11-22 02:09:59,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 02:09:59,266 INFO L93 Difference]: Finished difference Result 89 states and 165 transitions. [2024-11-22 02:09:59,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-22 02:09:59,266 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.5) internal successors, (45), 11 states have internal predecessors, (45), 7 states have call successors, (12), 1 states have call predecessors, (12), 4 states have return successors, (12), 6 states have call predecessors, (12), 7 states have call successors, (12) Word has length 93 [2024-11-22 02:09:59,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 02:09:59,268 INFO L225 Difference]: With dead ends: 89 [2024-11-22 02:09:59,268 INFO L226 Difference]: Without dead ends: 85 [2024-11-22 02:09:59,268 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 180 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2024-11-22 02:09:59,269 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 14 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 02:09:59,269 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 134 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 02:09:59,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-11-22 02:09:59,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 64. [2024-11-22 02:09:59,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 40 states have (on average 1.15) internal successors, (46), 44 states have internal predecessors, (46), 12 states have call successors, (12), 3 states have call predecessors, (12), 11 states have return successors, (48), 16 states have call predecessors, (48), 12 states have call successors, (48) [2024-11-22 02:09:59,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 106 transitions. [2024-11-22 02:09:59,280 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 106 transitions. Word has length 93 [2024-11-22 02:09:59,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 02:09:59,280 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 106 transitions. [2024-11-22 02:09:59,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.5) internal successors, (45), 11 states have internal predecessors, (45), 7 states have call successors, (12), 1 states have call predecessors, (12), 4 states have return successors, (12), 6 states have call predecessors, (12), 7 states have call successors, (12) [2024-11-22 02:09:59,281 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 106 transitions. [2024-11-22 02:09:59,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-22 02:09:59,282 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 02:09:59,282 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 8, 8, 8, 8, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 02:09:59,288 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-22 02:09:59,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 02:09:59,483 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 02:09:59,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 02:09:59,483 INFO L85 PathProgramCache]: Analyzing trace with hash -1125346623, now seen corresponding path program 1 times [2024-11-22 02:09:59,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 02:09:59,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656689665] [2024-11-22 02:09:59,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 02:09:59,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 02:09:59,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 02:09:59,658 INFO L134 CoverageAnalysis]: Checked inductivity of 452 backedges. 73 proven. 94 refuted. 0 times theorem prover too weak. 285 trivial. 0 not checked. [2024-11-22 02:09:59,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 02:09:59,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656689665] [2024-11-22 02:09:59,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656689665] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 02:09:59,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1098803879] [2024-11-22 02:09:59,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 02:09:59,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 02:09:59,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 02:09:59,660 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 02:09:59,662 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-22 02:09:59,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 02:09:59,717 INFO L255 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-22 02:09:59,719 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 02:09:59,771 INFO L134 CoverageAnalysis]: Checked inductivity of 452 backedges. 81 proven. 110 refuted. 0 times theorem prover too weak. 261 trivial. 0 not checked. [2024-11-22 02:09:59,771 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 02:10:00,464 INFO L134 CoverageAnalysis]: Checked inductivity of 452 backedges. 81 proven. 118 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2024-11-22 02:10:00,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1098803879] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 02:10:00,465 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 02:10:00,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 13] total 18 [2024-11-22 02:10:00,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55359784] [2024-11-22 02:10:00,465 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 02:10:00,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-22 02:10:00,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 02:10:00,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-22 02:10:00,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2024-11-22 02:10:00,467 INFO L87 Difference]: Start difference. First operand 64 states and 106 transitions. Second operand has 18 states, 17 states have (on average 3.5294117647058822) internal successors, (60), 18 states have internal predecessors, (60), 12 states have call successors, (18), 1 states have call predecessors, (18), 6 states have return successors, (20), 9 states have call predecessors, (20), 12 states have call successors, (20) [2024-11-22 02:10:00,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 02:10:00,622 INFO L93 Difference]: Finished difference Result 109 states and 216 transitions. [2024-11-22 02:10:00,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-22 02:10:00,623 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 3.5294117647058822) internal successors, (60), 18 states have internal predecessors, (60), 12 states have call successors, (18), 1 states have call predecessors, (18), 6 states have return successors, (20), 9 states have call predecessors, (20), 12 states have call successors, (20) Word has length 134 [2024-11-22 02:10:00,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 02:10:00,624 INFO L225 Difference]: With dead ends: 109 [2024-11-22 02:10:00,624 INFO L226 Difference]: Without dead ends: 67 [2024-11-22 02:10:00,625 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 284 GetRequests, 257 SyntacticMatches, 6 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=109, Invalid=397, Unknown=0, NotChecked=0, Total=506 [2024-11-22 02:10:00,627 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 22 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 02:10:00,627 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 248 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 02:10:00,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-11-22 02:10:00,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2024-11-22 02:10:00,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 43 states have (on average 1.1395348837209303) internal successors, (49), 46 states have internal predecessors, (49), 11 states have call successors, (11), 4 states have call predecessors, (11), 12 states have return successors, (35), 16 states have call predecessors, (35), 11 states have call successors, (35) [2024-11-22 02:10:00,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 95 transitions. [2024-11-22 02:10:00,638 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 95 transitions. Word has length 134 [2024-11-22 02:10:00,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 02:10:00,639 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 95 transitions. [2024-11-22 02:10:00,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 3.5294117647058822) internal successors, (60), 18 states have internal predecessors, (60), 12 states have call successors, (18), 1 states have call predecessors, (18), 6 states have return successors, (20), 9 states have call predecessors, (20), 12 states have call successors, (20) [2024-11-22 02:10:00,639 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 95 transitions. [2024-11-22 02:10:00,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-22 02:10:00,640 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 02:10:00,640 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 7, 7, 6, 6, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 02:10:00,648 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-22 02:10:00,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 02:10:00,841 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 02:10:00,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 02:10:00,841 INFO L85 PathProgramCache]: Analyzing trace with hash 2118534433, now seen corresponding path program 2 times [2024-11-22 02:10:00,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 02:10:00,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622357293] [2024-11-22 02:10:00,841 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 02:10:00,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 02:10:00,855 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-22 02:10:00,855 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-22 02:10:00,855 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-22 02:10:00,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-22 02:10:00,881 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-22 02:10:00,881 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-22 02:10:00,883 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-22 02:10:00,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-22 02:10:00,886 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 02:10:00,917 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-22 02:10:00,919 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 02:10:00 BoogieIcfgContainer [2024-11-22 02:10:00,920 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-22 02:10:00,920 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-22 02:10:00,920 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-22 02:10:00,921 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-22 02:10:00,921 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 02:09:53" (3/4) ... [2024-11-22 02:10:00,922 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-22 02:10:00,967 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-22 02:10:00,967 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-22 02:10:00,968 INFO L158 Benchmark]: Toolchain (without parser) took 7763.09ms. Allocated memory was 157.3MB in the beginning and 213.9MB in the end (delta: 56.6MB). Free memory was 102.2MB in the beginning and 83.8MB in the end (delta: 18.4MB). Peak memory consumption was 75.0MB. Max. memory is 16.1GB. [2024-11-22 02:10:00,968 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 96.5MB. Free memory is still 51.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 02:10:00,968 INFO L158 Benchmark]: CACSL2BoogieTranslator took 240.36ms. Allocated memory is still 157.3MB. Free memory was 101.7MB in the beginning and 130.1MB in the end (delta: -28.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-22 02:10:00,968 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.55ms. Allocated memory is still 157.3MB. Free memory was 130.1MB in the beginning and 128.2MB in the end (delta: 1.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-22 02:10:00,968 INFO L158 Benchmark]: Boogie Preprocessor took 47.75ms. Allocated memory is still 157.3MB. Free memory was 128.2MB in the beginning and 127.0MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 02:10:00,968 INFO L158 Benchmark]: RCFGBuilder took 221.37ms. Allocated memory is still 157.3MB. Free memory was 127.0MB in the beginning and 115.7MB in the end (delta: 11.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-22 02:10:00,969 INFO L158 Benchmark]: TraceAbstraction took 7141.22ms. Allocated memory was 157.3MB in the beginning and 213.9MB in the end (delta: 56.6MB). Free memory was 115.7MB in the beginning and 86.9MB in the end (delta: 28.7MB). Peak memory consumption was 88.2MB. Max. memory is 16.1GB. [2024-11-22 02:10:00,969 INFO L158 Benchmark]: Witness Printer took 46.96ms. Allocated memory is still 213.9MB. Free memory was 86.9MB in the beginning and 83.8MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-22 02:10:00,971 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.13ms. Allocated memory is still 96.5MB. Free memory is still 51.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 240.36ms. Allocated memory is still 157.3MB. Free memory was 101.7MB in the beginning and 130.1MB in the end (delta: -28.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.55ms. Allocated memory is still 157.3MB. Free memory was 130.1MB in the beginning and 128.2MB in the end (delta: 1.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 47.75ms. Allocated memory is still 157.3MB. Free memory was 128.2MB in the beginning and 127.0MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 221.37ms. Allocated memory is still 157.3MB. Free memory was 127.0MB in the beginning and 115.7MB in the end (delta: 11.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 7141.22ms. Allocated memory was 157.3MB in the beginning and 213.9MB in the end (delta: 56.6MB). Free memory was 115.7MB in the beginning and 86.9MB in the end (delta: 28.7MB). Peak memory consumption was 88.2MB. Max. memory is 16.1GB. * Witness Printer took 46.96ms. Allocated memory is still 213.9MB. Free memory was 86.9MB in the beginning and 83.8MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. 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: 41]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L38] int x = 5; VAL [x=5] [L39] CALL, EXPR fibo1(x) VAL [\old(n)=5] [L10] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L12] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=4] [L20] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L22] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L10] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L12] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=4, n=4] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=4, n=4] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=5, n=5] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=3] [L20] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L22] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=5, n=5] [L15] return fibo2(n-1) + fibo2(n-2); [L39] RET, EXPR fibo1(x) VAL [x=5] [L39] int result = fibo1(x); [L40] COND TRUE result == 5 VAL [x=5] [L41] reach_error() VAL [x=5] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 29 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.1s, OverallIterations: 10, TraceHistogramMax: 11, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 204 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 160 mSDsluCounter, 1438 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1199 mSDsCounter, 151 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1300 IncrementalHoareTripleChecker+Invalid, 1451 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 151 mSolverCounterUnsat, 239 mSDtfsCounter, 1300 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 891 GetRequests, 748 SyntacticMatches, 25 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 380 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=67occurred in iteration=9, InterpolantAutomatonStates: 88, 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, 9 MinimizatonAttempts, 75 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.6s InterpolantComputationTime, 923 NumberOfCodeBlocks, 923 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 1192 ConstructedInterpolants, 0 QuantifiedInterpolants, 2336 SizeOfPredicates, 16 NumberOfNonLiveVariables, 1022 ConjunctsInSsa, 58 ConjunctsInUnsatCore, 23 InterpolantComputations, 2 PerfectInterpolantSequences, 1609/2190 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-11-22 02:10:00,990 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