./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_2calls_6-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_2calls_6-2.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 31de98bafea1eb3233157f378400eba30060b6561e9e0a6257ecfebe8e53877a --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 03:04:22,309 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 03:04:22,367 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 03:04:22,373 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 03:04:22,374 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 03:04:22,400 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 03:04:22,402 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 03:04:22,402 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 03:04:22,402 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 03:04:22,403 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 03:04:22,404 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 03:04:22,404 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 03:04:22,404 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 03:04:22,405 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 03:04:22,405 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 03:04:22,407 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 03:04:22,407 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 03:04:22,407 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 03:04:22,407 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 03:04:22,408 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 03:04:22,408 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 03:04:22,408 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 03:04:22,412 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 03:04:22,412 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 03:04:22,413 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 03:04:22,413 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 03:04:22,413 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 03:04:22,413 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 03:04:22,413 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 03:04:22,414 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 03:04:22,414 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 03:04:22,414 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 03:04:22,414 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 03:04:22,414 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 03:04:22,414 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 03:04:22,414 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 03:04:22,415 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 03:04:22,415 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 03:04:22,415 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 03:04:22,415 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 03:04:22,415 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 03:04:22,416 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 03:04:22,416 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-clean/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-clean/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 -> 31de98bafea1eb3233157f378400eba30060b6561e9e0a6257ecfebe8e53877a [2024-10-11 03:04:22,628 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 03:04:22,650 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 03:04:22,652 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 03:04:22,653 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 03:04:22,653 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 03:04:22,654 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_2calls_6-2.c [2024-10-11 03:04:24,013 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 03:04:24,162 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 03:04:24,163 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_2calls_6-2.c [2024-10-11 03:04:24,172 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/b2e528452/d7fabf5d55f74b8fad5a50ce953ac7d3/FLAG345e72328 [2024-10-11 03:04:24,185 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/b2e528452/d7fabf5d55f74b8fad5a50ce953ac7d3 [2024-10-11 03:04:24,188 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 03:04:24,189 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 03:04:24,191 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 03:04:24,191 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 03:04:24,195 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 03:04:24,196 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 03:04:24" (1/1) ... [2024-10-11 03:04:24,196 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d997450 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:04:24, skipping insertion in model container [2024-10-11 03:04:24,197 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 03:04:24" (1/1) ... [2024-10-11 03:04:24,212 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 03:04:24,354 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_2calls_6-2.c[946,959] [2024-10-11 03:04:24,359 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 03:04:24,368 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 03:04:24,382 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_2calls_6-2.c[946,959] [2024-10-11 03:04:24,385 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 03:04:24,398 INFO L204 MainTranslator]: Completed translation [2024-10-11 03:04:24,399 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:04:24 WrapperNode [2024-10-11 03:04:24,399 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 03:04:24,400 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 03:04:24,401 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 03:04:24,401 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 03:04:24,407 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:04:24" (1/1) ... [2024-10-11 03:04:24,413 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:04:24" (1/1) ... [2024-10-11 03:04:24,427 INFO L138 Inliner]: procedures = 14, calls = 12, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 20 [2024-10-11 03:04:24,428 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 03:04:24,428 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 03:04:24,429 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 03:04:24,429 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 03:04:24,437 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:04:24" (1/1) ... [2024-10-11 03:04:24,438 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:04:24" (1/1) ... [2024-10-11 03:04:24,438 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:04:24" (1/1) ... [2024-10-11 03:04:24,452 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 03:04:24,453 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:04:24" (1/1) ... [2024-10-11 03:04:24,453 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:04:24" (1/1) ... [2024-10-11 03:04:24,456 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:04:24" (1/1) ... [2024-10-11 03:04:24,458 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:04:24" (1/1) ... [2024-10-11 03:04:24,459 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:04:24" (1/1) ... [2024-10-11 03:04:24,464 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:04:24" (1/1) ... [2024-10-11 03:04:24,465 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 03:04:24,466 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 03:04:24,466 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 03:04:24,466 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 03:04:24,467 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:04:24" (1/1) ... [2024-10-11 03:04:24,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 03:04:24,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:04:24,496 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 03:04:24,502 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 03:04:24,581 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 03:04:24,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 03:04:24,582 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2024-10-11 03:04:24,582 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2024-10-11 03:04:24,582 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2024-10-11 03:04:24,582 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2024-10-11 03:04:24,582 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 03:04:24,582 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 03:04:24,647 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 03:04:24,649 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 03:04:24,775 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-10-11 03:04:24,776 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 03:04:24,816 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 03:04:24,817 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-11 03:04:24,817 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:04:24 BoogieIcfgContainer [2024-10-11 03:04:24,817 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 03:04:24,822 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 03:04:24,822 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 03:04:24,829 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 03:04:24,830 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 03:04:24" (1/3) ... [2024-10-11 03:04:24,830 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c039b89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 03:04:24, skipping insertion in model container [2024-10-11 03:04:24,830 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:04:24" (2/3) ... [2024-10-11 03:04:24,831 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c039b89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 03:04:24, skipping insertion in model container [2024-10-11 03:04:24,831 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:04:24" (3/3) ... [2024-10-11 03:04:24,832 INFO L112 eAbstractionObserver]: Analyzing ICFG fibo_2calls_6-2.c [2024-10-11 03:04:24,862 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 03:04:24,866 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 03:04:24,928 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 03:04:24,935 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;@1cc28e20, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 03:04:24,936 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 03:04:24,940 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 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-10-11 03:04:24,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-11 03:04:24,948 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:04:24,948 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:04:24,949 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:04:24,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:04:24,955 INFO L85 PathProgramCache]: Analyzing trace with hash -389521846, now seen corresponding path program 1 times [2024-10-11 03:04:24,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:04:24,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254089559] [2024-10-11 03:04:24,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:04:24,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:04:25,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:25,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:04:25,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:25,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:04:25,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:04:25,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254089559] [2024-10-11 03:04:25,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254089559] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:04:25,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:04:25,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 03:04:25,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307845902] [2024-10-11 03:04:25,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:04:25,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:04:25,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:04:25,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:04:25,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:04:25,235 INFO L87 Difference]: Start difference. First operand has 26 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 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.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 03:04:25,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:04:25,277 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2024-10-11 03:04:25,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:04:25,280 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 9 [2024-10-11 03:04:25,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:04:25,290 INFO L225 Difference]: With dead ends: 34 [2024-10-11 03:04:25,290 INFO L226 Difference]: Without dead ends: 26 [2024-10-11 03:04:25,293 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:04:25,296 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 0 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:04:25,297 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 108 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:04:25,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-10-11 03:04:25,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2024-10-11 03:04:25,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 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-10-11 03:04:25,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2024-10-11 03:04:25,332 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 9 [2024-10-11 03:04:25,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:04:25,332 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2024-10-11 03:04:25,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 03:04:25,333 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2024-10-11 03:04:25,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-11 03:04:25,334 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:04:25,334 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:04:25,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 03:04:25,335 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:04:25,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:04:25,336 INFO L85 PathProgramCache]: Analyzing trace with hash 1524884472, now seen corresponding path program 1 times [2024-10-11 03:04:25,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:04:25,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879907381] [2024-10-11 03:04:25,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:04:25,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:04:25,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:25,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:04:25,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:25,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:04:25,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:04:25,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879907381] [2024-10-11 03:04:25,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879907381] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:04:25,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:04:25,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 03:04:25,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590474496] [2024-10-11 03:04:25,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:04:25,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:04:25,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:04:25,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:04:25,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:04:25,526 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. 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-10-11 03:04:25,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:04:25,547 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2024-10-11 03:04:25,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:04:25,547 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-10-11 03:04:25,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:04:25,549 INFO L225 Difference]: With dead ends: 32 [2024-10-11 03:04:25,549 INFO L226 Difference]: Without dead ends: 28 [2024-10-11 03:04:25,549 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:04:25,552 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 0 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:04:25,552 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 119 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:04:25,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-10-11 03:04:25,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2024-10-11 03:04:25,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 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-10-11 03:04:25,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2024-10-11 03:04:25,561 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 10 [2024-10-11 03:04:25,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:04:25,562 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2024-10-11 03:04:25,562 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-10-11 03:04:25,562 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2024-10-11 03:04:25,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-11 03:04:25,564 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:04:25,564 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:04:25,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 03:04:25,565 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:04:25,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:04:25,567 INFO L85 PathProgramCache]: Analyzing trace with hash 741502751, now seen corresponding path program 1 times [2024-10-11 03:04:25,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:04:25,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458705889] [2024-10-11 03:04:25,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:04:25,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:04:25,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:25,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:04:25,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:25,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:25,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:25,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 03:04:25,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:25,698 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 03:04:25,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:04:25,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458705889] [2024-10-11 03:04:25,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458705889] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:04:25,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1828686352] [2024-10-11 03:04:25,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:04:25,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:04:25,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:04:25,701 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 03:04:25,702 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 03:04:25,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:25,758 INFO L255 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 03:04:25,770 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:04:25,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-10-11 03:04:25,850 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:04:26,044 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 03:04:26,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1828686352] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 03:04:26,045 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 03:04:26,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 13 [2024-10-11 03:04:26,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121580845] [2024-10-11 03:04:26,045 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 03:04:26,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-11 03:04:26,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:04:26,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-11 03:04:26,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2024-10-11 03:04:26,051 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. Second operand has 13 states, 10 states have (on average 3.1) internal successors, (31), 13 states have internal predecessors, (31), 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-10-11 03:04:26,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:04:26,173 INFO L93 Difference]: Finished difference Result 54 states and 74 transitions. [2024-10-11 03:04:26,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 03:04:26,174 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 10 states have (on average 3.1) internal successors, (31), 13 states have internal predecessors, (31), 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 22 [2024-10-11 03:04:26,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:04:26,175 INFO L225 Difference]: With dead ends: 54 [2024-10-11 03:04:26,175 INFO L226 Difference]: Without dead ends: 30 [2024-10-11 03:04:26,176 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2024-10-11 03:04:26,176 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 25 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:04:26,177 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 82 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:04:26,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-10-11 03:04:26,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2024-10-11 03:04:26,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 20 states have internal predecessors, (22), 5 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2024-10-11 03:04:26,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2024-10-11 03:04:26,182 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 22 [2024-10-11 03:04:26,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:04:26,183 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2024-10-11 03:04:26,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 10 states have (on average 3.1) internal successors, (31), 13 states have internal predecessors, (31), 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-10-11 03:04:26,183 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2024-10-11 03:04:26,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-11 03:04:26,184 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:04:26,184 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] [2024-10-11 03:04:26,198 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-11 03:04:26,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:04:26,386 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:04:26,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:04:26,386 INFO L85 PathProgramCache]: Analyzing trace with hash 1785876995, now seen corresponding path program 1 times [2024-10-11 03:04:26,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:04:26,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025087020] [2024-10-11 03:04:26,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:04:26,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:04:26,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:26,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:04:26,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:26,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:26,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:26,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:04:26,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:26,538 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 03:04:26,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:04:26,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025087020] [2024-10-11 03:04:26,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025087020] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:04:26,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2144272874] [2024-10-11 03:04:26,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:04:26,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:04:26,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:04:26,546 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 03:04:26,550 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 03:04:26,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:26,589 INFO L255 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 03:04:26,590 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:04:26,637 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 03:04:26,637 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:04:26,765 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 03:04:26,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2144272874] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 03:04:26,766 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 03:04:26,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 13 [2024-10-11 03:04:26,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915196351] [2024-10-11 03:04:26,766 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 03:04:26,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-11 03:04:26,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:04:26,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-11 03:04:26,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2024-10-11 03:04:26,767 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand has 13 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 13 states have internal predecessors, (31), 7 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-11 03:04:26,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:04:26,892 INFO L93 Difference]: Finished difference Result 52 states and 73 transitions. [2024-10-11 03:04:26,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 03:04:26,893 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 13 states have internal predecessors, (31), 7 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 7 states have call successors, (7) Word has length 23 [2024-10-11 03:04:26,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:04:26,895 INFO L225 Difference]: With dead ends: 52 [2024-10-11 03:04:26,895 INFO L226 Difference]: Without dead ends: 48 [2024-10-11 03:04:26,895 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2024-10-11 03:04:26,896 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 44 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:04:26,896 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 108 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:04:26,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-10-11 03:04:26,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2024-10-11 03:04:26,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 32 states have internal predecessors, (38), 9 states have call successors, (9), 4 states have call predecessors, (9), 6 states have return successors, (17), 9 states have call predecessors, (17), 9 states have call successors, (17) [2024-10-11 03:04:26,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 64 transitions. [2024-10-11 03:04:26,906 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 64 transitions. Word has length 23 [2024-10-11 03:04:26,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:04:26,908 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 64 transitions. [2024-10-11 03:04:26,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 13 states have internal predecessors, (31), 7 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-11 03:04:26,908 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 64 transitions. [2024-10-11 03:04:26,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-10-11 03:04:26,909 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:04:26,910 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] [2024-10-11 03:04:26,922 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 03:04:27,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:04:27,110 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:04:27,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:04:27,111 INFO L85 PathProgramCache]: Analyzing trace with hash -1754399412, now seen corresponding path program 1 times [2024-10-11 03:04:27,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:04:27,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834634669] [2024-10-11 03:04:27,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:04:27,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:04:27,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:27,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:04:27,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:27,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:27,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:27,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:27,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:27,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 03:04:27,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:27,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-11 03:04:27,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:27,232 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-11 03:04:27,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:04:27,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834634669] [2024-10-11 03:04:27,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834634669] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:04:27,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [342660168] [2024-10-11 03:04:27,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:04:27,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:04:27,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:04:27,236 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 03:04:27,241 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 03:04:27,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:27,282 INFO L255 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 03:04:27,284 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:04:27,351 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-11 03:04:27,351 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:04:27,707 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 03:04:27,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [342660168] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 03:04:27,707 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 03:04:27,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 9] total 15 [2024-10-11 03:04:27,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598939775] [2024-10-11 03:04:27,708 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 03:04:27,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-11 03:04:27,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:04:27,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-11 03:04:27,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2024-10-11 03:04:27,709 INFO L87 Difference]: Start difference. First operand 46 states and 64 transitions. Second operand has 15 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 15 states have internal predecessors, (46), 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-10-11 03:04:27,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:04:27,964 INFO L93 Difference]: Finished difference Result 108 states and 176 transitions. [2024-10-11 03:04:27,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 03:04:27,965 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 15 states have internal predecessors, (46), 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 35 [2024-10-11 03:04:27,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:04:27,966 INFO L225 Difference]: With dead ends: 108 [2024-10-11 03:04:27,966 INFO L226 Difference]: Without dead ends: 64 [2024-10-11 03:04:27,967 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 73 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=336, Unknown=0, NotChecked=0, Total=420 [2024-10-11 03:04:27,967 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 44 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 03:04:27,968 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 123 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 03:04:27,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-10-11 03:04:27,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 62. [2024-10-11 03:04:27,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 40 states have (on average 1.25) internal successors, (50), 43 states have internal predecessors, (50), 12 states have call successors, (12), 5 states have call predecessors, (12), 9 states have return successors, (29), 13 states have call predecessors, (29), 12 states have call successors, (29) [2024-10-11 03:04:27,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 91 transitions. [2024-10-11 03:04:27,980 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 91 transitions. Word has length 35 [2024-10-11 03:04:27,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:04:27,981 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 91 transitions. [2024-10-11 03:04:27,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 15 states have internal predecessors, (46), 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-10-11 03:04:27,981 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 91 transitions. [2024-10-11 03:04:27,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-11 03:04:27,982 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:04:27,982 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-10-11 03:04:27,994 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 03:04:28,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:04:28,186 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:04:28,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:04:28,187 INFO L85 PathProgramCache]: Analyzing trace with hash 2101254926, now seen corresponding path program 1 times [2024-10-11 03:04:28,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:04:28,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264180063] [2024-10-11 03:04:28,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:04:28,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:04:28,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:28,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:04:28,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:28,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:28,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:28,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:28,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:28,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:04:28,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:28,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 03:04:28,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:28,319 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-11 03:04:28,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:04:28,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264180063] [2024-10-11 03:04:28,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264180063] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:04:28,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [143324329] [2024-10-11 03:04:28,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:04:28,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:04:28,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:04:28,324 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 03:04:28,326 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 03:04:28,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:28,364 INFO L255 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 03:04:28,365 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:04:28,431 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-11 03:04:28,432 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:04:28,687 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 03:04:28,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [143324329] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 03:04:28,687 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 03:04:28,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 9] total 18 [2024-10-11 03:04:28,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147742811] [2024-10-11 03:04:28,688 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 03:04:28,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-11 03:04:28,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:04:28,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-11 03:04:28,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2024-10-11 03:04:28,689 INFO L87 Difference]: Start difference. First operand 62 states and 91 transitions. Second operand has 18 states, 16 states have (on average 3.0625) internal successors, (49), 18 states have internal predecessors, (49), 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-10-11 03:04:28,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:04:28,937 INFO L93 Difference]: Finished difference Result 178 states and 324 transitions. [2024-10-11 03:04:28,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-11 03:04:28,937 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 3.0625) internal successors, (49), 18 states have internal predecessors, (49), 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 36 [2024-10-11 03:04:28,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:04:28,942 INFO L225 Difference]: With dead ends: 178 [2024-10-11 03:04:28,943 INFO L226 Difference]: Without dead ends: 118 [2024-10-11 03:04:28,944 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 75 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=105, Invalid=447, Unknown=0, NotChecked=0, Total=552 [2024-10-11 03:04:28,947 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 25 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 03:04:28,948 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 268 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 343 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 03:04:28,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-10-11 03:04:28,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 99. [2024-10-11 03:04:28,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 63 states have (on average 1.2222222222222223) internal successors, (77), 66 states have internal predecessors, (77), 21 states have call successors, (21), 7 states have call predecessors, (21), 14 states have return successors, (63), 25 states have call predecessors, (63), 21 states have call successors, (63) [2024-10-11 03:04:28,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 161 transitions. [2024-10-11 03:04:28,970 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 161 transitions. Word has length 36 [2024-10-11 03:04:28,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:04:28,973 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 161 transitions. [2024-10-11 03:04:28,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 3.0625) internal successors, (49), 18 states have internal predecessors, (49), 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-10-11 03:04:28,973 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 161 transitions. [2024-10-11 03:04:28,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-11 03:04:28,976 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:04:28,976 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] [2024-10-11 03:04:29,003 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-11 03:04:29,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-10-11 03:04:29,177 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:04:29,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:04:29,178 INFO L85 PathProgramCache]: Analyzing trace with hash 644290867, now seen corresponding path program 1 times [2024-10-11 03:04:29,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:04:29,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482030500] [2024-10-11 03:04:29,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:04:29,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:04:29,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:29,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:04:29,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:29,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:29,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:29,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:29,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:29,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:29,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:29,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:04:29,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:29,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 03:04:29,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:29,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 03:04:29,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:29,318 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 15 proven. 4 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-10-11 03:04:29,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:04:29,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482030500] [2024-10-11 03:04:29,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482030500] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:04:29,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [651330420] [2024-10-11 03:04:29,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:04:29,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:04:29,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:04:29,324 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 03:04:29,325 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-11 03:04:29,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:29,367 INFO L255 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-11 03:04:29,368 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:04:29,443 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-10-11 03:04:29,444 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:04:29,855 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 28 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 03:04:29,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [651330420] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 03:04:29,856 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 03:04:29,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 11] total 20 [2024-10-11 03:04:29,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008553345] [2024-10-11 03:04:29,856 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 03:04:29,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-10-11 03:04:29,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:04:29,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-10-11 03:04:29,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=312, Unknown=0, NotChecked=0, Total=380 [2024-10-11 03:04:29,858 INFO L87 Difference]: Start difference. First operand 99 states and 161 transitions. Second operand has 20 states, 18 states have (on average 3.2777777777777777) internal successors, (59), 20 states have internal predecessors, (59), 14 states have call successors, (16), 1 states have call predecessors, (16), 8 states have return successors, (18), 7 states have call predecessors, (18), 14 states have call successors, (18) [2024-10-11 03:04:30,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:04:30,125 INFO L93 Difference]: Finished difference Result 248 states and 485 transitions. [2024-10-11 03:04:30,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-11 03:04:30,126 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 3.2777777777777777) internal successors, (59), 20 states have internal predecessors, (59), 14 states have call successors, (16), 1 states have call predecessors, (16), 8 states have return successors, (18), 7 states have call predecessors, (18), 14 states have call successors, (18) Word has length 50 [2024-10-11 03:04:30,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:04:30,128 INFO L225 Difference]: With dead ends: 248 [2024-10-11 03:04:30,128 INFO L226 Difference]: Without dead ends: 151 [2024-10-11 03:04:30,129 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 106 SyntacticMatches, 4 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=131, Invalid=571, Unknown=0, NotChecked=0, Total=702 [2024-10-11 03:04:30,130 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 34 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 03:04:30,130 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 254 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 03:04:30,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2024-10-11 03:04:30,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 108. [2024-10-11 03:04:30,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 70 states have (on average 1.2285714285714286) internal successors, (86), 71 states have internal predecessors, (86), 24 states have call successors, (24), 9 states have call predecessors, (24), 13 states have return successors, (66), 27 states have call predecessors, (66), 24 states have call successors, (66) [2024-10-11 03:04:30,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 176 transitions. [2024-10-11 03:04:30,150 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 176 transitions. Word has length 50 [2024-10-11 03:04:30,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:04:30,150 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 176 transitions. [2024-10-11 03:04:30,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 3.2777777777777777) internal successors, (59), 20 states have internal predecessors, (59), 14 states have call successors, (16), 1 states have call predecessors, (16), 8 states have return successors, (18), 7 states have call predecessors, (18), 14 states have call successors, (18) [2024-10-11 03:04:30,150 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 176 transitions. [2024-10-11 03:04:30,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-10-11 03:04:30,157 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:04:30,157 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 7, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2024-10-11 03:04:30,184 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-11 03:04:30,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:04:30,358 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:04:30,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:04:30,358 INFO L85 PathProgramCache]: Analyzing trace with hash -110138383, now seen corresponding path program 1 times [2024-10-11 03:04:30,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:04:30,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781268589] [2024-10-11 03:04:30,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:04:30,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:04:30,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:30,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:04:30,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:30,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:30,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:30,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:30,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:30,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:30,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:30,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:30,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:30,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:04:30,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:30,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 03:04:30,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:30,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 03:04:30,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:30,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 03:04:30,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:30,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:30,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:30,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:30,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:30,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:30,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:30,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:04:30,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:30,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 03:04:30,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:30,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 03:04:30,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:30,792 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 44 proven. 79 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2024-10-11 03:04:30,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:04:30,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781268589] [2024-10-11 03:04:30,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781268589] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:04:30,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [481617686] [2024-10-11 03:04:30,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:04:30,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:04:30,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:04:30,794 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 03:04:30,795 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-11 03:04:30,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:30,851 INFO L255 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-11 03:04:30,853 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:04:30,950 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 17 proven. 119 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2024-10-11 03:04:30,951 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:04:31,648 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 17 proven. 129 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2024-10-11 03:04:31,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [481617686] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 03:04:31,649 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 03:04:31,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 13] total 23 [2024-10-11 03:04:31,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577332167] [2024-10-11 03:04:31,649 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 03:04:31,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-10-11 03:04:31,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:04:31,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-10-11 03:04:31,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=421, Unknown=0, NotChecked=0, Total=506 [2024-10-11 03:04:31,651 INFO L87 Difference]: Start difference. First operand 108 states and 176 transitions. Second operand has 23 states, 22 states have (on average 3.3636363636363638) internal successors, (74), 23 states have internal predecessors, (74), 17 states have call successors, (22), 1 states have call predecessors, (22), 9 states have return successors, (26), 11 states have call predecessors, (26), 17 states have call successors, (26) [2024-10-11 03:04:32,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:04:32,012 INFO L93 Difference]: Finished difference Result 252 states and 490 transitions. [2024-10-11 03:04:32,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-11 03:04:32,012 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 3.3636363636363638) internal successors, (74), 23 states have internal predecessors, (74), 17 states have call successors, (22), 1 states have call predecessors, (22), 9 states have return successors, (26), 11 states have call predecessors, (26), 17 states have call successors, (26) Word has length 106 [2024-10-11 03:04:32,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:04:32,014 INFO L225 Difference]: With dead ends: 252 [2024-10-11 03:04:32,017 INFO L226 Difference]: Without dead ends: 104 [2024-10-11 03:04:32,019 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 224 SyntacticMatches, 6 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 264 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=218, Invalid=972, Unknown=0, NotChecked=0, Total=1190 [2024-10-11 03:04:32,019 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 49 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 494 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 565 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 494 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 03:04:32,019 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 285 Invalid, 565 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 494 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 03:04:32,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-10-11 03:04:32,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 87. [2024-10-11 03:04:32,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 58 states have (on average 1.1896551724137931) internal successors, (69), 59 states have internal predecessors, (69), 16 states have call successors, (16), 8 states have call predecessors, (16), 12 states have return successors, (38), 19 states have call predecessors, (38), 16 states have call successors, (38) [2024-10-11 03:04:32,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 123 transitions. [2024-10-11 03:04:32,047 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 123 transitions. Word has length 106 [2024-10-11 03:04:32,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:04:32,048 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 123 transitions. [2024-10-11 03:04:32,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 3.3636363636363638) internal successors, (74), 23 states have internal predecessors, (74), 17 states have call successors, (22), 1 states have call predecessors, (22), 9 states have return successors, (26), 11 states have call predecessors, (26), 17 states have call successors, (26) [2024-10-11 03:04:32,048 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 123 transitions. [2024-10-11 03:04:32,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2024-10-11 03:04:32,049 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:04:32,049 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 11, 11, 11, 10, 7, 7, 7, 7, 7, 7, 7, 6, 5, 5, 5, 5, 5, 5, 5, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:04:32,062 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-11 03:04:32,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-10-11 03:04:32,254 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:04:32,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:04:32,255 INFO L85 PathProgramCache]: Analyzing trace with hash 1815143376, now seen corresponding path program 1 times [2024-10-11 03:04:32,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:04:32,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358367593] [2024-10-11 03:04:32,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:04:32,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:04:32,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:32,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:04:32,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:32,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:32,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:32,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:32,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:32,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:32,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:32,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:32,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:32,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:32,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:32,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:04:32,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:32,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 03:04:32,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:32,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 03:04:32,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:32,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 03:04:32,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:32,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:32,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:32,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:32,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:32,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:32,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:32,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:04:32,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:32,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 03:04:32,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:32,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 03:04:32,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:32,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 03:04:32,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:32,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:32,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:32,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:32,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:32,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:32,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:32,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:04:32,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:32,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 03:04:32,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:32,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 03:04:32,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:32,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:32,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:32,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:04:32,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:32,747 INFO L134 CoverageAnalysis]: Checked inductivity of 808 backedges. 78 proven. 182 refuted. 0 times theorem prover too weak. 548 trivial. 0 not checked. [2024-10-11 03:04:32,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:04:32,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358367593] [2024-10-11 03:04:32,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358367593] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:04:32,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1467641988] [2024-10-11 03:04:32,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:04:32,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:04:32,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:04:32,753 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 03:04:32,755 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-11 03:04:32,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:32,853 INFO L255 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-11 03:04:32,856 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:04:32,966 INFO L134 CoverageAnalysis]: Checked inductivity of 808 backedges. 65 proven. 158 refuted. 0 times theorem prover too weak. 585 trivial. 0 not checked. [2024-10-11 03:04:32,966 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:04:33,565 INFO L134 CoverageAnalysis]: Checked inductivity of 808 backedges. 65 proven. 163 refuted. 0 times theorem prover too weak. 580 trivial. 0 not checked. [2024-10-11 03:04:33,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1467641988] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 03:04:33,566 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 03:04:33,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 11] total 21 [2024-10-11 03:04:33,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112838350] [2024-10-11 03:04:33,566 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 03:04:33,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-10-11 03:04:33,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:04:33,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-10-11 03:04:33,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2024-10-11 03:04:33,568 INFO L87 Difference]: Start difference. First operand 87 states and 123 transitions. Second operand has 21 states, 20 states have (on average 3.5) internal successors, (70), 21 states have internal predecessors, (70), 14 states have call successors, (21), 1 states have call predecessors, (21), 8 states have return successors, (26), 12 states have call predecessors, (26), 14 states have call successors, (26) [2024-10-11 03:04:33,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:04:33,891 INFO L93 Difference]: Finished difference Result 178 states and 265 transitions. [2024-10-11 03:04:33,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-10-11 03:04:33,891 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 3.5) internal successors, (70), 21 states have internal predecessors, (70), 14 states have call successors, (21), 1 states have call predecessors, (21), 8 states have return successors, (26), 12 states have call predecessors, (26), 14 states have call successors, (26) Word has length 174 [2024-10-11 03:04:33,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:04:33,893 INFO L225 Difference]: With dead ends: 178 [2024-10-11 03:04:33,893 INFO L226 Difference]: Without dead ends: 98 [2024-10-11 03:04:33,893 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 417 GetRequests, 384 SyntacticMatches, 5 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=164, Invalid=706, Unknown=0, NotChecked=0, Total=870 [2024-10-11 03:04:33,894 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 43 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 411 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 03:04:33,894 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 219 Invalid, 450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 411 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 03:04:33,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-10-11 03:04:33,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 92. [2024-10-11 03:04:33,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 61 states have (on average 1.180327868852459) internal successors, (72), 63 states have internal predecessors, (72), 16 states have call successors, (16), 8 states have call predecessors, (16), 14 states have return successors, (39), 20 states have call predecessors, (39), 16 states have call successors, (39) [2024-10-11 03:04:33,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 127 transitions. [2024-10-11 03:04:33,903 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 127 transitions. Word has length 174 [2024-10-11 03:04:33,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:04:33,904 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 127 transitions. [2024-10-11 03:04:33,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 3.5) internal successors, (70), 21 states have internal predecessors, (70), 14 states have call successors, (21), 1 states have call predecessors, (21), 8 states have return successors, (26), 12 states have call predecessors, (26), 14 states have call successors, (26) [2024-10-11 03:04:33,904 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 127 transitions. [2024-10-11 03:04:33,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2024-10-11 03:04:33,905 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:04:33,906 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 13, 13, 11, 10, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1] [2024-10-11 03:04:33,919 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-10-11 03:04:34,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:04:34,110 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:04:34,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:04:34,111 INFO L85 PathProgramCache]: Analyzing trace with hash -1290424005, now seen corresponding path program 2 times [2024-10-11 03:04:34,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:04:34,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090299497] [2024-10-11 03:04:34,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:04:34,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:04:34,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:34,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:04:34,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:34,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:34,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:34,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:34,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:34,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:34,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:34,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:34,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:34,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:34,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:34,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:04:34,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:34,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 03:04:34,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:34,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 03:04:34,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:34,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:34,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:34,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:04:34,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:34,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 03:04:34,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:34,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:34,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:34,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:04:34,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:34,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 03:04:34,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:34,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:34,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:34,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:34,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:34,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:34,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:34,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:34,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:34,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:04:34,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:34,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 03:04:34,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:34,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 03:04:34,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:34,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:34,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:34,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:04:34,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:34,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 03:04:34,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:34,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:34,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:34,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:04:34,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:34,612 INFO L134 CoverageAnalysis]: Checked inductivity of 920 backedges. 121 proven. 185 refuted. 0 times theorem prover too weak. 614 trivial. 0 not checked. [2024-10-11 03:04:34,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:04:34,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090299497] [2024-10-11 03:04:34,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090299497] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:04:34,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [20248372] [2024-10-11 03:04:34,613 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 03:04:34,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:04:34,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:04:34,615 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 03:04:34,623 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-11 03:04:34,721 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 03:04:34,722 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 03:04:34,723 INFO L255 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-11 03:04:34,727 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:04:34,871 INFO L134 CoverageAnalysis]: Checked inductivity of 920 backedges. 89 proven. 150 refuted. 0 times theorem prover too weak. 681 trivial. 0 not checked. [2024-10-11 03:04:34,871 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:04:35,673 INFO L134 CoverageAnalysis]: Checked inductivity of 920 backedges. 89 proven. 155 refuted. 0 times theorem prover too weak. 676 trivial. 0 not checked. [2024-10-11 03:04:35,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [20248372] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 03:04:35,673 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 03:04:35,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 11] total 22 [2024-10-11 03:04:35,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370631805] [2024-10-11 03:04:35,673 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 03:04:35,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-10-11 03:04:35,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:04:35,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-10-11 03:04:35,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=385, Unknown=0, NotChecked=0, Total=462 [2024-10-11 03:04:35,675 INFO L87 Difference]: Start difference. First operand 92 states and 127 transitions. Second operand has 22 states, 20 states have (on average 3.6) internal successors, (72), 22 states have internal predecessors, (72), 15 states have call successors, (22), 1 states have call predecessors, (22), 8 states have return successors, (26), 13 states have call predecessors, (26), 15 states have call successors, (26) [2024-10-11 03:04:36,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:04:36,050 INFO L93 Difference]: Finished difference Result 195 states and 282 transitions. [2024-10-11 03:04:36,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-10-11 03:04:36,051 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 20 states have (on average 3.6) internal successors, (72), 22 states have internal predecessors, (72), 15 states have call successors, (22), 1 states have call predecessors, (22), 8 states have return successors, (26), 13 states have call predecessors, (26), 15 states have call successors, (26) Word has length 186 [2024-10-11 03:04:36,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:04:36,052 INFO L225 Difference]: With dead ends: 195 [2024-10-11 03:04:36,052 INFO L226 Difference]: Without dead ends: 112 [2024-10-11 03:04:36,053 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 446 GetRequests, 411 SyntacticMatches, 5 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=165, Invalid=827, Unknown=0, NotChecked=0, Total=992 [2024-10-11 03:04:36,053 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 56 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 501 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 551 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 501 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 03:04:36,054 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 294 Invalid, 551 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 501 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 03:04:36,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-10-11 03:04:36,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 92. [2024-10-11 03:04:36,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 61 states have (on average 1.180327868852459) internal successors, (72), 63 states have internal predecessors, (72), 16 states have call successors, (16), 8 states have call predecessors, (16), 14 states have return successors, (38), 20 states have call predecessors, (38), 16 states have call successors, (38) [2024-10-11 03:04:36,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 126 transitions. [2024-10-11 03:04:36,061 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 126 transitions. Word has length 186 [2024-10-11 03:04:36,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:04:36,061 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 126 transitions. [2024-10-11 03:04:36,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 20 states have (on average 3.6) internal successors, (72), 22 states have internal predecessors, (72), 15 states have call successors, (22), 1 states have call predecessors, (22), 8 states have return successors, (26), 13 states have call predecessors, (26), 15 states have call successors, (26) [2024-10-11 03:04:36,062 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 126 transitions. [2024-10-11 03:04:36,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2024-10-11 03:04:36,063 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:04:36,063 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 15, 15, 14, 13, 9, 9, 9, 9, 9, 9, 9, 7, 7, 7, 7, 7, 7, 7, 6, 5, 5, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:04:36,076 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-10-11 03:04:36,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-10-11 03:04:36,267 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:04:36,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:04:36,268 INFO L85 PathProgramCache]: Analyzing trace with hash 1948414804, now seen corresponding path program 3 times [2024-10-11 03:04:36,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:04:36,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922995102] [2024-10-11 03:04:36,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:04:36,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:04:36,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:36,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:04:36,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:36,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:36,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:36,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:36,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:36,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:36,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:36,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:36,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:36,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:36,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:36,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:04:36,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:36,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 03:04:36,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:36,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 03:04:36,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:36,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:36,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:36,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:04:36,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:36,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:36,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:36,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:04:36,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:36,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 03:04:36,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:36,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:36,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:36,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:36,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:36,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:36,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:36,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:04:36,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:36,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 03:04:36,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:36,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 03:04:36,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:36,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:36,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:36,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:04:36,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:36,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:36,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:36,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:04:36,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:36,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-10-11 03:04:36,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:36,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:36,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:36,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:36,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:36,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:36,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:36,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:04:36,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:36,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 03:04:36,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:36,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 03:04:36,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:36,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:36,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:36,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:04:36,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:36,900 INFO L134 CoverageAnalysis]: Checked inductivity of 1429 backedges. 179 proven. 395 refuted. 0 times theorem prover too weak. 855 trivial. 0 not checked. [2024-10-11 03:04:36,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:04:36,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922995102] [2024-10-11 03:04:36,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922995102] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:04:36,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [849533544] [2024-10-11 03:04:36,901 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-11 03:04:36,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:04:36,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:04:36,903 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 03:04:36,906 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-11 03:04:36,989 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2024-10-11 03:04:36,989 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 03:04:36,990 INFO L255 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 03:04:36,993 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:04:37,071 INFO L134 CoverageAnalysis]: Checked inductivity of 1429 backedges. 790 proven. 7 refuted. 0 times theorem prover too weak. 632 trivial. 0 not checked. [2024-10-11 03:04:37,071 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:04:37,674 INFO L134 CoverageAnalysis]: Checked inductivity of 1429 backedges. 247 proven. 106 refuted. 0 times theorem prover too weak. 1076 trivial. 0 not checked. [2024-10-11 03:04:37,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [849533544] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 03:04:37,674 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 03:04:37,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 9, 9] total 30 [2024-10-11 03:04:37,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763503009] [2024-10-11 03:04:37,675 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 03:04:37,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-10-11 03:04:37,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:04:37,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-10-11 03:04:37,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=743, Unknown=0, NotChecked=0, Total=870 [2024-10-11 03:04:37,677 INFO L87 Difference]: Start difference. First operand 92 states and 126 transitions. Second operand has 30 states, 29 states have (on average 3.0689655172413794) internal successors, (89), 30 states have internal predecessors, (89), 17 states have call successors, (26), 2 states have call predecessors, (26), 11 states have return successors, (35), 17 states have call predecessors, (35), 17 states have call successors, (35) [2024-10-11 03:04:38,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:04:38,115 INFO L93 Difference]: Finished difference Result 219 states and 353 transitions. [2024-10-11 03:04:38,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-10-11 03:04:38,115 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 3.0689655172413794) internal successors, (89), 30 states have internal predecessors, (89), 17 states have call successors, (26), 2 states have call predecessors, (26), 11 states have return successors, (35), 17 states have call predecessors, (35), 17 states have call successors, (35) Word has length 228 [2024-10-11 03:04:38,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:04:38,118 INFO L225 Difference]: With dead ends: 219 [2024-10-11 03:04:38,118 INFO L226 Difference]: Without dead ends: 125 [2024-10-11 03:04:38,120 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 555 GetRequests, 508 SyntacticMatches, 3 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 591 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=324, Invalid=1746, Unknown=0, NotChecked=0, Total=2070 [2024-10-11 03:04:38,121 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 87 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 623 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 701 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 03:04:38,121 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 335 Invalid, 701 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 623 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 03:04:38,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2024-10-11 03:04:38,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 102. [2024-10-11 03:04:38,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 70 states have (on average 1.1571428571428573) internal successors, (81), 69 states have internal predecessors, (81), 18 states have call successors, (18), 12 states have call predecessors, (18), 13 states have return successors, (36), 20 states have call predecessors, (36), 18 states have call successors, (36) [2024-10-11 03:04:38,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 135 transitions. [2024-10-11 03:04:38,166 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 135 transitions. Word has length 228 [2024-10-11 03:04:38,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:04:38,166 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 135 transitions. [2024-10-11 03:04:38,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 3.0689655172413794) internal successors, (89), 30 states have internal predecessors, (89), 17 states have call successors, (26), 2 states have call predecessors, (26), 11 states have return successors, (35), 17 states have call predecessors, (35), 17 states have call successors, (35) [2024-10-11 03:04:38,167 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 135 transitions. [2024-10-11 03:04:38,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2024-10-11 03:04:38,170 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:04:38,170 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 20, 20, 17, 16, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 7, 6, 4, 4, 1, 1, 1, 1, 1, 1] [2024-10-11 03:04:38,186 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-10-11 03:04:38,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:04:38,371 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:04:38,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:04:38,371 INFO L85 PathProgramCache]: Analyzing trace with hash -649087976, now seen corresponding path program 4 times [2024-10-11 03:04:38,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:04:38,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030272296] [2024-10-11 03:04:38,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:04:38,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:04:38,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:38,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:04:38,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:38,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:38,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:38,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:38,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:38,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:38,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:38,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:38,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:38,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:38,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:38,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:04:38,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:38,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 03:04:38,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:38,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 03:04:38,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:38,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:38,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:38,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:04:38,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:38,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 03:04:38,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:38,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:38,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:38,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:38,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:38,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:04:38,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:38,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 03:04:38,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:38,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-11 03:04:38,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:39,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:39,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:39,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:39,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:39,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:39,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:39,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:39,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:39,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:39,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:39,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:04:39,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:39,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 03:04:39,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:39,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 03:04:39,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:39,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:39,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:39,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:04:39,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:39,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 03:04:39,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:39,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:39,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:39,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:39,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:39,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:04:39,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:39,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 03:04:39,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:39,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-11 03:04:39,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:39,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:39,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:39,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:39,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:39,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:39,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:39,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:04:39,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:39,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 03:04:39,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:39,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 03:04:39,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:39,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:39,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:39,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:04:39,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:39,217 INFO L134 CoverageAnalysis]: Checked inductivity of 2216 backedges. 297 proven. 552 refuted. 0 times theorem prover too weak. 1367 trivial. 0 not checked. [2024-10-11 03:04:39,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:04:39,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030272296] [2024-10-11 03:04:39,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030272296] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:04:39,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1166679669] [2024-10-11 03:04:39,218 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-11 03:04:39,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:04:39,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:04:39,220 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 03:04:39,222 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-10-11 03:04:39,327 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-11 03:04:39,327 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 03:04:39,328 INFO L255 TraceCheckSpWp]: Trace formula consists of 503 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-10-11 03:04:39,332 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:04:39,524 INFO L134 CoverageAnalysis]: Checked inductivity of 2216 backedges. 273 proven. 668 refuted. 0 times theorem prover too weak. 1275 trivial. 0 not checked. [2024-10-11 03:04:39,524 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:04:41,358 INFO L134 CoverageAnalysis]: Checked inductivity of 2216 backedges. 273 proven. 686 refuted. 0 times theorem prover too weak. 1257 trivial. 0 not checked. [2024-10-11 03:04:41,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1166679669] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 03:04:41,359 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 03:04:41,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 17, 23] total 39 [2024-10-11 03:04:41,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809055140] [2024-10-11 03:04:41,359 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 03:04:41,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2024-10-11 03:04:41,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:04:41,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2024-10-11 03:04:41,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=206, Invalid=1276, Unknown=0, NotChecked=0, Total=1482 [2024-10-11 03:04:41,361 INFO L87 Difference]: Start difference. First operand 102 states and 135 transitions. Second operand has 39 states, 38 states have (on average 3.0789473684210527) internal successors, (117), 39 states have internal predecessors, (117), 33 states have call successors, (40), 1 states have call predecessors, (40), 14 states have return successors, (50), 22 states have call predecessors, (50), 33 states have call successors, (50) [2024-10-11 03:04:42,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:04:42,064 INFO L93 Difference]: Finished difference Result 260 states and 401 transitions. [2024-10-11 03:04:42,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2024-10-11 03:04:42,065 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 3.0789473684210527) internal successors, (117), 39 states have internal predecessors, (117), 33 states have call successors, (40), 1 states have call predecessors, (40), 14 states have return successors, (50), 22 states have call predecessors, (50), 33 states have call successors, (50) Word has length 282 [2024-10-11 03:04:42,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:04:42,067 INFO L225 Difference]: With dead ends: 260 [2024-10-11 03:04:42,067 INFO L226 Difference]: Without dead ends: 155 [2024-10-11 03:04:42,068 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 688 GetRequests, 616 SyntacticMatches, 11 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1257 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=588, Invalid=3318, Unknown=0, NotChecked=0, Total=3906 [2024-10-11 03:04:42,069 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 75 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 905 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 1010 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 905 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 03:04:42,069 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 429 Invalid, 1010 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 905 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 03:04:42,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2024-10-11 03:04:42,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 131. [2024-10-11 03:04:42,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 92 states have (on average 1.076086956521739) internal successors, (99), 88 states have internal predecessors, (99), 22 states have call successors, (22), 17 states have call predecessors, (22), 16 states have return successors, (53), 25 states have call predecessors, (53), 22 states have call successors, (53) [2024-10-11 03:04:42,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 174 transitions. [2024-10-11 03:04:42,078 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 174 transitions. Word has length 282 [2024-10-11 03:04:42,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:04:42,079 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 174 transitions. [2024-10-11 03:04:42,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 3.0789473684210527) internal successors, (117), 39 states have internal predecessors, (117), 33 states have call successors, (40), 1 states have call predecessors, (40), 14 states have return successors, (50), 22 states have call predecessors, (50), 33 states have call successors, (50) [2024-10-11 03:04:42,079 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 174 transitions. [2024-10-11 03:04:42,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2024-10-11 03:04:42,081 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:04:42,081 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 16, 16, 15, 14, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 7, 5, 4, 2, 1, 1, 1, 1, 1, 1] [2024-10-11 03:04:42,095 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-10-11 03:04:42,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-10-11 03:04:42,284 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:04:42,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:04:42,285 INFO L85 PathProgramCache]: Analyzing trace with hash -726763103, now seen corresponding path program 5 times [2024-10-11 03:04:42,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:04:42,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654359821] [2024-10-11 03:04:42,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:04:42,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:04:42,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:42,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:04:42,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:42,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:42,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:42,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:42,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:42,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:42,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:42,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:42,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:42,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:42,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:42,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:42,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:42,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:04:42,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:42,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 03:04:42,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:42,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 03:04:42,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:42,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:42,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:42,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:04:42,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:42,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 03:04:42,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:42,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:42,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:42,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:04:42,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:42,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 03:04:42,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:42,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:42,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:42,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:42,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:42,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:04:42,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:42,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 03:04:42,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:42,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-10-11 03:04:42,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:42,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:42,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:42,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:42,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:42,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:42,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:42,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:42,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:42,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:04:42,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:42,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 03:04:42,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:42,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 03:04:42,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:42,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:42,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:42,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:04:42,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:42,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 03:04:42,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:42,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:42,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:42,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:42,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:42,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:04:42,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:42,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 03:04:42,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:42,780 INFO L134 CoverageAnalysis]: Checked inductivity of 1616 backedges. 164 proven. 300 refuted. 0 times theorem prover too weak. 1152 trivial. 0 not checked. [2024-10-11 03:04:42,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:04:42,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654359821] [2024-10-11 03:04:42,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654359821] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:04:42,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [251452746] [2024-10-11 03:04:42,780 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-11 03:04:42,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:04:42,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:04:42,782 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 03:04:42,783 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-10-11 03:04:42,866 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2024-10-11 03:04:42,866 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 03:04:42,867 INFO L255 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-11 03:04:42,870 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:04:42,967 INFO L134 CoverageAnalysis]: Checked inductivity of 1616 backedges. 872 proven. 71 refuted. 0 times theorem prover too weak. 673 trivial. 0 not checked. [2024-10-11 03:04:42,968 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:04:44,159 INFO L134 CoverageAnalysis]: Checked inductivity of 1616 backedges. 146 proven. 447 refuted. 0 times theorem prover too weak. 1023 trivial. 0 not checked. [2024-10-11 03:04:44,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [251452746] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 03:04:44,160 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 03:04:44,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 15] total 26 [2024-10-11 03:04:44,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889630376] [2024-10-11 03:04:44,160 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 03:04:44,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-11 03:04:44,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:04:44,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-11 03:04:44,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=548, Unknown=0, NotChecked=0, Total=650 [2024-10-11 03:04:44,162 INFO L87 Difference]: Start difference. First operand 131 states and 174 transitions. Second operand has 26 states, 25 states have (on average 3.84) internal successors, (96), 26 states have internal predecessors, (96), 18 states have call successors, (29), 2 states have call predecessors, (29), 9 states have return successors, (34), 11 states have call predecessors, (34), 18 states have call successors, (34) [2024-10-11 03:04:44,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:04:44,449 INFO L93 Difference]: Finished difference Result 258 states and 357 transitions. [2024-10-11 03:04:44,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-11 03:04:44,450 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 3.84) internal successors, (96), 26 states have internal predecessors, (96), 18 states have call successors, (29), 2 states have call predecessors, (29), 9 states have return successors, (34), 11 states have call predecessors, (34), 18 states have call successors, (34) Word has length 242 [2024-10-11 03:04:44,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:04:44,451 INFO L225 Difference]: With dead ends: 258 [2024-10-11 03:04:44,451 INFO L226 Difference]: Without dead ends: 132 [2024-10-11 03:04:44,452 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 573 GetRequests, 534 SyntacticMatches, 7 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=190, Invalid=932, Unknown=0, NotChecked=0, Total=1122 [2024-10-11 03:04:44,452 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 29 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 530 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 530 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 03:04:44,453 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 323 Invalid, 557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 530 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 03:04:44,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2024-10-11 03:04:44,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 130. [2024-10-11 03:04:44,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 93 states have (on average 1.064516129032258) internal successors, (99), 88 states have internal predecessors, (99), 22 states have call successors, (22), 19 states have call predecessors, (22), 14 states have return successors, (46), 22 states have call predecessors, (46), 22 states have call successors, (46) [2024-10-11 03:04:44,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 167 transitions. [2024-10-11 03:04:44,461 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 167 transitions. Word has length 242 [2024-10-11 03:04:44,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:04:44,461 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 167 transitions. [2024-10-11 03:04:44,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 3.84) internal successors, (96), 26 states have internal predecessors, (96), 18 states have call successors, (29), 2 states have call predecessors, (29), 9 states have return successors, (34), 11 states have call predecessors, (34), 18 states have call successors, (34) [2024-10-11 03:04:44,461 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 167 transitions. [2024-10-11 03:04:44,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-10-11 03:04:44,463 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:04:44,463 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 9, 8, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2024-10-11 03:04:44,476 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-10-11 03:04:44,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-10-11 03:04:44,667 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:04:44,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:04:44,667 INFO L85 PathProgramCache]: Analyzing trace with hash 1699641540, now seen corresponding path program 6 times [2024-10-11 03:04:44,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:04:44,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257445385] [2024-10-11 03:04:44,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:04:44,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:04:44,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:44,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:04:44,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:44,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:44,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:44,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:44,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:44,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:44,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:44,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:44,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:44,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:44,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:44,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:04:44,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:44,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 03:04:44,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:44,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 03:04:44,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:44,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:44,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:44,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:04:44,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:44,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 03:04:44,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:44,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:44,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:44,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:44,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:44,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:04:44,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:44,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 03:04:44,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:44,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-11 03:04:44,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:44,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:44,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:44,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:04:44,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:44,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 03:04:44,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:44,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 03:04:44,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:04:44,997 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 165 proven. 92 refuted. 0 times theorem prover too weak. 287 trivial. 0 not checked. [2024-10-11 03:04:44,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:04:44,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257445385] [2024-10-11 03:04:44,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257445385] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:04:44,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1830937730] [2024-10-11 03:04:44,998 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-10-11 03:04:44,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:04:44,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:04:45,000 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 03:04:45,001 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-10-11 03:04:45,086 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2024-10-11 03:04:45,086 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 03:04:45,087 INFO L255 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 03:04:45,089 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:04:45,146 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 109 proven. 27 refuted. 0 times theorem prover too weak. 408 trivial. 0 not checked. [2024-10-11 03:04:45,146 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:04:45,514 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 109 proven. 29 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2024-10-11 03:04:45,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1830937730] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 03:04:45,514 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 03:04:45,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 8, 9] total 24 [2024-10-11 03:04:45,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634820593] [2024-10-11 03:04:45,514 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 03:04:45,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-10-11 03:04:45,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:04:45,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-10-11 03:04:45,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=461, Unknown=0, NotChecked=0, Total=552 [2024-10-11 03:04:45,516 INFO L87 Difference]: Start difference. First operand 130 states and 167 transitions. Second operand has 24 states, 23 states have (on average 3.0869565217391304) internal successors, (71), 24 states have internal predecessors, (71), 13 states have call successors, (22), 1 states have call predecessors, (22), 10 states have return successors, (26), 18 states have call predecessors, (26), 13 states have call successors, (26) [2024-10-11 03:04:45,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:04:45,813 INFO L93 Difference]: Finished difference Result 259 states and 338 transitions. [2024-10-11 03:04:45,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-10-11 03:04:45,814 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 3.0869565217391304) internal successors, (71), 24 states have internal predecessors, (71), 13 states have call successors, (22), 1 states have call predecessors, (22), 10 states have return successors, (26), 18 states have call predecessors, (26), 13 states have call successors, (26) Word has length 146 [2024-10-11 03:04:45,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:04:45,816 INFO L225 Difference]: With dead ends: 259 [2024-10-11 03:04:45,816 INFO L226 Difference]: Without dead ends: 138 [2024-10-11 03:04:45,816 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 355 GetRequests, 321 SyntacticMatches, 4 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 263 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=163, Invalid=829, Unknown=0, NotChecked=0, Total=992 [2024-10-11 03:04:45,817 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 38 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 525 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 551 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 525 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 03:04:45,817 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 329 Invalid, 551 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 525 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 03:04:45,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2024-10-11 03:04:45,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 129. [2024-10-11 03:04:45,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 93 states have (on average 1.064516129032258) internal successors, (99), 87 states have internal predecessors, (99), 21 states have call successors, (21), 19 states have call predecessors, (21), 14 states have return successors, (40), 22 states have call predecessors, (40), 21 states have call successors, (40) [2024-10-11 03:04:45,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 160 transitions. [2024-10-11 03:04:45,824 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 160 transitions. Word has length 146 [2024-10-11 03:04:45,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:04:45,825 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 160 transitions. [2024-10-11 03:04:45,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 3.0869565217391304) internal successors, (71), 24 states have internal predecessors, (71), 13 states have call successors, (22), 1 states have call predecessors, (22), 10 states have return successors, (26), 18 states have call predecessors, (26), 13 states have call successors, (26) [2024-10-11 03:04:45,825 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 160 transitions. [2024-10-11 03:04:45,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-10-11 03:04:45,826 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:04:45,826 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 12, 12, 10, 10, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1] [2024-10-11 03:04:45,839 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-10-11 03:04:46,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-10-11 03:04:46,027 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:04:46,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:04:46,027 INFO L85 PathProgramCache]: Analyzing trace with hash 1451526342, now seen corresponding path program 7 times [2024-10-11 03:04:46,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:04:46,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204689053] [2024-10-11 03:04:46,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:04:46,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:04:46,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 03:04:46,039 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 03:04:46,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 03:04:46,077 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 03:04:46,077 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 03:04:46,078 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 03:04:46,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 03:04:46,082 INFO L407 BasicCegarLoop]: Path program histogram: [7, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:04:46,128 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 03:04:46,130 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 03:04:46 BoogieIcfgContainer [2024-10-11 03:04:46,130 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 03:04:46,131 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 03:04:46,131 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 03:04:46,131 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 03:04:46,131 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:04:24" (3/4) ... [2024-10-11 03:04:46,132 INFO L133 WitnessPrinter]: Generating witness for reachability counterexample [2024-10-11 03:04:46,188 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 03:04:46,188 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 03:04:46,188 INFO L158 Benchmark]: Toolchain (without parser) took 21999.02ms. Allocated memory was 165.7MB in the beginning and 488.6MB in the end (delta: 323.0MB). Free memory was 95.2MB in the beginning and 309.0MB in the end (delta: -213.8MB). Peak memory consumption was 112.8MB. Max. memory is 16.1GB. [2024-10-11 03:04:46,191 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 165.7MB. Free memory is still 122.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 03:04:46,191 INFO L158 Benchmark]: CACSL2BoogieTranslator took 208.95ms. Allocated memory is still 165.7MB. Free memory was 95.0MB in the beginning and 83.2MB in the end (delta: 11.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-11 03:04:46,191 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.84ms. Allocated memory is still 165.7MB. Free memory was 83.0MB in the beginning and 81.6MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 03:04:46,192 INFO L158 Benchmark]: Boogie Preprocessor took 36.43ms. Allocated memory is still 165.7MB. Free memory was 81.6MB in the beginning and 80.1MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 03:04:46,192 INFO L158 Benchmark]: RCFGBuilder took 351.76ms. Allocated memory is still 165.7MB. Free memory was 80.1MB in the beginning and 129.3MB in the end (delta: -49.2MB). Peak memory consumption was 11.5MB. Max. memory is 16.1GB. [2024-10-11 03:04:46,192 INFO L158 Benchmark]: TraceAbstraction took 21308.07ms. Allocated memory was 165.7MB in the beginning and 488.6MB in the end (delta: 323.0MB). Free memory was 129.3MB in the beginning and 314.2MB in the end (delta: -184.9MB). Peak memory consumption was 139.1MB. Max. memory is 16.1GB. [2024-10-11 03:04:46,192 INFO L158 Benchmark]: Witness Printer took 57.08ms. Allocated memory is still 488.6MB. Free memory was 314.2MB in the beginning and 309.0MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-11 03:04:46,194 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.17ms. Allocated memory is still 165.7MB. Free memory is still 122.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 208.95ms. Allocated memory is still 165.7MB. Free memory was 95.0MB in the beginning and 83.2MB in the end (delta: 11.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.84ms. Allocated memory is still 165.7MB. Free memory was 83.0MB in the beginning and 81.6MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.43ms. Allocated memory is still 165.7MB. Free memory was 81.6MB in the beginning and 80.1MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 351.76ms. Allocated memory is still 165.7MB. Free memory was 80.1MB in the beginning and 129.3MB in the end (delta: -49.2MB). Peak memory consumption was 11.5MB. Max. memory is 16.1GB. * TraceAbstraction took 21308.07ms. Allocated memory was 165.7MB in the beginning and 488.6MB in the end (delta: 323.0MB). Free memory was 129.3MB in the beginning and 314.2MB in the end (delta: -184.9MB). Peak memory consumption was 139.1MB. Max. memory is 16.1GB. * Witness Printer took 57.08ms. Allocated memory is still 488.6MB. Free memory was 314.2MB in the beginning and 309.0MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. 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 = 6; VAL [x=6] [L39] CALL, EXPR fibo1(x) VAL [\old(n)=6] [L10] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L12] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=5] [L20] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L22] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=4] [L10] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L12] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L15] CALL, EXPR fibo2(n-1) 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-1) VAL [\old(n)=4, n=4] [L15] CALL, EXPR fibo2(n-2) 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-2) VAL [\old(n)=4, n=4] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=5, n=5] [L25] CALL, EXPR fibo1(n-2) 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-2) VAL [\old(n)=5, n=5] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=6, n=6] [L15] CALL, EXPR fibo2(n-2) 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-2) VAL [\old(n)=6, n=6] [L15] return fibo2(n-1) + fibo2(n-2); [L39] RET, EXPR fibo1(x) VAL [x=6] [L39] int result = fibo1(x); [L40] COND TRUE result == 8 VAL [x=6] [L41] reach_error() VAL [x=6] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 26 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 21.2s, OverallIterations: 15, TraceHistogramMax: 21, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.0s, AutomataDifference: 4.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 616 SdHoareTripleChecker+Valid, 2.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 549 mSDsluCounter, 3276 SdHoareTripleChecker+Invalid, 2.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2898 mSDsCounter, 562 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5165 IncrementalHoareTripleChecker+Invalid, 5727 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 562 mSolverCounterUnsat, 378 mSDtfsCounter, 5165 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3755 GetRequests, 3345 SyntacticMatches, 55 SemanticMatches, 355 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3334 ImplicationChecksByTransitivity, 3.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=131occurred in iteration=12, InterpolantAutomatonStates: 264, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 14 MinimizatonAttempts, 171 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 13.2s InterpolantComputationTime, 3252 NumberOfCodeBlocks, 2874 NumberOfCodeBlocksAsserted, 44 NumberOfCheckSat, 4571 ConstructedInterpolants, 0 QuantifiedInterpolants, 7483 SizeOfPredicates, 36 NumberOfNonLiveVariables, 2748 ConjunctsInSsa, 122 ConjunctsInUnsatCore, 38 InterpolantComputations, 2 PerfectInterpolantSequences, 18863/23682 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-10-11 03:04:46,236 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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