./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem02_label54.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem02_label54.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 86c957edaa3a19e9386396f93b83971b79b2c7d38305a79160055b9fd3c1d0de --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-10 22:35:29,429 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-10 22:35:29,494 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-10 22:35:29,500 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-10 22:35:29,502 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-10 22:35:29,523 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-10 22:35:29,525 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-10 22:35:29,525 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-10 22:35:29,526 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-10 22:35:29,527 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-10 22:35:29,528 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-10 22:35:29,528 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-10 22:35:29,528 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-10 22:35:29,529 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-10 22:35:29,530 INFO L153 SettingsManager]: * Use SBE=true [2024-10-10 22:35:29,531 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-10 22:35:29,531 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-10 22:35:29,531 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-10 22:35:29,531 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-10 22:35:29,531 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-10 22:35:29,532 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-10 22:35:29,534 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-10 22:35:29,534 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-10 22:35:29,534 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-10 22:35:29,535 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-10 22:35:29,535 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-10 22:35:29,535 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-10 22:35:29,535 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-10 22:35:29,535 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-10 22:35:29,535 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-10 22:35:29,536 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-10 22:35:29,536 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-10 22:35:29,536 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 22:35:29,536 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-10 22:35:29,536 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-10 22:35:29,537 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-10 22:35:29,537 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-10 22:35:29,537 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-10 22:35:29,539 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-10 22:35:29,539 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-10 22:35:29,539 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-10 22:35:29,540 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-10 22:35:29,540 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 86c957edaa3a19e9386396f93b83971b79b2c7d38305a79160055b9fd3c1d0de [2024-10-10 22:35:29,740 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-10 22:35:29,761 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-10 22:35:29,763 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-10 22:35:29,764 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-10 22:35:29,764 INFO L274 PluginConnector]: CDTParser initialized [2024-10-10 22:35:29,765 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem02_label54.c [2024-10-10 22:35:31,020 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-10 22:35:31,235 INFO L384 CDTParser]: Found 1 translation units. [2024-10-10 22:35:31,235 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem02_label54.c [2024-10-10 22:35:31,255 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/b05901705/1c3e847df73a4b58b724bde06577ddce/FLAGf6ec33319 [2024-10-10 22:35:31,590 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/b05901705/1c3e847df73a4b58b724bde06577ddce [2024-10-10 22:35:31,593 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-10 22:35:31,594 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-10 22:35:31,594 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-10 22:35:31,595 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-10 22:35:31,600 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-10 22:35:31,601 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 10:35:31" (1/1) ... [2024-10-10 22:35:31,602 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44357015 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:35:31, skipping insertion in model container [2024-10-10 22:35:31,602 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 10:35:31" (1/1) ... [2024-10-10 22:35:31,639 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-10 22:35:31,889 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem02_label54.c[16901,16914] [2024-10-10 22:35:31,942 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 22:35:31,952 INFO L200 MainTranslator]: Completed pre-run [2024-10-10 22:35:32,005 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem02_label54.c[16901,16914] [2024-10-10 22:35:32,016 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 22:35:32,034 INFO L204 MainTranslator]: Completed translation [2024-10-10 22:35:32,034 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:35:32 WrapperNode [2024-10-10 22:35:32,035 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-10 22:35:32,035 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-10 22:35:32,036 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-10 22:35:32,036 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-10 22:35:32,045 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:35:32" (1/1) ... [2024-10-10 22:35:32,058 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:35:32" (1/1) ... [2024-10-10 22:35:32,097 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 669 [2024-10-10 22:35:32,101 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-10 22:35:32,102 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-10 22:35:32,102 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-10 22:35:32,102 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-10 22:35:32,110 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:35:32" (1/1) ... [2024-10-10 22:35:32,111 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:35:32" (1/1) ... [2024-10-10 22:35:32,114 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:35:32" (1/1) ... [2024-10-10 22:35:32,142 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-10 22:35:32,142 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:35:32" (1/1) ... [2024-10-10 22:35:32,142 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:35:32" (1/1) ... [2024-10-10 22:35:32,162 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:35:32" (1/1) ... [2024-10-10 22:35:32,168 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:35:32" (1/1) ... [2024-10-10 22:35:32,172 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:35:32" (1/1) ... [2024-10-10 22:35:32,176 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:35:32" (1/1) ... [2024-10-10 22:35:32,182 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-10 22:35:32,183 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-10 22:35:32,183 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-10 22:35:32,183 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-10 22:35:32,184 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:35:32" (1/1) ... [2024-10-10 22:35:32,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 22:35:32,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:35:32,214 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-10 22:35:32,217 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-10 22:35:32,257 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-10 22:35:32,257 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-10 22:35:32,257 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-10 22:35:32,257 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-10 22:35:32,321 INFO L238 CfgBuilder]: Building ICFG [2024-10-10 22:35:32,323 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-10 22:35:33,107 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2024-10-10 22:35:33,108 INFO L287 CfgBuilder]: Performing block encoding [2024-10-10 22:35:33,158 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-10 22:35:33,160 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-10 22:35:33,160 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 10:35:33 BoogieIcfgContainer [2024-10-10 22:35:33,160 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-10 22:35:33,162 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-10 22:35:33,162 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-10 22:35:33,164 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-10 22:35:33,165 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.10 10:35:31" (1/3) ... [2024-10-10 22:35:33,165 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11872dea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 10:35:33, skipping insertion in model container [2024-10-10 22:35:33,166 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:35:32" (2/3) ... [2024-10-10 22:35:33,166 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11872dea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 10:35:33, skipping insertion in model container [2024-10-10 22:35:33,166 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 10:35:33" (3/3) ... [2024-10-10 22:35:33,167 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem02_label54.c [2024-10-10 22:35:33,181 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-10 22:35:33,181 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-10 22:35:33,237 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-10 22:35:33,243 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;@5c741806, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-10 22:35:33,243 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-10 22:35:33,248 INFO L276 IsEmpty]: Start isEmpty. Operand has 165 states, 163 states have (on average 1.9202453987730062) internal successors, (313), 164 states have internal predecessors, (313), 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-10-10 22:35:33,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-10 22:35:33,257 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:35:33,257 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, 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-10-10 22:35:33,258 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:35:33,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:35:33,263 INFO L85 PathProgramCache]: Analyzing trace with hash 1926501589, now seen corresponding path program 1 times [2024-10-10 22:35:33,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:35:33,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847660083] [2024-10-10 22:35:33,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:35:33,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:35:33,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:35:33,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:35:33,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:35:33,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847660083] [2024-10-10 22:35:33,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847660083] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:35:33,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:35:33,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 22:35:33,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545874141] [2024-10-10 22:35:33,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:35:33,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-10 22:35:33,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:35:33,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-10 22:35:33,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-10 22:35:33,691 INFO L87 Difference]: Start difference. First operand has 165 states, 163 states have (on average 1.9202453987730062) internal successors, (313), 164 states have internal predecessors, (313), 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 2 states, 2 states have (on average 50.0) internal successors, (100), 2 states have internal predecessors, (100), 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-10-10 22:35:33,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:35:33,728 INFO L93 Difference]: Finished difference Result 329 states and 625 transitions. [2024-10-10 22:35:33,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-10 22:35:33,730 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 50.0) internal successors, (100), 2 states have internal predecessors, (100), 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 100 [2024-10-10 22:35:33,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:35:33,738 INFO L225 Difference]: With dead ends: 329 [2024-10-10 22:35:33,738 INFO L226 Difference]: Without dead ends: 163 [2024-10-10 22:35:33,741 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-10 22:35:33,744 INFO L432 NwaCegarLoop]: 248 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 22:35:33,744 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 248 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:35:33,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2024-10-10 22:35:33,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2024-10-10 22:35:33,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 162 states have (on average 1.5308641975308641) internal successors, (248), 162 states have internal predecessors, (248), 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-10-10 22:35:33,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 248 transitions. [2024-10-10 22:35:33,781 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 248 transitions. Word has length 100 [2024-10-10 22:35:33,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:35:33,783 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 248 transitions. [2024-10-10 22:35:33,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 50.0) internal successors, (100), 2 states have internal predecessors, (100), 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-10-10 22:35:33,784 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 248 transitions. [2024-10-10 22:35:33,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-10 22:35:33,785 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:35:33,786 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, 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-10-10 22:35:33,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-10 22:35:33,786 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:35:33,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:35:33,787 INFO L85 PathProgramCache]: Analyzing trace with hash -1304012510, now seen corresponding path program 1 times [2024-10-10 22:35:33,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:35:33,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205582351] [2024-10-10 22:35:33,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:35:33,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:35:33,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:35:33,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:35:33,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:35:33,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205582351] [2024-10-10 22:35:33,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205582351] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:35:33,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:35:33,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 22:35:33,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176893805] [2024-10-10 22:35:33,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:35:33,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:35:33,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:35:33,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:35:33,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:35:33,984 INFO L87 Difference]: Start difference. First operand 163 states and 248 transitions. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 2 states have internal predecessors, (100), 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-10-10 22:35:34,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:35:34,493 INFO L93 Difference]: Finished difference Result 470 states and 719 transitions. [2024-10-10 22:35:34,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:35:34,494 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 2 states have internal predecessors, (100), 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 100 [2024-10-10 22:35:34,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:35:34,496 INFO L225 Difference]: With dead ends: 470 [2024-10-10 22:35:34,496 INFO L226 Difference]: Without dead ends: 308 [2024-10-10 22:35:34,497 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-10-10 22:35:34,498 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 49 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-10 22:35:34,498 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 116 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 363 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-10 22:35:34,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2024-10-10 22:35:34,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 306. [2024-10-10 22:35:34,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 305 states have (on average 1.3311475409836067) internal successors, (406), 305 states have internal predecessors, (406), 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-10-10 22:35:34,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 406 transitions. [2024-10-10 22:35:34,516 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 406 transitions. Word has length 100 [2024-10-10 22:35:34,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:35:34,518 INFO L471 AbstractCegarLoop]: Abstraction has 306 states and 406 transitions. [2024-10-10 22:35:34,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 2 states have internal predecessors, (100), 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-10-10 22:35:34,518 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 406 transitions. [2024-10-10 22:35:34,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-10 22:35:34,521 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:35:34,521 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:35:34,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-10 22:35:34,521 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:35:34,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:35:34,522 INFO L85 PathProgramCache]: Analyzing trace with hash 1014936329, now seen corresponding path program 1 times [2024-10-10 22:35:34,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:35:34,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785427568] [2024-10-10 22:35:34,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:35:34,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:35:34,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:35:34,796 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:35:34,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:35:34,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785427568] [2024-10-10 22:35:34,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785427568] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:35:34,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:35:34,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:35:34,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198472923] [2024-10-10 22:35:34,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:35:34,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:35:34,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:35:34,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:35:34,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:35:34,799 INFO L87 Difference]: Start difference. First operand 306 states and 406 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 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-10-10 22:35:35,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:35:35,224 INFO L93 Difference]: Finished difference Result 757 states and 1033 transitions. [2024-10-10 22:35:35,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:35:35,225 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 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 105 [2024-10-10 22:35:35,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:35:35,227 INFO L225 Difference]: With dead ends: 757 [2024-10-10 22:35:35,227 INFO L226 Difference]: Without dead ends: 452 [2024-10-10 22:35:35,228 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-10-10 22:35:35,229 INFO L432 NwaCegarLoop]: 228 mSDtfsCounter, 63 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 446 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-10 22:35:35,229 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 245 Invalid, 446 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-10 22:35:35,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2024-10-10 22:35:35,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 452. [2024-10-10 22:35:35,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 452 states, 451 states have (on average 1.2793791574279378) internal successors, (577), 451 states have internal predecessors, (577), 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-10-10 22:35:35,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 577 transitions. [2024-10-10 22:35:35,241 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 577 transitions. Word has length 105 [2024-10-10 22:35:35,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:35:35,241 INFO L471 AbstractCegarLoop]: Abstraction has 452 states and 577 transitions. [2024-10-10 22:35:35,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 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-10-10 22:35:35,242 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 577 transitions. [2024-10-10 22:35:35,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-10-10 22:35:35,243 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:35:35,244 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:35:35,244 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-10 22:35:35,244 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:35:35,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:35:35,245 INFO L85 PathProgramCache]: Analyzing trace with hash -270266908, now seen corresponding path program 1 times [2024-10-10 22:35:35,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:35:35,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033279788] [2024-10-10 22:35:35,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:35:35,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:35:35,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:35:35,347 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:35:35,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:35:35,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033279788] [2024-10-10 22:35:35,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033279788] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:35:35,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:35:35,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 22:35:35,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649729503] [2024-10-10 22:35:35,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:35:35,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:35:35,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:35:35,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:35:35,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:35:35,349 INFO L87 Difference]: Start difference. First operand 452 states and 577 transitions. Second operand has 3 states, 3 states have (on average 39.0) internal successors, (117), 2 states have internal predecessors, (117), 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-10-10 22:35:35,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:35:35,733 INFO L93 Difference]: Finished difference Result 1324 states and 1690 transitions. [2024-10-10 22:35:35,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:35:35,733 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 2 states have internal predecessors, (117), 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 117 [2024-10-10 22:35:35,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:35:35,736 INFO L225 Difference]: With dead ends: 1324 [2024-10-10 22:35:35,736 INFO L226 Difference]: Without dead ends: 873 [2024-10-10 22:35:35,737 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-10-10 22:35:35,738 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 183 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 349 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-10 22:35:35,738 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 79 Invalid, 435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 349 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-10 22:35:35,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2024-10-10 22:35:35,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 873. [2024-10-10 22:35:35,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 873 states, 872 states have (on average 1.2293577981651376) internal successors, (1072), 872 states have internal predecessors, (1072), 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-10-10 22:35:35,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1072 transitions. [2024-10-10 22:35:35,759 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1072 transitions. Word has length 117 [2024-10-10 22:35:35,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:35:35,759 INFO L471 AbstractCegarLoop]: Abstraction has 873 states and 1072 transitions. [2024-10-10 22:35:35,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 2 states have internal predecessors, (117), 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-10-10 22:35:35,760 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1072 transitions. [2024-10-10 22:35:35,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-10-10 22:35:35,764 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:35:35,764 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-10 22:35:35,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-10 22:35:35,765 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:35:35,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:35:35,765 INFO L85 PathProgramCache]: Analyzing trace with hash 1287371631, now seen corresponding path program 1 times [2024-10-10 22:35:35,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:35:35,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124947419] [2024-10-10 22:35:35,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:35:35,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:35:35,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:35:35,887 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-10 22:35:35,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:35:35,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124947419] [2024-10-10 22:35:35,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124947419] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:35:35,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:35:35,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:35:35,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486516665] [2024-10-10 22:35:35,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:35:35,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:35:35,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:35:35,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:35:35,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:35:35,890 INFO L87 Difference]: Start difference. First operand 873 states and 1072 transitions. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 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-10-10 22:35:36,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:35:36,273 INFO L93 Difference]: Finished difference Result 2027 states and 2467 transitions. [2024-10-10 22:35:36,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:35:36,275 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 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 146 [2024-10-10 22:35:36,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:35:36,279 INFO L225 Difference]: With dead ends: 2027 [2024-10-10 22:35:36,280 INFO L226 Difference]: Without dead ends: 1013 [2024-10-10 22:35:36,281 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-10-10 22:35:36,282 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 157 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-10 22:35:36,286 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 64 Invalid, 424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-10 22:35:36,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1013 states. [2024-10-10 22:35:36,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1013 to 1011. [2024-10-10 22:35:36,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1011 states, 1010 states have (on average 1.1425742574257425) internal successors, (1154), 1010 states have internal predecessors, (1154), 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-10-10 22:35:36,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1011 states to 1011 states and 1154 transitions. [2024-10-10 22:35:36,306 INFO L78 Accepts]: Start accepts. Automaton has 1011 states and 1154 transitions. Word has length 146 [2024-10-10 22:35:36,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:35:36,306 INFO L471 AbstractCegarLoop]: Abstraction has 1011 states and 1154 transitions. [2024-10-10 22:35:36,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 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-10-10 22:35:36,307 INFO L276 IsEmpty]: Start isEmpty. Operand 1011 states and 1154 transitions. [2024-10-10 22:35:36,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-10-10 22:35:36,311 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:35:36,312 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-10 22:35:36,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-10 22:35:36,312 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:35:36,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:35:36,313 INFO L85 PathProgramCache]: Analyzing trace with hash 1954456293, now seen corresponding path program 1 times [2024-10-10 22:35:36,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:35:36,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521227280] [2024-10-10 22:35:36,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:35:36,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:35:36,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:35:36,627 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 55 proven. 8 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-10 22:35:36,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:35:36,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521227280] [2024-10-10 22:35:36,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521227280] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:35:36,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [281834942] [2024-10-10 22:35:36,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:35:36,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:35:36,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:35:36,632 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 22:35:36,635 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-10 22:35:36,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:35:36,727 INFO L255 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-10 22:35:36,735 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:35:36,912 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-10-10 22:35:36,913 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 22:35:36,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [281834942] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:35:36,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 22:35:36,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-10-10 22:35:36,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389532077] [2024-10-10 22:35:36,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:35:36,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:35:36,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:35:36,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:35:36,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-10 22:35:36,917 INFO L87 Difference]: Start difference. First operand 1011 states and 1154 transitions. Second operand has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 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-10-10 22:35:37,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:35:37,290 INFO L93 Difference]: Finished difference Result 2301 states and 2671 transitions. [2024-10-10 22:35:37,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:35:37,294 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 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 150 [2024-10-10 22:35:37,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:35:37,298 INFO L225 Difference]: With dead ends: 2301 [2024-10-10 22:35:37,298 INFO L226 Difference]: Without dead ends: 1291 [2024-10-10 22:35:37,299 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-10 22:35:37,300 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 53 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 349 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-10 22:35:37,300 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 92 Invalid, 414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 349 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-10 22:35:37,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1291 states. [2024-10-10 22:35:37,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1291 to 1289. [2024-10-10 22:35:37,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1289 states, 1288 states have (on average 1.1498447204968945) internal successors, (1481), 1288 states have internal predecessors, (1481), 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-10-10 22:35:37,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1289 states to 1289 states and 1481 transitions. [2024-10-10 22:35:37,319 INFO L78 Accepts]: Start accepts. Automaton has 1289 states and 1481 transitions. Word has length 150 [2024-10-10 22:35:37,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:35:37,320 INFO L471 AbstractCegarLoop]: Abstraction has 1289 states and 1481 transitions. [2024-10-10 22:35:37,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 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-10-10 22:35:37,321 INFO L276 IsEmpty]: Start isEmpty. Operand 1289 states and 1481 transitions. [2024-10-10 22:35:37,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-10-10 22:35:37,323 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:35:37,323 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, 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-10-10 22:35:37,340 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-10 22:35:37,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:35:37,528 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:35:37,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:35:37,529 INFO L85 PathProgramCache]: Analyzing trace with hash -535616344, now seen corresponding path program 1 times [2024-10-10 22:35:37,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:35:37,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875304021] [2024-10-10 22:35:37,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:35:37,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:35:37,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:35:37,618 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:35:37,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:35:37,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875304021] [2024-10-10 22:35:37,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875304021] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:35:37,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:35:37,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 22:35:37,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569960301] [2024-10-10 22:35:37,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:35:37,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:35:37,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:35:37,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:35:37,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:35:37,621 INFO L87 Difference]: Start difference. First operand 1289 states and 1481 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 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-10-10 22:35:37,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:35:37,791 INFO L93 Difference]: Finished difference Result 2426 states and 2791 transitions. [2024-10-10 22:35:37,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:35:37,792 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 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 154 [2024-10-10 22:35:37,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:35:37,795 INFO L225 Difference]: With dead ends: 2426 [2024-10-10 22:35:37,795 INFO L226 Difference]: Without dead ends: 1138 [2024-10-10 22:35:37,796 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-10-10 22:35:37,797 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 143 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-10 22:35:37,797 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 19 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-10 22:35:37,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1138 states. [2024-10-10 22:35:37,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1138 to 1138. [2024-10-10 22:35:37,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1138 states, 1137 states have (on average 1.1002638522427441) internal successors, (1251), 1137 states have internal predecessors, (1251), 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-10-10 22:35:37,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1138 states to 1138 states and 1251 transitions. [2024-10-10 22:35:37,812 INFO L78 Accepts]: Start accepts. Automaton has 1138 states and 1251 transitions. Word has length 154 [2024-10-10 22:35:37,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:35:37,813 INFO L471 AbstractCegarLoop]: Abstraction has 1138 states and 1251 transitions. [2024-10-10 22:35:37,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 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-10-10 22:35:37,813 INFO L276 IsEmpty]: Start isEmpty. Operand 1138 states and 1251 transitions. [2024-10-10 22:35:37,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-10 22:35:37,815 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:35:37,816 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, 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] [2024-10-10 22:35:37,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-10 22:35:37,816 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:35:37,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:35:37,816 INFO L85 PathProgramCache]: Analyzing trace with hash -318793991, now seen corresponding path program 1 times [2024-10-10 22:35:37,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:35:37,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702402440] [2024-10-10 22:35:37,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:35:37,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:35:37,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:35:37,906 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:35:37,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:35:37,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702402440] [2024-10-10 22:35:37,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702402440] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:35:37,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:35:37,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:35:37,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623964956] [2024-10-10 22:35:37,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:35:37,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:35:37,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:35:37,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:35:37,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:35:37,908 INFO L87 Difference]: Start difference. First operand 1138 states and 1251 transitions. Second operand has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 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-10-10 22:35:38,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:35:38,218 INFO L93 Difference]: Finished difference Result 2973 states and 3273 transitions. [2024-10-10 22:35:38,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:35:38,218 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 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 172 [2024-10-10 22:35:38,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:35:38,223 INFO L225 Difference]: With dead ends: 2973 [2024-10-10 22:35:38,223 INFO L226 Difference]: Without dead ends: 1836 [2024-10-10 22:35:38,225 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-10-10 22:35:38,226 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 131 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-10 22:35:38,226 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 37 Invalid, 365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-10 22:35:38,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1836 states. [2024-10-10 22:35:38,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1836 to 1276. [2024-10-10 22:35:38,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1276 states, 1275 states have (on average 1.116078431372549) internal successors, (1423), 1275 states have internal predecessors, (1423), 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-10-10 22:35:38,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1276 states to 1276 states and 1423 transitions. [2024-10-10 22:35:38,248 INFO L78 Accepts]: Start accepts. Automaton has 1276 states and 1423 transitions. Word has length 172 [2024-10-10 22:35:38,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:35:38,248 INFO L471 AbstractCegarLoop]: Abstraction has 1276 states and 1423 transitions. [2024-10-10 22:35:38,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 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-10-10 22:35:38,248 INFO L276 IsEmpty]: Start isEmpty. Operand 1276 states and 1423 transitions. [2024-10-10 22:35:38,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2024-10-10 22:35:38,251 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:35:38,251 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, 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] [2024-10-10 22:35:38,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-10 22:35:38,251 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:35:38,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:35:38,252 INFO L85 PathProgramCache]: Analyzing trace with hash -2084047849, now seen corresponding path program 1 times [2024-10-10 22:35:38,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:35:38,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629101370] [2024-10-10 22:35:38,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:35:38,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:35:38,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:35:38,661 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 68 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:35:38,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:35:38,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629101370] [2024-10-10 22:35:38,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629101370] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:35:38,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [581954303] [2024-10-10 22:35:38,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:35:38,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:35:38,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:35:38,666 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 22:35:38,671 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-10 22:35:38,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:35:38,772 INFO L255 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-10 22:35:38,776 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:35:38,887 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-10-10 22:35:38,888 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 22:35:38,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [581954303] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:35:38,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 22:35:38,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-10-10 22:35:38,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783063392] [2024-10-10 22:35:38,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:35:38,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:35:38,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:35:38,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:35:38,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-10 22:35:38,890 INFO L87 Difference]: Start difference. First operand 1276 states and 1423 transitions. Second operand has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 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-10-10 22:35:39,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:35:39,209 INFO L93 Difference]: Finished difference Result 2829 states and 3137 transitions. [2024-10-10 22:35:39,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:35:39,210 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 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 198 [2024-10-10 22:35:39,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:35:39,210 INFO L225 Difference]: With dead ends: 2829 [2024-10-10 22:35:39,211 INFO L226 Difference]: Without dead ends: 0 [2024-10-10 22:35:39,212 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-10 22:35:39,213 INFO L432 NwaCegarLoop]: 197 mSDtfsCounter, 43 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-10 22:35:39,213 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 212 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-10 22:35:39,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-10 22:35:39,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-10 22:35:39,214 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-10-10 22:35:39,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-10 22:35:39,214 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 198 [2024-10-10 22:35:39,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:35:39,214 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-10 22:35:39,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 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-10-10 22:35:39,214 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-10 22:35:39,215 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-10 22:35:39,217 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-10 22:35:39,231 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-10 22:35:39,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:35:39,425 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:35:39,427 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-10 22:35:39,529 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-10 22:35:39,549 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.10 10:35:39 BoogieIcfgContainer [2024-10-10 22:35:39,549 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-10 22:35:39,550 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-10 22:35:39,550 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-10 22:35:39,550 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-10 22:35:39,550 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 10:35:33" (3/4) ... [2024-10-10 22:35:39,553 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-10 22:35:39,570 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2024-10-10 22:35:39,572 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-10-10 22:35:39,573 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-10 22:35:39,573 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-10 22:35:39,711 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-10 22:35:39,711 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-10 22:35:39,712 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-10 22:35:39,712 INFO L158 Benchmark]: Toolchain (without parser) took 8118.74ms. Allocated memory was 155.2MB in the beginning and 251.7MB in the end (delta: 96.5MB). Free memory was 81.3MB in the beginning and 177.1MB in the end (delta: -95.8MB). Peak memory consumption was 1.8MB. Max. memory is 16.1GB. [2024-10-10 22:35:39,712 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 155.2MB. Free memory is still 106.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-10 22:35:39,713 INFO L158 Benchmark]: CACSL2BoogieTranslator took 440.34ms. Allocated memory was 155.2MB in the beginning and 205.5MB in the end (delta: 50.3MB). Free memory was 81.1MB in the beginning and 166.6MB in the end (delta: -85.5MB). Peak memory consumption was 32.1MB. Max. memory is 16.1GB. [2024-10-10 22:35:39,713 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.57ms. Allocated memory is still 205.5MB. Free memory was 166.6MB in the beginning and 161.4MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-10 22:35:39,713 INFO L158 Benchmark]: Boogie Preprocessor took 80.71ms. Allocated memory is still 205.5MB. Free memory was 161.4MB in the beginning and 156.1MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-10 22:35:39,713 INFO L158 Benchmark]: RCFGBuilder took 977.51ms. Allocated memory is still 205.5MB. Free memory was 156.1MB in the beginning and 67.0MB in the end (delta: 89.1MB). Peak memory consumption was 88.1MB. Max. memory is 16.1GB. [2024-10-10 22:35:39,714 INFO L158 Benchmark]: TraceAbstraction took 6387.81ms. Allocated memory was 205.5MB in the beginning and 251.7MB in the end (delta: 46.1MB). Free memory was 67.0MB in the beginning and 189.7MB in the end (delta: -122.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-10 22:35:39,714 INFO L158 Benchmark]: Witness Printer took 161.96ms. Allocated memory is still 251.7MB. Free memory was 189.7MB in the beginning and 177.1MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-10 22:35:39,715 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 155.2MB. Free memory is still 106.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 440.34ms. Allocated memory was 155.2MB in the beginning and 205.5MB in the end (delta: 50.3MB). Free memory was 81.1MB in the beginning and 166.6MB in the end (delta: -85.5MB). Peak memory consumption was 32.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 65.57ms. Allocated memory is still 205.5MB. Free memory was 166.6MB in the beginning and 161.4MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 80.71ms. Allocated memory is still 205.5MB. Free memory was 161.4MB in the beginning and 156.1MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 977.51ms. Allocated memory is still 205.5MB. Free memory was 156.1MB in the beginning and 67.0MB in the end (delta: 89.1MB). Peak memory consumption was 88.1MB. Max. memory is 16.1GB. * TraceAbstraction took 6387.81ms. Allocated memory was 205.5MB in the beginning and 251.7MB in the end (delta: 46.1MB). Free memory was 67.0MB in the beginning and 189.7MB in the end (delta: -122.6MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 161.96ms. Allocated memory is still 251.7MB. Free memory was 189.7MB in the beginning and 177.1MB in the end (delta: 12.6MB). 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: 485]: 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, 165 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.2s, OverallIterations: 9, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 822 SdHoareTripleChecker+Valid, 2.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 822 mSDsluCounter, 1112 SdHoareTripleChecker+Invalid, 2.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 94 mSDsCounter, 486 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2598 IncrementalHoareTripleChecker+Invalid, 3084 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 486 mSolverCounterUnsat, 1018 mSDtfsCounter, 2598 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 371 GetRequests, 357 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1289occurred in iteration=6, InterpolantAutomatonStates: 26, 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, 566 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 1590 NumberOfCodeBlocks, 1590 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1579 ConstructedInterpolants, 0 QuantifiedInterpolants, 5034 SizeOfPredicates, 0 NumberOfNonLiveVariables, 611 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 11 InterpolantComputations, 9 PerfectInterpolantSequences, 575/641 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: 616]: Loop Invariant Derived loop invariant: ((((((((a17 <= 7) && (a28 <= 10)) || (((a17 <= 8) && (a28 <= 10)) && (a19 == 1))) || ((a28 == 10) && (a17 <= 8))) || ((a28 == 10) && (a19 == 1))) || ((a17 <= 8) && (a28 <= 7))) || (((a28 <= 8) && (a17 <= 8)) && (a11 != 1))) || (((a17 <= 8) && (a19 == 1)) && (a11 != 1))) RESULT: Ultimate proved your program to be correct! [2024-10-10 22:35:39,746 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE