./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem10_label13.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 803cd42f Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem10_label13.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 29c272f94fc98eecb70c8e165b01acafdc9b1cf1c8d08d69100d178e45ed1c97 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-21 22:01:25,900 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-21 22:01:25,974 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-21 22:01:25,977 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-21 22:01:25,977 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-21 22:01:25,994 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-21 22:01:25,995 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-21 22:01:25,995 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-21 22:01:25,996 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-21 22:01:25,996 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-21 22:01:25,996 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-21 22:01:25,997 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-21 22:01:25,997 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-21 22:01:25,997 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-21 22:01:25,997 INFO L153 SettingsManager]: * Use SBE=true [2024-11-21 22:01:25,998 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-21 22:01:25,998 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-21 22:01:25,998 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-21 22:01:25,999 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-21 22:01:25,999 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-21 22:01:25,999 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-21 22:01:25,999 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-21 22:01:26,000 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-21 22:01:26,000 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-21 22:01:26,000 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-21 22:01:26,000 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-21 22:01:26,001 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-21 22:01:26,001 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-21 22:01:26,001 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-21 22:01:26,001 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-21 22:01:26,001 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-21 22:01:26,002 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-21 22:01:26,002 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-21 22:01:26,002 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-21 22:01:26,002 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-21 22:01:26,002 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-21 22:01:26,003 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-21 22:01:26,003 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-21 22:01:26,003 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-21 22:01:26,003 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-21 22:01:26,004 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-21 22:01:26,007 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-21 22:01:26,007 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 29c272f94fc98eecb70c8e165b01acafdc9b1cf1c8d08d69100d178e45ed1c97 [2024-11-21 22:01:26,198 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-21 22:01:26,220 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-21 22:01:26,223 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-21 22:01:26,224 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-21 22:01:26,224 INFO L274 PluginConnector]: CDTParser initialized [2024-11-21 22:01:26,225 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem10_label13.c [2024-11-21 22:01:27,614 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-21 22:01:27,846 INFO L384 CDTParser]: Found 1 translation units. [2024-11-21 22:01:27,846 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label13.c [2024-11-21 22:01:27,856 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/94574f70d/5d299a66f6514e0d8a374b1289e07ffe/FLAGa33af4c82 [2024-11-21 22:01:27,880 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/94574f70d/5d299a66f6514e0d8a374b1289e07ffe [2024-11-21 22:01:27,883 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-21 22:01:27,888 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-21 22:01:27,889 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-21 22:01:27,890 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-21 22:01:27,895 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-21 22:01:27,896 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 10:01:27" (1/1) ... [2024-11-21 22:01:27,897 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@aa9c012 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:01:27, skipping insertion in model container [2024-11-21 22:01:27,897 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 10:01:27" (1/1) ... [2024-11-21 22:01:27,931 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-21 22:01:28,146 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label13.c[6334,6347] [2024-11-21 22:01:28,235 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-21 22:01:28,244 INFO L200 MainTranslator]: Completed pre-run [2024-11-21 22:01:28,261 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label13.c[6334,6347] [2024-11-21 22:01:28,294 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-21 22:01:28,306 INFO L204 MainTranslator]: Completed translation [2024-11-21 22:01:28,307 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:01:28 WrapperNode [2024-11-21 22:01:28,307 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-21 22:01:28,308 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-21 22:01:28,308 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-21 22:01:28,308 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-21 22:01:28,313 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:01:28" (1/1) ... [2024-11-21 22:01:28,324 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:01:28" (1/1) ... [2024-11-21 22:01:28,363 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 598 [2024-11-21 22:01:28,364 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-21 22:01:28,364 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-21 22:01:28,364 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-21 22:01:28,364 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-21 22:01:28,372 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:01:28" (1/1) ... [2024-11-21 22:01:28,373 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:01:28" (1/1) ... [2024-11-21 22:01:28,376 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:01:28" (1/1) ... [2024-11-21 22:01:28,413 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-21 22:01:28,413 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:01:28" (1/1) ... [2024-11-21 22:01:28,413 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:01:28" (1/1) ... [2024-11-21 22:01:28,442 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:01:28" (1/1) ... [2024-11-21 22:01:28,451 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:01:28" (1/1) ... [2024-11-21 22:01:28,466 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:01:28" (1/1) ... [2024-11-21 22:01:28,476 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:01:28" (1/1) ... [2024-11-21 22:01:28,491 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-21 22:01:28,492 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-21 22:01:28,492 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-21 22:01:28,492 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-21 22:01:28,493 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:01:28" (1/1) ... [2024-11-21 22:01:28,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-21 22:01:28,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-21 22:01:28,528 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-21 22:01:28,559 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-21 22:01:28,626 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-21 22:01:28,627 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-21 22:01:28,627 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-21 22:01:28,627 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-21 22:01:28,692 INFO L238 CfgBuilder]: Building ICFG [2024-11-21 22:01:28,694 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-21 22:01:29,415 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2024-11-21 22:01:29,415 INFO L287 CfgBuilder]: Performing block encoding [2024-11-21 22:01:29,437 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-21 22:01:29,439 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-21 22:01:29,439 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 10:01:29 BoogieIcfgContainer [2024-11-21 22:01:29,439 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-21 22:01:29,441 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-21 22:01:29,441 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-21 22:01:29,443 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-21 22:01:29,443 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 10:01:27" (1/3) ... [2024-11-21 22:01:29,444 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46868b98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 10:01:29, skipping insertion in model container [2024-11-21 22:01:29,444 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:01:28" (2/3) ... [2024-11-21 22:01:29,444 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46868b98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 10:01:29, skipping insertion in model container [2024-11-21 22:01:29,445 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 10:01:29" (3/3) ... [2024-11-21 22:01:29,446 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem10_label13.c [2024-11-21 22:01:29,458 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-21 22:01:29,459 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-21 22:01:29,504 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-21 22:01:29,509 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;@45cba72d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 22:01:29,509 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-21 22:01:29,513 INFO L276 IsEmpty]: Start isEmpty. Operand has 206 states, 204 states have (on average 1.6862745098039216) internal successors, (344), 205 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 22:01:29,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-21 22:01:29,518 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 22:01:29,519 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 22:01:29,519 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 22:01:29,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 22:01:29,523 INFO L85 PathProgramCache]: Analyzing trace with hash 1246856209, now seen corresponding path program 1 times [2024-11-21 22:01:29,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 22:01:29,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996011573] [2024-11-21 22:01:29,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 22:01:29,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 22:01:29,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 22:01:29,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 22:01:29,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 22:01:29,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996011573] [2024-11-21 22:01:29,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996011573] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 22:01:29,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 22:01:29,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 22:01:29,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931037861] [2024-11-21 22:01:29,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 22:01:29,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 22:01:29,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 22:01:29,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 22:01:29,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 22:01:29,896 INFO L87 Difference]: Start difference. First operand has 206 states, 204 states have (on average 1.6862745098039216) internal successors, (344), 205 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 2 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 22:01:30,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 22:01:30,486 INFO L93 Difference]: Finished difference Result 552 states and 966 transitions. [2024-11-21 22:01:30,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 22:01:30,488 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 2 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2024-11-21 22:01:30,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 22:01:30,496 INFO L225 Difference]: With dead ends: 552 [2024-11-21 22:01:30,496 INFO L226 Difference]: Without dead ends: 282 [2024-11-21 22:01:30,498 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 22:01:30,500 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 108 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 414 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-21 22:01:30,501 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 120 Invalid, 544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 414 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-21 22:01:30,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2024-11-21 22:01:30,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 282. [2024-11-21 22:01:30,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 281 states have (on average 1.3416370106761566) internal successors, (377), 281 states have internal predecessors, (377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 22:01:30,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 377 transitions. [2024-11-21 22:01:30,535 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 377 transitions. Word has length 55 [2024-11-21 22:01:30,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 22:01:30,536 INFO L471 AbstractCegarLoop]: Abstraction has 282 states and 377 transitions. [2024-11-21 22:01:30,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 2 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 22:01:30,536 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 377 transitions. [2024-11-21 22:01:30,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-21 22:01:30,539 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 22:01:30,539 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 22:01:30,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-21 22:01:30,539 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 22:01:30,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 22:01:30,540 INFO L85 PathProgramCache]: Analyzing trace with hash -2042555292, now seen corresponding path program 1 times [2024-11-21 22:01:30,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 22:01:30,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066017045] [2024-11-21 22:01:30,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 22:01:30,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 22:01:30,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 22:01:30,837 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 22:01:30,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 22:01:30,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066017045] [2024-11-21 22:01:30,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066017045] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 22:01:30,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 22:01:30,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 22:01:30,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093941126] [2024-11-21 22:01:30,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 22:01:30,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 22:01:30,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 22:01:30,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 22:01:30,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 22:01:30,842 INFO L87 Difference]: Start difference. First operand 282 states and 377 transitions. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 22:01:31,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 22:01:31,349 INFO L93 Difference]: Finished difference Result 701 states and 967 transitions. [2024-11-21 22:01:31,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 22:01:31,349 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 121 [2024-11-21 22:01:31,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 22:01:31,352 INFO L225 Difference]: With dead ends: 701 [2024-11-21 22:01:31,352 INFO L226 Difference]: Without dead ends: 421 [2024-11-21 22:01:31,353 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 22:01:31,353 INFO L432 NwaCegarLoop]: 210 mSDtfsCounter, 91 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-21 22:01:31,354 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 215 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-21 22:01:31,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2024-11-21 22:01:31,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 421. [2024-11-21 22:01:31,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 420 states have (on average 1.2523809523809524) internal successors, (526), 420 states have internal predecessors, (526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 22:01:31,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 526 transitions. [2024-11-21 22:01:31,367 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 526 transitions. Word has length 121 [2024-11-21 22:01:31,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 22:01:31,368 INFO L471 AbstractCegarLoop]: Abstraction has 421 states and 526 transitions. [2024-11-21 22:01:31,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 22:01:31,368 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 526 transitions. [2024-11-21 22:01:31,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-21 22:01:31,371 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 22:01:31,375 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 22:01:31,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-21 22:01:31,376 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 22:01:31,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 22:01:31,376 INFO L85 PathProgramCache]: Analyzing trace with hash 1371951955, now seen corresponding path program 1 times [2024-11-21 22:01:31,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 22:01:31,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932770411] [2024-11-21 22:01:31,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 22:01:31,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 22:01:31,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 22:01:31,553 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 22:01:31,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 22:01:31,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932770411] [2024-11-21 22:01:31,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932770411] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 22:01:31,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 22:01:31,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 22:01:31,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388643882] [2024-11-21 22:01:31,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 22:01:31,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 22:01:31,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 22:01:31,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 22:01:31,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 22:01:31,555 INFO L87 Difference]: Start difference. First operand 421 states and 526 transitions. Second operand has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 2 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 22:01:31,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 22:01:31,879 INFO L93 Difference]: Finished difference Result 979 states and 1209 transitions. [2024-11-21 22:01:31,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 22:01:31,879 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 2 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 128 [2024-11-21 22:01:31,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 22:01:31,881 INFO L225 Difference]: With dead ends: 979 [2024-11-21 22:01:31,881 INFO L226 Difference]: Without dead ends: 560 [2024-11-21 22:01:31,882 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 22:01:31,883 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 68 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-21 22:01:31,883 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 77 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-21 22:01:31,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2024-11-21 22:01:31,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 560. [2024-11-21 22:01:31,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 560 states, 559 states have (on average 1.2075134168157424) internal successors, (675), 559 states have internal predecessors, (675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 22:01:31,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 675 transitions. [2024-11-21 22:01:31,894 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 675 transitions. Word has length 128 [2024-11-21 22:01:31,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 22:01:31,894 INFO L471 AbstractCegarLoop]: Abstraction has 560 states and 675 transitions. [2024-11-21 22:01:31,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 2 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 22:01:31,895 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 675 transitions. [2024-11-21 22:01:31,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-21 22:01:31,896 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 22:01:31,896 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 22:01:31,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-21 22:01:31,897 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 22:01:31,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 22:01:31,897 INFO L85 PathProgramCache]: Analyzing trace with hash 1762411064, now seen corresponding path program 1 times [2024-11-21 22:01:31,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 22:01:31,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558386512] [2024-11-21 22:01:31,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 22:01:31,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 22:01:31,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 22:01:32,168 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 38 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 22:01:32,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 22:01:32,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558386512] [2024-11-21 22:01:32,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558386512] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-21 22:01:32,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [677713680] [2024-11-21 22:01:32,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 22:01:32,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 22:01:32,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-21 22:01:32,172 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-21 22:01:32,173 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-21 22:01:32,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 22:01:32,240 INFO L255 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-21 22:01:32,244 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 22:01:32,392 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 22:01:32,392 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-21 22:01:32,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [677713680] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 22:01:32,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-21 22:01:32,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2024-11-21 22:01:32,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638860796] [2024-11-21 22:01:32,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 22:01:32,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 22:01:32,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 22:01:32,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 22:01:32,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2024-11-21 22:01:32,394 INFO L87 Difference]: Start difference. First operand 560 states and 675 transitions. Second operand has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 22:01:32,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 22:01:32,943 INFO L93 Difference]: Finished difference Result 979 states and 1199 transitions. [2024-11-21 22:01:32,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 22:01:32,944 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 130 [2024-11-21 22:01:32,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 22:01:32,947 INFO L225 Difference]: With dead ends: 979 [2024-11-21 22:01:32,947 INFO L226 Difference]: Without dead ends: 977 [2024-11-21 22:01:32,947 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2024-11-21 22:01:32,948 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 129 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 449 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-21 22:01:32,948 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 11 Invalid, 449 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-21 22:01:32,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 977 states. [2024-11-21 22:01:32,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 977 to 699. [2024-11-21 22:01:32,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 699 states, 698 states have (on average 1.2736389684813754) internal successors, (889), 698 states have internal predecessors, (889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 22:01:32,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 889 transitions. [2024-11-21 22:01:32,966 INFO L78 Accepts]: Start accepts. Automaton has 699 states and 889 transitions. Word has length 130 [2024-11-21 22:01:32,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 22:01:32,967 INFO L471 AbstractCegarLoop]: Abstraction has 699 states and 889 transitions. [2024-11-21 22:01:32,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 22:01:32,967 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 889 transitions. [2024-11-21 22:01:32,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-11-21 22:01:32,970 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 22:01:32,970 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 22:01:32,984 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-21 22:01:33,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 22:01:33,176 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 22:01:33,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 22:01:33,177 INFO L85 PathProgramCache]: Analyzing trace with hash 1726354278, now seen corresponding path program 1 times [2024-11-21 22:01:33,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 22:01:33,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88316609] [2024-11-21 22:01:33,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 22:01:33,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 22:01:33,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 22:01:33,522 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 22:01:33,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 22:01:33,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88316609] [2024-11-21 22:01:33,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88316609] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 22:01:33,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 22:01:33,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 22:01:33,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133236715] [2024-11-21 22:01:33,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 22:01:33,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-21 22:01:33,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 22:01:33,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-21 22:01:33,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-21 22:01:33,527 INFO L87 Difference]: Start difference. First operand 699 states and 889 transitions. Second operand has 4 states, 4 states have (on average 43.25) internal successors, (173), 3 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 22:01:34,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 22:01:34,464 INFO L93 Difference]: Finished difference Result 1257 states and 1627 transitions. [2024-11-21 22:01:34,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 22:01:34,465 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 43.25) internal successors, (173), 3 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 173 [2024-11-21 22:01:34,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 22:01:34,467 INFO L225 Difference]: With dead ends: 1257 [2024-11-21 22:01:34,468 INFO L226 Difference]: Without dead ends: 699 [2024-11-21 22:01:34,468 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-21 22:01:34,470 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 87 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 567 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 571 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 567 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-21 22:01:34,470 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 87 Invalid, 571 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 567 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-21 22:01:34,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2024-11-21 22:01:34,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 699. [2024-11-21 22:01:34,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 699 states, 698 states have (on average 1.2664756446991403) internal successors, (884), 698 states have internal predecessors, (884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 22:01:34,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 884 transitions. [2024-11-21 22:01:34,483 INFO L78 Accepts]: Start accepts. Automaton has 699 states and 884 transitions. Word has length 173 [2024-11-21 22:01:34,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 22:01:34,483 INFO L471 AbstractCegarLoop]: Abstraction has 699 states and 884 transitions. [2024-11-21 22:01:34,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 43.25) internal successors, (173), 3 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 22:01:34,484 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 884 transitions. [2024-11-21 22:01:34,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2024-11-21 22:01:34,487 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 22:01:34,487 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 22:01:34,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-21 22:01:34,487 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 22:01:34,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 22:01:34,488 INFO L85 PathProgramCache]: Analyzing trace with hash -1617583127, now seen corresponding path program 1 times [2024-11-21 22:01:34,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 22:01:34,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93194642] [2024-11-21 22:01:34,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 22:01:34,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 22:01:34,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 22:01:34,835 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 179 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 22:01:34,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 22:01:34,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93194642] [2024-11-21 22:01:34,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93194642] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 22:01:34,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 22:01:34,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-21 22:01:34,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534999266] [2024-11-21 22:01:34,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 22:01:34,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-21 22:01:34,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 22:01:34,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-21 22:01:34,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-21 22:01:34,840 INFO L87 Difference]: Start difference. First operand 699 states and 884 transitions. Second operand has 7 states, 7 states have (on average 29.714285714285715) internal successors, (208), 6 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 22:01:35,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 22:01:35,364 INFO L93 Difference]: Finished difference Result 1312 states and 1677 transitions. [2024-11-21 22:01:35,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-21 22:01:35,365 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 29.714285714285715) internal successors, (208), 6 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 208 [2024-11-21 22:01:35,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 22:01:35,371 INFO L225 Difference]: With dead ends: 1312 [2024-11-21 22:01:35,371 INFO L226 Difference]: Without dead ends: 699 [2024-11-21 22:01:35,371 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-21 22:01:35,372 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 142 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 736 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 736 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 736 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-21 22:01:35,372 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 25 Invalid, 736 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 736 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-21 22:01:35,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2024-11-21 22:01:35,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 699. [2024-11-21 22:01:35,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 699 states, 698 states have (on average 1.2607449856733524) internal successors, (880), 698 states have internal predecessors, (880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 22:01:35,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 880 transitions. [2024-11-21 22:01:35,396 INFO L78 Accepts]: Start accepts. Automaton has 699 states and 880 transitions. Word has length 208 [2024-11-21 22:01:35,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 22:01:35,396 INFO L471 AbstractCegarLoop]: Abstraction has 699 states and 880 transitions. [2024-11-21 22:01:35,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 29.714285714285715) internal successors, (208), 6 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 22:01:35,397 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 880 transitions. [2024-11-21 22:01:35,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-11-21 22:01:35,402 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 22:01:35,402 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 22:01:35,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-21 22:01:35,403 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 22:01:35,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 22:01:35,403 INFO L85 PathProgramCache]: Analyzing trace with hash 1784057475, now seen corresponding path program 1 times [2024-11-21 22:01:35,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 22:01:35,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714429579] [2024-11-21 22:01:35,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 22:01:35,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 22:01:35,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 22:01:35,702 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 182 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 22:01:35,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 22:01:35,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714429579] [2024-11-21 22:01:35,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714429579] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 22:01:35,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 22:01:35,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 22:01:35,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487667364] [2024-11-21 22:01:35,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 22:01:35,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 22:01:35,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 22:01:35,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 22:01:35,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 22:01:35,710 INFO L87 Difference]: Start difference. First operand 699 states and 880 transitions. Second operand has 3 states, 3 states have (on average 81.33333333333333) internal successors, (244), 3 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 22:01:36,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 22:01:36,300 INFO L93 Difference]: Finished difference Result 1535 states and 2042 transitions. [2024-11-21 22:01:36,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 22:01:36,301 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 81.33333333333333) internal successors, (244), 3 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 244 [2024-11-21 22:01:36,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 22:01:36,307 INFO L225 Difference]: With dead ends: 1535 [2024-11-21 22:01:36,308 INFO L226 Difference]: Without dead ends: 977 [2024-11-21 22:01:36,308 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 22:01:36,314 INFO L432 NwaCegarLoop]: 185 mSDtfsCounter, 75 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-21 22:01:36,314 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 190 Invalid, 421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-21 22:01:36,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 977 states. [2024-11-21 22:01:36,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 977 to 838. [2024-11-21 22:01:36,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 838 states, 837 states have (on average 1.2592592592592593) internal successors, (1054), 837 states have internal predecessors, (1054), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 22:01:36,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 1054 transitions. [2024-11-21 22:01:36,338 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 1054 transitions. Word has length 244 [2024-11-21 22:01:36,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 22:01:36,339 INFO L471 AbstractCegarLoop]: Abstraction has 838 states and 1054 transitions. [2024-11-21 22:01:36,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 81.33333333333333) internal successors, (244), 3 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 22:01:36,339 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 1054 transitions. [2024-11-21 22:01:36,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2024-11-21 22:01:36,341 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 22:01:36,341 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 22:01:36,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-21 22:01:36,341 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 22:01:36,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 22:01:36,342 INFO L85 PathProgramCache]: Analyzing trace with hash -724262486, now seen corresponding path program 1 times [2024-11-21 22:01:36,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 22:01:36,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746651490] [2024-11-21 22:01:36,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 22:01:36,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 22:01:36,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 22:01:36,731 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 120 proven. 95 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 22:01:36,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 22:01:36,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746651490] [2024-11-21 22:01:36,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746651490] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-21 22:01:36,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [239873024] [2024-11-21 22:01:36,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 22:01:36,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 22:01:36,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-21 22:01:36,734 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-21 22:01:36,738 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-21 22:01:36,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 22:01:36,840 INFO L255 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-21 22:01:36,844 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 22:01:37,245 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2024-11-21 22:01:37,245 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-21 22:01:37,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [239873024] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 22:01:37,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-21 22:01:37,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2024-11-21 22:01:37,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266504757] [2024-11-21 22:01:37,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 22:01:37,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 22:01:37,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 22:01:37,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 22:01:37,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-21 22:01:37,249 INFO L87 Difference]: Start difference. First operand 838 states and 1054 transitions. Second operand has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 2 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 22:01:37,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 22:01:37,612 INFO L93 Difference]: Finished difference Result 1813 states and 2295 transitions. [2024-11-21 22:01:37,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 22:01:37,613 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 2 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 287 [2024-11-21 22:01:37,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 22:01:37,616 INFO L225 Difference]: With dead ends: 1813 [2024-11-21 22:01:37,616 INFO L226 Difference]: Without dead ends: 1116 [2024-11-21 22:01:37,617 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 286 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-21 22:01:37,620 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 55 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 333 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-21 22:01:37,620 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 34 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 333 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-21 22:01:37,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1116 states. [2024-11-21 22:01:37,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1116 to 1116. [2024-11-21 22:01:37,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1116 states, 1115 states have (on average 1.1713004484304932) internal successors, (1306), 1115 states have internal predecessors, (1306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 22:01:37,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1116 states to 1116 states and 1306 transitions. [2024-11-21 22:01:37,634 INFO L78 Accepts]: Start accepts. Automaton has 1116 states and 1306 transitions. Word has length 287 [2024-11-21 22:01:37,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 22:01:37,634 INFO L471 AbstractCegarLoop]: Abstraction has 1116 states and 1306 transitions. [2024-11-21 22:01:37,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 2 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 22:01:37,634 INFO L276 IsEmpty]: Start isEmpty. Operand 1116 states and 1306 transitions. [2024-11-21 22:01:37,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 355 [2024-11-21 22:01:37,638 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 22:01:37,638 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 22:01:37,648 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-21 22:01:37,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-11-21 22:01:37,841 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 22:01:37,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 22:01:37,842 INFO L85 PathProgramCache]: Analyzing trace with hash -524971941, now seen corresponding path program 1 times [2024-11-21 22:01:37,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 22:01:37,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222398993] [2024-11-21 22:01:37,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 22:01:37,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 22:01:37,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 22:01:38,123 INFO L134 CoverageAnalysis]: Checked inductivity of 413 backedges. 158 proven. 0 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2024-11-21 22:01:38,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 22:01:38,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222398993] [2024-11-21 22:01:38,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222398993] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 22:01:38,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 22:01:38,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 22:01:38,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025462067] [2024-11-21 22:01:38,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 22:01:38,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 22:01:38,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 22:01:38,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 22:01:38,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 22:01:38,126 INFO L87 Difference]: Start difference. First operand 1116 states and 1306 transitions. Second operand has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 22:01:38,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 22:01:38,498 INFO L93 Difference]: Finished difference Result 2923 states and 3437 transitions. [2024-11-21 22:01:38,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 22:01:38,499 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 354 [2024-11-21 22:01:38,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 22:01:38,499 INFO L225 Difference]: With dead ends: 2923 [2024-11-21 22:01:38,499 INFO L226 Difference]: Without dead ends: 0 [2024-11-21 22:01:38,501 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 22:01:38,502 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 89 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 374 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-21 22:01:38,502 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 48 Invalid, 436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 374 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-21 22:01:38,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-21 22:01:38,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-21 22:01:38,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 22:01:38,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-21 22:01:38,503 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 354 [2024-11-21 22:01:38,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 22:01:38,503 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-21 22:01:38,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 22:01:38,503 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-21 22:01:38,503 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-21 22:01:38,505 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-21 22:01:38,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-21 22:01:38,509 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 22:01:38,511 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-21 22:01:38,612 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-21 22:01:38,628 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.11 10:01:38 BoogieIcfgContainer [2024-11-21 22:01:38,628 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-21 22:01:38,629 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-21 22:01:38,629 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-21 22:01:38,630 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-21 22:01:38,630 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 10:01:29" (3/4) ... [2024-11-21 22:01:38,632 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-21 22:01:38,647 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2024-11-21 22:01:38,647 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-21 22:01:38,648 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-21 22:01:38,648 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-21 22:01:38,770 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-21 22:01:38,770 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-21 22:01:38,771 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-21 22:01:38,771 INFO L158 Benchmark]: Toolchain (without parser) took 10883.77ms. Allocated memory was 182.5MB in the beginning and 377.5MB in the end (delta: 195.0MB). Free memory was 110.3MB in the beginning and 187.6MB in the end (delta: -77.3MB). Peak memory consumption was 119.4MB. Max. memory is 16.1GB. [2024-11-21 22:01:38,771 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 117.4MB. Free memory is still 80.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-21 22:01:38,772 INFO L158 Benchmark]: CACSL2BoogieTranslator took 417.89ms. Allocated memory is still 182.5MB. Free memory was 110.0MB in the beginning and 80.3MB in the end (delta: 29.7MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-11-21 22:01:38,772 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.93ms. Allocated memory is still 182.5MB. Free memory was 80.3MB in the beginning and 72.3MB in the end (delta: 8.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-21 22:01:38,772 INFO L158 Benchmark]: Boogie Preprocessor took 126.59ms. Allocated memory is still 182.5MB. Free memory was 72.0MB in the beginning and 62.1MB in the end (delta: 9.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-21 22:01:38,772 INFO L158 Benchmark]: RCFGBuilder took 947.54ms. Allocated memory is still 182.5MB. Free memory was 61.8MB in the beginning and 142.3MB in the end (delta: -80.5MB). Peak memory consumption was 25.3MB. Max. memory is 16.1GB. [2024-11-21 22:01:38,773 INFO L158 Benchmark]: TraceAbstraction took 9187.82ms. Allocated memory was 182.5MB in the beginning and 377.5MB in the end (delta: 195.0MB). Free memory was 141.3MB in the beginning and 199.2MB in the end (delta: -57.9MB). Peak memory consumption was 136.1MB. Max. memory is 16.1GB. [2024-11-21 22:01:38,773 INFO L158 Benchmark]: Witness Printer took 141.35ms. Allocated memory is still 377.5MB. Free memory was 199.2MB in the beginning and 187.6MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-21 22:01:38,774 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 117.4MB. Free memory is still 80.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 417.89ms. Allocated memory is still 182.5MB. Free memory was 110.0MB in the beginning and 80.3MB in the end (delta: 29.7MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.93ms. Allocated memory is still 182.5MB. Free memory was 80.3MB in the beginning and 72.3MB in the end (delta: 8.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 126.59ms. Allocated memory is still 182.5MB. Free memory was 72.0MB in the beginning and 62.1MB in the end (delta: 9.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * RCFGBuilder took 947.54ms. Allocated memory is still 182.5MB. Free memory was 61.8MB in the beginning and 142.3MB in the end (delta: -80.5MB). Peak memory consumption was 25.3MB. Max. memory is 16.1GB. * TraceAbstraction took 9187.82ms. Allocated memory was 182.5MB in the beginning and 377.5MB in the end (delta: 195.0MB). Free memory was 141.3MB in the beginning and 199.2MB in the end (delta: -57.9MB). Peak memory consumption was 136.1MB. Max. memory is 16.1GB. * Witness Printer took 141.35ms. Allocated memory is still 377.5MB. Free memory was 199.2MB in the beginning and 187.6MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. 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 - PositiveResult [Line: 179]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 206 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.0s, OverallIterations: 9, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 844 SdHoareTripleChecker+Valid, 4.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 844 mSDsluCounter, 807 SdHoareTripleChecker+Invalid, 3.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 56 mSDsCounter, 509 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3839 IncrementalHoareTripleChecker+Invalid, 4348 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 509 mSolverCounterUnsat, 751 mSDtfsCounter, 3839 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 450 GetRequests, 425 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1116occurred in iteration=8, InterpolantAutomatonStates: 32, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 417 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 2117 NumberOfCodeBlocks, 2117 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 2106 ConstructedInterpolants, 0 QuantifiedInterpolants, 8554 SizeOfPredicates, 0 NumberOfNonLiveVariables, 604 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 11 InterpolantComputations, 9 PerfectInterpolantSequences, 1355/1464 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 592]: Loop Invariant Derived loop invariant: ((((((((a19 <= 9) && (8 <= a19)) && (14 == a4)) && (a12 == 0)) || ((((a19 <= 9) && (14 == a4)) && (a12 == 0)) && (a1 <= 33))) || ((((a19 <= 9) && (14 == a4)) && (a10 == 2)) && (a12 == 0))) || (((a10 <= 0) && (14 == a4)) && (a12 == 0))) || (((a10 == 1) && (14 == a4)) && (a12 == 0))) RESULT: Ultimate proved your program to be correct! [2024-11-21 22:01:38,791 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE