./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label26.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label26.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f464de24b3032dee99022ecd3bac09be4532608b487d4a13c374cca55e302076 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-10 23:18:20,164 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-10 23:18:20,231 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-10 23:18:20,235 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-10 23:18:20,237 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-10 23:18:20,267 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-10 23:18:20,267 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-10 23:18:20,268 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-10 23:18:20,270 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-10 23:18:20,272 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-10 23:18:20,273 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-10 23:18:20,273 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-10 23:18:20,274 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-10 23:18:20,274 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-10 23:18:20,274 INFO L153 SettingsManager]: * Use SBE=true [2024-10-10 23:18:20,274 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-10 23:18:20,275 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-10 23:18:20,277 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-10 23:18:20,277 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-10 23:18:20,278 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-10 23:18:20,278 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-10 23:18:20,279 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-10 23:18:20,279 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-10 23:18:20,279 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-10 23:18:20,279 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-10 23:18:20,280 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-10 23:18:20,280 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-10 23:18:20,280 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-10 23:18:20,281 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-10 23:18:20,281 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-10 23:18:20,281 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-10 23:18:20,282 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-10 23:18:20,282 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 23:18:20,282 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-10 23:18:20,282 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-10 23:18:20,283 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-10 23:18:20,283 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-10 23:18:20,283 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-10 23:18:20,283 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-10 23:18:20,284 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-10 23:18:20,284 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-10 23:18:20,284 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-10 23:18:20,284 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f464de24b3032dee99022ecd3bac09be4532608b487d4a13c374cca55e302076 [2024-10-10 23:18:20,583 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-10 23:18:20,608 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-10 23:18:20,611 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-10 23:18:20,613 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-10 23:18:20,613 INFO L274 PluginConnector]: CDTParser initialized [2024-10-10 23:18:20,614 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label26.c [2024-10-10 23:18:22,050 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-10 23:18:22,357 INFO L384 CDTParser]: Found 1 translation units. [2024-10-10 23:18:22,361 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label26.c [2024-10-10 23:18:22,385 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/fc55b8222/7d303f102be84d7b8e62e20192181b0a/FLAGc9b6e325d [2024-10-10 23:18:22,401 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/fc55b8222/7d303f102be84d7b8e62e20192181b0a [2024-10-10 23:18:22,405 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-10 23:18:22,407 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-10 23:18:22,408 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-10 23:18:22,409 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-10 23:18:22,414 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-10 23:18:22,415 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 11:18:22" (1/1) ... [2024-10-10 23:18:22,417 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@de3d10a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:18:22, skipping insertion in model container [2024-10-10 23:18:22,417 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 11:18:22" (1/1) ... [2024-10-10 23:18:22,474 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-10 23:18:22,702 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label26.c[5699,5712] [2024-10-10 23:18:22,933 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 23:18:22,941 INFO L200 MainTranslator]: Completed pre-run [2024-10-10 23:18:22,961 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label26.c[5699,5712] [2024-10-10 23:18:23,050 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 23:18:23,070 INFO L204 MainTranslator]: Completed translation [2024-10-10 23:18:23,071 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:18:23 WrapperNode [2024-10-10 23:18:23,071 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-10 23:18:23,072 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-10 23:18:23,073 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-10 23:18:23,074 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-10 23:18:23,080 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:18:23" (1/1) ... [2024-10-10 23:18:23,116 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:18:23" (1/1) ... [2024-10-10 23:18:23,224 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1000 [2024-10-10 23:18:23,225 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-10 23:18:23,226 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-10 23:18:23,226 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-10 23:18:23,226 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-10 23:18:23,236 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:18:23" (1/1) ... [2024-10-10 23:18:23,236 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:18:23" (1/1) ... [2024-10-10 23:18:23,256 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:18:23" (1/1) ... [2024-10-10 23:18:23,311 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-10 23:18:23,311 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:18:23" (1/1) ... [2024-10-10 23:18:23,311 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:18:23" (1/1) ... [2024-10-10 23:18:23,350 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:18:23" (1/1) ... [2024-10-10 23:18:23,363 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:18:23" (1/1) ... [2024-10-10 23:18:23,390 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:18:23" (1/1) ... [2024-10-10 23:18:23,398 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:18:23" (1/1) ... [2024-10-10 23:18:23,416 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-10 23:18:23,418 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-10 23:18:23,418 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-10 23:18:23,418 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-10 23:18:23,419 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:18:23" (1/1) ... [2024-10-10 23:18:23,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 23:18:23,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:18:23,451 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-10 23:18:23,453 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-10 23:18:23,527 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-10 23:18:23,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-10 23:18:23,530 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-10 23:18:23,531 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-10 23:18:23,611 INFO L238 CfgBuilder]: Building ICFG [2024-10-10 23:18:23,612 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-10 23:18:25,082 INFO L? ?]: Removed 129 outVars from TransFormulas that were not future-live. [2024-10-10 23:18:25,082 INFO L287 CfgBuilder]: Performing block encoding [2024-10-10 23:18:25,144 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-10 23:18:25,146 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-10 23:18:25,147 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:18:25 BoogieIcfgContainer [2024-10-10 23:18:25,147 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-10 23:18:25,149 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-10 23:18:25,149 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-10 23:18:25,153 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-10 23:18:25,153 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.10 11:18:22" (1/3) ... [2024-10-10 23:18:25,154 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2280d1d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 11:18:25, skipping insertion in model container [2024-10-10 23:18:25,154 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:18:23" (2/3) ... [2024-10-10 23:18:25,154 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2280d1d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 11:18:25, skipping insertion in model container [2024-10-10 23:18:25,154 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:18:25" (3/3) ... [2024-10-10 23:18:25,156 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem11_label26.c [2024-10-10 23:18:25,169 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-10 23:18:25,170 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-10 23:18:25,232 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-10 23:18:25,239 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;@be33c3b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-10 23:18:25,239 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-10 23:18:25,245 INFO L276 IsEmpty]: Start isEmpty. Operand has 221 states, 219 states have (on average 1.917808219178082) internal successors, (420), 220 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:18:25,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-10 23:18:25,253 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:18:25,254 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] [2024-10-10 23:18:25,254 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:18:25,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:18:25,261 INFO L85 PathProgramCache]: Analyzing trace with hash -248824699, now seen corresponding path program 1 times [2024-10-10 23:18:25,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:18:25,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134327999] [2024-10-10 23:18:25,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:18:25,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:18:25,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:18:25,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:18:25,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:18:25,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134327999] [2024-10-10 23:18:25,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134327999] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:18:25,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:18:25,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:18:25,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922961254] [2024-10-10 23:18:25,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:18:25,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-10 23:18:25,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:18:25,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-10 23:18:25,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-10 23:18:25,526 INFO L87 Difference]: Start difference. First operand has 221 states, 219 states have (on average 1.917808219178082) internal successors, (420), 220 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:18:25,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:18:25,587 INFO L93 Difference]: Finished difference Result 441 states and 839 transitions. [2024-10-10 23:18:25,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-10 23:18:25,592 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 0 states have call successors, (0), 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 38 [2024-10-10 23:18:25,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:18:25,603 INFO L225 Difference]: With dead ends: 441 [2024-10-10 23:18:25,605 INFO L226 Difference]: Without dead ends: 219 [2024-10-10 23:18:25,609 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-10 23:18:25,613 INFO L432 NwaCegarLoop]: 355 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 23:18:25,614 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 355 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 23:18:25,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2024-10-10 23:18:25,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 219. [2024-10-10 23:18:25,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 218 states have (on average 1.628440366972477) internal successors, (355), 218 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:18:25,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 355 transitions. [2024-10-10 23:18:25,676 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 355 transitions. Word has length 38 [2024-10-10 23:18:25,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:18:25,677 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 355 transitions. [2024-10-10 23:18:25,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:18:25,678 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 355 transitions. [2024-10-10 23:18:25,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-10 23:18:25,679 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:18:25,679 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] [2024-10-10 23:18:25,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-10 23:18:25,680 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:18:25,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:18:25,681 INFO L85 PathProgramCache]: Analyzing trace with hash 568008558, now seen corresponding path program 1 times [2024-10-10 23:18:25,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:18:25,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774702769] [2024-10-10 23:18:25,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:18:25,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:18:25,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:18:25,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:18:25,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:18:25,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774702769] [2024-10-10 23:18:25,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774702769] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:18:25,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:18:25,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:18:25,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286170769] [2024-10-10 23:18:25,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:18:25,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:18:25,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:18:25,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:18:25,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:18:25,869 INFO L87 Difference]: Start difference. First operand 219 states and 355 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 2 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:18:26,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:18:26,857 INFO L93 Difference]: Finished difference Result 630 states and 1029 transitions. [2024-10-10 23:18:26,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:18:26,857 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 2 states have internal predecessors, (38), 0 states have call successors, (0), 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 38 [2024-10-10 23:18:26,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:18:26,861 INFO L225 Difference]: With dead ends: 630 [2024-10-10 23:18:26,861 INFO L226 Difference]: Without dead ends: 412 [2024-10-10 23:18:26,862 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:18:26,866 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 169 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 557 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 644 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 557 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-10 23:18:26,866 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 144 Invalid, 644 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 557 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-10 23:18:26,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2024-10-10 23:18:26,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 410. [2024-10-10 23:18:26,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 410 states, 409 states have (on average 1.4596577017114913) internal successors, (597), 409 states have internal predecessors, (597), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:18:26,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 597 transitions. [2024-10-10 23:18:26,886 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 597 transitions. Word has length 38 [2024-10-10 23:18:26,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:18:26,886 INFO L471 AbstractCegarLoop]: Abstraction has 410 states and 597 transitions. [2024-10-10 23:18:26,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 2 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:18:26,887 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 597 transitions. [2024-10-10 23:18:26,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-10-10 23:18:26,891 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:18:26,891 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:18:26,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-10 23:18:26,892 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:18:26,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:18:26,893 INFO L85 PathProgramCache]: Analyzing trace with hash 413753813, now seen corresponding path program 1 times [2024-10-10 23:18:26,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:18:26,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649190702] [2024-10-10 23:18:26,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:18:26,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:18:26,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:18:27,128 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:18:27,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:18:27,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649190702] [2024-10-10 23:18:27,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649190702] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:18:27,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:18:27,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:18:27,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154114086] [2024-10-10 23:18:27,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:18:27,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:18:27,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:18:27,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:18:27,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:18:27,134 INFO L87 Difference]: Start difference. First operand 410 states and 597 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 2 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:18:27,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:18:27,860 INFO L93 Difference]: Finished difference Result 1208 states and 1764 transitions. [2024-10-10 23:18:27,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:18:27,861 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 2 states have internal predecessors, (106), 0 states have call successors, (0), 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 106 [2024-10-10 23:18:27,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:18:27,865 INFO L225 Difference]: With dead ends: 1208 [2024-10-10 23:18:27,865 INFO L226 Difference]: Without dead ends: 799 [2024-10-10 23:18:27,867 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:18:27,869 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 142 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 524 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 524 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-10 23:18:27,870 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 120 Invalid, 672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 524 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-10 23:18:27,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 799 states. [2024-10-10 23:18:27,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 799 to 786. [2024-10-10 23:18:27,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 786 states, 785 states have (on average 1.3847133757961783) internal successors, (1087), 785 states have internal predecessors, (1087), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:18:27,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 1087 transitions. [2024-10-10 23:18:27,897 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 1087 transitions. Word has length 106 [2024-10-10 23:18:27,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:18:27,897 INFO L471 AbstractCegarLoop]: Abstraction has 786 states and 1087 transitions. [2024-10-10 23:18:27,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 2 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:18:27,898 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 1087 transitions. [2024-10-10 23:18:27,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-10-10 23:18:27,900 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:18:27,900 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:18:27,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-10 23:18:27,900 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:18:27,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:18:27,901 INFO L85 PathProgramCache]: Analyzing trace with hash -426164518, now seen corresponding path program 1 times [2024-10-10 23:18:27,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:18:27,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652189291] [2024-10-10 23:18:27,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:18:27,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:18:27,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:18:28,312 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:18:28,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:18:28,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652189291] [2024-10-10 23:18:28,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652189291] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:18:28,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:18:28,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:18:28,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594281950] [2024-10-10 23:18:28,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:18:28,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:18:28,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:18:28,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:18:28,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:18:28,317 INFO L87 Difference]: Start difference. First operand 786 states and 1087 transitions. Second operand has 3 states, 3 states have (on average 36.0) internal successors, (108), 2 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:18:28,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:18:28,972 INFO L93 Difference]: Finished difference Result 1941 states and 2628 transitions. [2024-10-10 23:18:28,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:18:28,972 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 2 states have internal predecessors, (108), 0 states have call successors, (0), 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 108 [2024-10-10 23:18:28,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:18:28,977 INFO L225 Difference]: With dead ends: 1941 [2024-10-10 23:18:28,977 INFO L226 Difference]: Without dead ends: 1156 [2024-10-10 23:18:28,979 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:18:28,980 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 119 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 532 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-10 23:18:28,980 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 188 Invalid, 569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 532 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-10 23:18:28,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1156 states. [2024-10-10 23:18:28,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1156 to 1155. [2024-10-10 23:18:29,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1155 states, 1154 states have (on average 1.2772963604852687) internal successors, (1474), 1154 states have internal predecessors, (1474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:18:29,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1155 states to 1155 states and 1474 transitions. [2024-10-10 23:18:29,004 INFO L78 Accepts]: Start accepts. Automaton has 1155 states and 1474 transitions. Word has length 108 [2024-10-10 23:18:29,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:18:29,005 INFO L471 AbstractCegarLoop]: Abstraction has 1155 states and 1474 transitions. [2024-10-10 23:18:29,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 2 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:18:29,005 INFO L276 IsEmpty]: Start isEmpty. Operand 1155 states and 1474 transitions. [2024-10-10 23:18:29,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-10-10 23:18:29,012 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:18:29,012 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:18:29,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-10 23:18:29,013 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:18:29,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:18:29,013 INFO L85 PathProgramCache]: Analyzing trace with hash -2107943791, now seen corresponding path program 1 times [2024-10-10 23:18:29,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:18:29,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656067385] [2024-10-10 23:18:29,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:18:29,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:18:29,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:18:29,275 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-10-10 23:18:29,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:18:29,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656067385] [2024-10-10 23:18:29,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656067385] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:18:29,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:18:29,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:18:29,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688150058] [2024-10-10 23:18:29,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:18:29,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:18:29,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:18:29,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:18:29,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:18:29,281 INFO L87 Difference]: Start difference. First operand 1155 states and 1474 transitions. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 2 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:18:30,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:18:30,065 INFO L93 Difference]: Finished difference Result 2501 states and 3335 transitions. [2024-10-10 23:18:30,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:18:30,067 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 2 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 150 [2024-10-10 23:18:30,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:18:30,073 INFO L225 Difference]: With dead ends: 2501 [2024-10-10 23:18:30,073 INFO L226 Difference]: Without dead ends: 1531 [2024-10-10 23:18:30,075 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:18:30,076 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 108 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 536 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 536 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-10 23:18:30,076 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 154 Invalid, 634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 536 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-10 23:18:30,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1531 states. [2024-10-10 23:18:30,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1531 to 1531. [2024-10-10 23:18:30,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1531 states, 1530 states have (on average 1.261437908496732) internal successors, (1930), 1530 states have internal predecessors, (1930), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:18:30,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1531 states to 1531 states and 1930 transitions. [2024-10-10 23:18:30,104 INFO L78 Accepts]: Start accepts. Automaton has 1531 states and 1930 transitions. Word has length 150 [2024-10-10 23:18:30,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:18:30,105 INFO L471 AbstractCegarLoop]: Abstraction has 1531 states and 1930 transitions. [2024-10-10 23:18:30,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 2 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:18:30,106 INFO L276 IsEmpty]: Start isEmpty. Operand 1531 states and 1930 transitions. [2024-10-10 23:18:30,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-10-10 23:18:30,110 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:18:30,110 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:18:30,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-10 23:18:30,111 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:18:30,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:18:30,111 INFO L85 PathProgramCache]: Analyzing trace with hash 458459296, now seen corresponding path program 1 times [2024-10-10 23:18:30,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:18:30,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949262785] [2024-10-10 23:18:30,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:18:30,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:18:30,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:18:30,329 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:18:30,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:18:30,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949262785] [2024-10-10 23:18:30,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949262785] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:18:30,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:18:30,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:18:30,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745837755] [2024-10-10 23:18:30,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:18:30,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:18:30,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:18:30,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:18:30,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:18:30,332 INFO L87 Difference]: Start difference. First operand 1531 states and 1930 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-10-10 23:18:31,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:18:31,036 INFO L93 Difference]: Finished difference Result 3643 states and 4734 transitions. [2024-10-10 23:18:31,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:18:31,036 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 165 [2024-10-10 23:18:31,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:18:31,045 INFO L225 Difference]: With dead ends: 3643 [2024-10-10 23:18:31,045 INFO L226 Difference]: Without dead ends: 2297 [2024-10-10 23:18:31,047 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:18:31,048 INFO L432 NwaCegarLoop]: 288 mSDtfsCounter, 196 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 584 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 635 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-10 23:18:31,048 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 319 Invalid, 635 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 584 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-10 23:18:31,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2297 states. [2024-10-10 23:18:31,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2297 to 2294. [2024-10-10 23:18:31,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2294 states, 2293 states have (on average 1.2651548190143915) internal successors, (2901), 2293 states have internal predecessors, (2901), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:18:31,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2294 states to 2294 states and 2901 transitions. [2024-10-10 23:18:31,087 INFO L78 Accepts]: Start accepts. Automaton has 2294 states and 2901 transitions. Word has length 165 [2024-10-10 23:18:31,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:18:31,088 INFO L471 AbstractCegarLoop]: Abstraction has 2294 states and 2901 transitions. [2024-10-10 23:18:31,088 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-10-10 23:18:31,088 INFO L276 IsEmpty]: Start isEmpty. Operand 2294 states and 2901 transitions. [2024-10-10 23:18:31,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2024-10-10 23:18:31,091 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:18:31,091 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:18:31,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-10 23:18:31,092 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:18:31,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:18:31,092 INFO L85 PathProgramCache]: Analyzing trace with hash 36648381, now seen corresponding path program 1 times [2024-10-10 23:18:31,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:18:31,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100825885] [2024-10-10 23:18:31,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:18:31,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:18:31,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:18:31,375 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-10-10 23:18:31,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:18:31,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100825885] [2024-10-10 23:18:31,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100825885] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:18:31,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:18:31,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:18:31,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878672628] [2024-10-10 23:18:31,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:18:31,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:18:31,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:18:31,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:18:31,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:18:31,378 INFO L87 Difference]: Start difference. First operand 2294 states and 2901 transitions. Second operand has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:18:32,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:18:32,093 INFO L93 Difference]: Finished difference Result 5508 states and 7125 transitions. [2024-10-10 23:18:32,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:18:32,093 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 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 220 [2024-10-10 23:18:32,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:18:32,104 INFO L225 Difference]: With dead ends: 5508 [2024-10-10 23:18:32,104 INFO L226 Difference]: Without dead ends: 3399 [2024-10-10 23:18:32,108 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:18:32,109 INFO L432 NwaCegarLoop]: 320 mSDtfsCounter, 168 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 507 mSolverCounterSat, 147 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 654 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 147 IncrementalHoareTripleChecker+Valid, 507 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-10 23:18:32,111 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 344 Invalid, 654 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [147 Valid, 507 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-10 23:18:32,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3399 states. [2024-10-10 23:18:32,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3399 to 3399. [2024-10-10 23:18:32,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3399 states, 3398 states have (on average 1.235138316656857) internal successors, (4197), 3398 states have internal predecessors, (4197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:18:32,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3399 states to 3399 states and 4197 transitions. [2024-10-10 23:18:32,169 INFO L78 Accepts]: Start accepts. Automaton has 3399 states and 4197 transitions. Word has length 220 [2024-10-10 23:18:32,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:18:32,170 INFO L471 AbstractCegarLoop]: Abstraction has 3399 states and 4197 transitions. [2024-10-10 23:18:32,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:18:32,170 INFO L276 IsEmpty]: Start isEmpty. Operand 3399 states and 4197 transitions. [2024-10-10 23:18:32,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2024-10-10 23:18:32,173 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:18:32,173 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-10 23:18:32,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-10 23:18:32,174 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:18:32,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:18:32,174 INFO L85 PathProgramCache]: Analyzing trace with hash -333697396, now seen corresponding path program 1 times [2024-10-10 23:18:32,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:18:32,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734514802] [2024-10-10 23:18:32,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:18:32,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:18:32,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:18:32,473 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2024-10-10 23:18:32,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:18:32,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734514802] [2024-10-10 23:18:32,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734514802] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:18:32,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:18:32,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:18:32,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224134393] [2024-10-10 23:18:32,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:18:32,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:18:32,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:18:32,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:18:32,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:18:32,476 INFO L87 Difference]: Start difference. First operand 3399 states and 4197 transitions. Second operand has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:18:33,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:18:33,321 INFO L93 Difference]: Finished difference Result 7912 states and 9908 transitions. [2024-10-10 23:18:33,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:18:33,322 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 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 226 [2024-10-10 23:18:33,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:18:33,337 INFO L225 Difference]: With dead ends: 7912 [2024-10-10 23:18:33,338 INFO L226 Difference]: Without dead ends: 4698 [2024-10-10 23:18:33,342 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:18:33,343 INFO L432 NwaCegarLoop]: 360 mSDtfsCounter, 157 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 581 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 674 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 581 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-10 23:18:33,343 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 381 Invalid, 674 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 581 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-10 23:18:33,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4698 states. [2024-10-10 23:18:33,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4698 to 4688. [2024-10-10 23:18:33,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4688 states, 4687 states have (on average 1.2137828034990399) internal successors, (5689), 4687 states have internal predecessors, (5689), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:18:33,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4688 states to 4688 states and 5689 transitions. [2024-10-10 23:18:33,440 INFO L78 Accepts]: Start accepts. Automaton has 4688 states and 5689 transitions. Word has length 226 [2024-10-10 23:18:33,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:18:33,441 INFO L471 AbstractCegarLoop]: Abstraction has 4688 states and 5689 transitions. [2024-10-10 23:18:33,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:18:33,441 INFO L276 IsEmpty]: Start isEmpty. Operand 4688 states and 5689 transitions. [2024-10-10 23:18:33,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2024-10-10 23:18:33,449 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:18:33,450 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:18:33,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-10 23:18:33,450 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:18:33,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:18:33,451 INFO L85 PathProgramCache]: Analyzing trace with hash 1743295370, now seen corresponding path program 1 times [2024-10-10 23:18:33,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:18:33,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339971218] [2024-10-10 23:18:33,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:18:33,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:18:33,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:18:33,703 INFO L134 CoverageAnalysis]: Checked inductivity of 323 backedges. 286 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2024-10-10 23:18:33,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:18:33,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339971218] [2024-10-10 23:18:33,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339971218] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:18:33,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:18:33,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:18:33,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070981792] [2024-10-10 23:18:33,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:18:33,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:18:33,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:18:33,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:18:33,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:18:33,706 INFO L87 Difference]: Start difference. First operand 4688 states and 5689 transitions. Second operand has 3 states, 3 states have (on average 87.0) internal successors, (261), 3 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:18:34,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:18:34,489 INFO L93 Difference]: Finished difference Result 10681 states and 13135 transitions. [2024-10-10 23:18:34,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:18:34,493 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 87.0) internal successors, (261), 3 states have internal predecessors, (261), 0 states have call successors, (0), 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 297 [2024-10-10 23:18:34,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:18:34,513 INFO L225 Difference]: With dead ends: 10681 [2024-10-10 23:18:34,514 INFO L226 Difference]: Without dead ends: 6178 [2024-10-10 23:18:34,520 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:18:34,522 INFO L432 NwaCegarLoop]: 322 mSDtfsCounter, 135 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 555 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 555 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-10 23:18:34,522 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 341 Invalid, 651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 555 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-10 23:18:34,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6178 states. [2024-10-10 23:18:34,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6178 to 5977. [2024-10-10 23:18:34,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5977 states, 5976 states have (on average 1.2008032128514057) internal successors, (7176), 5976 states have internal predecessors, (7176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:18:34,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5977 states to 5977 states and 7176 transitions. [2024-10-10 23:18:34,621 INFO L78 Accepts]: Start accepts. Automaton has 5977 states and 7176 transitions. Word has length 297 [2024-10-10 23:18:34,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:18:34,622 INFO L471 AbstractCegarLoop]: Abstraction has 5977 states and 7176 transitions. [2024-10-10 23:18:34,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 87.0) internal successors, (261), 3 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:18:34,622 INFO L276 IsEmpty]: Start isEmpty. Operand 5977 states and 7176 transitions. [2024-10-10 23:18:34,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2024-10-10 23:18:34,629 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:18:34,629 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:18:34,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-10 23:18:34,629 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:18:34,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:18:34,630 INFO L85 PathProgramCache]: Analyzing trace with hash -845415217, now seen corresponding path program 1 times [2024-10-10 23:18:34,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:18:34,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196629931] [2024-10-10 23:18:34,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:18:34,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:18:34,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:18:34,855 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 259 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-10-10 23:18:34,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:18:34,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196629931] [2024-10-10 23:18:34,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196629931] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:18:34,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:18:34,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:18:34,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454623713] [2024-10-10 23:18:34,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:18:34,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:18:34,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:18:34,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:18:34,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:18:34,858 INFO L87 Difference]: Start difference. First operand 5977 states and 7176 transitions. Second operand has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 3 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:18:35,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:18:35,580 INFO L93 Difference]: Finished difference Result 11738 states and 14075 transitions. [2024-10-10 23:18:35,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:18:35,581 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 3 states have internal predecessors, (233), 0 states have call successors, (0), 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 300 [2024-10-10 23:18:35,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:18:35,595 INFO L225 Difference]: With dead ends: 11738 [2024-10-10 23:18:35,595 INFO L226 Difference]: Without dead ends: 5762 [2024-10-10 23:18:35,602 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:18:35,602 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 158 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 449 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-10 23:18:35,603 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 149 Invalid, 589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 449 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-10 23:18:35,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5762 states. [2024-10-10 23:18:35,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5762 to 5577. [2024-10-10 23:18:35,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5577 states, 5576 states have (on average 1.1468794835007174) internal successors, (6395), 5576 states have internal predecessors, (6395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:18:35,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5577 states to 5577 states and 6395 transitions. [2024-10-10 23:18:35,693 INFO L78 Accepts]: Start accepts. Automaton has 5577 states and 6395 transitions. Word has length 300 [2024-10-10 23:18:35,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:18:35,694 INFO L471 AbstractCegarLoop]: Abstraction has 5577 states and 6395 transitions. [2024-10-10 23:18:35,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 3 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:18:35,694 INFO L276 IsEmpty]: Start isEmpty. Operand 5577 states and 6395 transitions. [2024-10-10 23:18:35,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 379 [2024-10-10 23:18:35,704 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:18:35,705 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:18:35,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-10 23:18:35,706 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:18:35,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:18:35,706 INFO L85 PathProgramCache]: Analyzing trace with hash -1531645548, now seen corresponding path program 1 times [2024-10-10 23:18:35,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:18:35,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034085222] [2024-10-10 23:18:35,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:18:35,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:18:35,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:18:36,022 INFO L134 CoverageAnalysis]: Checked inductivity of 422 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-10 23:18:36,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:18:36,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034085222] [2024-10-10 23:18:36,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034085222] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:18:36,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:18:36,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:18:36,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517295866] [2024-10-10 23:18:36,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:18:36,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:18:36,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:18:36,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:18:36,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:18:36,025 INFO L87 Difference]: Start difference. First operand 5577 states and 6395 transitions. Second operand has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 2 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:18:36,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:18:36,404 INFO L93 Difference]: Finished difference Result 11149 states and 12785 transitions. [2024-10-10 23:18:36,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:18:36,405 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 2 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 378 [2024-10-10 23:18:36,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:18:36,421 INFO L225 Difference]: With dead ends: 11149 [2024-10-10 23:18:36,422 INFO L226 Difference]: Without dead ends: 5573 [2024-10-10 23:18:36,427 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:18:36,428 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 216 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-10 23:18:36,428 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 37 Invalid, 312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-10 23:18:36,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5573 states. [2024-10-10 23:18:36,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5573 to 5573. [2024-10-10 23:18:36,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5573 states, 5572 states have (on average 1.146267049533381) internal successors, (6387), 5572 states have internal predecessors, (6387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:18:36,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5573 states to 5573 states and 6387 transitions. [2024-10-10 23:18:36,505 INFO L78 Accepts]: Start accepts. Automaton has 5573 states and 6387 transitions. Word has length 378 [2024-10-10 23:18:36,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:18:36,505 INFO L471 AbstractCegarLoop]: Abstraction has 5573 states and 6387 transitions. [2024-10-10 23:18:36,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 2 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:18:36,506 INFO L276 IsEmpty]: Start isEmpty. Operand 5573 states and 6387 transitions. [2024-10-10 23:18:36,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 411 [2024-10-10 23:18:36,518 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:18:36,518 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:18:36,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-10 23:18:36,519 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:18:36,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:18:36,520 INFO L85 PathProgramCache]: Analyzing trace with hash -1924097945, now seen corresponding path program 1 times [2024-10-10 23:18:36,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:18:36,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131287533] [2024-10-10 23:18:36,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:18:36,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:18:36,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:18:36,930 INFO L134 CoverageAnalysis]: Checked inductivity of 459 backedges. 348 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2024-10-10 23:18:36,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:18:36,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131287533] [2024-10-10 23:18:36,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131287533] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:18:36,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:18:36,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:18:36,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400783324] [2024-10-10 23:18:36,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:18:36,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:18:36,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:18:36,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:18:36,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:18:36,933 INFO L87 Difference]: Start difference. First operand 5573 states and 6387 transitions. Second operand has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:18:37,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:18:37,709 INFO L93 Difference]: Finished difference Result 12631 states and 14465 transitions. [2024-10-10 23:18:37,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:18:37,711 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 0 states have call successors, (0), 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 410 [2024-10-10 23:18:37,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:18:37,735 INFO L225 Difference]: With dead ends: 12631 [2024-10-10 23:18:37,736 INFO L226 Difference]: Without dead ends: 7059 [2024-10-10 23:18:37,740 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:18:37,741 INFO L432 NwaCegarLoop]: 160 mSDtfsCounter, 66 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 581 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 630 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 581 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-10 23:18:37,742 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 177 Invalid, 630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 581 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-10 23:18:37,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7059 states. [2024-10-10 23:18:37,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7059 to 6861. [2024-10-10 23:18:37,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6861 states, 6860 states have (on average 1.1380466472303208) internal successors, (7807), 6860 states have internal predecessors, (7807), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:18:37,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6861 states to 6861 states and 7807 transitions. [2024-10-10 23:18:37,816 INFO L78 Accepts]: Start accepts. Automaton has 6861 states and 7807 transitions. Word has length 410 [2024-10-10 23:18:37,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:18:37,816 INFO L471 AbstractCegarLoop]: Abstraction has 6861 states and 7807 transitions. [2024-10-10 23:18:37,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:18:37,817 INFO L276 IsEmpty]: Start isEmpty. Operand 6861 states and 7807 transitions. [2024-10-10 23:18:37,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 463 [2024-10-10 23:18:37,829 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:18:37,830 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:18:37,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-10 23:18:37,830 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:18:37,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:18:37,831 INFO L85 PathProgramCache]: Analyzing trace with hash -1745926069, now seen corresponding path program 1 times [2024-10-10 23:18:37,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:18:37,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089153771] [2024-10-10 23:18:37,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:18:37,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:18:37,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:18:38,081 INFO L134 CoverageAnalysis]: Checked inductivity of 678 backedges. 563 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2024-10-10 23:18:38,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:18:38,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089153771] [2024-10-10 23:18:38,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089153771] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:18:38,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:18:38,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:18:38,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972920165] [2024-10-10 23:18:38,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:18:38,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:18:38,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:18:38,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:18:38,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:18:38,084 INFO L87 Difference]: Start difference. First operand 6861 states and 7807 transitions. Second operand has 3 states, 3 states have (on average 116.33333333333333) internal successors, (349), 3 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:18:38,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:18:38,807 INFO L93 Difference]: Finished difference Result 15928 states and 18168 transitions. [2024-10-10 23:18:38,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:18:38,808 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 116.33333333333333) internal successors, (349), 3 states have internal predecessors, (349), 0 states have call successors, (0), 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 462 [2024-10-10 23:18:38,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:18:38,821 INFO L225 Difference]: With dead ends: 15928 [2024-10-10 23:18:38,822 INFO L226 Difference]: Without dead ends: 8516 [2024-10-10 23:18:38,829 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:18:38,830 INFO L432 NwaCegarLoop]: 328 mSDtfsCounter, 64 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 574 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 655 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 574 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-10 23:18:38,830 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 348 Invalid, 655 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 574 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-10 23:18:38,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8516 states. [2024-10-10 23:18:38,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8516 to 8332. [2024-10-10 23:18:38,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8332 states, 8331 states have (on average 1.1331172728363943) internal successors, (9440), 8331 states have internal predecessors, (9440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:18:38,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8332 states to 8332 states and 9440 transitions. [2024-10-10 23:18:38,936 INFO L78 Accepts]: Start accepts. Automaton has 8332 states and 9440 transitions. Word has length 462 [2024-10-10 23:18:38,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:18:38,936 INFO L471 AbstractCegarLoop]: Abstraction has 8332 states and 9440 transitions. [2024-10-10 23:18:38,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 116.33333333333333) internal successors, (349), 3 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:18:38,937 INFO L276 IsEmpty]: Start isEmpty. Operand 8332 states and 9440 transitions. [2024-10-10 23:18:38,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 499 [2024-10-10 23:18:38,952 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:18:38,953 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:18:38,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-10 23:18:38,954 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:18:38,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:18:38,955 INFO L85 PathProgramCache]: Analyzing trace with hash -1644975805, now seen corresponding path program 1 times [2024-10-10 23:18:38,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:18:38,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325770416] [2024-10-10 23:18:38,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:18:38,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:18:39,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:18:39,468 INFO L134 CoverageAnalysis]: Checked inductivity of 745 backedges. 540 proven. 0 refuted. 0 times theorem prover too weak. 205 trivial. 0 not checked. [2024-10-10 23:18:39,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:18:39,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325770416] [2024-10-10 23:18:39,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325770416] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:18:39,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:18:39,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:18:39,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196674378] [2024-10-10 23:18:39,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:18:39,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:18:39,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:18:39,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:18:39,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:18:39,470 INFO L87 Difference]: Start difference. First operand 8332 states and 9440 transitions. Second operand has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:18:40,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:18:40,097 INFO L93 Difference]: Finished difference Result 19071 states and 21664 transitions. [2024-10-10 23:18:40,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:18:40,098 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 0 states have call successors, (0), 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 498 [2024-10-10 23:18:40,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:18:40,117 INFO L225 Difference]: With dead ends: 19071 [2024-10-10 23:18:40,117 INFO L226 Difference]: Without dead ends: 10740 [2024-10-10 23:18:40,126 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:18:40,127 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 138 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 576 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 576 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-10 23:18:40,127 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 132 Invalid, 645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 576 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-10 23:18:40,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10740 states. [2024-10-10 23:18:40,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10740 to 10552. [2024-10-10 23:18:40,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10552 states, 10551 states have (on average 1.1254857359491992) internal successors, (11875), 10551 states have internal predecessors, (11875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:18:40,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10552 states to 10552 states and 11875 transitions. [2024-10-10 23:18:40,359 INFO L78 Accepts]: Start accepts. Automaton has 10552 states and 11875 transitions. Word has length 498 [2024-10-10 23:18:40,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:18:40,360 INFO L471 AbstractCegarLoop]: Abstraction has 10552 states and 11875 transitions. [2024-10-10 23:18:40,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:18:40,360 INFO L276 IsEmpty]: Start isEmpty. Operand 10552 states and 11875 transitions. [2024-10-10 23:18:40,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 503 [2024-10-10 23:18:40,382 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:18:40,382 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:18:40,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-10 23:18:40,383 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:18:40,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:18:40,384 INFO L85 PathProgramCache]: Analyzing trace with hash -1805185773, now seen corresponding path program 1 times [2024-10-10 23:18:40,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:18:40,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489389710] [2024-10-10 23:18:40,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:18:40,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:18:40,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:18:40,954 INFO L134 CoverageAnalysis]: Checked inductivity of 733 backedges. 573 proven. 0 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2024-10-10 23:18:40,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:18:40,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489389710] [2024-10-10 23:18:40,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489389710] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:18:40,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:18:40,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:18:40,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254388517] [2024-10-10 23:18:40,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:18:40,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:18:40,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:18:40,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:18:40,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:18:40,957 INFO L87 Difference]: Start difference. First operand 10552 states and 11875 transitions. Second operand has 3 states, 3 states have (on average 127.0) internal successors, (381), 3 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:18:41,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:18:41,652 INFO L93 Difference]: Finished difference Result 24418 states and 27483 transitions. [2024-10-10 23:18:41,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:18:41,652 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 127.0) internal successors, (381), 3 states have internal predecessors, (381), 0 states have call successors, (0), 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 502 [2024-10-10 23:18:41,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:18:41,672 INFO L225 Difference]: With dead ends: 24418 [2024-10-10 23:18:41,672 INFO L226 Difference]: Without dead ends: 13867 [2024-10-10 23:18:41,684 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:18:41,685 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 124 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 535 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 662 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 535 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-10 23:18:41,685 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 77 Invalid, 662 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 535 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-10 23:18:41,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13867 states. [2024-10-10 23:18:41,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13867 to 13120. [2024-10-10 23:18:41,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13120 states, 13119 states have (on average 1.1182254745026299) internal successors, (14670), 13119 states have internal predecessors, (14670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:18:41,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13120 states to 13120 states and 14670 transitions. [2024-10-10 23:18:41,865 INFO L78 Accepts]: Start accepts. Automaton has 13120 states and 14670 transitions. Word has length 502 [2024-10-10 23:18:41,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:18:41,865 INFO L471 AbstractCegarLoop]: Abstraction has 13120 states and 14670 transitions. [2024-10-10 23:18:41,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 127.0) internal successors, (381), 3 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:18:41,866 INFO L276 IsEmpty]: Start isEmpty. Operand 13120 states and 14670 transitions. [2024-10-10 23:18:41,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 509 [2024-10-10 23:18:41,883 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:18:41,883 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:18:41,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-10 23:18:41,884 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:18:41,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:18:41,884 INFO L85 PathProgramCache]: Analyzing trace with hash -1813583140, now seen corresponding path program 1 times [2024-10-10 23:18:41,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:18:41,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222093164] [2024-10-10 23:18:41,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:18:41,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:18:41,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:18:43,268 INFO L134 CoverageAnalysis]: Checked inductivity of 765 backedges. 228 proven. 406 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2024-10-10 23:18:43,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:18:43,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222093164] [2024-10-10 23:18:43,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222093164] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:18:43,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [462286677] [2024-10-10 23:18:43,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:18:43,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:18:43,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:18:43,273 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 23:18:43,274 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-10 23:18:43,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:18:43,504 INFO L255 TraceCheckSpWp]: Trace formula consists of 672 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-10 23:18:43,519 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:18:43,710 INFO L134 CoverageAnalysis]: Checked inductivity of 765 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 618 trivial. 0 not checked. [2024-10-10 23:18:43,711 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 23:18:43,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [462286677] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:18:43,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 23:18:43,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2024-10-10 23:18:43,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435054001] [2024-10-10 23:18:43,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:18:43,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:18:43,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:18:43,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:18:43,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-10 23:18:43,713 INFO L87 Difference]: Start difference. First operand 13120 states and 14670 transitions. Second operand has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:18:44,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:18:44,328 INFO L93 Difference]: Finished difference Result 15146 states and 16896 transitions. [2024-10-10 23:18:44,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:18:44,328 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 0 states have call successors, (0), 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 508 [2024-10-10 23:18:44,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:18:44,350 INFO L225 Difference]: With dead ends: 15146 [2024-10-10 23:18:44,351 INFO L226 Difference]: Without dead ends: 15144 [2024-10-10 23:18:44,357 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 512 GetRequests, 507 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-10 23:18:44,358 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 181 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 484 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 559 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-10 23:18:44,358 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 135 Invalid, 559 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 484 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-10 23:18:44,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15144 states. [2024-10-10 23:18:44,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15144 to 13120. [2024-10-10 23:18:44,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13120 states, 13119 states have (on average 1.1181492491805778) internal successors, (14669), 13119 states have internal predecessors, (14669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:18:44,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13120 states to 13120 states and 14669 transitions. [2024-10-10 23:18:44,590 INFO L78 Accepts]: Start accepts. Automaton has 13120 states and 14669 transitions. Word has length 508 [2024-10-10 23:18:44,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:18:44,591 INFO L471 AbstractCegarLoop]: Abstraction has 13120 states and 14669 transitions. [2024-10-10 23:18:44,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:18:44,591 INFO L276 IsEmpty]: Start isEmpty. Operand 13120 states and 14669 transitions. [2024-10-10 23:18:44,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 575 [2024-10-10 23:18:44,609 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:18:44,610 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:18:44,630 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-10 23:18:44,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-10-10 23:18:44,813 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:18:44,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:18:44,813 INFO L85 PathProgramCache]: Analyzing trace with hash 70382273, now seen corresponding path program 1 times [2024-10-10 23:18:44,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:18:44,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490777606] [2024-10-10 23:18:44,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:18:44,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:18:44,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:18:45,313 INFO L134 CoverageAnalysis]: Checked inductivity of 817 backedges. 630 proven. 0 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2024-10-10 23:18:45,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:18:45,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490777606] [2024-10-10 23:18:45,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490777606] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:18:45,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:18:45,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:18:45,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360505470] [2024-10-10 23:18:45,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:18:45,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:18:45,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:18:45,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:18:45,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:18:45,317 INFO L87 Difference]: Start difference. First operand 13120 states and 14669 transitions. Second operand has 4 states, 4 states have (on average 97.25) internal successors, (389), 3 states have internal predecessors, (389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:18:46,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:18:46,307 INFO L93 Difference]: Finished difference Result 34168 states and 37972 transitions. [2024-10-10 23:18:46,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:18:46,308 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 97.25) internal successors, (389), 3 states have internal predecessors, (389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 574 [2024-10-10 23:18:46,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:18:46,327 INFO L225 Difference]: With dead ends: 34168 [2024-10-10 23:18:46,327 INFO L226 Difference]: Without dead ends: 21049 [2024-10-10 23:18:46,339 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:18:46,339 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 160 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 1087 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 1176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 1087 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-10 23:18:46,340 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 64 Invalid, 1176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 1087 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-10 23:18:46,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21049 states. [2024-10-10 23:18:46,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21049 to 19570. [2024-10-10 23:18:46,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19570 states, 19569 states have (on average 1.1077724973171854) internal successors, (21678), 19569 states have internal predecessors, (21678), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:18:46,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19570 states to 19570 states and 21678 transitions. [2024-10-10 23:18:46,581 INFO L78 Accepts]: Start accepts. Automaton has 19570 states and 21678 transitions. Word has length 574 [2024-10-10 23:18:46,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:18:46,582 INFO L471 AbstractCegarLoop]: Abstraction has 19570 states and 21678 transitions. [2024-10-10 23:18:46,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 97.25) internal successors, (389), 3 states have internal predecessors, (389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:18:46,583 INFO L276 IsEmpty]: Start isEmpty. Operand 19570 states and 21678 transitions. [2024-10-10 23:18:46,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 626 [2024-10-10 23:18:46,603 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:18:46,604 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:18:46,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-10 23:18:46,604 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:18:46,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:18:46,605 INFO L85 PathProgramCache]: Analyzing trace with hash -380937973, now seen corresponding path program 1 times [2024-10-10 23:18:46,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:18:46,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56397047] [2024-10-10 23:18:46,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:18:46,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:18:46,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:18:46,960 INFO L134 CoverageAnalysis]: Checked inductivity of 1198 backedges. 527 proven. 0 refuted. 0 times theorem prover too weak. 671 trivial. 0 not checked. [2024-10-10 23:18:46,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:18:46,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56397047] [2024-10-10 23:18:46,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56397047] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:18:46,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:18:46,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:18:46,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421437239] [2024-10-10 23:18:46,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:18:46,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:18:46,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:18:46,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:18:46,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:18:46,963 INFO L87 Difference]: Start difference. First operand 19570 states and 21678 transitions. Second operand has 3 states, 3 states have (on average 93.0) internal successors, (279), 3 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:18:47,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:18:47,587 INFO L93 Difference]: Finished difference Result 39319 states and 43586 transitions. [2024-10-10 23:18:47,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:18:47,588 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 93.0) internal successors, (279), 3 states have internal predecessors, (279), 0 states have call successors, (0), 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 625 [2024-10-10 23:18:47,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:18:47,607 INFO L225 Difference]: With dead ends: 39319 [2024-10-10 23:18:47,607 INFO L226 Difference]: Without dead ends: 22330 [2024-10-10 23:18:47,620 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:18:47,621 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 145 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 483 mSolverCounterSat, 147 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 630 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 147 IncrementalHoareTripleChecker+Valid, 483 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-10 23:18:47,621 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 110 Invalid, 630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [147 Valid, 483 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-10 23:18:47,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22330 states. [2024-10-10 23:18:47,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22330 to 19938. [2024-10-10 23:18:47,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19938 states, 19937 states have (on average 1.1019712093093244) internal successors, (21970), 19937 states have internal predecessors, (21970), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:18:47,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19938 states to 19938 states and 21970 transitions. [2024-10-10 23:18:47,887 INFO L78 Accepts]: Start accepts. Automaton has 19938 states and 21970 transitions. Word has length 625 [2024-10-10 23:18:47,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:18:47,888 INFO L471 AbstractCegarLoop]: Abstraction has 19938 states and 21970 transitions. [2024-10-10 23:18:47,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 93.0) internal successors, (279), 3 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:18:47,889 INFO L276 IsEmpty]: Start isEmpty. Operand 19938 states and 21970 transitions. [2024-10-10 23:18:47,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 659 [2024-10-10 23:18:47,910 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:18:47,911 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-10 23:18:47,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-10 23:18:47,911 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:18:47,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:18:47,912 INFO L85 PathProgramCache]: Analyzing trace with hash 998891673, now seen corresponding path program 1 times [2024-10-10 23:18:47,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:18:47,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666245879] [2024-10-10 23:18:47,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:18:47,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:18:48,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:18:48,386 INFO L134 CoverageAnalysis]: Checked inductivity of 1217 backedges. 527 proven. 0 refuted. 0 times theorem prover too weak. 690 trivial. 0 not checked. [2024-10-10 23:18:48,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:18:48,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666245879] [2024-10-10 23:18:48,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666245879] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:18:48,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:18:48,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:18:48,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065759719] [2024-10-10 23:18:48,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:18:48,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:18:48,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:18:48,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:18:48,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:18:48,390 INFO L87 Difference]: Start difference. First operand 19938 states and 21970 transitions. Second operand has 3 states, 3 states have (on average 97.66666666666667) internal successors, (293), 3 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:18:48,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:18:48,998 INFO L93 Difference]: Finished difference Result 40794 states and 44945 transitions. [2024-10-10 23:18:48,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:18:48,999 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 97.66666666666667) internal successors, (293), 3 states have internal predecessors, (293), 0 states have call successors, (0), 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 658 [2024-10-10 23:18:49,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:18:49,018 INFO L225 Difference]: With dead ends: 40794 [2024-10-10 23:18:49,018 INFO L226 Difference]: Without dead ends: 21225 [2024-10-10 23:18:49,033 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:18:49,034 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 114 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 533 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 584 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 533 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-10 23:18:49,034 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 135 Invalid, 584 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 533 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-10 23:18:49,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21225 states. [2024-10-10 23:18:49,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21225 to 19192. [2024-10-10 23:18:49,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19192 states, 19191 states have (on average 1.0982231254233756) internal successors, (21076), 19191 states have internal predecessors, (21076), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:18:49,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19192 states to 19192 states and 21076 transitions. [2024-10-10 23:18:49,224 INFO L78 Accepts]: Start accepts. Automaton has 19192 states and 21076 transitions. Word has length 658 [2024-10-10 23:18:49,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:18:49,225 INFO L471 AbstractCegarLoop]: Abstraction has 19192 states and 21076 transitions. [2024-10-10 23:18:49,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 97.66666666666667) internal successors, (293), 3 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:18:49,225 INFO L276 IsEmpty]: Start isEmpty. Operand 19192 states and 21076 transitions. [2024-10-10 23:18:49,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 708 [2024-10-10 23:18:49,249 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:18:49,250 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-10-10 23:18:49,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-10 23:18:49,250 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:18:49,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:18:49,251 INFO L85 PathProgramCache]: Analyzing trace with hash 1710080404, now seen corresponding path program 1 times [2024-10-10 23:18:49,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:18:49,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142600731] [2024-10-10 23:18:49,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:18:49,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:18:49,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:18:49,908 INFO L134 CoverageAnalysis]: Checked inductivity of 1633 backedges. 1039 proven. 0 refuted. 0 times theorem prover too weak. 594 trivial. 0 not checked. [2024-10-10 23:18:49,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:18:49,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142600731] [2024-10-10 23:18:49,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142600731] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:18:49,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:18:49,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:18:49,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402627492] [2024-10-10 23:18:49,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:18:49,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:18:49,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:18:49,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:18:49,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:18:49,911 INFO L87 Difference]: Start difference. First operand 19192 states and 21076 transitions. Second operand has 3 states, 3 states have (on average 125.0) internal successors, (375), 3 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-10-10 23:18:50,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:18:50,564 INFO L93 Difference]: Finished difference Result 36908 states and 40476 transitions. [2024-10-10 23:18:50,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:18:50,565 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 125.0) internal successors, (375), 3 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) Word has length 707 [2024-10-10 23:18:50,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:18:50,567 INFO L225 Difference]: With dead ends: 36908 [2024-10-10 23:18:50,567 INFO L226 Difference]: Without dead ends: 0 [2024-10-10 23:18:50,584 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:18:50,585 INFO L432 NwaCegarLoop]: 322 mSDtfsCounter, 46 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 553 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 623 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 553 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-10 23:18:50,585 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 335 Invalid, 623 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 553 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-10 23:18:50,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-10 23:18:50,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-10 23:18:50,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:18:50,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-10 23:18:50,587 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 707 [2024-10-10 23:18:50,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:18:50,587 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-10 23:18:50,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 125.0) internal successors, (375), 3 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-10-10 23:18:50,588 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-10 23:18:50,588 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-10 23:18:50,591 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-10 23:18:50,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-10 23:18:50,597 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:18:50,599 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-10 23:18:53,585 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-10 23:18:53,616 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.10 11:18:53 BoogieIcfgContainer [2024-10-10 23:18:53,616 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-10 23:18:53,617 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-10 23:18:53,617 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-10 23:18:53,617 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-10 23:18:53,617 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:18:25" (3/4) ... [2024-10-10 23:18:53,620 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-10 23:18:53,646 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2024-10-10 23:18:53,649 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-10-10 23:18:53,650 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-10 23:18:53,651 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-10 23:18:53,841 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-10 23:18:53,842 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-10 23:18:53,842 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-10 23:18:53,843 INFO L158 Benchmark]: Toolchain (without parser) took 31435.24ms. Allocated memory was 174.1MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 140.9MB in the beginning and 518.4MB in the end (delta: -377.5MB). Peak memory consumption was 720.5MB. Max. memory is 16.1GB. [2024-10-10 23:18:53,843 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 104.9MB. Free memory is still 77.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-10 23:18:53,843 INFO L158 Benchmark]: CACSL2BoogieTranslator took 663.10ms. Allocated memory is still 174.1MB. Free memory was 140.9MB in the beginning and 92.9MB in the end (delta: 48.0MB). Peak memory consumption was 48.2MB. Max. memory is 16.1GB. [2024-10-10 23:18:53,843 INFO L158 Benchmark]: Boogie Procedure Inliner took 153.15ms. Allocated memory is still 174.1MB. Free memory was 92.9MB in the beginning and 75.9MB in the end (delta: 16.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-10 23:18:53,844 INFO L158 Benchmark]: Boogie Preprocessor took 190.39ms. Allocated memory is still 174.1MB. Free memory was 75.9MB in the beginning and 49.9MB in the end (delta: 26.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-10-10 23:18:53,844 INFO L158 Benchmark]: RCFGBuilder took 1729.18ms. Allocated memory was 174.1MB in the beginning and 237.0MB in the end (delta: 62.9MB). Free memory was 49.9MB in the beginning and 162.4MB in the end (delta: -112.5MB). Peak memory consumption was 33.8MB. Max. memory is 16.1GB. [2024-10-10 23:18:53,844 INFO L158 Benchmark]: TraceAbstraction took 28467.11ms. Allocated memory was 237.0MB in the beginning and 1.3GB in the end (delta: 1.0GB). Free memory was 162.4MB in the beginning and 535.2MB in the end (delta: -372.8MB). Peak memory consumption was 787.0MB. Max. memory is 16.1GB. [2024-10-10 23:18:53,845 INFO L158 Benchmark]: Witness Printer took 225.08ms. Allocated memory is still 1.3GB. Free memory was 535.2MB in the beginning and 518.4MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-10 23:18:53,847 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.15ms. Allocated memory is still 104.9MB. Free memory is still 77.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 663.10ms. Allocated memory is still 174.1MB. Free memory was 140.9MB in the beginning and 92.9MB in the end (delta: 48.0MB). Peak memory consumption was 48.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 153.15ms. Allocated memory is still 174.1MB. Free memory was 92.9MB in the beginning and 75.9MB in the end (delta: 16.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 190.39ms. Allocated memory is still 174.1MB. Free memory was 75.9MB in the beginning and 49.9MB in the end (delta: 26.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1729.18ms. Allocated memory was 174.1MB in the beginning and 237.0MB in the end (delta: 62.9MB). Free memory was 49.9MB in the beginning and 162.4MB in the end (delta: -112.5MB). Peak memory consumption was 33.8MB. Max. memory is 16.1GB. * TraceAbstraction took 28467.11ms. Allocated memory was 237.0MB in the beginning and 1.3GB in the end (delta: 1.0GB). Free memory was 162.4MB in the beginning and 535.2MB in the end (delta: -372.8MB). Peak memory consumption was 787.0MB. Max. memory is 16.1GB. * Witness Printer took 225.08ms. Allocated memory is still 1.3GB. Free memory was 535.2MB in the beginning and 518.4MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 133]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 221 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 25.4s, OverallIterations: 20, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 14.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2606 SdHoareTripleChecker+Valid, 12.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2606 mSDsluCounter, 4045 SdHoareTripleChecker+Invalid, 10.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 381 mSDsCounter, 1658 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 10542 IncrementalHoareTripleChecker+Invalid, 12200 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1658 mSolverCounterUnsat, 3664 mSDtfsCounter, 10542 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 563 GetRequests, 539 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=19938occurred in iteration=18, InterpolantAutomatonStates: 60, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.1s AutomataMinimizationTime, 20 MinimizatonAttempts, 9660 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 6.5s InterpolantComputationTime, 7478 NumberOfCodeBlocks, 7478 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 7457 ConstructedInterpolants, 0 QuantifiedInterpolants, 14331 SizeOfPredicates, 0 NumberOfNonLiveVariables, 672 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 21 InterpolantComputations, 20 PerfectInterpolantSequences, 10110/10516 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 1044]: Loop Invariant Derived loop invariant: (((((((((((((((((((((a25 == 11) && (a8 <= 15)) && (a4 == 1)) && (246 <= a29)) && (0 <= ((long long) a23 + 42))) || (((a25 == 12) && (a4 == 0)) && (a8 <= 15))) || (((((a25 == 11) && (a29 <= 274)) && (a8 <= 15)) && (a4 == 1)) && (246 <= a29))) || ((((((a29 <= 140) && (a4 == 0)) && (a25 <= 10)) && (a8 <= 15)) && (a23 <= 312)) && (0 <= ((long long) a23 + 42)))) || ((((a25 == 13) && (139 <= a23)) && (a8 <= 15)) && (a4 == 1))) || ((((a25 == 12) && (a8 <= 15)) && (a4 == 1)) && (a29 <= 130))) || ((((a25 == 12) && (139 <= a23)) && (a8 <= 15)) && (a4 == 1))) || (((((a29 <= 140) && (a4 == 0)) && (a25 == 11)) && (a8 <= 15)) && (a23 <= 312))) || (((((a25 == 11) && (139 <= a23)) && (a8 <= 15)) && (a4 == 1)) && (a23 <= 312))) || (((a25 <= 10) && (a8 <= 15)) && (a4 == 1))) || (((((a25 == 13) && (a4 == 0)) && (a8 <= 15)) && (a23 <= 312)) && (0 <= ((long long) a23 + 42)))) || ((((a4 == 0) && (a8 <= 15)) && (a25 == 10)) && (a29 <= 130))) || (((((a25 == 11) && (a8 <= 15)) && (a29 <= 220)) && (a4 == 1)) && (312 <= a23))) || (((((((long long) a23 + 43) <= 0) && (a4 == 0)) && (a25 <= 10)) && (a8 <= 15)) && (246 <= a29))) || (((((((long long) a23 + 43) <= 0) && (a4 == 0)) && (a25 <= 10)) && (a8 <= 15)) && (a29 <= 130))) || ((((a25 == 13) && (a29 <= 274)) && (a8 <= 15)) && (a4 == 1))) || (((((a4 == 0) && (a25 == 11)) && (a8 <= 15)) && (a23 <= 312)) && (246 <= a29))) RESULT: Ultimate proved your program to be correct! [2024-10-10 23:18:53,876 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE