./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/Problem16_label56.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/Problem16_label56.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 1bf9c9ed0ac3089dd8a3bb2d319db37780f9f29fcee029bedf598db4408580eb --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-10 23:44:03,948 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-10 23:44:04,039 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-10 23:44:04,044 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-10 23:44:04,045 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-10 23:44:04,064 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-10 23:44:04,064 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-10 23:44:04,065 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-10 23:44:04,065 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-10 23:44:04,066 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-10 23:44:04,066 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-10 23:44:04,067 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-10 23:44:04,067 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-10 23:44:04,067 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-10 23:44:04,068 INFO L153 SettingsManager]: * Use SBE=true [2024-10-10 23:44:04,068 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-10 23:44:04,069 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-10 23:44:04,069 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-10 23:44:04,069 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-10 23:44:04,070 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-10 23:44:04,075 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-10 23:44:04,076 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-10 23:44:04,076 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-10 23:44:04,076 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-10 23:44:04,076 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-10 23:44:04,076 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-10 23:44:04,077 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-10 23:44:04,077 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-10 23:44:04,077 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-10 23:44:04,077 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-10 23:44:04,077 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-10 23:44:04,078 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-10 23:44:04,078 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 23:44:04,078 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-10 23:44:04,078 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-10 23:44:04,078 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-10 23:44:04,079 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-10 23:44:04,079 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-10 23:44:04,079 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-10 23:44:04,080 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-10 23:44:04,080 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-10 23:44:04,080 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-10 23:44:04,080 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 -> 1bf9c9ed0ac3089dd8a3bb2d319db37780f9f29fcee029bedf598db4408580eb [2024-10-10 23:44:04,314 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-10 23:44:04,339 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-10 23:44:04,344 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-10 23:44:04,345 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-10 23:44:04,346 INFO L274 PluginConnector]: CDTParser initialized [2024-10-10 23:44:04,347 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem16_label56.c [2024-10-10 23:44:05,779 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-10 23:44:06,105 INFO L384 CDTParser]: Found 1 translation units. [2024-10-10 23:44:06,106 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem16_label56.c [2024-10-10 23:44:06,135 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/d82ddc0b6/01f6a2e9be254d218b07d5db99a05983/FLAGecbff9973 [2024-10-10 23:44:06,152 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/d82ddc0b6/01f6a2e9be254d218b07d5db99a05983 [2024-10-10 23:44:06,154 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-10 23:44:06,156 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-10 23:44:06,158 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-10 23:44:06,158 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-10 23:44:06,164 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-10 23:44:06,166 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 11:44:06" (1/1) ... [2024-10-10 23:44:06,167 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52a4c805 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:44:06, skipping insertion in model container [2024-10-10 23:44:06,167 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 11:44:06" (1/1) ... [2024-10-10 23:44:06,236 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-10 23:44:06,527 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/Problem16_label56.c[3626,3639] [2024-10-10 23:44:06,918 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 23:44:06,928 INFO L200 MainTranslator]: Completed pre-run [2024-10-10 23:44:06,949 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/Problem16_label56.c[3626,3639] [2024-10-10 23:44:07,167 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 23:44:07,188 INFO L204 MainTranslator]: Completed translation [2024-10-10 23:44:07,189 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:44:07 WrapperNode [2024-10-10 23:44:07,189 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-10 23:44:07,190 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-10 23:44:07,191 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-10 23:44:07,191 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-10 23:44:07,198 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:44:07" (1/1) ... [2024-10-10 23:44:07,234 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:44:07" (1/1) ... [2024-10-10 23:44:07,360 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1770 [2024-10-10 23:44:07,360 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-10 23:44:07,362 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-10 23:44:07,362 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-10 23:44:07,362 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-10 23:44:07,373 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:44:07" (1/1) ... [2024-10-10 23:44:07,373 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:44:07" (1/1) ... [2024-10-10 23:44:07,388 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:44:07" (1/1) ... [2024-10-10 23:44:07,455 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 23:44:07,456 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:44:07" (1/1) ... [2024-10-10 23:44:07,456 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:44:07" (1/1) ... [2024-10-10 23:44:07,494 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:44:07" (1/1) ... [2024-10-10 23:44:07,511 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:44:07" (1/1) ... [2024-10-10 23:44:07,536 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:44:07" (1/1) ... [2024-10-10 23:44:07,599 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:44:07" (1/1) ... [2024-10-10 23:44:07,619 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-10 23:44:07,621 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-10 23:44:07,621 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-10 23:44:07,621 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-10 23:44:07,622 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:44:07" (1/1) ... [2024-10-10 23:44:07,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 23:44:07,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:44:07,654 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 23:44:07,662 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 23:44:07,710 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-10 23:44:07,710 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-10 23:44:07,711 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-10 23:44:07,711 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-10 23:44:07,769 INFO L238 CfgBuilder]: Building ICFG [2024-10-10 23:44:07,771 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-10 23:44:09,746 INFO L? ?]: Removed 276 outVars from TransFormulas that were not future-live. [2024-10-10 23:44:09,746 INFO L287 CfgBuilder]: Performing block encoding [2024-10-10 23:44:09,804 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-10 23:44:09,808 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-10 23:44:09,808 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:44:09 BoogieIcfgContainer [2024-10-10 23:44:09,808 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-10 23:44:09,811 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-10 23:44:09,811 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-10 23:44:09,815 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-10 23:44:09,815 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.10 11:44:06" (1/3) ... [2024-10-10 23:44:09,816 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32122766 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 11:44:09, skipping insertion in model container [2024-10-10 23:44:09,817 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:44:07" (2/3) ... [2024-10-10 23:44:09,818 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32122766 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 11:44:09, skipping insertion in model container [2024-10-10 23:44:09,818 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:44:09" (3/3) ... [2024-10-10 23:44:09,822 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem16_label56.c [2024-10-10 23:44:09,840 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-10 23:44:09,841 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-10 23:44:09,926 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-10 23:44:09,933 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;@79a0c8b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-10 23:44:09,934 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-10 23:44:09,940 INFO L276 IsEmpty]: Start isEmpty. Operand has 334 states, 332 states have (on average 1.9909638554216869) internal successors, (661), 333 states have internal predecessors, (661), 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 23:44:09,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-10 23:44:09,948 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:44:09,950 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] [2024-10-10 23:44:09,950 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:44:09,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:44:09,958 INFO L85 PathProgramCache]: Analyzing trace with hash -349683723, now seen corresponding path program 1 times [2024-10-10 23:44:09,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:44:09,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579525294] [2024-10-10 23:44:09,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:44:09,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:44:10,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:44:10,139 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 23:44:10,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:44:10,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579525294] [2024-10-10 23:44:10,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579525294] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:44:10,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:44:10,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:44:10,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760212382] [2024-10-10 23:44:10,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:44:10,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-10 23:44:10,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:44:10,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-10 23:44:10,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-10 23:44:10,177 INFO L87 Difference]: Start difference. First operand has 334 states, 332 states have (on average 1.9909638554216869) internal successors, (661), 333 states have internal predecessors, (661), 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 16.0) internal successors, (32), 2 states have internal predecessors, (32), 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 23:44:10,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:44:10,258 INFO L93 Difference]: Finished difference Result 667 states and 1321 transitions. [2024-10-10 23:44:10,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-10 23:44:10,262 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 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 32 [2024-10-10 23:44:10,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:44:10,276 INFO L225 Difference]: With dead ends: 667 [2024-10-10 23:44:10,276 INFO L226 Difference]: Without dead ends: 332 [2024-10-10 23:44:10,280 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 23:44:10,285 INFO L432 NwaCegarLoop]: 596 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, 596 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 23:44:10,286 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 596 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 23:44:10,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2024-10-10 23:44:10,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 332. [2024-10-10 23:44:10,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 331 states have (on average 1.8006042296072509) internal successors, (596), 331 states have internal predecessors, (596), 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 23:44:10,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 596 transitions. [2024-10-10 23:44:10,339 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 596 transitions. Word has length 32 [2024-10-10 23:44:10,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:44:10,339 INFO L471 AbstractCegarLoop]: Abstraction has 332 states and 596 transitions. [2024-10-10 23:44:10,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 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 23:44:10,340 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 596 transitions. [2024-10-10 23:44:10,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-10 23:44:10,340 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:44:10,341 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] [2024-10-10 23:44:10,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-10 23:44:10,341 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:44:10,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:44:10,342 INFO L85 PathProgramCache]: Analyzing trace with hash 1302304309, now seen corresponding path program 1 times [2024-10-10 23:44:10,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:44:10,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730014914] [2024-10-10 23:44:10,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:44:10,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:44:10,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:44:10,502 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 23:44:10,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:44:10,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730014914] [2024-10-10 23:44:10,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730014914] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:44:10,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:44:10,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:44:10,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154456712] [2024-10-10 23:44:10,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:44:10,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:44:10,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:44:10,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:44:10,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:44:10,509 INFO L87 Difference]: Start difference. First operand 332 states and 596 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 2 states have internal predecessors, (32), 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 23:44:11,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:44:11,995 INFO L93 Difference]: Finished difference Result 992 states and 1785 transitions. [2024-10-10 23:44:11,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:44:11,996 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 2 states have internal predecessors, (32), 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 32 [2024-10-10 23:44:11,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:44:12,000 INFO L225 Difference]: With dead ends: 992 [2024-10-10 23:44:12,000 INFO L226 Difference]: Without dead ends: 661 [2024-10-10 23:44:12,005 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 23:44:12,007 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 323 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 995 mSolverCounterSat, 191 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 1186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 191 IncrementalHoareTripleChecker+Valid, 995 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-10 23:44:12,008 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [323 Valid, 156 Invalid, 1186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [191 Valid, 995 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-10 23:44:12,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 661 states. [2024-10-10 23:44:12,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 661 to 661. [2024-10-10 23:44:12,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 661 states, 660 states have (on average 1.5833333333333333) internal successors, (1045), 660 states have internal predecessors, (1045), 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 23:44:12,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 661 states to 661 states and 1045 transitions. [2024-10-10 23:44:12,053 INFO L78 Accepts]: Start accepts. Automaton has 661 states and 1045 transitions. Word has length 32 [2024-10-10 23:44:12,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:44:12,053 INFO L471 AbstractCegarLoop]: Abstraction has 661 states and 1045 transitions. [2024-10-10 23:44:12,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 2 states have internal predecessors, (32), 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 23:44:12,055 INFO L276 IsEmpty]: Start isEmpty. Operand 661 states and 1045 transitions. [2024-10-10 23:44:12,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-10 23:44:12,058 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:44:12,058 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:44:12,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-10 23:44:12,058 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:44:12,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:44:12,060 INFO L85 PathProgramCache]: Analyzing trace with hash 583387047, now seen corresponding path program 1 times [2024-10-10 23:44:12,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:44:12,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900477311] [2024-10-10 23:44:12,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:44:12,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:44:12,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:44:12,275 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:44:12,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:44:12,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900477311] [2024-10-10 23:44:12,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900477311] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:44:12,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:44:12,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:44:12,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572057811] [2024-10-10 23:44:12,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:44:12,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:44:12,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:44:12,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:44:12,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:44:12,309 INFO L87 Difference]: Start difference. First operand 661 states and 1045 transitions. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 2 states have internal predecessors, (103), 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 23:44:13,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:44:13,436 INFO L93 Difference]: Finished difference Result 1650 states and 2538 transitions. [2024-10-10 23:44:13,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:44:13,437 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 2 states have internal predecessors, (103), 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 103 [2024-10-10 23:44:13,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:44:13,440 INFO L225 Difference]: With dead ends: 1650 [2024-10-10 23:44:13,441 INFO L226 Difference]: Without dead ends: 990 [2024-10-10 23:44:13,442 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 23:44:13,445 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 338 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 883 mSolverCounterSat, 268 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 338 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 1151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 268 IncrementalHoareTripleChecker+Valid, 883 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-10 23:44:13,445 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [338 Valid, 75 Invalid, 1151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [268 Valid, 883 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-10 23:44:13,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 990 states. [2024-10-10 23:44:13,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 990 to 990. [2024-10-10 23:44:13,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 990 states, 989 states have (on average 1.3771486349848332) internal successors, (1362), 989 states have internal predecessors, (1362), 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 23:44:13,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 990 states to 990 states and 1362 transitions. [2024-10-10 23:44:13,474 INFO L78 Accepts]: Start accepts. Automaton has 990 states and 1362 transitions. Word has length 103 [2024-10-10 23:44:13,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:44:13,475 INFO L471 AbstractCegarLoop]: Abstraction has 990 states and 1362 transitions. [2024-10-10 23:44:13,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 2 states have internal predecessors, (103), 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 23:44:13,475 INFO L276 IsEmpty]: Start isEmpty. Operand 990 states and 1362 transitions. [2024-10-10 23:44:13,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-10 23:44:13,478 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:44:13,478 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:44:13,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-10 23:44:13,478 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:44:13,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:44:13,479 INFO L85 PathProgramCache]: Analyzing trace with hash -649797084, now seen corresponding path program 1 times [2024-10-10 23:44:13,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:44:13,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278037202] [2024-10-10 23:44:13,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:44:13,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:44:13,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:44:13,642 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:44:13,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:44:13,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278037202] [2024-10-10 23:44:13,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278037202] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:44:13,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:44:13,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:44:13,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446788977] [2024-10-10 23:44:13,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:44:13,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:44:13,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:44:13,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:44:13,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:44:13,646 INFO L87 Difference]: Start difference. First operand 990 states and 1362 transitions. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 2 states have internal predecessors, (104), 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 23:44:14,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:44:14,803 INFO L93 Difference]: Finished difference Result 2966 states and 4083 transitions. [2024-10-10 23:44:14,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:44:14,804 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 2 states have internal predecessors, (104), 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 104 [2024-10-10 23:44:14,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:44:14,810 INFO L225 Difference]: With dead ends: 2966 [2024-10-10 23:44:14,811 INFO L226 Difference]: Without dead ends: 1977 [2024-10-10 23:44:14,812 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 23:44:14,813 INFO L432 NwaCegarLoop]: 204 mSDtfsCounter, 287 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 807 mSolverCounterSat, 390 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 1197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 390 IncrementalHoareTripleChecker+Valid, 807 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-10 23:44:14,813 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 209 Invalid, 1197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [390 Valid, 807 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-10 23:44:14,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1977 states. [2024-10-10 23:44:14,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1977 to 1977. [2024-10-10 23:44:14,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1977 states, 1976 states have (on average 1.2464574898785425) internal successors, (2463), 1976 states have internal predecessors, (2463), 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 23:44:14,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1977 states to 1977 states and 2463 transitions. [2024-10-10 23:44:14,846 INFO L78 Accepts]: Start accepts. Automaton has 1977 states and 2463 transitions. Word has length 104 [2024-10-10 23:44:14,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:44:14,847 INFO L471 AbstractCegarLoop]: Abstraction has 1977 states and 2463 transitions. [2024-10-10 23:44:14,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 2 states have internal predecessors, (104), 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 23:44:14,847 INFO L276 IsEmpty]: Start isEmpty. Operand 1977 states and 2463 transitions. [2024-10-10 23:44:14,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-10-10 23:44:14,851 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:44:14,851 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-10-10 23:44:14,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-10 23:44:14,852 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:44:14,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:44:14,855 INFO L85 PathProgramCache]: Analyzing trace with hash 1016982964, now seen corresponding path program 1 times [2024-10-10 23:44:14,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:44:14,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665612000] [2024-10-10 23:44:14,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:44:14,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:44:14,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:44:15,106 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2024-10-10 23:44:15,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:44:15,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665612000] [2024-10-10 23:44:15,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665612000] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:44:15,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:44:15,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:44:15,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931760834] [2024-10-10 23:44:15,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:44:15,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:44:15,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:44:15,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:44:15,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:44:15,110 INFO L87 Difference]: Start difference. First operand 1977 states and 2463 transitions. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:44:16,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:44:16,465 INFO L93 Difference]: Finished difference Result 4611 states and 5848 transitions. [2024-10-10 23:44:16,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:44:16,466 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 187 [2024-10-10 23:44:16,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:44:16,478 INFO L225 Difference]: With dead ends: 4611 [2024-10-10 23:44:16,478 INFO L226 Difference]: Without dead ends: 2635 [2024-10-10 23:44:16,481 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 23:44:16,483 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 358 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 812 mSolverCounterSat, 307 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 358 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 1119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 307 IncrementalHoareTripleChecker+Valid, 812 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-10 23:44:16,483 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [358 Valid, 154 Invalid, 1119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [307 Valid, 812 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-10 23:44:16,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2635 states. [2024-10-10 23:44:16,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2635 to 2306. [2024-10-10 23:44:16,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2306 states, 2305 states have (on average 1.2351409978308026) internal successors, (2847), 2305 states have internal predecessors, (2847), 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 23:44:16,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2306 states to 2306 states and 2847 transitions. [2024-10-10 23:44:16,537 INFO L78 Accepts]: Start accepts. Automaton has 2306 states and 2847 transitions. Word has length 187 [2024-10-10 23:44:16,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:44:16,539 INFO L471 AbstractCegarLoop]: Abstraction has 2306 states and 2847 transitions. [2024-10-10 23:44:16,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:44:16,540 INFO L276 IsEmpty]: Start isEmpty. Operand 2306 states and 2847 transitions. [2024-10-10 23:44:16,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 365 [2024-10-10 23:44:16,548 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:44:16,548 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:44:16,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-10 23:44:16,549 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:44:16,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:44:16,549 INFO L85 PathProgramCache]: Analyzing trace with hash 753404733, now seen corresponding path program 1 times [2024-10-10 23:44:16,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:44:16,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173417297] [2024-10-10 23:44:16,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:44:16,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:44:16,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:44:16,965 INFO L134 CoverageAnalysis]: Checked inductivity of 393 backedges. 220 proven. 0 refuted. 0 times theorem prover too weak. 173 trivial. 0 not checked. [2024-10-10 23:44:16,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:44:16,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173417297] [2024-10-10 23:44:16,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173417297] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:44:16,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:44:16,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:44:16,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369993252] [2024-10-10 23:44:16,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:44:16,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:44:16,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:44:16,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:44:16,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:44:16,968 INFO L87 Difference]: Start difference. First operand 2306 states and 2847 transitions. Second operand has 3 states, 3 states have (on average 74.66666666666667) internal successors, (224), 2 states have internal predecessors, (224), 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 23:44:18,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:44:18,620 INFO L93 Difference]: Finished difference Result 6916 states and 8539 transitions. [2024-10-10 23:44:18,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:44:18,621 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 74.66666666666667) internal successors, (224), 2 states have internal predecessors, (224), 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 364 [2024-10-10 23:44:18,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:44:18,636 INFO L225 Difference]: With dead ends: 6916 [2024-10-10 23:44:18,637 INFO L226 Difference]: Without dead ends: 4611 [2024-10-10 23:44:18,642 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 23:44:18,643 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 254 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 941 mSolverCounterSat, 351 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 1292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 351 IncrementalHoareTripleChecker+Valid, 941 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-10 23:44:18,645 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 118 Invalid, 1292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [351 Valid, 941 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-10 23:44:18,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4611 states. [2024-10-10 23:44:18,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4611 to 4609. [2024-10-10 23:44:18,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4609 states, 4608 states have (on average 1.2065972222222223) internal successors, (5560), 4608 states have internal predecessors, (5560), 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 23:44:18,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4609 states to 4609 states and 5560 transitions. [2024-10-10 23:44:18,735 INFO L78 Accepts]: Start accepts. Automaton has 4609 states and 5560 transitions. Word has length 364 [2024-10-10 23:44:18,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:44:18,737 INFO L471 AbstractCegarLoop]: Abstraction has 4609 states and 5560 transitions. [2024-10-10 23:44:18,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 74.66666666666667) internal successors, (224), 2 states have internal predecessors, (224), 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 23:44:18,738 INFO L276 IsEmpty]: Start isEmpty. Operand 4609 states and 5560 transitions. [2024-10-10 23:44:18,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 389 [2024-10-10 23:44:18,744 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:44:18,745 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:44:18,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-10 23:44:18,745 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:44:18,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:44:18,746 INFO L85 PathProgramCache]: Analyzing trace with hash -246978714, now seen corresponding path program 1 times [2024-10-10 23:44:18,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:44:18,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824740212] [2024-10-10 23:44:18,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:44:18,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:44:18,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:44:19,543 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-10-10 23:44:19,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:44:19,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824740212] [2024-10-10 23:44:19,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824740212] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:44:19,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:44:19,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:44:19,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671063607] [2024-10-10 23:44:19,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:44:19,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:44:19,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:44:19,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:44:19,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:44:19,547 INFO L87 Difference]: Start difference. First operand 4609 states and 5560 transitions. Second operand has 4 states, 4 states have (on average 89.5) internal successors, (358), 3 states have internal predecessors, (358), 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 23:44:20,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:44:20,945 INFO L93 Difference]: Finished difference Result 9546 states and 11460 transitions. [2024-10-10 23:44:20,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:44:20,946 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 89.5) internal successors, (358), 3 states have internal predecessors, (358), 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 388 [2024-10-10 23:44:20,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:44:20,961 INFO L225 Difference]: With dead ends: 9546 [2024-10-10 23:44:20,961 INFO L226 Difference]: Without dead ends: 4938 [2024-10-10 23:44:20,967 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-10 23:44:20,968 INFO L432 NwaCegarLoop]: 265 mSDtfsCounter, 127 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 1471 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 1476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1471 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-10 23:44:20,970 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 318 Invalid, 1476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1471 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-10 23:44:20,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4938 states. [2024-10-10 23:44:21,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4938 to 4938. [2024-10-10 23:44:21,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4938 states, 4937 states have (on average 1.1940449665788941) internal successors, (5895), 4937 states have internal predecessors, (5895), 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 23:44:21,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4938 states to 4938 states and 5895 transitions. [2024-10-10 23:44:21,047 INFO L78 Accepts]: Start accepts. Automaton has 4938 states and 5895 transitions. Word has length 388 [2024-10-10 23:44:21,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:44:21,048 INFO L471 AbstractCegarLoop]: Abstraction has 4938 states and 5895 transitions. [2024-10-10 23:44:21,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 89.5) internal successors, (358), 3 states have internal predecessors, (358), 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 23:44:21,049 INFO L276 IsEmpty]: Start isEmpty. Operand 4938 states and 5895 transitions. [2024-10-10 23:44:21,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 476 [2024-10-10 23:44:21,056 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:44:21,057 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:44:21,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-10 23:44:21,057 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:44:21,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:44:21,058 INFO L85 PathProgramCache]: Analyzing trace with hash 2023584000, now seen corresponding path program 1 times [2024-10-10 23:44:21,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:44:21,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389343668] [2024-10-10 23:44:21,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:44:21,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:44:21,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:44:21,932 INFO L134 CoverageAnalysis]: Checked inductivity of 375 backedges. 292 proven. 0 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2024-10-10 23:44:21,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:44:21,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389343668] [2024-10-10 23:44:21,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389343668] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:44:21,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:44:21,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-10 23:44:21,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322577461] [2024-10-10 23:44:21,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:44:21,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-10 23:44:21,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:44:21,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-10 23:44:21,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-10 23:44:21,938 INFO L87 Difference]: Start difference. First operand 4938 states and 5895 transitions. Second operand has 7 states, 7 states have (on average 56.285714285714285) internal successors, (394), 6 states have internal predecessors, (394), 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 23:44:23,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:44:23,834 INFO L93 Difference]: Finished difference Result 9405 states and 11301 transitions. [2024-10-10 23:44:23,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-10 23:44:23,835 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 56.285714285714285) internal successors, (394), 6 states have internal predecessors, (394), 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 475 [2024-10-10 23:44:23,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:44:23,846 INFO L225 Difference]: With dead ends: 9405 [2024-10-10 23:44:23,846 INFO L226 Difference]: Without dead ends: 4609 [2024-10-10 23:44:23,852 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-10 23:44:23,852 INFO L432 NwaCegarLoop]: 261 mSDtfsCounter, 288 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 2433 mSolverCounterSat, 184 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 2617 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 184 IncrementalHoareTripleChecker+Valid, 2433 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-10 23:44:23,853 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [288 Valid, 299 Invalid, 2617 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [184 Valid, 2433 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-10 23:44:23,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4609 states. [2024-10-10 23:44:23,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4609 to 4609. [2024-10-10 23:44:23,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4609 states, 4608 states have (on average 1.0744357638888888) internal successors, (4951), 4608 states have internal predecessors, (4951), 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 23:44:23,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4609 states to 4609 states and 4951 transitions. [2024-10-10 23:44:23,915 INFO L78 Accepts]: Start accepts. Automaton has 4609 states and 4951 transitions. Word has length 475 [2024-10-10 23:44:23,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:44:23,916 INFO L471 AbstractCegarLoop]: Abstraction has 4609 states and 4951 transitions. [2024-10-10 23:44:23,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 56.285714285714285) internal successors, (394), 6 states have internal predecessors, (394), 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 23:44:23,916 INFO L276 IsEmpty]: Start isEmpty. Operand 4609 states and 4951 transitions. [2024-10-10 23:44:23,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 504 [2024-10-10 23:44:23,925 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:44:23,926 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:44:23,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-10 23:44:23,926 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:44:23,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:44:23,927 INFO L85 PathProgramCache]: Analyzing trace with hash 135323102, now seen corresponding path program 1 times [2024-10-10 23:44:23,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:44:23,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161845368] [2024-10-10 23:44:23,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:44:23,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:44:24,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:44:24,324 INFO L134 CoverageAnalysis]: Checked inductivity of 437 backedges. 313 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-10-10 23:44:24,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:44:24,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161845368] [2024-10-10 23:44:24,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161845368] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:44:24,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:44:24,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:44:24,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657954274] [2024-10-10 23:44:24,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:44:24,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:44:24,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:44:24,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:44:24,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:44:24,328 INFO L87 Difference]: Start difference. First operand 4609 states and 4951 transitions. Second operand has 3 states, 3 states have (on average 126.66666666666667) internal successors, (380), 3 states have internal predecessors, (380), 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 23:44:25,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:44:25,183 INFO L93 Difference]: Finished difference Result 11191 states and 12125 transitions. [2024-10-10 23:44:25,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:44:25,186 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 126.66666666666667) internal successors, (380), 3 states have internal predecessors, (380), 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 503 [2024-10-10 23:44:25,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:44:25,211 INFO L225 Difference]: With dead ends: 11191 [2024-10-10 23:44:25,211 INFO L226 Difference]: Without dead ends: 6912 [2024-10-10 23:44:25,219 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 23:44:25,222 INFO L432 NwaCegarLoop]: 426 mSDtfsCounter, 219 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 764 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 865 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 764 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-10 23:44:25,222 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 431 Invalid, 865 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 764 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-10 23:44:25,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6912 states. [2024-10-10 23:44:25,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6912 to 6583. [2024-10-10 23:44:25,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6583 states, 6582 states have (on average 1.0589486478274082) internal successors, (6970), 6582 states have internal predecessors, (6970), 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 23:44:25,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6583 states to 6583 states and 6970 transitions. [2024-10-10 23:44:25,344 INFO L78 Accepts]: Start accepts. Automaton has 6583 states and 6970 transitions. Word has length 503 [2024-10-10 23:44:25,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:44:25,345 INFO L471 AbstractCegarLoop]: Abstraction has 6583 states and 6970 transitions. [2024-10-10 23:44:25,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 126.66666666666667) internal successors, (380), 3 states have internal predecessors, (380), 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 23:44:25,346 INFO L276 IsEmpty]: Start isEmpty. Operand 6583 states and 6970 transitions. [2024-10-10 23:44:25,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 567 [2024-10-10 23:44:25,354 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:44:25,355 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:44:25,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-10 23:44:25,355 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:44:25,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:44:25,356 INFO L85 PathProgramCache]: Analyzing trace with hash 1437519312, now seen corresponding path program 1 times [2024-10-10 23:44:25,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:44:25,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54698246] [2024-10-10 23:44:25,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:44:25,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:44:25,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:44:25,798 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 498 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-10-10 23:44:25,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:44:25,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54698246] [2024-10-10 23:44:25,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54698246] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:44:25,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:44:25,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:44:25,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328126443] [2024-10-10 23:44:25,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:44:25,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:44:25,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:44:25,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:44:25,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:44:25,805 INFO L87 Difference]: Start difference. First operand 6583 states and 6970 transitions. Second operand has 3 states, 3 states have (on average 178.66666666666666) internal successors, (536), 3 states have internal predecessors, (536), 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 23:44:26,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:44:26,557 INFO L93 Difference]: Finished difference Result 15139 states and 16149 transitions. [2024-10-10 23:44:26,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:44:26,558 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 178.66666666666666) internal successors, (536), 3 states have internal predecessors, (536), 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 566 [2024-10-10 23:44:26,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:44:26,575 INFO L225 Difference]: With dead ends: 15139 [2024-10-10 23:44:26,575 INFO L226 Difference]: Without dead ends: 8886 [2024-10-10 23:44:26,583 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 23:44:26,584 INFO L432 NwaCegarLoop]: 412 mSDtfsCounter, 176 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 769 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 863 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 769 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-10 23:44:26,584 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 417 Invalid, 863 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 769 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-10 23:44:26,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8886 states. [2024-10-10 23:44:26,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8886 to 8228. [2024-10-10 23:44:26,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8228 states, 8227 states have (on average 1.0550625987601798) internal successors, (8680), 8227 states have internal predecessors, (8680), 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 23:44:26,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8228 states to 8228 states and 8680 transitions. [2024-10-10 23:44:26,693 INFO L78 Accepts]: Start accepts. Automaton has 8228 states and 8680 transitions. Word has length 566 [2024-10-10 23:44:26,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:44:26,694 INFO L471 AbstractCegarLoop]: Abstraction has 8228 states and 8680 transitions. [2024-10-10 23:44:26,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 178.66666666666666) internal successors, (536), 3 states have internal predecessors, (536), 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 23:44:26,695 INFO L276 IsEmpty]: Start isEmpty. Operand 8228 states and 8680 transitions. [2024-10-10 23:44:26,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 865 [2024-10-10 23:44:26,708 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:44:26,709 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-10 23:44:26,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-10 23:44:26,709 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:44:26,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:44:26,710 INFO L85 PathProgramCache]: Analyzing trace with hash -1163916121, now seen corresponding path program 1 times [2024-10-10 23:44:26,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:44:26,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151018183] [2024-10-10 23:44:26,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:44:26,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:44:26,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:44:27,493 INFO L134 CoverageAnalysis]: Checked inductivity of 1351 backedges. 947 proven. 0 refuted. 0 times theorem prover too weak. 404 trivial. 0 not checked. [2024-10-10 23:44:27,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:44:27,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151018183] [2024-10-10 23:44:27,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151018183] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:44:27,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:44:27,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:44:27,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140815681] [2024-10-10 23:44:27,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:44:27,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:44:27,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:44:27,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:44:27,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:44:27,496 INFO L87 Difference]: Start difference. First operand 8228 states and 8680 transitions. Second operand has 3 states, 3 states have (on average 176.0) internal successors, (528), 3 states have internal predecessors, (528), 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 23:44:28,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:44:28,252 INFO L93 Difference]: Finished difference Result 18758 states and 19923 transitions. [2024-10-10 23:44:28,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:44:28,253 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 176.0) internal successors, (528), 3 states have internal predecessors, (528), 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 864 [2024-10-10 23:44:28,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:44:28,271 INFO L225 Difference]: With dead ends: 18758 [2024-10-10 23:44:28,271 INFO L226 Difference]: Without dead ends: 10860 [2024-10-10 23:44:28,280 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 23:44:28,281 INFO L432 NwaCegarLoop]: 434 mSDtfsCounter, 193 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 780 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 878 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 780 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-10 23:44:28,282 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 438 Invalid, 878 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 780 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-10 23:44:28,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10860 states. [2024-10-10 23:44:28,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10860 to 10202. [2024-10-10 23:44:28,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10202 states, 10201 states have (on average 1.0503872169395156) internal successors, (10715), 10201 states have internal predecessors, (10715), 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 23:44:28,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10202 states to 10202 states and 10715 transitions. [2024-10-10 23:44:28,449 INFO L78 Accepts]: Start accepts. Automaton has 10202 states and 10715 transitions. Word has length 864 [2024-10-10 23:44:28,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:44:28,451 INFO L471 AbstractCegarLoop]: Abstraction has 10202 states and 10715 transitions. [2024-10-10 23:44:28,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 176.0) internal successors, (528), 3 states have internal predecessors, (528), 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 23:44:28,451 INFO L276 IsEmpty]: Start isEmpty. Operand 10202 states and 10715 transitions. [2024-10-10 23:44:28,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 890 [2024-10-10 23:44:28,466 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:44:28,467 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-10 23:44:28,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-10 23:44:28,467 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:44:28,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:44:28,468 INFO L85 PathProgramCache]: Analyzing trace with hash -1940265727, now seen corresponding path program 1 times [2024-10-10 23:44:28,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:44:28,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318326824] [2024-10-10 23:44:28,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:44:28,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:44:28,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:44:29,258 INFO L134 CoverageAnalysis]: Checked inductivity of 1451 backedges. 627 proven. 0 refuted. 0 times theorem prover too weak. 824 trivial. 0 not checked. [2024-10-10 23:44:29,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:44:29,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318326824] [2024-10-10 23:44:29,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318326824] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:44:29,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:44:29,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:44:29,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089836363] [2024-10-10 23:44:29,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:44:29,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:44:29,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:44:29,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:44:29,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:44:29,261 INFO L87 Difference]: Start difference. First operand 10202 states and 10715 transitions. Second operand has 3 states, 3 states have (on average 129.66666666666666) internal successors, (389), 3 states have internal predecessors, (389), 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 23:44:29,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:44:29,990 INFO L93 Difference]: Finished difference Result 25009 states and 26381 transitions. [2024-10-10 23:44:29,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:44:29,991 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 129.66666666666666) internal successors, (389), 3 states have internal predecessors, (389), 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 889 [2024-10-10 23:44:29,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:44:30,009 INFO L225 Difference]: With dead ends: 25009 [2024-10-10 23:44:30,010 INFO L226 Difference]: Without dead ends: 13492 [2024-10-10 23:44:30,023 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 23:44:30,024 INFO L432 NwaCegarLoop]: 422 mSDtfsCounter, 198 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 748 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 841 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 748 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-10 23:44:30,024 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 427 Invalid, 841 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 748 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-10 23:44:30,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13492 states. [2024-10-10 23:44:30,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13492 to 13163. [2024-10-10 23:44:30,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13163 states, 13162 states have (on average 1.041862938763106) internal successors, (13713), 13162 states have internal predecessors, (13713), 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 23:44:30,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13163 states to 13163 states and 13713 transitions. [2024-10-10 23:44:30,185 INFO L78 Accepts]: Start accepts. Automaton has 13163 states and 13713 transitions. Word has length 889 [2024-10-10 23:44:30,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:44:30,187 INFO L471 AbstractCegarLoop]: Abstraction has 13163 states and 13713 transitions. [2024-10-10 23:44:30,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 129.66666666666666) internal successors, (389), 3 states have internal predecessors, (389), 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 23:44:30,187 INFO L276 IsEmpty]: Start isEmpty. Operand 13163 states and 13713 transitions. [2024-10-10 23:44:30,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1220 [2024-10-10 23:44:30,213 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:44:30,213 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:44:30,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-10 23:44:30,214 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:44:30,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:44:30,214 INFO L85 PathProgramCache]: Analyzing trace with hash 1420607651, now seen corresponding path program 1 times [2024-10-10 23:44:30,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:44:30,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810793991] [2024-10-10 23:44:30,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:44:30,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:44:30,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:44:31,065 INFO L134 CoverageAnalysis]: Checked inductivity of 2818 backedges. 1971 proven. 0 refuted. 0 times theorem prover too weak. 847 trivial. 0 not checked. [2024-10-10 23:44:31,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:44:31,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810793991] [2024-10-10 23:44:31,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810793991] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:44:31,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:44:31,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:44:31,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619157495] [2024-10-10 23:44:31,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:44:31,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:44:31,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:44:31,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:44:31,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:44:31,069 INFO L87 Difference]: Start difference. First operand 13163 states and 13713 transitions. Second operand has 3 states, 3 states have (on average 203.0) internal successors, (609), 3 states have internal predecessors, (609), 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 23:44:31,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:44:31,945 INFO L93 Difference]: Finished difference Result 25996 states and 27094 transitions. [2024-10-10 23:44:31,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:44:31,946 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 203.0) internal successors, (609), 3 states have internal predecessors, (609), 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 1219 [2024-10-10 23:44:31,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:44:31,972 INFO L225 Difference]: With dead ends: 25996 [2024-10-10 23:44:31,972 INFO L226 Difference]: Without dead ends: 13163 [2024-10-10 23:44:31,987 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 23:44:31,988 INFO L432 NwaCegarLoop]: 421 mSDtfsCounter, 220 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 752 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 847 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 752 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-10 23:44:31,988 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 426 Invalid, 847 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 752 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-10 23:44:31,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13163 states. [2024-10-10 23:44:32,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13163 to 12176. [2024-10-10 23:44:32,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12176 states, 12175 states have (on average 1.0259548254620123) internal successors, (12491), 12175 states have internal predecessors, (12491), 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 23:44:32,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12176 states to 12176 states and 12491 transitions. [2024-10-10 23:44:32,177 INFO L78 Accepts]: Start accepts. Automaton has 12176 states and 12491 transitions. Word has length 1219 [2024-10-10 23:44:32,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:44:32,178 INFO L471 AbstractCegarLoop]: Abstraction has 12176 states and 12491 transitions. [2024-10-10 23:44:32,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 203.0) internal successors, (609), 3 states have internal predecessors, (609), 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 23:44:32,179 INFO L276 IsEmpty]: Start isEmpty. Operand 12176 states and 12491 transitions. [2024-10-10 23:44:32,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1221 [2024-10-10 23:44:32,214 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:44:32,215 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:44:32,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-10 23:44:32,215 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:44:32,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:44:32,216 INFO L85 PathProgramCache]: Analyzing trace with hash 193806762, now seen corresponding path program 1 times [2024-10-10 23:44:32,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:44:32,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217101486] [2024-10-10 23:44:32,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:44:32,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:44:32,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:44:33,145 INFO L134 CoverageAnalysis]: Checked inductivity of 2824 backedges. 1011 proven. 0 refuted. 0 times theorem prover too weak. 1813 trivial. 0 not checked. [2024-10-10 23:44:33,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:44:33,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217101486] [2024-10-10 23:44:33,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217101486] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:44:33,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:44:33,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:44:33,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109469665] [2024-10-10 23:44:33,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:44:33,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:44:33,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:44:33,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:44:33,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:44:33,151 INFO L87 Difference]: Start difference. First operand 12176 states and 12491 transitions. Second operand has 3 states, 3 states have (on average 151.66666666666666) internal successors, (455), 3 states have internal predecessors, (455), 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 23:44:33,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:44:33,834 INFO L93 Difference]: Finished difference Result 26323 states and 27059 transitions. [2024-10-10 23:44:33,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:44:33,834 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 151.66666666666666) internal successors, (455), 3 states have internal predecessors, (455), 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 1220 [2024-10-10 23:44:33,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:44:33,836 INFO L225 Difference]: With dead ends: 26323 [2024-10-10 23:44:33,836 INFO L226 Difference]: Without dead ends: 0 [2024-10-10 23:44:33,849 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 23:44:33,850 INFO L432 NwaCegarLoop]: 402 mSDtfsCounter, 170 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 756 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 820 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 756 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-10 23:44:33,850 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 406 Invalid, 820 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 756 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-10 23:44:33,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-10 23:44:33,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-10 23:44:33,852 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 23:44:33,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-10 23:44:33,852 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1220 [2024-10-10 23:44:33,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:44:33,853 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-10 23:44:33,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 151.66666666666666) internal successors, (455), 3 states have internal predecessors, (455), 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 23:44:33,853 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-10 23:44:33,853 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-10 23:44:33,857 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-10 23:44:33,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-10 23:44:33,860 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:44:33,862 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-10 23:44:34,338 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-10 23:44:34,357 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.10 11:44:34 BoogieIcfgContainer [2024-10-10 23:44:34,357 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-10 23:44:34,358 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-10 23:44:34,358 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-10 23:44:34,358 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-10 23:44:34,359 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:44:09" (3/4) ... [2024-10-10 23:44:34,361 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-10 23:44:34,390 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2024-10-10 23:44:34,392 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-10-10 23:44:34,394 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-10 23:44:34,396 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-10 23:44:34,618 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-10 23:44:34,618 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-10 23:44:34,618 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-10 23:44:34,619 INFO L158 Benchmark]: Toolchain (without parser) took 28462.80ms. Allocated memory was 146.8MB in the beginning and 979.4MB in the end (delta: 832.6MB). Free memory was 85.7MB in the beginning and 513.0MB in the end (delta: -427.3MB). Peak memory consumption was 404.9MB. Max. memory is 16.1GB. [2024-10-10 23:44:34,619 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 100.7MB. Free memory is still 54.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-10 23:44:34,619 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1031.07ms. Allocated memory was 146.8MB in the beginning and 192.9MB in the end (delta: 46.1MB). Free memory was 85.4MB in the beginning and 153.2MB in the end (delta: -67.8MB). Peak memory consumption was 24.4MB. Max. memory is 16.1GB. [2024-10-10 23:44:34,620 INFO L158 Benchmark]: Boogie Procedure Inliner took 170.11ms. Allocated memory is still 192.9MB. Free memory was 153.2MB in the beginning and 128.5MB in the end (delta: 24.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-10-10 23:44:34,620 INFO L158 Benchmark]: Boogie Preprocessor took 257.61ms. Allocated memory is still 192.9MB. Free memory was 128.5MB in the beginning and 139.3MB in the end (delta: -10.9MB). Peak memory consumption was 49.6MB. Max. memory is 16.1GB. [2024-10-10 23:44:34,620 INFO L158 Benchmark]: RCFGBuilder took 2187.68ms. Allocated memory was 192.9MB in the beginning and 327.2MB in the end (delta: 134.2MB). Free memory was 139.2MB in the beginning and 184.4MB in the end (delta: -45.2MB). Peak memory consumption was 93.1MB. Max. memory is 16.1GB. [2024-10-10 23:44:34,620 INFO L158 Benchmark]: TraceAbstraction took 24546.32ms. Allocated memory was 327.2MB in the beginning and 979.4MB in the end (delta: 652.2MB). Free memory was 183.4MB in the beginning and 539.2MB in the end (delta: -355.8MB). Peak memory consumption was 297.4MB. Max. memory is 16.1GB. [2024-10-10 23:44:34,621 INFO L158 Benchmark]: Witness Printer took 260.82ms. Allocated memory is still 979.4MB. Free memory was 539.2MB in the beginning and 513.0MB in the end (delta: 26.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-10-10 23:44:34,625 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.16ms. Allocated memory is still 100.7MB. Free memory is still 54.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1031.07ms. Allocated memory was 146.8MB in the beginning and 192.9MB in the end (delta: 46.1MB). Free memory was 85.4MB in the beginning and 153.2MB in the end (delta: -67.8MB). Peak memory consumption was 24.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 170.11ms. Allocated memory is still 192.9MB. Free memory was 153.2MB in the beginning and 128.5MB in the end (delta: 24.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 257.61ms. Allocated memory is still 192.9MB. Free memory was 128.5MB in the beginning and 139.3MB in the end (delta: -10.9MB). Peak memory consumption was 49.6MB. Max. memory is 16.1GB. * RCFGBuilder took 2187.68ms. Allocated memory was 192.9MB in the beginning and 327.2MB in the end (delta: 134.2MB). Free memory was 139.2MB in the beginning and 184.4MB in the end (delta: -45.2MB). Peak memory consumption was 93.1MB. Max. memory is 16.1GB. * TraceAbstraction took 24546.32ms. Allocated memory was 327.2MB in the beginning and 979.4MB in the end (delta: 652.2MB). Free memory was 183.4MB in the beginning and 539.2MB in the end (delta: -355.8MB). Peak memory consumption was 297.4MB. Max. memory is 16.1GB. * Witness Printer took 260.82ms. Allocated memory is still 979.4MB. Free memory was 539.2MB in the beginning and 513.0MB in the end (delta: 26.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 116]: 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, 334 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 24.0s, OverallIterations: 14, TraceHistogramMax: 8, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 15.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3151 SdHoareTripleChecker+Valid, 14.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3151 mSDsluCounter, 4470 SdHoareTripleChecker+Invalid, 11.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 142 mSDsCounter, 2241 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 12913 IncrementalHoareTripleChecker+Invalid, 15154 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2241 mSolverCounterUnsat, 4328 mSDtfsCounter, 12913 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 40 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=13163occurred in iteration=12, InterpolantAutomatonStates: 46, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.2s AutomataMinimizationTime, 14 MinimizatonAttempts, 3292 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 5.9s InterpolantComputationTime, 6946 NumberOfCodeBlocks, 6946 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 6932 ConstructedInterpolants, 0 QuantifiedInterpolants, 14483 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 10537/10537 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: 1783]: Loop Invariant Derived loop invariant: (((((((((((((((a16 == 9) && (7 == a12)) || ((a12 == 9) && (a16 == 9))) || ((a16 == 8) && (a15 <= 3))) || ((a12 == 6) && (a16 <= 11))) || ((a16 == 8) && (7 == a12))) || ((5 == a12) && (a15 == 3))) || ((a15 <= 3) && (7 == a12))) || ((a15 <= 3) && (a12 == 6))) || ((a16 == 9) && (a12 == 8))) || ((a16 == 8) && (a12 == 8))) || ((a15 <= 3) && (a12 == 8))) || ((a12 == 9) && (a16 == 8))) || ((a12 <= 5) && (a16 <= 11))) || (((a12 == 9) && (a15 <= 3)) && (11 <= a16))) RESULT: Ultimate proved your program to be correct! [2024-10-10 23:44:34,658 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