./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/bitvector/s3_srvr_3a.BV.c.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/bitvector/s3_srvr_3a.BV.c.cil.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 a8373cb8fe582bc9cb45d9609c89b33bf31b030c114c7e7fdfee851d52974fb9 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 10:22:31,200 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 10:22:31,281 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 10:22:31,286 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 10:22:31,288 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 10:22:31,328 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 10:22:31,329 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 10:22:31,329 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 10:22:31,330 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 10:22:31,332 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 10:22:31,332 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 10:22:31,332 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 10:22:31,333 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 10:22:31,333 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 10:22:31,334 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 10:22:31,336 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 10:22:31,336 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 10:22:31,337 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 10:22:31,337 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 10:22:31,337 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 10:22:31,337 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 10:22:31,341 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 10:22:31,341 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 10:22:31,342 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 10:22:31,342 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 10:22:31,342 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 10:22:31,342 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 10:22:31,343 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 10:22:31,343 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 10:22:31,343 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 10:22:31,343 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 10:22:31,343 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 10:22:31,344 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 10:22:31,344 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 10:22:31,344 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 10:22:31,344 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 10:22:31,345 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 10:22:31,345 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 10:22:31,345 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 10:22:31,347 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 10:22:31,347 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 10:22:31,348 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 10:22:31,348 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 -> a8373cb8fe582bc9cb45d9609c89b33bf31b030c114c7e7fdfee851d52974fb9 [2024-11-08 10:22:31,635 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 10:22:31,661 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 10:22:31,666 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 10:22:31,667 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 10:22:31,668 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 10:22:31,670 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/s3_srvr_3a.BV.c.cil.c [2024-11-08 10:22:33,225 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 10:22:33,418 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 10:22:33,418 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/s3_srvr_3a.BV.c.cil.c [2024-11-08 10:22:33,436 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1172753b9/221d286ce32842858653e0259798b60e/FLAGc0462d626 [2024-11-08 10:22:33,802 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1172753b9/221d286ce32842858653e0259798b60e [2024-11-08 10:22:33,804 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 10:22:33,805 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 10:22:33,806 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 10:22:33,806 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 10:22:33,810 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 10:22:33,811 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 10:22:33" (1/1) ... [2024-11-08 10:22:33,812 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d5a579f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:22:33, skipping insertion in model container [2024-11-08 10:22:33,812 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 10:22:33" (1/1) ... [2024-11-08 10:22:33,854 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 10:22:34,091 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/s3_srvr_3a.BV.c.cil.c[44494,44507] [2024-11-08 10:22:34,107 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 10:22:34,116 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 10:22:34,159 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/s3_srvr_3a.BV.c.cil.c[44494,44507] [2024-11-08 10:22:34,163 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 10:22:34,182 INFO L204 MainTranslator]: Completed translation [2024-11-08 10:22:34,182 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:22:34 WrapperNode [2024-11-08 10:22:34,183 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 10:22:34,184 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 10:22:34,184 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 10:22:34,184 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 10:22:34,190 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:22:34" (1/1) ... [2024-11-08 10:22:34,200 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:22:34" (1/1) ... [2024-11-08 10:22:34,242 INFO L138 Inliner]: procedures = 15, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 652 [2024-11-08 10:22:34,243 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 10:22:34,243 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 10:22:34,244 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 10:22:34,244 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 10:22:34,255 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:22:34" (1/1) ... [2024-11-08 10:22:34,255 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:22:34" (1/1) ... [2024-11-08 10:22:34,259 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:22:34" (1/1) ... [2024-11-08 10:22:34,291 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 10:22:34,292 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:22:34" (1/1) ... [2024-11-08 10:22:34,292 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:22:34" (1/1) ... [2024-11-08 10:22:34,303 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:22:34" (1/1) ... [2024-11-08 10:22:34,312 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:22:34" (1/1) ... [2024-11-08 10:22:34,315 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:22:34" (1/1) ... [2024-11-08 10:22:34,317 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:22:34" (1/1) ... [2024-11-08 10:22:34,321 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 10:22:34,322 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 10:22:34,322 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 10:22:34,322 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 10:22:34,323 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:22:34" (1/1) ... [2024-11-08 10:22:34,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 10:22:34,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 10:22:34,375 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 10:22:34,378 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 10:22:34,433 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 10:22:34,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 10:22:34,434 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 10:22:34,434 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 10:22:34,532 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 10:22:34,535 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 10:22:34,551 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-08 10:22:35,077 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##103: assume !false; [2024-11-08 10:22:35,077 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##102: assume false; [2024-11-08 10:22:35,121 INFO L? ?]: Removed 119 outVars from TransFormulas that were not future-live. [2024-11-08 10:22:35,121 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 10:22:35,140 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 10:22:35,158 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 10:22:35,159 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:22:35 BoogieIcfgContainer [2024-11-08 10:22:35,159 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 10:22:35,161 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 10:22:35,162 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 10:22:35,165 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 10:22:35,165 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 10:22:33" (1/3) ... [2024-11-08 10:22:35,166 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26862a8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 10:22:35, skipping insertion in model container [2024-11-08 10:22:35,166 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:22:34" (2/3) ... [2024-11-08 10:22:35,166 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26862a8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 10:22:35, skipping insertion in model container [2024-11-08 10:22:35,167 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:22:35" (3/3) ... [2024-11-08 10:22:35,168 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_srvr_3a.BV.c.cil.c [2024-11-08 10:22:35,197 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 10:22:35,197 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 10:22:35,269 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 10:22:35,274 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;@fa7f080, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 10:22:35,274 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 10:22:35,280 INFO L276 IsEmpty]: Start isEmpty. Operand has 171 states, 169 states have (on average 1.727810650887574) internal successors, (292), 170 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:35,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-08 10:22:35,290 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:22:35,290 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] [2024-11-08 10:22:35,291 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:22:35,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:22:35,296 INFO L85 PathProgramCache]: Analyzing trace with hash -1471869972, now seen corresponding path program 1 times [2024-11-08 10:22:35,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:22:35,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921121459] [2024-11-08 10:22:35,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:22:35,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:22:35,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:35,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:22:35,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:22:35,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921121459] [2024-11-08 10:22:35,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921121459] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:22:35,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:22:35,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:22:35,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719148814] [2024-11-08 10:22:35,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:22:35,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:22:35,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:22:35,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:22:35,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:22:35,791 INFO L87 Difference]: Start difference. First operand has 171 states, 169 states have (on average 1.727810650887574) internal successors, (292), 170 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:36,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:22:36,026 INFO L93 Difference]: Finished difference Result 371 states and 642 transitions. [2024-11-08 10:22:36,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:22:36,028 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 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 45 [2024-11-08 10:22:36,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:22:36,036 INFO L225 Difference]: With dead ends: 371 [2024-11-08 10:22:36,036 INFO L226 Difference]: Without dead ends: 191 [2024-11-08 10:22:36,039 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:22:36,042 INFO L432 NwaCegarLoop]: 211 mSDtfsCounter, 56 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 10:22:36,043 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 357 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 10:22:36,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2024-11-08 10:22:36,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 189. [2024-11-08 10:22:36,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 188 states have (on average 1.6117021276595744) internal successors, (303), 188 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:36,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 303 transitions. [2024-11-08 10:22:36,085 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 303 transitions. Word has length 45 [2024-11-08 10:22:36,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:22:36,086 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 303 transitions. [2024-11-08 10:22:36,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:36,088 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 303 transitions. [2024-11-08 10:22:36,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-08 10:22:36,090 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:22:36,090 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] [2024-11-08 10:22:36,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 10:22:36,091 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:22:36,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:22:36,093 INFO L85 PathProgramCache]: Analyzing trace with hash 1606388500, now seen corresponding path program 1 times [2024-11-08 10:22:36,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:22:36,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410786398] [2024-11-08 10:22:36,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:22:36,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:22:36,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:36,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:22:36,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:22:36,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410786398] [2024-11-08 10:22:36,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410786398] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:22:36,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:22:36,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:22:36,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957437330] [2024-11-08 10:22:36,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:22:36,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:22:36,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:22:36,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:22:36,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:22:36,219 INFO L87 Difference]: Start difference. First operand 189 states and 303 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:36,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:22:36,397 INFO L93 Difference]: Finished difference Result 409 states and 663 transitions. [2024-11-08 10:22:36,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:22:36,398 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 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 46 [2024-11-08 10:22:36,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:22:36,401 INFO L225 Difference]: With dead ends: 409 [2024-11-08 10:22:36,403 INFO L226 Difference]: Without dead ends: 232 [2024-11-08 10:22:36,404 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:22:36,405 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 37 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 10:22:36,407 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 281 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 10:22:36,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2024-11-08 10:22:36,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 230. [2024-11-08 10:22:36,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 229 states have (on average 1.6375545851528384) internal successors, (375), 229 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:36,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 375 transitions. [2024-11-08 10:22:36,425 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 375 transitions. Word has length 46 [2024-11-08 10:22:36,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:22:36,426 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 375 transitions. [2024-11-08 10:22:36,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:36,426 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 375 transitions. [2024-11-08 10:22:36,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-08 10:22:36,428 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:22:36,429 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:22:36,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 10:22:36,429 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:22:36,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:22:36,430 INFO L85 PathProgramCache]: Analyzing trace with hash 373294279, now seen corresponding path program 1 times [2024-11-08 10:22:36,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:22:36,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572964355] [2024-11-08 10:22:36,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:22:36,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:22:36,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:36,562 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-08 10:22:36,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:22:36,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572964355] [2024-11-08 10:22:36,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572964355] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:22:36,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:22:36,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:22:36,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013784399] [2024-11-08 10:22:36,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:22:36,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:22:36,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:22:36,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:22:36,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:22:36,568 INFO L87 Difference]: Start difference. First operand 230 states and 375 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:36,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:22:36,679 INFO L93 Difference]: Finished difference Result 457 states and 743 transitions. [2024-11-08 10:22:36,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:22:36,680 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 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 73 [2024-11-08 10:22:36,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:22:36,682 INFO L225 Difference]: With dead ends: 457 [2024-11-08 10:22:36,682 INFO L226 Difference]: Without dead ends: 241 [2024-11-08 10:22:36,683 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:22:36,693 INFO L432 NwaCegarLoop]: 219 mSDtfsCounter, 15 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 10:22:36,694 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 340 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 10:22:36,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2024-11-08 10:22:36,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 241. [2024-11-08 10:22:36,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 240 states have (on average 1.6083333333333334) internal successors, (386), 240 states have internal predecessors, (386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:36,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 386 transitions. [2024-11-08 10:22:36,715 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 386 transitions. Word has length 73 [2024-11-08 10:22:36,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:22:36,715 INFO L471 AbstractCegarLoop]: Abstraction has 241 states and 386 transitions. [2024-11-08 10:22:36,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:36,716 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 386 transitions. [2024-11-08 10:22:36,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-08 10:22:36,726 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:22:36,726 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-08 10:22:36,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 10:22:36,727 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:22:36,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:22:36,727 INFO L85 PathProgramCache]: Analyzing trace with hash -412045020, now seen corresponding path program 1 times [2024-11-08 10:22:36,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:22:36,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105909561] [2024-11-08 10:22:36,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:22:36,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:22:36,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:36,810 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-08 10:22:36,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:22:36,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105909561] [2024-11-08 10:22:36,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105909561] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:22:36,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:22:36,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:22:36,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120376352] [2024-11-08 10:22:36,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:22:36,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:22:36,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:22:36,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:22:36,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:22:36,813 INFO L87 Difference]: Start difference. First operand 241 states and 386 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:36,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:22:36,832 INFO L93 Difference]: Finished difference Result 459 states and 742 transitions. [2024-11-08 10:22:36,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:22:36,833 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 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 89 [2024-11-08 10:22:36,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:22:36,834 INFO L225 Difference]: With dead ends: 459 [2024-11-08 10:22:36,834 INFO L226 Difference]: Without dead ends: 243 [2024-11-08 10:22:36,835 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:22:36,840 INFO L432 NwaCegarLoop]: 228 mSDtfsCounter, 15 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 10:22:36,840 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 426 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 10:22:36,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2024-11-08 10:22:36,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 243. [2024-11-08 10:22:36,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 242 states have (on average 1.603305785123967) internal successors, (388), 242 states have internal predecessors, (388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:36,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 388 transitions. [2024-11-08 10:22:36,852 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 388 transitions. Word has length 89 [2024-11-08 10:22:36,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:22:36,853 INFO L471 AbstractCegarLoop]: Abstraction has 243 states and 388 transitions. [2024-11-08 10:22:36,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:36,853 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 388 transitions. [2024-11-08 10:22:36,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-08 10:22:36,855 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:22:36,855 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-08 10:22:36,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 10:22:36,855 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:22:36,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:22:36,856 INFO L85 PathProgramCache]: Analyzing trace with hash 1974464486, now seen corresponding path program 1 times [2024-11-08 10:22:36,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:22:36,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804507241] [2024-11-08 10:22:36,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:22:36,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:22:36,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:36,920 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-08 10:22:36,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:22:36,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804507241] [2024-11-08 10:22:36,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804507241] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:22:36,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:22:36,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:22:36,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950402076] [2024-11-08 10:22:36,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:22:36,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:22:36,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:22:36,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:22:36,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:22:36,922 INFO L87 Difference]: Start difference. First operand 243 states and 388 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:37,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:22:37,042 INFO L93 Difference]: Finished difference Result 480 states and 774 transitions. [2024-11-08 10:22:37,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:22:37,042 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 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 89 [2024-11-08 10:22:37,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:22:37,044 INFO L225 Difference]: With dead ends: 480 [2024-11-08 10:22:37,044 INFO L226 Difference]: Without dead ends: 264 [2024-11-08 10:22:37,045 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:22:37,045 INFO L432 NwaCegarLoop]: 224 mSDtfsCounter, 9 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 10:22:37,046 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 365 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 10:22:37,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2024-11-08 10:22:37,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 264. [2024-11-08 10:22:37,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 263 states have (on average 1.5741444866920151) internal successors, (414), 263 states have internal predecessors, (414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:37,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 414 transitions. [2024-11-08 10:22:37,060 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 414 transitions. Word has length 89 [2024-11-08 10:22:37,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:22:37,061 INFO L471 AbstractCegarLoop]: Abstraction has 264 states and 414 transitions. [2024-11-08 10:22:37,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:37,061 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 414 transitions. [2024-11-08 10:22:37,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-08 10:22:37,062 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:22:37,063 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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-11-08 10:22:37,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 10:22:37,063 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:22:37,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:22:37,064 INFO L85 PathProgramCache]: Analyzing trace with hash 731548763, now seen corresponding path program 1 times [2024-11-08 10:22:37,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:22:37,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879550118] [2024-11-08 10:22:37,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:22:37,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:22:37,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:37,153 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-08 10:22:37,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:22:37,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879550118] [2024-11-08 10:22:37,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879550118] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:22:37,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:22:37,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:22:37,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343110478] [2024-11-08 10:22:37,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:22:37,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:22:37,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:22:37,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:22:37,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:22:37,156 INFO L87 Difference]: Start difference. First operand 264 states and 414 transitions. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:37,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:22:37,309 INFO L93 Difference]: Finished difference Result 544 states and 867 transitions. [2024-11-08 10:22:37,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:22:37,312 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 110 [2024-11-08 10:22:37,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:22:37,313 INFO L225 Difference]: With dead ends: 544 [2024-11-08 10:22:37,314 INFO L226 Difference]: Without dead ends: 307 [2024-11-08 10:22:37,314 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:22:37,315 INFO L432 NwaCegarLoop]: 219 mSDtfsCounter, 22 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 10:22:37,317 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 359 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 10:22:37,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2024-11-08 10:22:37,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 305. [2024-11-08 10:22:37,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 304 states have (on average 1.430921052631579) internal successors, (435), 304 states have internal predecessors, (435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:37,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 435 transitions. [2024-11-08 10:22:37,326 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 435 transitions. Word has length 110 [2024-11-08 10:22:37,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:22:37,327 INFO L471 AbstractCegarLoop]: Abstraction has 305 states and 435 transitions. [2024-11-08 10:22:37,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:37,327 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 435 transitions. [2024-11-08 10:22:37,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-08 10:22:37,329 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:22:37,329 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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-11-08 10:22:37,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 10:22:37,329 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:22:37,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:22:37,330 INFO L85 PathProgramCache]: Analyzing trace with hash -1654960743, now seen corresponding path program 1 times [2024-11-08 10:22:37,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:22:37,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628757611] [2024-11-08 10:22:37,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:22:37,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:22:37,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:37,397 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-08 10:22:37,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:22:37,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628757611] [2024-11-08 10:22:37,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628757611] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:22:37,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:22:37,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:22:37,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284868032] [2024-11-08 10:22:37,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:22:37,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:22:37,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:22:37,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:22:37,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:22:37,401 INFO L87 Difference]: Start difference. First operand 305 states and 435 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:37,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:22:37,513 INFO L93 Difference]: Finished difference Result 606 states and 872 transitions. [2024-11-08 10:22:37,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:22:37,514 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 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 110 [2024-11-08 10:22:37,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:22:37,516 INFO L225 Difference]: With dead ends: 606 [2024-11-08 10:22:37,516 INFO L226 Difference]: Without dead ends: 328 [2024-11-08 10:22:37,516 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:22:37,517 INFO L432 NwaCegarLoop]: 240 mSDtfsCounter, 9 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 10:22:37,518 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 381 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 10:22:37,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2024-11-08 10:22:37,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 328. [2024-11-08 10:22:37,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 327 states have (on average 1.415902140672783) internal successors, (463), 327 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:37,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 463 transitions. [2024-11-08 10:22:37,530 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 463 transitions. Word has length 110 [2024-11-08 10:22:37,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:22:37,532 INFO L471 AbstractCegarLoop]: Abstraction has 328 states and 463 transitions. [2024-11-08 10:22:37,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:37,532 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 463 transitions. [2024-11-08 10:22:37,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-08 10:22:37,533 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:22:37,533 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:22:37,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 10:22:37,534 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:22:37,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:22:37,535 INFO L85 PathProgramCache]: Analyzing trace with hash 521344006, now seen corresponding path program 1 times [2024-11-08 10:22:37,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:22:37,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243119113] [2024-11-08 10:22:37,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:22:37,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:22:37,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:37,624 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-11-08 10:22:37,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:22:37,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243119113] [2024-11-08 10:22:37,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243119113] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:22:37,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:22:37,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:22:37,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722755335] [2024-11-08 10:22:37,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:22:37,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:22:37,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:22:37,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:22:37,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:22:37,628 INFO L87 Difference]: Start difference. First operand 328 states and 463 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:37,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:22:37,668 INFO L93 Difference]: Finished difference Result 924 states and 1313 transitions. [2024-11-08 10:22:37,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:22:37,668 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 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 122 [2024-11-08 10:22:37,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:22:37,671 INFO L225 Difference]: With dead ends: 924 [2024-11-08 10:22:37,672 INFO L226 Difference]: Without dead ends: 623 [2024-11-08 10:22:37,673 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:22:37,674 INFO L432 NwaCegarLoop]: 411 mSDtfsCounter, 156 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 629 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 10:22:37,674 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 629 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 10:22:37,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2024-11-08 10:22:37,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 623. [2024-11-08 10:22:37,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 623 states, 622 states have (on average 1.414790996784566) internal successors, (880), 622 states have internal predecessors, (880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:37,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 880 transitions. [2024-11-08 10:22:37,691 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 880 transitions. Word has length 122 [2024-11-08 10:22:37,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:22:37,691 INFO L471 AbstractCegarLoop]: Abstraction has 623 states and 880 transitions. [2024-11-08 10:22:37,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:37,691 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 880 transitions. [2024-11-08 10:22:37,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-08 10:22:37,692 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:22:37,693 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:22:37,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 10:22:37,693 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:22:37,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:22:37,693 INFO L85 PathProgramCache]: Analyzing trace with hash -376049272, now seen corresponding path program 1 times [2024-11-08 10:22:37,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:22:37,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091331900] [2024-11-08 10:22:37,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:22:37,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:22:37,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:37,748 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-08 10:22:37,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:22:37,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091331900] [2024-11-08 10:22:37,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091331900] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:22:37,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:22:37,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:22:37,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946823272] [2024-11-08 10:22:37,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:22:37,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:22:37,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:22:37,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:22:37,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:22:37,751 INFO L87 Difference]: Start difference. First operand 623 states and 880 transitions. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:37,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:22:37,789 INFO L93 Difference]: Finished difference Result 1474 states and 2101 transitions. [2024-11-08 10:22:37,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:22:37,790 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 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 122 [2024-11-08 10:22:37,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:22:37,794 INFO L225 Difference]: With dead ends: 1474 [2024-11-08 10:22:37,794 INFO L226 Difference]: Without dead ends: 878 [2024-11-08 10:22:37,795 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:22:37,799 INFO L432 NwaCegarLoop]: 263 mSDtfsCounter, 158 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 10:22:37,800 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 481 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 10:22:37,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 878 states. [2024-11-08 10:22:37,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 878 to 878. [2024-11-08 10:22:37,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 878 states, 877 states have (on average 1.426453819840365) internal successors, (1251), 877 states have internal predecessors, (1251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:37,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 878 states to 878 states and 1251 transitions. [2024-11-08 10:22:37,820 INFO L78 Accepts]: Start accepts. Automaton has 878 states and 1251 transitions. Word has length 122 [2024-11-08 10:22:37,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:22:37,821 INFO L471 AbstractCegarLoop]: Abstraction has 878 states and 1251 transitions. [2024-11-08 10:22:37,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:37,821 INFO L276 IsEmpty]: Start isEmpty. Operand 878 states and 1251 transitions. [2024-11-08 10:22:37,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-08 10:22:37,822 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:22:37,822 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:22:37,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 10:22:37,823 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:22:37,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:22:37,823 INFO L85 PathProgramCache]: Analyzing trace with hash 2039787078, now seen corresponding path program 1 times [2024-11-08 10:22:37,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:22:37,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740508547] [2024-11-08 10:22:37,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:22:37,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:22:37,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:37,864 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-11-08 10:22:37,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:22:37,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740508547] [2024-11-08 10:22:37,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740508547] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:22:37,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:22:37,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:22:37,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770354185] [2024-11-08 10:22:37,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:22:37,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:22:37,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:22:37,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:22:37,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:22:37,866 INFO L87 Difference]: Start difference. First operand 878 states and 1251 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:37,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:22:37,892 INFO L93 Difference]: Finished difference Result 1753 states and 2497 transitions. [2024-11-08 10:22:37,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:22:37,893 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 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 122 [2024-11-08 10:22:37,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:22:37,897 INFO L225 Difference]: With dead ends: 1753 [2024-11-08 10:22:37,897 INFO L226 Difference]: Without dead ends: 902 [2024-11-08 10:22:37,898 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:22:37,899 INFO L432 NwaCegarLoop]: 238 mSDtfsCounter, 10 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 10:22:37,899 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 456 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 10:22:37,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 902 states. [2024-11-08 10:22:37,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 902 to 902. [2024-11-08 10:22:37,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 902 states, 901 states have (on average 1.420643729189789) internal successors, (1280), 901 states have internal predecessors, (1280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:37,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 902 states to 902 states and 1280 transitions. [2024-11-08 10:22:37,920 INFO L78 Accepts]: Start accepts. Automaton has 902 states and 1280 transitions. Word has length 122 [2024-11-08 10:22:37,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:22:37,920 INFO L471 AbstractCegarLoop]: Abstraction has 902 states and 1280 transitions. [2024-11-08 10:22:37,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:37,920 INFO L276 IsEmpty]: Start isEmpty. Operand 902 states and 1280 transitions. [2024-11-08 10:22:37,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2024-11-08 10:22:37,923 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:22:37,924 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 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] [2024-11-08 10:22:37,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-08 10:22:37,924 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:22:37,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:22:37,925 INFO L85 PathProgramCache]: Analyzing trace with hash -1040332397, now seen corresponding path program 1 times [2024-11-08 10:22:37,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:22:37,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216972180] [2024-11-08 10:22:37,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:22:37,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:22:37,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:38,017 INFO L134 CoverageAnalysis]: Checked inductivity of 458 backedges. 327 proven. 0 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2024-11-08 10:22:38,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:22:38,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216972180] [2024-11-08 10:22:38,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216972180] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:22:38,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:22:38,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:22:38,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956996903] [2024-11-08 10:22:38,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:22:38,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:22:38,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:22:38,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:22:38,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:22:38,019 INFO L87 Difference]: Start difference. First operand 902 states and 1280 transitions. Second operand has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:38,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:22:38,054 INFO L93 Difference]: Finished difference Result 2534 states and 3632 transitions. [2024-11-08 10:22:38,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:22:38,055 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 230 [2024-11-08 10:22:38,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:22:38,062 INFO L225 Difference]: With dead ends: 2534 [2024-11-08 10:22:38,062 INFO L226 Difference]: Without dead ends: 1659 [2024-11-08 10:22:38,064 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:22:38,065 INFO L432 NwaCegarLoop]: 390 mSDtfsCounter, 155 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 612 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 10:22:38,065 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 612 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 10:22:38,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1659 states. [2024-11-08 10:22:38,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1659 to 1657. [2024-11-08 10:22:38,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1657 states, 1656 states have (on average 1.4359903381642511) internal successors, (2378), 1656 states have internal predecessors, (2378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:38,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1657 states to 1657 states and 2378 transitions. [2024-11-08 10:22:38,104 INFO L78 Accepts]: Start accepts. Automaton has 1657 states and 2378 transitions. Word has length 230 [2024-11-08 10:22:38,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:22:38,104 INFO L471 AbstractCegarLoop]: Abstraction has 1657 states and 2378 transitions. [2024-11-08 10:22:38,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:38,105 INFO L276 IsEmpty]: Start isEmpty. Operand 1657 states and 2378 transitions. [2024-11-08 10:22:38,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2024-11-08 10:22:38,108 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:22:38,108 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 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] [2024-11-08 10:22:38,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-08 10:22:38,109 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:22:38,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:22:38,109 INFO L85 PathProgramCache]: Analyzing trace with hash 932832981, now seen corresponding path program 1 times [2024-11-08 10:22:38,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:22:38,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217169663] [2024-11-08 10:22:38,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:22:38,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:22:38,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:38,200 INFO L134 CoverageAnalysis]: Checked inductivity of 458 backedges. 325 proven. 0 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2024-11-08 10:22:38,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:22:38,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217169663] [2024-11-08 10:22:38,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217169663] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:22:38,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:22:38,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:22:38,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892914183] [2024-11-08 10:22:38,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:22:38,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:22:38,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:22:38,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:22:38,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:22:38,202 INFO L87 Difference]: Start difference. First operand 1657 states and 2378 transitions. Second operand has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:38,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:22:38,337 INFO L93 Difference]: Finished difference Result 3473 states and 5039 transitions. [2024-11-08 10:22:38,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:22:38,338 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 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 230 [2024-11-08 10:22:38,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:22:38,344 INFO L225 Difference]: With dead ends: 3473 [2024-11-08 10:22:38,344 INFO L226 Difference]: Without dead ends: 1843 [2024-11-08 10:22:38,346 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:22:38,347 INFO L432 NwaCegarLoop]: 240 mSDtfsCounter, 10 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 10:22:38,347 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 378 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 10:22:38,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1843 states. [2024-11-08 10:22:38,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1843 to 1843. [2024-11-08 10:22:38,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1843 states, 1842 states have (on average 1.4082519001085776) internal successors, (2594), 1842 states have internal predecessors, (2594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:38,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1843 states to 1843 states and 2594 transitions. [2024-11-08 10:22:38,382 INFO L78 Accepts]: Start accepts. Automaton has 1843 states and 2594 transitions. Word has length 230 [2024-11-08 10:22:38,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:22:38,382 INFO L471 AbstractCegarLoop]: Abstraction has 1843 states and 2594 transitions. [2024-11-08 10:22:38,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:38,382 INFO L276 IsEmpty]: Start isEmpty. Operand 1843 states and 2594 transitions. [2024-11-08 10:22:38,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2024-11-08 10:22:38,386 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:22:38,387 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 3, 3, 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-11-08 10:22:38,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-08 10:22:38,387 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:22:38,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:22:38,387 INFO L85 PathProgramCache]: Analyzing trace with hash -1238424976, now seen corresponding path program 2 times [2024-11-08 10:22:38,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:22:38,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046085387] [2024-11-08 10:22:38,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:22:38,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:22:38,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:38,490 INFO L134 CoverageAnalysis]: Checked inductivity of 617 backedges. 319 proven. 0 refuted. 0 times theorem prover too weak. 298 trivial. 0 not checked. [2024-11-08 10:22:38,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:22:38,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046085387] [2024-11-08 10:22:38,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046085387] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:22:38,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:22:38,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:22:38,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096654601] [2024-11-08 10:22:38,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:22:38,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:22:38,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:22:38,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:22:38,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:22:38,492 INFO L87 Difference]: Start difference. First operand 1843 states and 2594 transitions. Second operand has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:38,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:22:38,648 INFO L93 Difference]: Finished difference Result 3905 states and 5585 transitions. [2024-11-08 10:22:38,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:22:38,649 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 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-11-08 10:22:38,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:22:38,654 INFO L225 Difference]: With dead ends: 3905 [2024-11-08 10:22:38,654 INFO L226 Difference]: Without dead ends: 1247 [2024-11-08 10:22:38,657 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:22:38,657 INFO L432 NwaCegarLoop]: 240 mSDtfsCounter, 19 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 10:22:38,657 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 381 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 10:22:38,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1247 states. [2024-11-08 10:22:38,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1247 to 1245. [2024-11-08 10:22:38,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1245 states, 1244 states have (on average 1.3954983922829582) internal successors, (1736), 1244 states have internal predecessors, (1736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:38,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1245 states to 1245 states and 1736 transitions. [2024-11-08 10:22:38,714 INFO L78 Accepts]: Start accepts. Automaton has 1245 states and 1736 transitions. Word has length 258 [2024-11-08 10:22:38,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:22:38,715 INFO L471 AbstractCegarLoop]: Abstraction has 1245 states and 1736 transitions. [2024-11-08 10:22:38,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:38,715 INFO L276 IsEmpty]: Start isEmpty. Operand 1245 states and 1736 transitions. [2024-11-08 10:22:38,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2024-11-08 10:22:38,718 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:22:38,719 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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] [2024-11-08 10:22:38,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-08 10:22:38,720 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:22:38,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:22:38,720 INFO L85 PathProgramCache]: Analyzing trace with hash 36764180, now seen corresponding path program 1 times [2024-11-08 10:22:38,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:22:38,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225641448] [2024-11-08 10:22:38,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:22:38,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:22:38,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:38,798 INFO L134 CoverageAnalysis]: Checked inductivity of 789 backedges. 370 proven. 0 refuted. 0 times theorem prover too weak. 419 trivial. 0 not checked. [2024-11-08 10:22:38,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:22:38,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225641448] [2024-11-08 10:22:38,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225641448] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:22:38,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:22:38,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:22:38,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877894113] [2024-11-08 10:22:38,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:22:38,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:22:38,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:22:38,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:22:38,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:22:38,799 INFO L87 Difference]: Start difference. First operand 1245 states and 1736 transitions. Second operand has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:38,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:22:38,917 INFO L93 Difference]: Finished difference Result 2563 states and 3597 transitions. [2024-11-08 10:22:38,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:22:38,917 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 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 291 [2024-11-08 10:22:38,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:22:38,922 INFO L225 Difference]: With dead ends: 2563 [2024-11-08 10:22:38,922 INFO L226 Difference]: Without dead ends: 1345 [2024-11-08 10:22:38,924 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:22:38,924 INFO L432 NwaCegarLoop]: 234 mSDtfsCounter, 9 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 10:22:38,925 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 375 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 10:22:38,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1345 states. [2024-11-08 10:22:38,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1345 to 1345. [2024-11-08 10:22:38,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1345 states, 1344 states have (on average 1.380952380952381) internal successors, (1856), 1344 states have internal predecessors, (1856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:38,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1345 states to 1345 states and 1856 transitions. [2024-11-08 10:22:38,952 INFO L78 Accepts]: Start accepts. Automaton has 1345 states and 1856 transitions. Word has length 291 [2024-11-08 10:22:38,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:22:38,953 INFO L471 AbstractCegarLoop]: Abstraction has 1345 states and 1856 transitions. [2024-11-08 10:22:38,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:38,953 INFO L276 IsEmpty]: Start isEmpty. Operand 1345 states and 1856 transitions. [2024-11-08 10:22:38,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2024-11-08 10:22:38,957 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:22:38,957 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 8, 8, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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-11-08 10:22:38,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-08 10:22:38,957 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:22:38,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:22:38,958 INFO L85 PathProgramCache]: Analyzing trace with hash 432890531, now seen corresponding path program 1 times [2024-11-08 10:22:38,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:22:38,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900401770] [2024-11-08 10:22:38,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:22:38,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:22:38,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:39,037 INFO L134 CoverageAnalysis]: Checked inductivity of 954 backedges. 500 proven. 0 refuted. 0 times theorem prover too weak. 454 trivial. 0 not checked. [2024-11-08 10:22:39,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:22:39,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900401770] [2024-11-08 10:22:39,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900401770] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:22:39,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:22:39,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:22:39,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443977098] [2024-11-08 10:22:39,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:22:39,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:22:39,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:22:39,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:22:39,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:22:39,040 INFO L87 Difference]: Start difference. First operand 1345 states and 1856 transitions. Second operand has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:39,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:22:39,160 INFO L93 Difference]: Finished difference Result 2771 states and 3853 transitions. [2024-11-08 10:22:39,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:22:39,161 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 318 [2024-11-08 10:22:39,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:22:39,170 INFO L225 Difference]: With dead ends: 2771 [2024-11-08 10:22:39,171 INFO L226 Difference]: Without dead ends: 1453 [2024-11-08 10:22:39,175 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:22:39,176 INFO L432 NwaCegarLoop]: 234 mSDtfsCounter, 9 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 10:22:39,177 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 375 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 10:22:39,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1453 states. [2024-11-08 10:22:39,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1453 to 1453. [2024-11-08 10:22:39,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1453 states, 1452 states have (on average 1.3663911845730028) internal successors, (1984), 1452 states have internal predecessors, (1984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:39,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1453 states to 1453 states and 1984 transitions. [2024-11-08 10:22:39,207 INFO L78 Accepts]: Start accepts. Automaton has 1453 states and 1984 transitions. Word has length 318 [2024-11-08 10:22:39,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:22:39,207 INFO L471 AbstractCegarLoop]: Abstraction has 1453 states and 1984 transitions. [2024-11-08 10:22:39,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:39,208 INFO L276 IsEmpty]: Start isEmpty. Operand 1453 states and 1984 transitions. [2024-11-08 10:22:39,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 342 [2024-11-08 10:22:39,227 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:22:39,227 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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-11-08 10:22:39,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-08 10:22:39,227 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:22:39,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:22:39,228 INFO L85 PathProgramCache]: Analyzing trace with hash -397424155, now seen corresponding path program 1 times [2024-11-08 10:22:39,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:22:39,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268319715] [2024-11-08 10:22:39,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:22:39,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:22:39,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:39,327 INFO L134 CoverageAnalysis]: Checked inductivity of 1151 backedges. 642 proven. 0 refuted. 0 times theorem prover too weak. 509 trivial. 0 not checked. [2024-11-08 10:22:39,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:22:39,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268319715] [2024-11-08 10:22:39,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268319715] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:22:39,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:22:39,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:22:39,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284752804] [2024-11-08 10:22:39,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:22:39,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:22:39,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:22:39,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:22:39,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:22:39,329 INFO L87 Difference]: Start difference. First operand 1453 states and 1984 transitions. Second operand has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:39,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:22:39,457 INFO L93 Difference]: Finished difference Result 2995 states and 4125 transitions. [2024-11-08 10:22:39,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:22:39,457 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 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 341 [2024-11-08 10:22:39,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:22:39,463 INFO L225 Difference]: With dead ends: 2995 [2024-11-08 10:22:39,463 INFO L226 Difference]: Without dead ends: 1569 [2024-11-08 10:22:39,465 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:22:39,465 INFO L432 NwaCegarLoop]: 234 mSDtfsCounter, 9 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 10:22:39,465 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 375 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 10:22:39,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1569 states. [2024-11-08 10:22:39,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1569 to 1569. [2024-11-08 10:22:39,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1569 states, 1568 states have (on average 1.3520408163265305) internal successors, (2120), 1568 states have internal predecessors, (2120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:39,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1569 states to 1569 states and 2120 transitions. [2024-11-08 10:22:39,497 INFO L78 Accepts]: Start accepts. Automaton has 1569 states and 2120 transitions. Word has length 341 [2024-11-08 10:22:39,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:22:39,497 INFO L471 AbstractCegarLoop]: Abstraction has 1569 states and 2120 transitions. [2024-11-08 10:22:39,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:39,497 INFO L276 IsEmpty]: Start isEmpty. Operand 1569 states and 2120 transitions. [2024-11-08 10:22:39,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 375 [2024-11-08 10:22:39,502 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:22:39,502 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 10, 10, 9, 9, 8, 8, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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] [2024-11-08 10:22:39,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-08 10:22:39,503 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:22:39,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:22:39,503 INFO L85 PathProgramCache]: Analyzing trace with hash -2110167608, now seen corresponding path program 1 times [2024-11-08 10:22:39,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:22:39,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970913684] [2024-11-08 10:22:39,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:22:39,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:22:39,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:39,636 INFO L134 CoverageAnalysis]: Checked inductivity of 1396 backedges. 905 proven. 26 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2024-11-08 10:22:39,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:22:39,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970913684] [2024-11-08 10:22:39,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970913684] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 10:22:39,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [46766020] [2024-11-08 10:22:39,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:22:39,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:22:39,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 10:22:39,648 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 10:22:39,650 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 10:22:39,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:39,828 INFO L255 TraceCheckSpWp]: Trace formula consists of 603 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 10:22:39,853 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:22:40,028 INFO L134 CoverageAnalysis]: Checked inductivity of 1396 backedges. 905 proven. 26 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2024-11-08 10:22:40,030 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 10:22:40,162 INFO L134 CoverageAnalysis]: Checked inductivity of 1396 backedges. 905 proven. 26 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2024-11-08 10:22:40,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [46766020] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 10:22:40,162 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 10:22:40,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2024-11-08 10:22:40,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259149136] [2024-11-08 10:22:40,162 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 10:22:40,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 10:22:40,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:22:40,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 10:22:40,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-08 10:22:40,164 INFO L87 Difference]: Start difference. First operand 1569 states and 2120 transitions. Second operand has 6 states, 6 states have (on average 40.666666666666664) internal successors, (244), 6 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:40,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:22:40,573 INFO L93 Difference]: Finished difference Result 3886 states and 5316 transitions. [2024-11-08 10:22:40,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 10:22:40,574 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 40.666666666666664) internal successors, (244), 6 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 374 [2024-11-08 10:22:40,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:22:40,581 INFO L225 Difference]: With dead ends: 3886 [2024-11-08 10:22:40,581 INFO L226 Difference]: Without dead ends: 2235 [2024-11-08 10:22:40,584 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 758 GetRequests, 750 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2024-11-08 10:22:40,584 INFO L432 NwaCegarLoop]: 265 mSDtfsCounter, 525 mSDsluCounter, 580 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 525 SdHoareTripleChecker+Valid, 845 SdHoareTripleChecker+Invalid, 413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 10:22:40,585 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [525 Valid, 845 Invalid, 413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 10:22:40,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2235 states. [2024-11-08 10:22:40,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2235 to 1629. [2024-11-08 10:22:40,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1629 states, 1628 states have (on average 1.3433660933660934) internal successors, (2187), 1628 states have internal predecessors, (2187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:40,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1629 states to 1629 states and 2187 transitions. [2024-11-08 10:22:40,621 INFO L78 Accepts]: Start accepts. Automaton has 1629 states and 2187 transitions. Word has length 374 [2024-11-08 10:22:40,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:22:40,621 INFO L471 AbstractCegarLoop]: Abstraction has 1629 states and 2187 transitions. [2024-11-08 10:22:40,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 40.666666666666664) internal successors, (244), 6 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:40,621 INFO L276 IsEmpty]: Start isEmpty. Operand 1629 states and 2187 transitions. [2024-11-08 10:22:40,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 475 [2024-11-08 10:22:40,627 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:22:40,628 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 13, 13, 12, 12, 11, 11, 10, 10, 10, 10, 8, 6, 6, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:22:40,645 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-08 10:22:40,828 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,SelfDestructingSolverStorable16 [2024-11-08 10:22:40,829 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:22:40,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:22:40,831 INFO L85 PathProgramCache]: Analyzing trace with hash -1180231711, now seen corresponding path program 1 times [2024-11-08 10:22:40,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:22:40,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722096238] [2024-11-08 10:22:40,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:22:40,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:22:40,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:40,967 INFO L134 CoverageAnalysis]: Checked inductivity of 2338 backedges. 1323 proven. 0 refuted. 0 times theorem prover too weak. 1015 trivial. 0 not checked. [2024-11-08 10:22:40,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:22:40,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722096238] [2024-11-08 10:22:40,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722096238] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:22:40,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:22:40,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:22:40,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54980843] [2024-11-08 10:22:40,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:22:40,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:22:40,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:22:40,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:22:40,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:22:40,970 INFO L87 Difference]: Start difference. First operand 1629 states and 2187 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:41,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:22:41,111 INFO L93 Difference]: Finished difference Result 3401 states and 4629 transitions. [2024-11-08 10:22:41,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:22:41,111 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 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 474 [2024-11-08 10:22:41,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:22:41,117 INFO L225 Difference]: With dead ends: 3401 [2024-11-08 10:22:41,117 INFO L226 Difference]: Without dead ends: 1799 [2024-11-08 10:22:41,119 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:22:41,120 INFO L432 NwaCegarLoop]: 232 mSDtfsCounter, 9 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 10:22:41,120 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 373 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 10:22:41,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1799 states. [2024-11-08 10:22:41,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1799 to 1799. [2024-11-08 10:22:41,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1799 states, 1798 states have (on average 1.324805339265851) internal successors, (2382), 1798 states have internal predecessors, (2382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:41,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1799 states to 1799 states and 2382 transitions. [2024-11-08 10:22:41,157 INFO L78 Accepts]: Start accepts. Automaton has 1799 states and 2382 transitions. Word has length 474 [2024-11-08 10:22:41,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:22:41,157 INFO L471 AbstractCegarLoop]: Abstraction has 1799 states and 2382 transitions. [2024-11-08 10:22:41,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:41,157 INFO L276 IsEmpty]: Start isEmpty. Operand 1799 states and 2382 transitions. [2024-11-08 10:22:41,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 537 [2024-11-08 10:22:41,165 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:22:41,165 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 15, 15, 14, 14, 13, 13, 12, 12, 12, 12, 10, 8, 8, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:22:41,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-08 10:22:41,165 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:22:41,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:22:41,166 INFO L85 PathProgramCache]: Analyzing trace with hash -1146052641, now seen corresponding path program 1 times [2024-11-08 10:22:41,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:22:41,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524761634] [2024-11-08 10:22:41,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:22:41,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:22:41,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:41,290 INFO L134 CoverageAnalysis]: Checked inductivity of 3103 backedges. 1760 proven. 0 refuted. 0 times theorem prover too weak. 1343 trivial. 0 not checked. [2024-11-08 10:22:41,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:22:41,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524761634] [2024-11-08 10:22:41,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524761634] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:22:41,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:22:41,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:22:41,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329199796] [2024-11-08 10:22:41,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:22:41,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:22:41,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:22:41,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:22:41,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:22:41,292 INFO L87 Difference]: Start difference. First operand 1799 states and 2382 transitions. Second operand has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 3 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:41,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:22:41,441 INFO L93 Difference]: Finished difference Result 3751 states and 5039 transitions. [2024-11-08 10:22:41,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:22:41,442 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 3 states have internal predecessors, (175), 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 536 [2024-11-08 10:22:41,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:22:41,449 INFO L225 Difference]: With dead ends: 3751 [2024-11-08 10:22:41,449 INFO L226 Difference]: Without dead ends: 1979 [2024-11-08 10:22:41,451 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:22:41,452 INFO L432 NwaCegarLoop]: 232 mSDtfsCounter, 9 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 10:22:41,452 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 373 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 10:22:41,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1979 states. [2024-11-08 10:22:41,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1979 to 1979. [2024-11-08 10:22:41,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1979 states, 1978 states have (on average 1.3078867542972699) internal successors, (2587), 1978 states have internal predecessors, (2587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:41,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1979 states to 1979 states and 2587 transitions. [2024-11-08 10:22:41,492 INFO L78 Accepts]: Start accepts. Automaton has 1979 states and 2587 transitions. Word has length 536 [2024-11-08 10:22:41,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:22:41,493 INFO L471 AbstractCegarLoop]: Abstraction has 1979 states and 2587 transitions. [2024-11-08 10:22:41,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 3 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:41,493 INFO L276 IsEmpty]: Start isEmpty. Operand 1979 states and 2587 transitions. [2024-11-08 10:22:41,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 603 [2024-11-08 10:22:41,515 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:22:41,515 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 18, 18, 18, 18, 18, 17, 17, 16, 16, 15, 15, 14, 14, 14, 14, 12, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:22:41,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-08 10:22:41,516 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:22:41,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:22:41,516 INFO L85 PathProgramCache]: Analyzing trace with hash -1151389759, now seen corresponding path program 1 times [2024-11-08 10:22:41,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:22:41,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386868399] [2024-11-08 10:22:41,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:22:41,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:22:41,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:41,757 INFO L134 CoverageAnalysis]: Checked inductivity of 4010 backedges. 2316 proven. 26 refuted. 0 times theorem prover too weak. 1668 trivial. 0 not checked. [2024-11-08 10:22:41,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:22:41,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386868399] [2024-11-08 10:22:41,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386868399] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 10:22:41,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [216099763] [2024-11-08 10:22:41,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:22:41,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:22:41,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 10:22:41,759 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 10:22:41,760 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-08 10:22:41,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:41,959 INFO L255 TraceCheckSpWp]: Trace formula consists of 905 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 10:22:41,971 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:22:42,078 INFO L134 CoverageAnalysis]: Checked inductivity of 4010 backedges. 2316 proven. 26 refuted. 0 times theorem prover too weak. 1668 trivial. 0 not checked. [2024-11-08 10:22:42,078 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 10:22:42,172 INFO L134 CoverageAnalysis]: Checked inductivity of 4010 backedges. 2316 proven. 26 refuted. 0 times theorem prover too weak. 1668 trivial. 0 not checked. [2024-11-08 10:22:42,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [216099763] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 10:22:42,172 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 10:22:42,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2024-11-08 10:22:42,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866149569] [2024-11-08 10:22:42,173 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 10:22:42,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 10:22:42,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:22:42,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 10:22:42,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-08 10:22:42,175 INFO L87 Difference]: Start difference. First operand 1979 states and 2587 transitions. Second operand has 8 states, 8 states have (on average 41.875) internal successors, (335), 8 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:42,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:22:42,620 INFO L93 Difference]: Finished difference Result 2823 states and 3704 transitions. [2024-11-08 10:22:42,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 10:22:42,620 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 41.875) internal successors, (335), 8 states have internal predecessors, (335), 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 602 [2024-11-08 10:22:42,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:22:42,621 INFO L225 Difference]: With dead ends: 2823 [2024-11-08 10:22:42,622 INFO L226 Difference]: Without dead ends: 0 [2024-11-08 10:22:42,624 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1212 GetRequests, 1203 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-08 10:22:42,625 INFO L432 NwaCegarLoop]: 320 mSDtfsCounter, 174 mSDsluCounter, 1068 mSDsCounter, 0 mSdLazyCounter, 653 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 1388 SdHoareTripleChecker+Invalid, 685 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 653 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 10:22:42,625 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 1388 Invalid, 685 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 653 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 10:22:42,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-08 10:22:42,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-08 10:22:42,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:42,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-08 10:22:42,626 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 602 [2024-11-08 10:22:42,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:22:42,626 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-08 10:22:42,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 41.875) internal successors, (335), 8 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:22:42,627 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-08 10:22:42,627 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-08 10:22:42,630 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 10:22:42,648 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-08 10:22:42,833 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,SelfDestructingSolverStorable19 [2024-11-08 10:22:42,837 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:22:42,839 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-08 10:22:43,212 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 10:22:43,237 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 10:22:43 BoogieIcfgContainer [2024-11-08 10:22:43,237 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 10:22:43,238 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 10:22:43,238 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 10:22:43,238 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 10:22:43,239 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:22:35" (3/4) ... [2024-11-08 10:22:43,242 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-08 10:22:43,257 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2024-11-08 10:22:43,257 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-08 10:22:43,258 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-08 10:22:43,259 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-08 10:22:43,404 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-08 10:22:43,406 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-08 10:22:43,406 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 10:22:43,407 INFO L158 Benchmark]: Toolchain (without parser) took 9601.55ms. Allocated memory was 176.2MB in the beginning and 264.2MB in the end (delta: 88.1MB). Free memory was 118.0MB in the beginning and 221.6MB in the end (delta: -103.6MB). Peak memory consumption was 134.0MB. Max. memory is 16.1GB. [2024-11-08 10:22:43,407 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 176.2MB. Free memory is still 138.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 10:22:43,409 INFO L158 Benchmark]: CACSL2BoogieTranslator took 376.80ms. Allocated memory is still 176.2MB. Free memory was 118.0MB in the beginning and 99.6MB in the end (delta: 18.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-08 10:22:43,409 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.13ms. Allocated memory is still 176.2MB. Free memory was 99.6MB in the beginning and 96.2MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 10:22:43,409 INFO L158 Benchmark]: Boogie Preprocessor took 77.62ms. Allocated memory is still 176.2MB. Free memory was 96.2MB in the beginning and 92.9MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 10:22:43,409 INFO L158 Benchmark]: RCFGBuilder took 837.32ms. Allocated memory is still 176.2MB. Free memory was 92.5MB in the beginning and 142.7MB in the end (delta: -50.2MB). Peak memory consumption was 54.5MB. Max. memory is 16.1GB. [2024-11-08 10:22:43,410 INFO L158 Benchmark]: TraceAbstraction took 8075.90ms. Allocated memory was 176.2MB in the beginning and 264.2MB in the end (delta: 88.1MB). Free memory was 142.0MB in the beginning and 79.8MB in the end (delta: 62.2MB). Peak memory consumption was 150.0MB. Max. memory is 16.1GB. [2024-11-08 10:22:43,410 INFO L158 Benchmark]: Witness Printer took 168.73ms. Allocated memory is still 264.2MB. Free memory was 79.8MB in the beginning and 221.6MB in the end (delta: -141.8MB). Peak memory consumption was 5.0MB. Max. memory is 16.1GB. [2024-11-08 10:22:43,411 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.23ms. Allocated memory is still 176.2MB. Free memory is still 138.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 376.80ms. Allocated memory is still 176.2MB. Free memory was 118.0MB in the beginning and 99.6MB in the end (delta: 18.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 59.13ms. Allocated memory is still 176.2MB. Free memory was 99.6MB in the beginning and 96.2MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 77.62ms. Allocated memory is still 176.2MB. Free memory was 96.2MB in the beginning and 92.9MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 837.32ms. Allocated memory is still 176.2MB. Free memory was 92.5MB in the beginning and 142.7MB in the end (delta: -50.2MB). Peak memory consumption was 54.5MB. Max. memory is 16.1GB. * TraceAbstraction took 8075.90ms. Allocated memory was 176.2MB in the beginning and 264.2MB in the end (delta: 88.1MB). Free memory was 142.0MB in the beginning and 79.8MB in the end (delta: 62.2MB). Peak memory consumption was 150.0MB. Max. memory is 16.1GB. * Witness Printer took 168.73ms. Allocated memory is still 264.2MB. Free memory was 79.8MB in the beginning and 221.6MB in the end (delta: -141.8MB). Peak memory consumption was 5.0MB. 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: 677]: 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, 171 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.6s, OverallIterations: 20, TraceHistogramMax: 19, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 3.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1415 SdHoareTripleChecker+Valid, 2.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1415 mSDsluCounter, 9550 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4508 mSDsCounter, 334 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2523 IncrementalHoareTripleChecker+Invalid, 2857 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 334 mSolverCounterUnsat, 5042 mSDtfsCounter, 2523 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2024 GetRequests, 1989 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1979occurred in iteration=19, InterpolantAutomatonStates: 71, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 20 MinimizatonAttempts, 616 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 5558 NumberOfCodeBlocks, 5558 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 6510 ConstructedInterpolants, 0 QuantifiedInterpolants, 8469 SizeOfPredicates, 2 NumberOfNonLiveVariables, 1508 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 24 InterpolantComputations, 18 PerfectInterpolantSequences, 26532/26688 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: 109]: Loop Invariant Derived loop invariant: (((((((((((((8464 == s__state) && (blastFlag == 0)) || ((2 == blastFlag) && (8560 == s__state))) || ((2 == blastFlag) && (s__state == 8512))) || ((((8673 != s__state) && (2 == blastFlag)) && (s__state != 8672)) && (s__s3__tmp__next_state___0 <= 8576))) || ((2 == blastFlag) && (0 != s__hit))) || ((2 == blastFlag) && (8544 == s__state))) || ((((8673 != s__state) && (3 == blastFlag)) && (s__s3__tmp__next_state___0 <= 8576)) && (8656 <= s__state))) || (((3 == blastFlag) && (3 == s__s3__tmp__next_state___0)) && (8448 == s__state))) || ((3 == blastFlag) && (0 != s__hit))) || (s__state == 3)) || ((8496 == s__state) && (blastFlag == 1))) || ((s__state == 8528) && (2 == blastFlag))) RESULT: Ultimate proved your program to be correct! [2024-11-08 10:22:43,449 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE