./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/Problem11_label19.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label19.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8aa577dc4c04bf53d7d29751ed362e9afcf94d1db611db106e7ed08797634e47 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-23 21:02:05,260 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-23 21:02:05,356 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-23 21:02:05,365 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-23 21:02:05,369 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-23 21:02:05,390 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-23 21:02:05,390 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-23 21:02:05,391 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-23 21:02:05,391 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-23 21:02:05,391 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-23 21:02:05,391 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-23 21:02:05,392 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-23 21:02:05,392 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-23 21:02:05,393 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-23 21:02:05,394 INFO L153 SettingsManager]: * Use SBE=true [2024-10-23 21:02:05,394 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-23 21:02:05,395 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-23 21:02:05,395 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-23 21:02:05,395 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-23 21:02:05,397 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-23 21:02:05,397 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-23 21:02:05,398 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-23 21:02:05,398 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-23 21:02:05,398 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-23 21:02:05,398 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-23 21:02:05,398 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-23 21:02:05,398 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-23 21:02:05,399 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-23 21:02:05,399 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-23 21:02:05,399 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-23 21:02:05,399 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-23 21:02:05,399 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-23 21:02:05,399 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-23 21:02:05,399 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-23 21:02:05,400 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-23 21:02:05,400 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-23 21:02:05,400 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-23 21:02:05,400 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-23 21:02:05,400 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-23 21:02:05,400 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-23 21:02:05,400 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-23 21:02:05,402 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-23 21:02:05,402 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8aa577dc4c04bf53d7d29751ed362e9afcf94d1db611db106e7ed08797634e47 [2024-10-23 21:02:05,616 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-23 21:02:05,636 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-23 21:02:05,638 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-23 21:02:05,639 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-23 21:02:05,639 INFO L274 PluginConnector]: CDTParser initialized [2024-10-23 21:02:05,640 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label19.c [2024-10-23 21:02:07,022 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-23 21:02:07,319 INFO L384 CDTParser]: Found 1 translation units. [2024-10-23 21:02:07,320 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label19.c [2024-10-23 21:02:07,332 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dab7702f5/aad864f1253b4c5c8611f4ee56e1feed/FLAGf6341d9be [2024-10-23 21:02:07,597 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dab7702f5/aad864f1253b4c5c8611f4ee56e1feed [2024-10-23 21:02:07,599 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-23 21:02:07,601 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-23 21:02:07,602 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-23 21:02:07,602 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-23 21:02:07,606 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-23 21:02:07,607 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 09:02:07" (1/1) ... [2024-10-23 21:02:07,608 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3dc30eec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:02:07, skipping insertion in model container [2024-10-23 21:02:07,608 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 09:02:07" (1/1) ... [2024-10-23 21:02:07,646 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-23 21:02:07,816 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/Problem11_label19.c[8142,8155] [2024-10-23 21:02:08,067 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-23 21:02:08,075 INFO L200 MainTranslator]: Completed pre-run [2024-10-23 21:02:08,102 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/Problem11_label19.c[8142,8155] [2024-10-23 21:02:08,181 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-23 21:02:08,198 INFO L204 MainTranslator]: Completed translation [2024-10-23 21:02:08,198 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:02:08 WrapperNode [2024-10-23 21:02:08,198 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-23 21:02:08,199 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-23 21:02:08,200 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-23 21:02:08,200 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-23 21:02:08,206 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:02:08" (1/1) ... [2024-10-23 21:02:08,235 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:02:08" (1/1) ... [2024-10-23 21:02:08,309 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1000 [2024-10-23 21:02:08,310 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-23 21:02:08,310 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-23 21:02:08,310 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-23 21:02:08,311 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-23 21:02:08,319 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:02:08" (1/1) ... [2024-10-23 21:02:08,319 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:02:08" (1/1) ... [2024-10-23 21:02:08,329 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:02:08" (1/1) ... [2024-10-23 21:02:08,370 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-23 21:02:08,371 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:02:08" (1/1) ... [2024-10-23 21:02:08,371 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:02:08" (1/1) ... [2024-10-23 21:02:08,407 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:02:08" (1/1) ... [2024-10-23 21:02:08,418 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:02:08" (1/1) ... [2024-10-23 21:02:08,434 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:02:08" (1/1) ... [2024-10-23 21:02:08,440 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:02:08" (1/1) ... [2024-10-23 21:02:08,452 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-23 21:02:08,453 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-23 21:02:08,453 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-23 21:02:08,454 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-23 21:02:08,454 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:02:08" (1/1) ... [2024-10-23 21:02:08,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-23 21:02:08,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-23 21:02:08,483 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-23 21:02:08,485 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-23 21:02:08,522 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-23 21:02:08,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-23 21:02:08,523 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-23 21:02:08,523 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-23 21:02:08,581 INFO L238 CfgBuilder]: Building ICFG [2024-10-23 21:02:08,583 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-23 21:02:09,743 INFO L? ?]: Removed 129 outVars from TransFormulas that were not future-live. [2024-10-23 21:02:09,743 INFO L287 CfgBuilder]: Performing block encoding [2024-10-23 21:02:09,783 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-23 21:02:09,784 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-23 21:02:09,784 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 09:02:09 BoogieIcfgContainer [2024-10-23 21:02:09,784 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-23 21:02:09,785 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-23 21:02:09,786 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-23 21:02:09,788 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-23 21:02:09,788 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.10 09:02:07" (1/3) ... [2024-10-23 21:02:09,789 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a045286 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 09:02:09, skipping insertion in model container [2024-10-23 21:02:09,789 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:02:08" (2/3) ... [2024-10-23 21:02:09,789 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a045286 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 09:02:09, skipping insertion in model container [2024-10-23 21:02:09,789 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 09:02:09" (3/3) ... [2024-10-23 21:02:09,790 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem11_label19.c [2024-10-23 21:02:09,803 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-23 21:02:09,803 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-23 21:02:09,851 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-23 21:02:09,856 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;@19c7ed24, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-23 21:02:09,857 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-23 21:02:09,861 INFO L276 IsEmpty]: Start isEmpty. Operand has 221 states, 219 states have (on average 1.917808219178082) internal successors, (420), 220 states have internal predecessors, (420), 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-23 21:02:09,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-23 21:02:09,867 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:02:09,867 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 21:02:09,868 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:02:09,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:02:09,872 INFO L85 PathProgramCache]: Analyzing trace with hash -1041092486, now seen corresponding path program 1 times [2024-10-23 21:02:09,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:02:09,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726441980] [2024-10-23 21:02:09,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:02:09,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:02:09,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:02:10,046 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-23 21:02:10,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:02:10,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726441980] [2024-10-23 21:02:10,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726441980] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:02:10,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:02:10,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-23 21:02:10,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902923380] [2024-10-23 21:02:10,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:02:10,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-23 21:02:10,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:02:10,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-23 21:02:10,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-23 21:02:10,089 INFO L87 Difference]: Start difference. First operand has 221 states, 219 states have (on average 1.917808219178082) internal successors, (420), 220 states have internal predecessors, (420), 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 27.5) internal successors, (55), 2 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:02:10,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:02:10,139 INFO L93 Difference]: Finished difference Result 441 states and 839 transitions. [2024-10-23 21:02:10,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-23 21:02:10,146 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2024-10-23 21:02:10,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:02:10,155 INFO L225 Difference]: With dead ends: 441 [2024-10-23 21:02:10,155 INFO L226 Difference]: Without dead ends: 219 [2024-10-23 21:02:10,159 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-23 21:02:10,161 INFO L432 NwaCegarLoop]: 355 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, 355 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-23 21:02:10,162 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 355 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-23 21:02:10,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2024-10-23 21:02:10,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 219. [2024-10-23 21:02:10,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 218 states have (on average 1.628440366972477) internal successors, (355), 218 states have internal predecessors, (355), 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-23 21:02:10,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 355 transitions. [2024-10-23 21:02:10,203 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 355 transitions. Word has length 55 [2024-10-23 21:02:10,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:02:10,206 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 355 transitions. [2024-10-23 21:02:10,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:02:10,207 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 355 transitions. [2024-10-23 21:02:10,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-23 21:02:10,208 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:02:10,208 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 21:02:10,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-23 21:02:10,208 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:02:10,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:02:10,208 INFO L85 PathProgramCache]: Analyzing trace with hash -68007116, now seen corresponding path program 1 times [2024-10-23 21:02:10,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:02:10,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119768479] [2024-10-23 21:02:10,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:02:10,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:02:10,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:02:10,436 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-23 21:02:10,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:02:10,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119768479] [2024-10-23 21:02:10,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119768479] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:02:10,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:02:10,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-23 21:02:10,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441840152] [2024-10-23 21:02:10,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:02:10,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 21:02:10,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:02:10,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 21:02:10,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:02:10,442 INFO L87 Difference]: Start difference. First operand 219 states and 355 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 2 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:02:11,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:02:11,247 INFO L93 Difference]: Finished difference Result 630 states and 1026 transitions. [2024-10-23 21:02:11,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 21:02:11,248 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 2 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2024-10-23 21:02:11,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:02:11,251 INFO L225 Difference]: With dead ends: 630 [2024-10-23 21:02:11,251 INFO L226 Difference]: Without dead ends: 412 [2024-10-23 21:02:11,252 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-23 21:02:11,253 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 168 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 536 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 536 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-23 21:02:11,253 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 155 Invalid, 634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 536 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-23 21:02:11,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2024-10-23 21:02:11,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 412. [2024-10-23 21:02:11,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 412 states, 411 states have (on average 1.4549878345498783) internal successors, (598), 411 states have internal predecessors, (598), 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-23 21:02:11,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 598 transitions. [2024-10-23 21:02:11,270 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 598 transitions. Word has length 55 [2024-10-23 21:02:11,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:02:11,270 INFO L471 AbstractCegarLoop]: Abstraction has 412 states and 598 transitions. [2024-10-23 21:02:11,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 2 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:02:11,271 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 598 transitions. [2024-10-23 21:02:11,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-10-23 21:02:11,273 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:02:11,274 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 21:02:11,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-23 21:02:11,274 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:02:11,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:02:11,275 INFO L85 PathProgramCache]: Analyzing trace with hash 1462231532, now seen corresponding path program 1 times [2024-10-23 21:02:11,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:02:11,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842552049] [2024-10-23 21:02:11,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:02:11,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:02:11,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:02:11,462 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-23 21:02:11,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:02:11,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842552049] [2024-10-23 21:02:11,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842552049] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:02:11,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:02:11,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-23 21:02:11,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647884482] [2024-10-23 21:02:11,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:02:11,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 21:02:11,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:02:11,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 21:02:11,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:02:11,464 INFO L87 Difference]: Start difference. First operand 412 states and 598 transitions. Second operand has 3 states, 3 states have (on average 41.0) internal successors, (123), 2 states have internal predecessors, (123), 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-23 21:02:12,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:02:12,060 INFO L93 Difference]: Finished difference Result 1210 states and 1762 transitions. [2024-10-23 21:02:12,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 21:02:12,061 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 2 states have internal predecessors, (123), 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 123 [2024-10-23 21:02:12,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:02:12,063 INFO L225 Difference]: With dead ends: 1210 [2024-10-23 21:02:12,064 INFO L226 Difference]: Without dead ends: 799 [2024-10-23 21:02:12,065 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-23 21:02:12,065 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 144 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 524 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 524 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-23 21:02:12,066 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 116 Invalid, 672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 524 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-23 21:02:12,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 799 states. [2024-10-23 21:02:12,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 799 to 788. [2024-10-23 21:02:12,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 788 states, 787 states have (on average 1.3761118170266835) internal successors, (1083), 787 states have internal predecessors, (1083), 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-23 21:02:12,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 1083 transitions. [2024-10-23 21:02:12,084 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 1083 transitions. Word has length 123 [2024-10-23 21:02:12,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:02:12,084 INFO L471 AbstractCegarLoop]: Abstraction has 788 states and 1083 transitions. [2024-10-23 21:02:12,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 2 states have internal predecessors, (123), 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-23 21:02:12,084 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 1083 transitions. [2024-10-23 21:02:12,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-10-23 21:02:12,087 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:02:12,087 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 21:02:12,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-23 21:02:12,088 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:02:12,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:02:12,088 INFO L85 PathProgramCache]: Analyzing trace with hash 2061888554, now seen corresponding path program 1 times [2024-10-23 21:02:12,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:02:12,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650006780] [2024-10-23 21:02:12,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:02:12,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:02:12,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:02:12,331 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-23 21:02:12,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:02:12,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650006780] [2024-10-23 21:02:12,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650006780] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:02:12,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:02:12,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-23 21:02:12,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591608529] [2024-10-23 21:02:12,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:02:12,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 21:02:12,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:02:12,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 21:02:12,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:02:12,333 INFO L87 Difference]: Start difference. First operand 788 states and 1083 transitions. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 2 states have internal predecessors, (124), 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-23 21:02:12,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:02:12,983 INFO L93 Difference]: Finished difference Result 1944 states and 2613 transitions. [2024-10-23 21:02:12,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 21:02:12,984 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 2 states have internal predecessors, (124), 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 124 [2024-10-23 21:02:12,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:02:12,987 INFO L225 Difference]: With dead ends: 1944 [2024-10-23 21:02:12,987 INFO L226 Difference]: Without dead ends: 1157 [2024-10-23 21:02:12,988 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-23 21:02:12,989 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 120 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 532 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-23 21:02:12,990 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 188 Invalid, 569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 532 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-23 21:02:12,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1157 states. [2024-10-23 21:02:13,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1157 to 1156. [2024-10-23 21:02:13,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1156 states, 1155 states have (on average 1.2718614718614718) internal successors, (1469), 1155 states have internal predecessors, (1469), 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-23 21:02:13,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1156 states to 1156 states and 1469 transitions. [2024-10-23 21:02:13,006 INFO L78 Accepts]: Start accepts. Automaton has 1156 states and 1469 transitions. Word has length 124 [2024-10-23 21:02:13,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:02:13,007 INFO L471 AbstractCegarLoop]: Abstraction has 1156 states and 1469 transitions. [2024-10-23 21:02:13,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 2 states have internal predecessors, (124), 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-23 21:02:13,007 INFO L276 IsEmpty]: Start isEmpty. Operand 1156 states and 1469 transitions. [2024-10-23 21:02:13,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2024-10-23 21:02:13,010 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:02:13,010 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-23 21:02:13,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-23 21:02:13,011 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:02:13,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:02:13,011 INFO L85 PathProgramCache]: Analyzing trace with hash -479133243, now seen corresponding path program 1 times [2024-10-23 21:02:13,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:02:13,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935746537] [2024-10-23 21:02:13,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:02:13,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:02:13,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:02:13,179 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-23 21:02:13,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:02:13,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935746537] [2024-10-23 21:02:13,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935746537] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:02:13,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:02:13,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 21:02:13,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148114137] [2024-10-23 21:02:13,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:02:13,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 21:02:13,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:02:13,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 21:02:13,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:02:13,181 INFO L87 Difference]: Start difference. First operand 1156 states and 1469 transitions. Second operand has 3 states, 3 states have (on average 60.666666666666664) internal successors, (182), 3 states have internal predecessors, (182), 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-23 21:02:13,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:02:13,932 INFO L93 Difference]: Finished difference Result 2518 states and 3351 transitions. [2024-10-23 21:02:13,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 21:02:13,933 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 60.666666666666664) internal successors, (182), 3 states have internal predecessors, (182), 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 182 [2024-10-23 21:02:13,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:02:13,937 INFO L225 Difference]: With dead ends: 2518 [2024-10-23 21:02:13,937 INFO L226 Difference]: Without dead ends: 1547 [2024-10-23 21:02:13,938 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-23 21:02:13,938 INFO L432 NwaCegarLoop]: 288 mSDtfsCounter, 179 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 584 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 635 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-23 21:02:13,939 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 319 Invalid, 635 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 584 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-23 21:02:13,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1547 states. [2024-10-23 21:02:13,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1547 to 1544. [2024-10-23 21:02:13,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1544 states, 1543 states have (on average 1.2942320155541154) internal successors, (1997), 1543 states have internal predecessors, (1997), 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-23 21:02:13,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1544 states to 1544 states and 1997 transitions. [2024-10-23 21:02:13,956 INFO L78 Accepts]: Start accepts. Automaton has 1544 states and 1997 transitions. Word has length 182 [2024-10-23 21:02:13,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:02:13,957 INFO L471 AbstractCegarLoop]: Abstraction has 1544 states and 1997 transitions. [2024-10-23 21:02:13,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 60.666666666666664) internal successors, (182), 3 states have internal predecessors, (182), 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-23 21:02:13,957 INFO L276 IsEmpty]: Start isEmpty. Operand 1544 states and 1997 transitions. [2024-10-23 21:02:13,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2024-10-23 21:02:13,959 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:02:13,959 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 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-23 21:02:13,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-23 21:02:13,959 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:02:13,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:02:13,962 INFO L85 PathProgramCache]: Analyzing trace with hash 424628840, now seen corresponding path program 1 times [2024-10-23 21:02:13,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:02:13,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292218432] [2024-10-23 21:02:13,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:02:13,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:02:13,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:02:14,254 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 174 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-23 21:02:14,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:02:14,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292218432] [2024-10-23 21:02:14,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292218432] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:02:14,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:02:14,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 21:02:14,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716001398] [2024-10-23 21:02:14,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:02:14,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 21:02:14,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:02:14,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 21:02:14,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:02:14,260 INFO L87 Difference]: Start difference. First operand 1544 states and 1997 transitions. Second operand has 3 states, 3 states have (on average 78.33333333333333) internal successors, (235), 3 states have internal predecessors, (235), 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-23 21:02:14,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:02:14,992 INFO L93 Difference]: Finished difference Result 3655 states and 4825 transitions. [2024-10-23 21:02:14,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 21:02:14,997 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 78.33333333333333) internal successors, (235), 3 states have internal predecessors, (235), 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 235 [2024-10-23 21:02:14,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:02:15,002 INFO L225 Difference]: With dead ends: 3655 [2024-10-23 21:02:15,003 INFO L226 Difference]: Without dead ends: 2296 [2024-10-23 21:02:15,004 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-23 21:02:15,005 INFO L432 NwaCegarLoop]: 317 mSDtfsCounter, 136 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 550 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 648 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 550 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-23 21:02:15,006 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 337 Invalid, 648 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 550 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-23 21:02:15,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2296 states. [2024-10-23 21:02:15,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2296 to 2099. [2024-10-23 21:02:15,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2099 states, 2098 states have (on average 1.2707340324118208) internal successors, (2666), 2098 states have internal predecessors, (2666), 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-23 21:02:15,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2099 states to 2099 states and 2666 transitions. [2024-10-23 21:02:15,041 INFO L78 Accepts]: Start accepts. Automaton has 2099 states and 2666 transitions. Word has length 235 [2024-10-23 21:02:15,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:02:15,041 INFO L471 AbstractCegarLoop]: Abstraction has 2099 states and 2666 transitions. [2024-10-23 21:02:15,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 78.33333333333333) internal successors, (235), 3 states have internal predecessors, (235), 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-23 21:02:15,042 INFO L276 IsEmpty]: Start isEmpty. Operand 2099 states and 2666 transitions. [2024-10-23 21:02:15,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2024-10-23 21:02:15,044 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:02:15,045 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-10-23 21:02:15,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-23 21:02:15,045 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:02:15,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:02:15,046 INFO L85 PathProgramCache]: Analyzing trace with hash -39023826, now seen corresponding path program 1 times [2024-10-23 21:02:15,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:02:15,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222349843] [2024-10-23 21:02:15,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:02:15,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:02:15,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:02:15,432 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 175 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-23 21:02:15,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:02:15,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222349843] [2024-10-23 21:02:15,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222349843] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:02:15,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:02:15,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-23 21:02:15,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902977880] [2024-10-23 21:02:15,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:02:15,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-23 21:02:15,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:02:15,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-23 21:02:15,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-23 21:02:15,435 INFO L87 Difference]: Start difference. First operand 2099 states and 2666 transitions. Second operand has 4 states, 4 states have (on average 59.0) internal successors, (236), 4 states have internal predecessors, (236), 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-23 21:02:16,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:02:16,559 INFO L93 Difference]: Finished difference Result 6987 states and 9013 transitions. [2024-10-23 21:02:16,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-23 21:02:16,560 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 59.0) internal successors, (236), 4 states have internal predecessors, (236), 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 236 [2024-10-23 21:02:16,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:02:16,571 INFO L225 Difference]: With dead ends: 6987 [2024-10-23 21:02:16,571 INFO L226 Difference]: Without dead ends: 4889 [2024-10-23 21:02:16,573 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-23 21:02:16,574 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 322 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 1090 mSolverCounterSat, 302 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 322 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 1392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 302 IncrementalHoareTripleChecker+Valid, 1090 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-23 21:02:16,574 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [322 Valid, 68 Invalid, 1392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [302 Valid, 1090 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-23 21:02:16,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4889 states. [2024-10-23 21:02:16,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4889 to 4689. [2024-10-23 21:02:16,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4689 states, 4688 states have (on average 1.251919795221843) internal successors, (5869), 4688 states have internal predecessors, (5869), 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-23 21:02:16,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4689 states to 4689 states and 5869 transitions. [2024-10-23 21:02:16,623 INFO L78 Accepts]: Start accepts. Automaton has 4689 states and 5869 transitions. Word has length 236 [2024-10-23 21:02:16,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:02:16,624 INFO L471 AbstractCegarLoop]: Abstraction has 4689 states and 5869 transitions. [2024-10-23 21:02:16,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 59.0) internal successors, (236), 4 states have internal predecessors, (236), 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-23 21:02:16,624 INFO L276 IsEmpty]: Start isEmpty. Operand 4689 states and 5869 transitions. [2024-10-23 21:02:16,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2024-10-23 21:02:16,653 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:02:16,653 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-10-23 21:02:16,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-23 21:02:16,654 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:02:16,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:02:16,654 INFO L85 PathProgramCache]: Analyzing trace with hash -1425667709, now seen corresponding path program 1 times [2024-10-23 21:02:16,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:02:16,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117949938] [2024-10-23 21:02:16,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:02:16,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:02:16,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:02:16,824 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-10-23 21:02:16,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:02:16,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117949938] [2024-10-23 21:02:16,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117949938] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:02:16,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:02:16,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 21:02:16,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780801558] [2024-10-23 21:02:16,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:02:16,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 21:02:16,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:02:16,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 21:02:16,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:02:16,827 INFO L87 Difference]: Start difference. First operand 4689 states and 5869 transitions. Second operand has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 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-23 21:02:17,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:02:17,431 INFO L93 Difference]: Finished difference Result 10495 states and 13348 transitions. [2024-10-23 21:02:17,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 21:02:17,432 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 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 237 [2024-10-23 21:02:17,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:02:17,445 INFO L225 Difference]: With dead ends: 10495 [2024-10-23 21:02:17,445 INFO L226 Difference]: Without dead ends: 6175 [2024-10-23 21:02:17,449 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-23 21:02:17,450 INFO L432 NwaCegarLoop]: 348 mSDtfsCounter, 141 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 580 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 669 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 580 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-23 21:02:17,450 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 368 Invalid, 669 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 580 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-23 21:02:17,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6175 states. [2024-10-23 21:02:17,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6175 to 5977. [2024-10-23 21:02:17,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5977 states, 5976 states have (on average 1.22975234270415) internal successors, (7349), 5976 states have internal predecessors, (7349), 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-23 21:02:17,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5977 states to 5977 states and 7349 transitions. [2024-10-23 21:02:17,562 INFO L78 Accepts]: Start accepts. Automaton has 5977 states and 7349 transitions. Word has length 237 [2024-10-23 21:02:17,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:02:17,562 INFO L471 AbstractCegarLoop]: Abstraction has 5977 states and 7349 transitions. [2024-10-23 21:02:17,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 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-23 21:02:17,563 INFO L276 IsEmpty]: Start isEmpty. Operand 5977 states and 7349 transitions. [2024-10-23 21:02:17,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2024-10-23 21:02:17,565 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:02:17,565 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-10-23 21:02:17,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-23 21:02:17,566 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:02:17,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:02:17,566 INFO L85 PathProgramCache]: Analyzing trace with hash 1419962307, now seen corresponding path program 1 times [2024-10-23 21:02:17,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:02:17,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119062295] [2024-10-23 21:02:17,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:02:17,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:02:17,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:02:17,769 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-10-23 21:02:17,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:02:17,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119062295] [2024-10-23 21:02:17,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119062295] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:02:17,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:02:17,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 21:02:17,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720353700] [2024-10-23 21:02:17,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:02:17,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 21:02:17,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:02:17,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 21:02:17,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:02:17,771 INFO L87 Difference]: Start difference. First operand 5977 states and 7349 transitions. Second operand has 3 states, 3 states have (on average 61.333333333333336) internal successors, (184), 3 states have internal predecessors, (184), 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-23 21:02:18,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:02:18,450 INFO L93 Difference]: Finished difference Result 14180 states and 17518 transitions. [2024-10-23 21:02:18,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 21:02:18,451 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 61.333333333333336) internal successors, (184), 3 states have internal predecessors, (184), 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 247 [2024-10-23 21:02:18,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:02:18,470 INFO L225 Difference]: With dead ends: 14180 [2024-10-23 21:02:18,470 INFO L226 Difference]: Without dead ends: 8572 [2024-10-23 21:02:18,477 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-23 21:02:18,478 INFO L432 NwaCegarLoop]: 303 mSDtfsCounter, 163 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 549 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 674 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 549 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-23 21:02:18,478 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 327 Invalid, 674 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 549 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-23 21:02:18,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8572 states. [2024-10-23 21:02:18,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8572 to 8016. [2024-10-23 21:02:18,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8016 states, 8015 states have (on average 1.216968184653774) internal successors, (9754), 8015 states have internal predecessors, (9754), 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-23 21:02:18,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8016 states to 8016 states and 9754 transitions. [2024-10-23 21:02:18,595 INFO L78 Accepts]: Start accepts. Automaton has 8016 states and 9754 transitions. Word has length 247 [2024-10-23 21:02:18,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:02:18,596 INFO L471 AbstractCegarLoop]: Abstraction has 8016 states and 9754 transitions. [2024-10-23 21:02:18,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 61.333333333333336) internal successors, (184), 3 states have internal predecessors, (184), 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-23 21:02:18,597 INFO L276 IsEmpty]: Start isEmpty. Operand 8016 states and 9754 transitions. [2024-10-23 21:02:18,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2024-10-23 21:02:18,602 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:02:18,603 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 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-23 21:02:18,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-23 21:02:18,603 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:02:18,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:02:18,604 INFO L85 PathProgramCache]: Analyzing trace with hash -353037167, now seen corresponding path program 1 times [2024-10-23 21:02:18,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:02:18,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022745436] [2024-10-23 21:02:18,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:02:18,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:02:18,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:02:18,765 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2024-10-23 21:02:18,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:02:18,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022745436] [2024-10-23 21:02:18,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022745436] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:02:18,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:02:18,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 21:02:18,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367572526] [2024-10-23 21:02:18,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:02:18,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 21:02:18,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:02:18,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 21:02:18,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:02:18,768 INFO L87 Difference]: Start difference. First operand 8016 states and 9754 transitions. Second operand has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 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-23 21:02:19,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:02:19,403 INFO L93 Difference]: Finished difference Result 17344 states and 21232 transitions. [2024-10-23 21:02:19,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 21:02:19,403 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 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 257 [2024-10-23 21:02:19,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:02:19,426 INFO L225 Difference]: With dead ends: 17344 [2024-10-23 21:02:19,426 INFO L226 Difference]: Without dead ends: 9697 [2024-10-23 21:02:19,432 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-23 21:02:19,432 INFO L432 NwaCegarLoop]: 177 mSDtfsCounter, 145 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 595 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 646 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 595 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-23 21:02:19,433 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 197 Invalid, 646 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 595 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-23 21:02:19,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9697 states. [2024-10-23 21:02:19,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9697 to 9303. [2024-10-23 21:02:19,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9303 states, 9302 states have (on average 1.2159750591270695) internal successors, (11311), 9302 states have internal predecessors, (11311), 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-23 21:02:19,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9303 states to 9303 states and 11311 transitions. [2024-10-23 21:02:19,533 INFO L78 Accepts]: Start accepts. Automaton has 9303 states and 11311 transitions. Word has length 257 [2024-10-23 21:02:19,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:02:19,534 INFO L471 AbstractCegarLoop]: Abstraction has 9303 states and 11311 transitions. [2024-10-23 21:02:19,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 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-23 21:02:19,534 INFO L276 IsEmpty]: Start isEmpty. Operand 9303 states and 11311 transitions. [2024-10-23 21:02:19,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2024-10-23 21:02:19,538 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:02:19,538 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 21:02:19,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-23 21:02:19,538 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:02:19,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:02:19,538 INFO L85 PathProgramCache]: Analyzing trace with hash -1776038293, now seen corresponding path program 1 times [2024-10-23 21:02:19,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:02:19,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614867678] [2024-10-23 21:02:19,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:02:19,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:02:19,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:02:19,643 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2024-10-23 21:02:19,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:02:19,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614867678] [2024-10-23 21:02:19,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614867678] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:02:19,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:02:19,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-23 21:02:19,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131181292] [2024-10-23 21:02:19,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:02:19,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 21:02:19,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:02:19,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 21:02:19,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:02:19,646 INFO L87 Difference]: Start difference. First operand 9303 states and 11311 transitions. Second operand has 3 states, 3 states have (on average 68.33333333333333) internal successors, (205), 2 states have internal predecessors, (205), 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-23 21:02:20,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:02:20,206 INFO L93 Difference]: Finished difference Result 18204 states and 22187 transitions. [2024-10-23 21:02:20,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 21:02:20,206 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 68.33333333333333) internal successors, (205), 2 states have internal predecessors, (205), 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 258 [2024-10-23 21:02:20,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:02:20,219 INFO L225 Difference]: With dead ends: 18204 [2024-10-23 21:02:20,219 INFO L226 Difference]: Without dead ends: 9270 [2024-10-23 21:02:20,226 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-23 21:02:20,227 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 114 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 449 mSolverCounterSat, 142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 591 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-23 21:02:20,227 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 148 Invalid, 591 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [142 Valid, 449 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-23 21:02:20,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9270 states. [2024-10-23 21:02:20,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9270 to 9085. [2024-10-23 21:02:20,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9085 states, 9084 states have (on average 1.1512549537648613) internal successors, (10458), 9084 states have internal predecessors, (10458), 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-23 21:02:20,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9085 states to 9085 states and 10458 transitions. [2024-10-23 21:02:20,359 INFO L78 Accepts]: Start accepts. Automaton has 9085 states and 10458 transitions. Word has length 258 [2024-10-23 21:02:20,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:02:20,360 INFO L471 AbstractCegarLoop]: Abstraction has 9085 states and 10458 transitions. [2024-10-23 21:02:20,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.33333333333333) internal successors, (205), 2 states have internal predecessors, (205), 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-23 21:02:20,361 INFO L276 IsEmpty]: Start isEmpty. Operand 9085 states and 10458 transitions. [2024-10-23 21:02:20,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2024-10-23 21:02:20,365 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:02:20,365 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 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-23 21:02:20,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-23 21:02:20,365 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:02:20,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:02:20,366 INFO L85 PathProgramCache]: Analyzing trace with hash 651111351, now seen corresponding path program 1 times [2024-10-23 21:02:20,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:02:20,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271692921] [2024-10-23 21:02:20,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:02:20,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:02:20,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:02:20,527 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2024-10-23 21:02:20,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:02:20,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271692921] [2024-10-23 21:02:20,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271692921] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:02:20,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:02:20,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 21:02:20,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20600517] [2024-10-23 21:02:20,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:02:20,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 21:02:20,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:02:20,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 21:02:20,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:02:20,530 INFO L87 Difference]: Start difference. First operand 9085 states and 10458 transitions. Second operand has 3 states, 3 states have (on average 61.333333333333336) internal successors, (184), 3 states have internal predecessors, (184), 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-23 21:02:21,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:02:21,180 INFO L93 Difference]: Finished difference Result 18357 states and 21125 transitions. [2024-10-23 21:02:21,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 21:02:21,180 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 61.333333333333336) internal successors, (184), 3 states have internal predecessors, (184), 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 288 [2024-10-23 21:02:21,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:02:21,190 INFO L225 Difference]: With dead ends: 18357 [2024-10-23 21:02:21,190 INFO L226 Difference]: Without dead ends: 9457 [2024-10-23 21:02:21,196 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-23 21:02:21,196 INFO L432 NwaCegarLoop]: 350 mSDtfsCounter, 145 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 575 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 662 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 575 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-23 21:02:21,196 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 371 Invalid, 662 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 575 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-23 21:02:21,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9457 states. [2024-10-23 21:02:21,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9457 to 9452. [2024-10-23 21:02:21,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9452 states, 9451 states have (on average 1.1241138503862025) internal successors, (10624), 9451 states have internal predecessors, (10624), 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-23 21:02:21,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9452 states to 9452 states and 10624 transitions. [2024-10-23 21:02:21,274 INFO L78 Accepts]: Start accepts. Automaton has 9452 states and 10624 transitions. Word has length 288 [2024-10-23 21:02:21,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:02:21,275 INFO L471 AbstractCegarLoop]: Abstraction has 9452 states and 10624 transitions. [2024-10-23 21:02:21,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 61.333333333333336) internal successors, (184), 3 states have internal predecessors, (184), 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-23 21:02:21,275 INFO L276 IsEmpty]: Start isEmpty. Operand 9452 states and 10624 transitions. [2024-10-23 21:02:21,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2024-10-23 21:02:21,280 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:02:21,280 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 21:02:21,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-23 21:02:21,280 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:02:21,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:02:21,281 INFO L85 PathProgramCache]: Analyzing trace with hash -14193191, now seen corresponding path program 1 times [2024-10-23 21:02:21,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:02:21,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462081449] [2024-10-23 21:02:21,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:02:21,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:02:21,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:02:21,481 INFO L134 CoverageAnalysis]: Checked inductivity of 379 backedges. 325 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2024-10-23 21:02:21,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:02:21,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462081449] [2024-10-23 21:02:21,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462081449] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:02:21,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:02:21,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 21:02:21,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959165509] [2024-10-23 21:02:21,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:02:21,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 21:02:21,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:02:21,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 21:02:21,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:02:21,510 INFO L87 Difference]: Start difference. First operand 9452 states and 10624 transitions. Second operand has 3 states, 3 states have (on average 88.33333333333333) internal successors, (265), 3 states have internal predecessors, (265), 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-23 21:02:22,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:02:22,152 INFO L93 Difference]: Finished difference Result 21306 states and 24060 transitions. [2024-10-23 21:02:22,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 21:02:22,153 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 88.33333333333333) internal successors, (265), 3 states have internal predecessors, (265), 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 318 [2024-10-23 21:02:22,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:02:22,165 INFO L225 Difference]: With dead ends: 21306 [2024-10-23 21:02:22,166 INFO L226 Difference]: Without dead ends: 12223 [2024-10-23 21:02:22,173 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-23 21:02:22,174 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 140 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 581 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 581 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-23 21:02:22,174 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 122 Invalid, 651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 581 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-23 21:02:22,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12223 states. [2024-10-23 21:02:22,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12223 to 12221. [2024-10-23 21:02:22,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12221 states, 12220 states have (on average 1.1161211129296236) internal successors, (13639), 12220 states have internal predecessors, (13639), 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-23 21:02:22,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12221 states to 12221 states and 13639 transitions. [2024-10-23 21:02:22,309 INFO L78 Accepts]: Start accepts. Automaton has 12221 states and 13639 transitions. Word has length 318 [2024-10-23 21:02:22,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:02:22,309 INFO L471 AbstractCegarLoop]: Abstraction has 12221 states and 13639 transitions. [2024-10-23 21:02:22,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 88.33333333333333) internal successors, (265), 3 states have internal predecessors, (265), 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-23 21:02:22,310 INFO L276 IsEmpty]: Start isEmpty. Operand 12221 states and 13639 transitions. [2024-10-23 21:02:22,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2024-10-23 21:02:22,317 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:02:22,318 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 21:02:22,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-23 21:02:22,318 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:02:22,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:02:22,319 INFO L85 PathProgramCache]: Analyzing trace with hash 1374191474, now seen corresponding path program 1 times [2024-10-23 21:02:22,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:02:22,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871073236] [2024-10-23 21:02:22,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:02:22,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:02:22,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:02:22,938 INFO L134 CoverageAnalysis]: Checked inductivity of 379 backedges. 242 proven. 137 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-23 21:02:22,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:02:22,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871073236] [2024-10-23 21:02:22,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871073236] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-23 21:02:22,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1244612513] [2024-10-23 21:02:22,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:02:22,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-23 21:02:22,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-23 21:02:22,941 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-23 21:02:22,941 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-23 21:02:23,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:02:23,118 INFO L255 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-23 21:02:23,135 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-23 21:02:23,484 INFO L134 CoverageAnalysis]: Checked inductivity of 379 backedges. 298 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2024-10-23 21:02:23,484 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-23 21:02:23,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1244612513] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:02:23,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-23 21:02:23,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2024-10-23 21:02:23,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407915646] [2024-10-23 21:02:23,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:02:23,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 21:02:23,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:02:23,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 21:02:23,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-23 21:02:23,491 INFO L87 Difference]: Start difference. First operand 12221 states and 13639 transitions. Second operand has 3 states, 3 states have (on average 82.66666666666667) internal successors, (248), 3 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:02:24,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:02:24,319 INFO L93 Difference]: Finished difference Result 25382 states and 28426 transitions. [2024-10-23 21:02:24,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 21:02:24,320 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 82.66666666666667) internal successors, (248), 3 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 328 [2024-10-23 21:02:24,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:02:24,341 INFO L225 Difference]: With dead ends: 25382 [2024-10-23 21:02:24,341 INFO L226 Difference]: Without dead ends: 13530 [2024-10-23 21:02:24,358 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 332 GetRequests, 327 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-23 21:02:24,363 INFO L432 NwaCegarLoop]: 319 mSDtfsCounter, 137 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 567 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 586 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 567 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-23 21:02:24,364 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 339 Invalid, 586 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 567 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-23 21:02:24,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13530 states. [2024-10-23 21:02:24,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13530 to 13521. [2024-10-23 21:02:24,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13521 states, 13520 states have (on average 1.1178254437869823) internal successors, (15113), 13520 states have internal predecessors, (15113), 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-23 21:02:24,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13521 states to 13521 states and 15113 transitions. [2024-10-23 21:02:24,570 INFO L78 Accepts]: Start accepts. Automaton has 13521 states and 15113 transitions. Word has length 328 [2024-10-23 21:02:24,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:02:24,571 INFO L471 AbstractCegarLoop]: Abstraction has 13521 states and 15113 transitions. [2024-10-23 21:02:24,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 82.66666666666667) internal successors, (248), 3 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:02:24,571 INFO L276 IsEmpty]: Start isEmpty. Operand 13521 states and 15113 transitions. [2024-10-23 21:02:24,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2024-10-23 21:02:24,579 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:02:24,579 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 21:02:24,593 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-23 21:02:24,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-10-23 21:02:24,780 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:02:24,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:02:24,781 INFO L85 PathProgramCache]: Analyzing trace with hash 755901531, now seen corresponding path program 1 times [2024-10-23 21:02:24,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:02:24,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46195378] [2024-10-23 21:02:24,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:02:24,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:02:24,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:02:24,980 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-10-23 21:02:24,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:02:24,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46195378] [2024-10-23 21:02:24,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46195378] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:02:24,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:02:24,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-23 21:02:24,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799972477] [2024-10-23 21:02:24,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:02:24,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 21:02:24,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:02:24,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 21:02:24,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:02:24,982 INFO L87 Difference]: Start difference. First operand 13521 states and 15113 transitions. Second operand has 3 states, 3 states have (on average 71.33333333333333) internal successors, (214), 2 states have internal predecessors, (214), 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-23 21:02:25,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:02:25,310 INFO L93 Difference]: Finished difference Result 26662 states and 29834 transitions. [2024-10-23 21:02:25,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 21:02:25,311 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 71.33333333333333) internal successors, (214), 2 states have internal predecessors, (214), 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 337 [2024-10-23 21:02:25,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:02:25,323 INFO L225 Difference]: With dead ends: 26662 [2024-10-23 21:02:25,323 INFO L226 Difference]: Without dead ends: 13510 [2024-10-23 21:02:25,332 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-23 21:02:25,334 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 188 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-23 21:02:25,334 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 37 Invalid, 312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-23 21:02:25,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13510 states. [2024-10-23 21:02:25,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13510 to 13505. [2024-10-23 21:02:25,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13505 states, 13504 states have (on average 1.117076421800948) internal successors, (15085), 13504 states have internal predecessors, (15085), 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-23 21:02:25,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13505 states to 13505 states and 15085 transitions. [2024-10-23 21:02:25,434 INFO L78 Accepts]: Start accepts. Automaton has 13505 states and 15085 transitions. Word has length 337 [2024-10-23 21:02:25,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:02:25,435 INFO L471 AbstractCegarLoop]: Abstraction has 13505 states and 15085 transitions. [2024-10-23 21:02:25,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 71.33333333333333) internal successors, (214), 2 states have internal predecessors, (214), 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-23 21:02:25,435 INFO L276 IsEmpty]: Start isEmpty. Operand 13505 states and 15085 transitions. [2024-10-23 21:02:25,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 350 [2024-10-23 21:02:25,441 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:02:25,441 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 21:02:25,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-23 21:02:25,441 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:02:25,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:02:25,442 INFO L85 PathProgramCache]: Analyzing trace with hash 1998007539, now seen corresponding path program 1 times [2024-10-23 21:02:25,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:02:25,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84654763] [2024-10-23 21:02:25,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:02:25,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:02:25,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:02:25,799 INFO L134 CoverageAnalysis]: Checked inductivity of 395 backedges. 341 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2024-10-23 21:02:25,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:02:25,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84654763] [2024-10-23 21:02:25,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84654763] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:02:25,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:02:25,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 21:02:25,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527084737] [2024-10-23 21:02:25,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:02:25,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-23 21:02:25,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:02:25,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-23 21:02:25,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-23 21:02:25,803 INFO L87 Difference]: Start difference. First operand 13505 states and 15085 transitions. Second operand has 4 states, 4 states have (on average 74.0) internal successors, (296), 3 states have internal predecessors, (296), 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-23 21:02:26,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:02:26,867 INFO L93 Difference]: Finished difference Result 28861 states and 32244 transitions. [2024-10-23 21:02:26,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-23 21:02:26,868 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 74.0) internal successors, (296), 3 states have internal predecessors, (296), 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 349 [2024-10-23 21:02:26,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:02:26,883 INFO L225 Difference]: With dead ends: 28861 [2024-10-23 21:02:26,883 INFO L226 Difference]: Without dead ends: 15725 [2024-10-23 21:02:26,892 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-23 21:02:26,893 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 215 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 1037 mSolverCounterSat, 241 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 1278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 241 IncrementalHoareTripleChecker+Valid, 1037 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-23 21:02:26,894 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 135 Invalid, 1278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [241 Valid, 1037 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-23 21:02:26,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15725 states. [2024-10-23 21:02:26,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15725 to 15717. [2024-10-23 21:02:27,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15717 states, 15716 states have (on average 1.1105243064392976) internal successors, (17453), 15716 states have internal predecessors, (17453), 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-23 21:02:27,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15717 states to 15717 states and 17453 transitions. [2024-10-23 21:02:27,024 INFO L78 Accepts]: Start accepts. Automaton has 15717 states and 17453 transitions. Word has length 349 [2024-10-23 21:02:27,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:02:27,024 INFO L471 AbstractCegarLoop]: Abstraction has 15717 states and 17453 transitions. [2024-10-23 21:02:27,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 74.0) internal successors, (296), 3 states have internal predecessors, (296), 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-23 21:02:27,024 INFO L276 IsEmpty]: Start isEmpty. Operand 15717 states and 17453 transitions. [2024-10-23 21:02:27,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 363 [2024-10-23 21:02:27,030 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:02:27,030 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 21:02:27,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-23 21:02:27,031 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:02:27,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:02:27,031 INFO L85 PathProgramCache]: Analyzing trace with hash 420427061, now seen corresponding path program 1 times [2024-10-23 21:02:27,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:02:27,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360416055] [2024-10-23 21:02:27,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:02:27,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:02:27,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:02:27,621 INFO L134 CoverageAnalysis]: Checked inductivity of 409 backedges. 298 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2024-10-23 21:02:27,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:02:27,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360416055] [2024-10-23 21:02:27,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360416055] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:02:27,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:02:27,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-23 21:02:27,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258361977] [2024-10-23 21:02:27,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:02:27,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-23 21:02:27,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:02:27,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-23 21:02:27,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-23 21:02:27,624 INFO L87 Difference]: Start difference. First operand 15717 states and 17453 transitions. Second operand has 4 states, 4 states have (on average 63.0) internal successors, (252), 4 states have internal predecessors, (252), 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-23 21:02:28,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:02:28,762 INFO L93 Difference]: Finished difference Result 32358 states and 35958 transitions. [2024-10-23 21:02:28,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-23 21:02:28,762 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 63.0) internal successors, (252), 4 states have internal predecessors, (252), 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 362 [2024-10-23 21:02:28,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:02:28,777 INFO L225 Difference]: With dead ends: 32358 [2024-10-23 21:02:28,777 INFO L226 Difference]: Without dead ends: 17010 [2024-10-23 21:02:28,782 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-23 21:02:28,783 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 307 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 1075 mSolverCounterSat, 191 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 1266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 191 IncrementalHoareTripleChecker+Valid, 1075 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-23 21:02:28,783 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [307 Valid, 133 Invalid, 1266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [191 Valid, 1075 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-23 21:02:28,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17010 states. [2024-10-23 21:02:28,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17010 to 16269. [2024-10-23 21:02:28,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16269 states, 16268 states have (on average 1.1089869682812885) internal successors, (18041), 16268 states have internal predecessors, (18041), 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-23 21:02:28,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16269 states to 16269 states and 18041 transitions. [2024-10-23 21:02:28,925 INFO L78 Accepts]: Start accepts. Automaton has 16269 states and 18041 transitions. Word has length 362 [2024-10-23 21:02:28,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:02:28,925 INFO L471 AbstractCegarLoop]: Abstraction has 16269 states and 18041 transitions. [2024-10-23 21:02:28,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 63.0) internal successors, (252), 4 states have internal predecessors, (252), 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-23 21:02:28,925 INFO L276 IsEmpty]: Start isEmpty. Operand 16269 states and 18041 transitions. [2024-10-23 21:02:28,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 377 [2024-10-23 21:02:28,933 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:02:28,933 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 21:02:28,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-23 21:02:28,934 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:02:28,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:02:28,934 INFO L85 PathProgramCache]: Analyzing trace with hash 240693292, now seen corresponding path program 1 times [2024-10-23 21:02:28,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:02:28,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338777203] [2024-10-23 21:02:28,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:02:28,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:02:28,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:02:29,367 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 359 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2024-10-23 21:02:29,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:02:29,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338777203] [2024-10-23 21:02:29,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338777203] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:02:29,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:02:29,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 21:02:29,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653620873] [2024-10-23 21:02:29,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:02:29,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-23 21:02:29,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:02:29,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-23 21:02:29,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-23 21:02:29,370 INFO L87 Difference]: Start difference. First operand 16269 states and 18041 transitions. Second operand has 4 states, 4 states have (on average 74.0) internal successors, (296), 3 states have internal predecessors, (296), 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-23 21:02:30,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:02:30,473 INFO L93 Difference]: Finished difference Result 43056 states and 47696 transitions. [2024-10-23 21:02:30,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-23 21:02:30,473 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 74.0) internal successors, (296), 3 states have internal predecessors, (296), 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 376 [2024-10-23 21:02:30,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:02:30,498 INFO L225 Difference]: With dead ends: 43056 [2024-10-23 21:02:30,498 INFO L226 Difference]: Without dead ends: 26232 [2024-10-23 21:02:30,510 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-23 21:02:30,511 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 225 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 1124 mSolverCounterSat, 149 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 1273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 149 IncrementalHoareTripleChecker+Valid, 1124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-23 21:02:30,511 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 66 Invalid, 1273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [149 Valid, 1124 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-23 21:02:30,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26232 states. [2024-10-23 21:02:30,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26232 to 24939. [2024-10-23 21:02:30,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24939 states, 24938 states have (on average 1.101732296094314) internal successors, (27475), 24938 states have internal predecessors, (27475), 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-23 21:02:30,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24939 states to 24939 states and 27475 transitions. [2024-10-23 21:02:30,756 INFO L78 Accepts]: Start accepts. Automaton has 24939 states and 27475 transitions. Word has length 376 [2024-10-23 21:02:30,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:02:30,756 INFO L471 AbstractCegarLoop]: Abstraction has 24939 states and 27475 transitions. [2024-10-23 21:02:30,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 74.0) internal successors, (296), 3 states have internal predecessors, (296), 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-23 21:02:30,756 INFO L276 IsEmpty]: Start isEmpty. Operand 24939 states and 27475 transitions. [2024-10-23 21:02:30,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 408 [2024-10-23 21:02:30,767 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:02:30,767 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-23 21:02:30,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-23 21:02:30,767 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:02:30,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:02:30,768 INFO L85 PathProgramCache]: Analyzing trace with hash 2047818624, now seen corresponding path program 1 times [2024-10-23 21:02:30,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:02:30,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494712257] [2024-10-23 21:02:30,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:02:30,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:02:30,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:02:31,176 INFO L134 CoverageAnalysis]: Checked inductivity of 445 backedges. 161 proven. 0 refuted. 0 times theorem prover too weak. 284 trivial. 0 not checked. [2024-10-23 21:02:31,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:02:31,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494712257] [2024-10-23 21:02:31,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494712257] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:02:31,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:02:31,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 21:02:31,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000927032] [2024-10-23 21:02:31,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:02:31,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 21:02:31,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:02:31,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 21:02:31,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:02:31,179 INFO L87 Difference]: Start difference. First operand 24939 states and 27475 transitions. Second operand has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 3 states have internal predecessors, (206), 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-23 21:02:31,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:02:31,731 INFO L93 Difference]: Finished difference Result 28805 states and 31707 transitions. [2024-10-23 21:02:31,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 21:02:31,732 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 3 states have internal predecessors, (206), 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 407 [2024-10-23 21:02:31,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:02:31,763 INFO L225 Difference]: With dead ends: 28805 [2024-10-23 21:02:31,763 INFO L226 Difference]: Without dead ends: 28803 [2024-10-23 21:02:31,776 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-23 21:02:31,777 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 165 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 490 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 490 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-23 21:02:31,777 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 130 Invalid, 557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 490 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-23 21:02:31,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28803 states. [2024-10-23 21:02:32,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28803 to 25307. [2024-10-23 21:02:32,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25307 states, 25306 states have (on average 1.1021892041413104) internal successors, (27892), 25306 states have internal predecessors, (27892), 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-23 21:02:32,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25307 states to 25307 states and 27892 transitions. [2024-10-23 21:02:32,135 INFO L78 Accepts]: Start accepts. Automaton has 25307 states and 27892 transitions. Word has length 407 [2024-10-23 21:02:32,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:02:32,136 INFO L471 AbstractCegarLoop]: Abstraction has 25307 states and 27892 transitions. [2024-10-23 21:02:32,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 3 states have internal predecessors, (206), 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-23 21:02:32,136 INFO L276 IsEmpty]: Start isEmpty. Operand 25307 states and 27892 transitions. [2024-10-23 21:02:32,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 419 [2024-10-23 21:02:32,148 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:02:32,148 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 21:02:32,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-23 21:02:32,148 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:02:32,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:02:32,149 INFO L85 PathProgramCache]: Analyzing trace with hash -238395606, now seen corresponding path program 1 times [2024-10-23 21:02:32,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:02:32,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768931669] [2024-10-23 21:02:32,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:02:32,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:02:32,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:02:32,385 INFO L134 CoverageAnalysis]: Checked inductivity of 512 backedges. 458 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2024-10-23 21:02:32,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:02:32,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768931669] [2024-10-23 21:02:32,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768931669] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:02:32,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:02:32,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 21:02:32,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811737331] [2024-10-23 21:02:32,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:02:32,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 21:02:32,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:02:32,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 21:02:32,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:02:32,388 INFO L87 Difference]: Start difference. First operand 25307 states and 27892 transitions. Second operand has 3 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 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-23 21:02:33,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:02:33,350 INFO L93 Difference]: Finished difference Result 54666 states and 60217 transitions. [2024-10-23 21:02:33,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 21:02:33,351 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 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 418 [2024-10-23 21:02:33,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:02:33,383 INFO L225 Difference]: With dead ends: 54666 [2024-10-23 21:02:33,383 INFO L226 Difference]: Without dead ends: 29912 [2024-10-23 21:02:33,399 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-23 21:02:33,400 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 110 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 540 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 540 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-23 21:02:33,400 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 66 Invalid, 672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 540 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-23 21:02:33,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29912 states. [2024-10-23 21:02:33,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29912 to 29723. [2024-10-23 21:02:33,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29723 states, 29722 states have (on average 1.0919520893614159) internal successors, (32455), 29722 states have internal predecessors, (32455), 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-23 21:02:33,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29723 states to 29723 states and 32455 transitions. [2024-10-23 21:02:33,686 INFO L78 Accepts]: Start accepts. Automaton has 29723 states and 32455 transitions. Word has length 418 [2024-10-23 21:02:33,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:02:33,687 INFO L471 AbstractCegarLoop]: Abstraction has 29723 states and 32455 transitions. [2024-10-23 21:02:33,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 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-23 21:02:33,687 INFO L276 IsEmpty]: Start isEmpty. Operand 29723 states and 32455 transitions. [2024-10-23 21:02:33,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 427 [2024-10-23 21:02:33,695 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:02:33,696 INFO L215 NwaCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 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-23 21:02:33,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-23 21:02:33,696 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:02:33,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:02:33,696 INFO L85 PathProgramCache]: Analyzing trace with hash 932881900, now seen corresponding path program 1 times [2024-10-23 21:02:33,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:02:33,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242711597] [2024-10-23 21:02:33,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:02:33,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:02:33,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:02:34,283 INFO L134 CoverageAnalysis]: Checked inductivity of 681 backedges. 627 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2024-10-23 21:02:34,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:02:34,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242711597] [2024-10-23 21:02:34,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242711597] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:02:34,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:02:34,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-23 21:02:34,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802874802] [2024-10-23 21:02:34,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:02:34,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-23 21:02:34,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:02:34,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-23 21:02:34,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-23 21:02:34,287 INFO L87 Difference]: Start difference. First operand 29723 states and 32455 transitions. Second operand has 4 states, 4 states have (on average 93.25) internal successors, (373), 4 states have internal predecessors, (373), 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-23 21:02:35,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:02:35,350 INFO L93 Difference]: Finished difference Result 63686 states and 69563 transitions. [2024-10-23 21:02:35,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-23 21:02:35,351 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 93.25) internal successors, (373), 4 states have internal predecessors, (373), 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 426 [2024-10-23 21:02:35,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:02:35,387 INFO L225 Difference]: With dead ends: 63686 [2024-10-23 21:02:35,388 INFO L226 Difference]: Without dead ends: 34700 [2024-10-23 21:02:35,406 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-23 21:02:35,406 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 265 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 1049 mSolverCounterSat, 182 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 1231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 182 IncrementalHoareTripleChecker+Valid, 1049 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-23 21:02:35,407 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 82 Invalid, 1231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [182 Valid, 1049 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-23 21:02:35,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34700 states. [2024-10-23 21:02:35,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34700 to 30830. [2024-10-23 21:02:35,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30830 states, 30829 states have (on average 1.0880988679490091) internal successors, (33545), 30829 states have internal predecessors, (33545), 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-23 21:02:35,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30830 states to 30830 states and 33545 transitions. [2024-10-23 21:02:35,704 INFO L78 Accepts]: Start accepts. Automaton has 30830 states and 33545 transitions. Word has length 426 [2024-10-23 21:02:35,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:02:35,704 INFO L471 AbstractCegarLoop]: Abstraction has 30830 states and 33545 transitions. [2024-10-23 21:02:35,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 93.25) internal successors, (373), 4 states have internal predecessors, (373), 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-23 21:02:35,704 INFO L276 IsEmpty]: Start isEmpty. Operand 30830 states and 33545 transitions. [2024-10-23 21:02:35,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 430 [2024-10-23 21:02:35,712 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:02:35,713 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 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-23 21:02:35,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-23 21:02:35,713 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:02:35,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:02:35,714 INFO L85 PathProgramCache]: Analyzing trace with hash 315780294, now seen corresponding path program 1 times [2024-10-23 21:02:35,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:02:35,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695402974] [2024-10-23 21:02:35,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:02:35,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:02:35,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:02:36,285 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 249 proven. 191 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-23 21:02:36,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:02:36,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695402974] [2024-10-23 21:02:36,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695402974] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-23 21:02:36,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [778940202] [2024-10-23 21:02:36,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:02:36,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-23 21:02:36,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-23 21:02:36,288 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-23 21:02:36,289 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-23 21:02:36,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:02:36,423 INFO L255 TraceCheckSpWp]: Trace formula consists of 562 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-23 21:02:36,430 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-23 21:02:37,606 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 230 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-23 21:02:37,607 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-23 21:02:39,721 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 303 proven. 137 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-23 21:02:39,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [778940202] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-23 21:02:39,721 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-23 21:02:39,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 11 [2024-10-23 21:02:39,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656451485] [2024-10-23 21:02:39,722 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-23 21:02:39,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-23 21:02:39,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:02:39,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-23 21:02:39,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2024-10-23 21:02:39,726 INFO L87 Difference]: Start difference. First operand 30830 states and 33545 transitions. Second operand has 12 states, 12 states have (on average 102.58333333333333) internal successors, (1231), 11 states have internal predecessors, (1231), 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-23 21:02:44,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:02:44,959 INFO L93 Difference]: Finished difference Result 76956 states and 83698 transitions. [2024-10-23 21:02:44,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-23 21:02:44,960 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 102.58333333333333) internal successors, (1231), 11 states have internal predecessors, (1231), 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 429 [2024-10-23 21:02:44,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:02:45,006 INFO L225 Difference]: With dead ends: 76956 [2024-10-23 21:02:45,006 INFO L226 Difference]: Without dead ends: 46311 [2024-10-23 21:02:45,026 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 879 GetRequests, 851 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=252, Invalid=618, Unknown=0, NotChecked=0, Total=870 [2024-10-23 21:02:45,027 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 2535 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 6201 mSolverCounterSat, 1367 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2535 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 7568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1367 IncrementalHoareTripleChecker+Valid, 6201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2024-10-23 21:02:45,027 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2535 Valid, 231 Invalid, 7568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1367 Valid, 6201 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2024-10-23 21:02:45,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46311 states. [2024-10-23 21:02:45,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46311 to 29358. [2024-10-23 21:02:45,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29358 states, 29357 states have (on average 1.077289913819532) internal successors, (31626), 29357 states have internal predecessors, (31626), 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-23 21:02:45,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29358 states to 29358 states and 31626 transitions. [2024-10-23 21:02:45,382 INFO L78 Accepts]: Start accepts. Automaton has 29358 states and 31626 transitions. Word has length 429 [2024-10-23 21:02:45,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:02:45,382 INFO L471 AbstractCegarLoop]: Abstraction has 29358 states and 31626 transitions. [2024-10-23 21:02:45,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 102.58333333333333) internal successors, (1231), 11 states have internal predecessors, (1231), 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-23 21:02:45,383 INFO L276 IsEmpty]: Start isEmpty. Operand 29358 states and 31626 transitions. [2024-10-23 21:02:45,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 444 [2024-10-23 21:02:45,389 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:02:45,389 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 21:02:45,403 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-23 21:02:45,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-10-23 21:02:45,594 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:02:45,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:02:45,595 INFO L85 PathProgramCache]: Analyzing trace with hash 1520252139, now seen corresponding path program 1 times [2024-10-23 21:02:45,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:02:45,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920046230] [2024-10-23 21:02:45,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:02:45,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:02:45,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:02:45,826 INFO L134 CoverageAnalysis]: Checked inductivity of 510 backedges. 161 proven. 0 refuted. 0 times theorem prover too weak. 349 trivial. 0 not checked. [2024-10-23 21:02:45,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:02:45,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920046230] [2024-10-23 21:02:45,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920046230] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:02:45,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:02:45,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 21:02:45,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678214837] [2024-10-23 21:02:45,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:02:45,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 21:02:45,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:02:45,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 21:02:45,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:02:45,828 INFO L87 Difference]: Start difference. First operand 29358 states and 31626 transitions. Second operand has 3 states, 3 states have (on average 69.0) internal successors, (207), 3 states have internal predecessors, (207), 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-23 21:02:46,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:02:46,392 INFO L93 Difference]: Finished difference Result 34144 states and 36689 transitions. [2024-10-23 21:02:46,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 21:02:46,393 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 69.0) internal successors, (207), 3 states have internal predecessors, (207), 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 443 [2024-10-23 21:02:46,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:02:46,425 INFO L225 Difference]: With dead ends: 34144 [2024-10-23 21:02:46,425 INFO L226 Difference]: Without dead ends: 34142 [2024-10-23 21:02:46,434 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-23 21:02:46,435 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 167 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 483 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 559 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 483 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-23 21:02:46,436 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 129 Invalid, 559 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 483 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-23 21:02:46,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34142 states. [2024-10-23 21:02:46,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34142 to 28990. [2024-10-23 21:02:46,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28990 states, 28989 states have (on average 1.077788126530753) internal successors, (31244), 28989 states have internal predecessors, (31244), 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-23 21:02:46,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28990 states to 28990 states and 31244 transitions. [2024-10-23 21:02:46,794 INFO L78 Accepts]: Start accepts. Automaton has 28990 states and 31244 transitions. Word has length 443 [2024-10-23 21:02:46,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:02:46,795 INFO L471 AbstractCegarLoop]: Abstraction has 28990 states and 31244 transitions. [2024-10-23 21:02:46,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 69.0) internal successors, (207), 3 states have internal predecessors, (207), 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-23 21:02:46,795 INFO L276 IsEmpty]: Start isEmpty. Operand 28990 states and 31244 transitions. [2024-10-23 21:02:46,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 505 [2024-10-23 21:02:46,807 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:02:46,808 INFO L215 NwaCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 21:02:46,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-23 21:02:46,808 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:02:46,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:02:46,808 INFO L85 PathProgramCache]: Analyzing trace with hash 1281662431, now seen corresponding path program 1 times [2024-10-23 21:02:46,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:02:46,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416916590] [2024-10-23 21:02:46,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:02:46,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:02:46,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:02:47,479 INFO L134 CoverageAnalysis]: Checked inductivity of 740 backedges. 464 proven. 222 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2024-10-23 21:02:47,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:02:47,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416916590] [2024-10-23 21:02:47,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416916590] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-23 21:02:47,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [471827182] [2024-10-23 21:02:47,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:02:47,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-23 21:02:47,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-23 21:02:47,483 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-23 21:02:47,483 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-23 21:02:47,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:02:47,622 INFO L255 TraceCheckSpWp]: Trace formula consists of 662 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-23 21:02:47,627 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-23 21:02:48,658 INFO L134 CoverageAnalysis]: Checked inductivity of 740 backedges. 464 proven. 222 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2024-10-23 21:02:48,658 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-23 21:02:50,123 INFO L134 CoverageAnalysis]: Checked inductivity of 740 backedges. 464 proven. 222 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2024-10-23 21:02:50,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [471827182] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-23 21:02:50,123 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-23 21:02:50,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2024-10-23 21:02:50,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115503335] [2024-10-23 21:02:50,124 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-23 21:02:50,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-23 21:02:50,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:02:50,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-23 21:02:50,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-23 21:02:50,126 INFO L87 Difference]: Start difference. First operand 28990 states and 31244 transitions. Second operand has 11 states, 11 states have (on average 64.18181818181819) internal successors, (706), 10 states have internal predecessors, (706), 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-23 21:02:53,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:02:53,803 INFO L93 Difference]: Finished difference Result 60966 states and 65569 transitions. [2024-10-23 21:02:53,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-10-23 21:02:53,803 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 64.18181818181819) internal successors, (706), 10 states have internal predecessors, (706), 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 504 [2024-10-23 21:02:53,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:02:53,839 INFO L225 Difference]: With dead ends: 60966 [2024-10-23 21:02:53,839 INFO L226 Difference]: Without dead ends: 32345 [2024-10-23 21:02:53,855 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1030 GetRequests, 1003 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=276, Invalid=536, Unknown=0, NotChecked=0, Total=812 [2024-10-23 21:02:53,855 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 3161 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 3662 mSolverCounterSat, 1187 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3161 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 4849 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1187 IncrementalHoareTripleChecker+Valid, 3662 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-10-23 21:02:53,856 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3161 Valid, 96 Invalid, 4849 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1187 Valid, 3662 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-10-23 21:02:53,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32345 states. [2024-10-23 21:02:54,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32345 to 18832. [2024-10-23 21:02:54,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18832 states, 18831 states have (on average 1.0753013647708565) internal successors, (20249), 18831 states have internal predecessors, (20249), 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-23 21:02:54,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18832 states to 18832 states and 20249 transitions. [2024-10-23 21:02:54,205 INFO L78 Accepts]: Start accepts. Automaton has 18832 states and 20249 transitions. Word has length 504 [2024-10-23 21:02:54,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:02:54,205 INFO L471 AbstractCegarLoop]: Abstraction has 18832 states and 20249 transitions. [2024-10-23 21:02:54,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 64.18181818181819) internal successors, (706), 10 states have internal predecessors, (706), 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-23 21:02:54,206 INFO L276 IsEmpty]: Start isEmpty. Operand 18832 states and 20249 transitions. [2024-10-23 21:02:54,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 541 [2024-10-23 21:02:54,217 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:02:54,218 INFO L215 NwaCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 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, 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-23 21:02:54,236 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-23 21:02:54,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-23 21:02:54,419 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:02:54,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:02:54,421 INFO L85 PathProgramCache]: Analyzing trace with hash 1991092206, now seen corresponding path program 1 times [2024-10-23 21:02:54,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:02:54,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091034408] [2024-10-23 21:02:54,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:02:54,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:02:54,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:02:55,359 INFO L134 CoverageAnalysis]: Checked inductivity of 766 backedges. 410 proven. 206 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2024-10-23 21:02:55,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:02:55,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091034408] [2024-10-23 21:02:55,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091034408] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-23 21:02:55,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1119312667] [2024-10-23 21:02:55,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:02:55,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-23 21:02:55,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-23 21:02:55,361 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-23 21:02:55,365 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-23 21:02:55,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:02:55,508 INFO L255 TraceCheckSpWp]: Trace formula consists of 699 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-23 21:02:55,513 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-23 21:02:56,673 INFO L134 CoverageAnalysis]: Checked inductivity of 766 backedges. 356 proven. 260 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2024-10-23 21:02:56,674 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-23 21:02:58,527 INFO L134 CoverageAnalysis]: Checked inductivity of 766 backedges. 547 proven. 69 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2024-10-23 21:02:58,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1119312667] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-23 21:02:58,528 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-23 21:02:58,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-10-23 21:02:58,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213242041] [2024-10-23 21:02:58,528 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-23 21:02:58,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-23 21:02:58,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:02:58,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-23 21:02:58,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=49, Unknown=0, NotChecked=0, Total=90 [2024-10-23 21:02:58,530 INFO L87 Difference]: Start difference. First operand 18832 states and 20249 transitions. Second operand has 10 states, 10 states have (on average 85.1) internal successors, (851), 10 states have internal predecessors, (851), 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-23 21:03:01,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:03:01,910 INFO L93 Difference]: Finished difference Result 47623 states and 51280 transitions. [2024-10-23 21:03:01,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-23 21:03:01,910 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 85.1) internal successors, (851), 10 states have internal predecessors, (851), 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 540 [2024-10-23 21:03:01,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:03:01,912 INFO L225 Difference]: With dead ends: 47623 [2024-10-23 21:03:01,912 INFO L226 Difference]: Without dead ends: 0 [2024-10-23 21:03:01,928 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1083 GetRequests, 1073 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=49, Unknown=0, NotChecked=0, Total=90 [2024-10-23 21:03:01,929 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 1000 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 4840 mSolverCounterSat, 563 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1000 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 5403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 563 IncrementalHoareTripleChecker+Valid, 4840 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-10-23 21:03:01,929 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1000 Valid, 169 Invalid, 5403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [563 Valid, 4840 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-10-23 21:03:01,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-23 21:03:01,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-23 21:03:01,930 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-23 21:03:01,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-23 21:03:01,930 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 540 [2024-10-23 21:03:01,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:03:01,930 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-23 21:03:01,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 85.1) internal successors, (851), 10 states have internal predecessors, (851), 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-23 21:03:01,931 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-23 21:03:01,931 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-23 21:03:01,934 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-23 21:03:01,948 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-23 21:03:02,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-23 21:03:02,138 INFO L407 BasicCegarLoop]: Path program 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] [2024-10-23 21:03:02,140 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-23 21:03:11,052 WARN L286 SmtUtils]: Spent 8.91s on a formula simplification. DAG size of input: 844 DAG size of output: 856 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or) [2024-10-23 21:03:16,504 WARN L286 SmtUtils]: Spent 5.44s on a formula simplification. DAG size of input: 856 DAG size of output: 148 (called from [L 162] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.combineInter) [2024-10-23 21:03:16,515 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-23 21:03:16,558 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.10 09:03:16 BoogieIcfgContainer [2024-10-23 21:03:16,558 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-23 21:03:16,558 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-23 21:03:16,559 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-23 21:03:16,559 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-23 21:03:16,560 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 09:02:09" (3/4) ... [2024-10-23 21:03:16,561 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-23 21:03:16,580 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2024-10-23 21:03:16,582 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-10-23 21:03:16,583 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-23 21:03:16,584 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-23 21:03:16,740 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-23 21:03:16,741 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-23 21:03:16,741 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-23 21:03:16,741 INFO L158 Benchmark]: Toolchain (without parser) took 69140.72ms. Allocated memory was 216.0MB in the beginning and 2.4GB in the end (delta: 2.2GB). Free memory was 156.5MB in the beginning and 1.0GB in the end (delta: -845.1MB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. [2024-10-23 21:03:16,742 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 111.1MB. Free memory is still 65.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-23 21:03:16,742 INFO L158 Benchmark]: CACSL2BoogieTranslator took 597.17ms. Allocated memory is still 216.0MB. Free memory was 156.5MB in the beginning and 160.3MB in the end (delta: -3.8MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-10-23 21:03:16,742 INFO L158 Benchmark]: Boogie Procedure Inliner took 110.56ms. Allocated memory is still 216.0MB. Free memory was 160.3MB in the beginning and 142.5MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-23 21:03:16,743 INFO L158 Benchmark]: Boogie Preprocessor took 141.88ms. Allocated memory is still 216.0MB. Free memory was 142.5MB in the beginning and 117.4MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-10-23 21:03:16,743 INFO L158 Benchmark]: RCFGBuilder took 1330.75ms. Allocated memory is still 216.0MB. Free memory was 117.4MB in the beginning and 105.7MB in the end (delta: 11.7MB). Peak memory consumption was 57.8MB. Max. memory is 16.1GB. [2024-10-23 21:03:16,745 INFO L158 Benchmark]: TraceAbstraction took 66772.42ms. Allocated memory was 216.0MB in the beginning and 2.4GB in the end (delta: 2.2GB). Free memory was 104.6MB in the beginning and 1.0GB in the end (delta: -914.8MB). Peak memory consumption was 1.5GB. Max. memory is 16.1GB. [2024-10-23 21:03:16,745 INFO L158 Benchmark]: Witness Printer took 182.53ms. Allocated memory is still 2.4GB. Free memory was 1.0GB in the beginning and 1.0GB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-23 21:03:16,746 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.12ms. Allocated memory is still 111.1MB. Free memory is still 65.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 597.17ms. Allocated memory is still 216.0MB. Free memory was 156.5MB in the beginning and 160.3MB in the end (delta: -3.8MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 110.56ms. Allocated memory is still 216.0MB. Free memory was 160.3MB in the beginning and 142.5MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 141.88ms. Allocated memory is still 216.0MB. Free memory was 142.5MB in the beginning and 117.4MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1330.75ms. Allocated memory is still 216.0MB. Free memory was 117.4MB in the beginning and 105.7MB in the end (delta: 11.7MB). Peak memory consumption was 57.8MB. Max. memory is 16.1GB. * TraceAbstraction took 66772.42ms. Allocated memory was 216.0MB in the beginning and 2.4GB in the end (delta: 2.2GB). Free memory was 104.6MB in the beginning and 1.0GB in the end (delta: -914.8MB). Peak memory consumption was 1.5GB. Max. memory is 16.1GB. * Witness Printer took 182.53ms. Allocated memory is still 2.4GB. Free memory was 1.0GB in the beginning and 1.0GB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. 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: 184]: 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, 221 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 52.3s, OverallIterations: 25, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 29.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 10392 SdHoareTripleChecker+Valid, 25.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 10392 mSDsluCounter, 4684 SdHoareTripleChecker+Invalid, 21.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 862 mSDsCounter, 5476 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 28523 IncrementalHoareTripleChecker+Invalid, 33999 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5476 mSolverCounterUnsat, 3822 mSDtfsCounter, 28523 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3384 GetRequests, 3289 SyntacticMatches, 2 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 456 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=30830occurred in iteration=21, InterpolantAutomatonStates: 128, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.7s AutomataMinimizationTime, 25 MinimizatonAttempts, 46981 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 16.5s InterpolantComputationTime, 9335 NumberOfCodeBlocks, 9335 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 10776 ConstructedInterpolants, 0 QuantifiedInterpolants, 45425 SizeOfPredicates, 10 NumberOfNonLiveVariables, 2387 ConjunctsInSsa, 30 ConjunctsInUnsatCore, 32 InterpolantComputations, 22 PerfectInterpolantSequences, 10167/12043 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: 1044]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((a3 == 1) && (a4 == 1)) && (312 <= a23)) && (a8 == 15)) && (a25 == 10)) || (((((((a25 == 11) && (173 <= a23)) && (a3 == 1)) && (a4 == 1)) && (0 <= ((long long) a29 + 554195))) && (a23 <= 312)) && (a8 == 15))) || (((((((0 <= ((((((long long) a29 * 3) + -554771) >= 0) ? ((((long long) a29 * 3) + -554771) / 25) : (((((long long) a29 * 3) + -554771) / 25) - 1)) + 115809)) && (a4 == 0)) && (a3 == 1)) && (a23 <= 312)) && ((0 < ((((((long long) a29 * 3) + -554771) >= 0) ? ((((long long) a29 * 3) + -554771) / 25) : (((((long long) a29 * 3) + -554771) / 25) - 1)) + 115809)) || ((((((((long long) a29 * 3) + -554771) >= 0) ? ((((long long) a29 * 3) + -554771) / 5) : (((((long long) a29 * 3) + -554771) / 5) - 1)) >= 0) ? ((((((long long) a29 * 3) + -554771) >= 0) ? ((((long long) a29 * 3) + -554771) / 5) : (((((long long) a29 * 3) + -554771) / 5) - 1)) % 5) : (((((((long long) a29 * 3) + -554771) >= 0) ? ((((long long) a29 * 3) + -554771) / 5) : (((((long long) a29 * 3) + -554771) / 5) - 1)) % 5) + 5)) != 0))) && (a8 == 15)) && (a25 == 10))) || ((((((260 <= a29) && (a29 <= 275)) && (a25 == 12)) && (a4 == 0)) && (a3 == 1)) && (a8 == 15))) || (((((((0 <= ((((((long long) a29 * 3) + -554771) >= 0) ? ((((long long) a29 * 3) + -554771) / 25) : (((((long long) a29 * 3) + -554771) / 25) - 1)) + 115809)) && (a4 == 0)) && (a3 == 1)) && (a29 <= 220)) && ((0 < ((((((long long) a29 * 3) + -554771) >= 0) ? ((((long long) a29 * 3) + -554771) / 25) : (((((long long) a29 * 3) + -554771) / 25) - 1)) + 115809)) || ((((((((long long) a29 * 3) + -554771) >= 0) ? ((((long long) a29 * 3) + -554771) / 5) : (((((long long) a29 * 3) + -554771) / 5) - 1)) >= 0) ? ((((((long long) a29 * 3) + -554771) >= 0) ? ((((long long) a29 * 3) + -554771) / 5) : (((((long long) a29 * 3) + -554771) / 5) - 1)) % 5) : (((((((long long) a29 * 3) + -554771) >= 0) ? ((((long long) a29 * 3) + -554771) / 5) : (((((long long) a29 * 3) + -554771) / 5) - 1)) % 5) + 5)) != 0))) && (a8 == 15)) && (a25 == 10))) || ((((((260 <= a29) && (a4 == 0)) && (a25 <= 10)) && (a3 == 1)) && (a23 <= 312)) && (a8 == 15))) || ((141 <= a29) && ((((((a25 == 11) && (a29 <= 274)) && (a3 == 1)) && (a4 == 1)) && (a8 == 15)) || ((((((a25 == 12) && (a29 <= 274)) && (a3 == 1)) && (a4 == 1)) && (312 <= a23)) && (a8 == 15))))) || (((((((((long long) a29 + 22) <= 0) && (a25 <= 10)) && (a3 == 1)) && (a4 == 1)) && (a23 <= 312)) && (a8 == 15)) && (141 <= a23))) || (((((a25 == 11) && (((long long) 119992 + a23) <= 0)) && (a4 == 1)) && (a8 == 15)) && (245 <= a29))) || ((((((((0 <= ((((((long long) a29 * 3) + -554771) >= 0) ? ((((long long) a29 * 3) + -554771) / 25) : (((((long long) a29 * 3) + -554771) / 25) - 1)) + 115809)) && (a4 == 0)) && (a25 <= 10)) && (a3 == 1)) && (a29 <= 220)) && (a23 <= 312)) && ((0 < ((((((long long) a29 * 3) + -554771) >= 0) ? ((((long long) a29 * 3) + -554771) / 25) : (((((long long) a29 * 3) + -554771) / 25) - 1)) + 115809)) || ((((((((long long) a29 * 3) + -554771) >= 0) ? ((((long long) a29 * 3) + -554771) / 5) : (((((long long) a29 * 3) + -554771) / 5) - 1)) >= 0) ? ((((((long long) a29 * 3) + -554771) >= 0) ? ((((long long) a29 * 3) + -554771) / 5) : (((((long long) a29 * 3) + -554771) / 5) - 1)) % 5) : (((((((long long) a29 * 3) + -554771) >= 0) ? ((((long long) a29 * 3) + -554771) / 5) : (((((long long) a29 * 3) + -554771) / 5) - 1)) % 5) + 5)) != 0))) && (a8 == 15))) || ((((((a25 == 12) && (((long long) a29 + 22) <= 0)) && (a3 == 1)) && (a4 == 1)) && (a23 <= 312)) && (a8 == 15))) || ((((((a25 == 12) && (a4 == 0)) && (a29 <= 274)) && (141 <= a29)) && (a3 == 1)) && (a8 == 15))) || (((((((a25 == 12) && (0 <= ((((((long long) a29 * 3) + -554771) >= 0) ? ((((long long) a29 * 3) + -554771) / 25) : (((((long long) a29 * 3) + -554771) / 25) - 1)) + 115809))) && (a4 == 0)) && (a3 == 1)) && (a23 <= 312)) && ((0 < ((((((long long) a29 * 3) + -554771) >= 0) ? ((((long long) a29 * 3) + -554771) / 25) : (((((long long) a29 * 3) + -554771) / 25) - 1)) + 115809)) || ((((((((long long) a29 * 3) + -554771) >= 0) ? ((((long long) a29 * 3) + -554771) / 5) : (((((long long) a29 * 3) + -554771) / 5) - 1)) >= 0) ? ((((((long long) a29 * 3) + -554771) >= 0) ? ((((long long) a29 * 3) + -554771) / 5) : (((((long long) a29 * 3) + -554771) / 5) - 1)) % 5) : (((((((long long) a29 * 3) + -554771) >= 0) ? ((((long long) a29 * 3) + -554771) / 5) : (((((long long) a29 * 3) + -554771) / 5) - 1)) % 5) + 5)) != 0))) && (a8 == 15))) || ((((((((a25 == 12) && (0 <= ((((((long long) a29 * 3) + -554771) >= 0) ? ((((long long) a29 * 3) + -554771) / 25) : (((((long long) a29 * 3) + -554771) / 25) - 1)) + 115809))) && (a4 == 0)) && (((long long) a29 + 580291) <= 0)) && (a3 == 1)) && ((0 < ((((((long long) a29 * 3) + -554771) >= 0) ? ((((long long) a29 * 3) + -554771) / 25) : (((((long long) a29 * 3) + -554771) / 25) - 1)) + 115809)) || ((((((((long long) a29 * 3) + -554771) >= 0) ? ((((long long) a29 * 3) + -554771) / 5) : (((((long long) a29 * 3) + -554771) / 5) - 1)) >= 0) ? ((((((long long) a29 * 3) + -554771) >= 0) ? ((((long long) a29 * 3) + -554771) / 5) : (((((long long) a29 * 3) + -554771) / 5) - 1)) % 5) : (((((((long long) a29 * 3) + -554771) >= 0) ? ((((long long) a29 * 3) + -554771) / 5) : (((((long long) a29 * 3) + -554771) / 5) - 1)) % 5) + 5)) != 0))) && (a8 == 15)) && ((4 < ((a29 >= 0) ? (a29 % 15) : ((a29 % 15) + 15))) || (((a29 >= 0) ? (a29 % 15) : ((a29 % 15) + 15)) == 0)))) || ((((((a25 == 11) && (a4 == 1)) && (103953 <= a29)) || (((((a25 != 13) && (a25 != 12)) && (((a25 <= 10) && (115637 <= a29)) || (115952 < a29))) && (a4 == 1)) && (a23 <= 312))) && (a3 == 1)) && (a8 == 15))) || ((((((a25 == 13) && (a29 <= 274)) && (141 <= a29)) && (a3 == 1)) && (a4 == 1)) && (a8 == 15))) || ((((((a29 <= 275) && (256 <= a29)) && (a25 == 11)) && (a3 == 1)) && (a4 == 1)) && (a8 == 15))) || ((((((a25 != 13) || (a29 < 278)) && (a25 != 12)) && ((((((a25 == 13) && (a29 <= 220)) && (((long long) 119992 + a23) <= 0)) && (a8 == 15)) || ((((260 <= a29) && (a25 <= 10)) && (((long long) 119992 + a23) <= 0)) && (a8 == 15))) || (((((long long) 119992 + a23) <= 0) && (a8 == 15)) && (115953 <= a29)))) && (a4 == 1)) && (130 <= a29))) || (((((a25 <= 10) && (141 <= a29)) && (a3 == 1)) && (a4 == 1)) && (a8 == 15))) || (((((((a25 == 13) && (a3 == 1)) && (a29 <= 220)) && (0 <= ((long long) 7792 + a29))) && (a4 == 1)) && (a8 == 15)) && (141 <= a23))) || (((((0 <= ((((((long long) a29 * 3) + -554771) >= 0) ? ((((long long) a29 * 3) + -554771) / 25) : (((((long long) a29 * 3) + -554771) / 25) - 1)) + 115809)) && (((((a25 <= 10) && (173 <= a23)) && (a4 == 1)) && (a23 <= 312)) || ((a4 == 1) && (a25 == 10)))) && (a3 == 1)) && ((0 < ((((((long long) a29 * 3) + -554771) >= 0) ? ((((long long) a29 * 3) + -554771) / 25) : (((((long long) a29 * 3) + -554771) / 25) - 1)) + 115809)) || ((((((((long long) a29 * 3) + -554771) >= 0) ? ((((long long) a29 * 3) + -554771) / 5) : (((((long long) a29 * 3) + -554771) / 5) - 1)) >= 0) ? ((((((long long) a29 * 3) + -554771) >= 0) ? ((((long long) a29 * 3) + -554771) / 5) : (((((long long) a29 * 3) + -554771) / 5) - 1)) % 5) : (((((((long long) a29 * 3) + -554771) >= 0) ? ((((long long) a29 * 3) + -554771) / 5) : (((((long long) a29 * 3) + -554771) / 5) - 1)) % 5) + 5)) != 0))) && (a8 == 15))) || (((((((260 <= a29) && (a25 == 12)) && (a29 <= 277)) && (173 <= a23)) && (a3 == 1)) && (a4 == 1)) && (a8 == 15))) || (((((((a25 != 13) && (300138 <= a29)) && (a25 != 12)) && (a3 == 1)) && (a29 <= 600297)) && (a4 == 1)) && (a8 == 15))) || (((((((a25 != 13) && (a25 != 12)) && (a29 <= 599998)) && (a3 == 1)) && (((a25 <= 10) && (115637 <= a29)) || (115952 < a29))) && (a4 == 1)) && (a8 == 15))) || ((((((a25 == 12) && (a3 == 1)) && (a4 == 1)) && (a23 <= 312)) && (a8 == 15)) && (141 <= a23))) || (((((((a25 == 13) && (0 <= ((((((long long) a29 * 3) + -554771) >= 0) ? ((((long long) a29 * 3) + -554771) / 25) : (((((long long) a29 * 3) + -554771) / 25) - 1)) + 115809))) && (a4 == 0)) && (a3 == 1)) && (a23 <= 312)) && ((0 < ((((((long long) a29 * 3) + -554771) >= 0) ? ((((long long) a29 * 3) + -554771) / 25) : (((((long long) a29 * 3) + -554771) / 25) - 1)) + 115809)) || ((((((((long long) a29 * 3) + -554771) >= 0) ? ((((long long) a29 * 3) + -554771) / 5) : (((((long long) a29 * 3) + -554771) / 5) - 1)) >= 0) ? ((((((long long) a29 * 3) + -554771) >= 0) ? ((((long long) a29 * 3) + -554771) / 5) : (((((long long) a29 * 3) + -554771) / 5) - 1)) % 5) : (((((((long long) a29 * 3) + -554771) >= 0) ? ((((long long) a29 * 3) + -554771) / 5) : (((((long long) a29 * 3) + -554771) / 5) - 1)) % 5) + 5)) != 0))) && (a8 == 15))) || (((((((0 <= ((((((long long) a29 * 3) + -554771) >= 0) ? ((((long long) a29 * 3) + -554771) / 25) : (((((long long) a29 * 3) + -554771) / 25) - 1)) + 115809)) && (a4 == 0)) && (a25 == 11)) && (a3 == 1)) && (a23 <= 312)) && ((0 < ((((((long long) a29 * 3) + -554771) >= 0) ? ((((long long) a29 * 3) + -554771) / 25) : (((((long long) a29 * 3) + -554771) / 25) - 1)) + 115809)) || ((((((((long long) a29 * 3) + -554771) >= 0) ? ((((long long) a29 * 3) + -554771) / 5) : (((((long long) a29 * 3) + -554771) / 5) - 1)) >= 0) ? ((((((long long) a29 * 3) + -554771) >= 0) ? ((((long long) a29 * 3) + -554771) / 5) : (((((long long) a29 * 3) + -554771) / 5) - 1)) % 5) : (((((((long long) a29 * 3) + -554771) >= 0) ? ((((long long) a29 * 3) + -554771) / 5) : (((((long long) a29 * 3) + -554771) / 5) - 1)) % 5) + 5)) != 0))) && (a8 == 15))) || ((((((long long) 119992 + a23) <= 0) && (a4 == 1)) && (a8 == 15)) && (a25 == 10))) || ((((((a25 == 13) && (173 <= a23)) && (a29 <= 599998)) && (a3 == 1)) && (a4 == 1)) && (a8 == 15))) || ((((((260 <= a29) && (a25 == 11)) && (a3 == 1)) && (a4 == 1)) && (a8 == 15)) && (141 <= a23))) || (((((((a25 == 12) && (0 <= ((((((long long) a29 * 3) + -554771) >= 0) ? ((((long long) a29 * 3) + -554771) / 25) : (((((long long) a29 * 3) + -554771) / 25) - 1)) + 115809))) && (((long long) a29 + 22) <= 0)) && (a3 == 1)) && (a4 == 1)) && ((0 < ((((((long long) a29 * 3) + -554771) >= 0) ? ((((long long) a29 * 3) + -554771) / 25) : (((((long long) a29 * 3) + -554771) / 25) - 1)) + 115809)) || ((((((((long long) a29 * 3) + -554771) >= 0) ? ((((long long) a29 * 3) + -554771) / 5) : (((((long long) a29 * 3) + -554771) / 5) - 1)) >= 0) ? ((((((long long) a29 * 3) + -554771) >= 0) ? ((((long long) a29 * 3) + -554771) / 5) : (((((long long) a29 * 3) + -554771) / 5) - 1)) % 5) : (((((((long long) a29 * 3) + -554771) >= 0) ? ((((long long) a29 * 3) + -554771) / 5) : (((((long long) a29 * 3) + -554771) / 5) - 1)) % 5) + 5)) != 0))) && (a8 == 15))) RESULT: Ultimate proved your program to be correct! [2024-10-23 21:03:16,771 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE