./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_label53.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_label53.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 536fb035d928713a90d5c84a48f9ef94bf2f10bc408883dd0d7e11d670c7e07b --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-10 23:19:55,978 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-10 23:19:56,070 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:19:56,076 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-10 23:19:56,079 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-10 23:19:56,104 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-10 23:19:56,105 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-10 23:19:56,105 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-10 23:19:56,106 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-10 23:19:56,106 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-10 23:19:56,107 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-10 23:19:56,107 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-10 23:19:56,108 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-10 23:19:56,110 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-10 23:19:56,111 INFO L153 SettingsManager]: * Use SBE=true [2024-10-10 23:19:56,111 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-10 23:19:56,112 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-10 23:19:56,112 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-10 23:19:56,112 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-10 23:19:56,113 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-10 23:19:56,113 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-10 23:19:56,114 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-10 23:19:56,114 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-10 23:19:56,114 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-10 23:19:56,115 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-10 23:19:56,115 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-10 23:19:56,115 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-10 23:19:56,116 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-10 23:19:56,116 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-10 23:19:56,116 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-10 23:19:56,117 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-10 23:19:56,117 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-10 23:19:56,117 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 23:19:56,118 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-10 23:19:56,118 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-10 23:19:56,119 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-10 23:19:56,119 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-10 23:19:56,119 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-10 23:19:56,120 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-10 23:19:56,120 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-10 23:19:56,120 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-10 23:19:56,121 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-10 23:19:56,121 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 -> 536fb035d928713a90d5c84a48f9ef94bf2f10bc408883dd0d7e11d670c7e07b [2024-10-10 23:19:56,375 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-10 23:19:56,400 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-10 23:19:56,404 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-10 23:19:56,405 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-10 23:19:56,406 INFO L274 PluginConnector]: CDTParser initialized [2024-10-10 23:19:56,408 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label53.c [2024-10-10 23:19:57,967 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-10 23:19:58,275 INFO L384 CDTParser]: Found 1 translation units. [2024-10-10 23:19:58,277 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label53.c [2024-10-10 23:19:58,300 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/009e465dc/7ddbcb11d44f4cf8ab045c928e477198/FLAG007b45f7c [2024-10-10 23:19:58,319 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/009e465dc/7ddbcb11d44f4cf8ab045c928e477198 [2024-10-10 23:19:58,322 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-10 23:19:58,325 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-10 23:19:58,326 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-10 23:19:58,326 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-10 23:19:58,333 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-10 23:19:58,334 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 11:19:58" (1/1) ... [2024-10-10 23:19:58,336 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d390ee5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:19:58, skipping insertion in model container [2024-10-10 23:19:58,337 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 11:19:58" (1/1) ... [2024-10-10 23:19:58,404 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-10 23:19:58,625 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_label53.c[6841,6854] [2024-10-10 23:19:58,875 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 23:19:58,888 INFO L200 MainTranslator]: Completed pre-run [2024-10-10 23:19:58,920 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_label53.c[6841,6854] [2024-10-10 23:19:59,047 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 23:19:59,067 INFO L204 MainTranslator]: Completed translation [2024-10-10 23:19:59,068 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:19:59 WrapperNode [2024-10-10 23:19:59,068 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-10 23:19:59,069 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-10 23:19:59,069 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-10 23:19:59,070 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-10 23:19:59,077 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:19:59" (1/1) ... [2024-10-10 23:19:59,112 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:19:59" (1/1) ... [2024-10-10 23:19:59,219 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1000 [2024-10-10 23:19:59,220 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-10 23:19:59,220 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-10 23:19:59,220 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-10 23:19:59,221 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-10 23:19:59,232 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:19:59" (1/1) ... [2024-10-10 23:19:59,232 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:19:59" (1/1) ... [2024-10-10 23:19:59,252 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:19:59" (1/1) ... [2024-10-10 23:19:59,315 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:19:59,315 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:19:59" (1/1) ... [2024-10-10 23:19:59,316 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:19:59" (1/1) ... [2024-10-10 23:19:59,362 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:19:59" (1/1) ... [2024-10-10 23:19:59,376 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:19:59" (1/1) ... [2024-10-10 23:19:59,397 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:19:59" (1/1) ... [2024-10-10 23:19:59,408 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:19:59" (1/1) ... [2024-10-10 23:19:59,424 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-10 23:19:59,426 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-10 23:19:59,426 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-10 23:19:59,426 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-10 23:19:59,427 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:19:59" (1/1) ... [2024-10-10 23:19:59,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 23:19:59,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:19:59,459 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:19:59,462 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:19:59,510 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-10 23:19:59,511 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-10 23:19:59,512 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-10 23:19:59,512 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-10 23:19:59,585 INFO L238 CfgBuilder]: Building ICFG [2024-10-10 23:19:59,587 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-10 23:20:01,292 INFO L? ?]: Removed 129 outVars from TransFormulas that were not future-live. [2024-10-10 23:20:01,292 INFO L287 CfgBuilder]: Performing block encoding [2024-10-10 23:20:01,358 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-10 23:20:01,359 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-10 23:20:01,359 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:20:01 BoogieIcfgContainer [2024-10-10 23:20:01,359 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-10 23:20:01,361 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-10 23:20:01,362 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-10 23:20:01,366 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-10 23:20:01,366 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.10 11:19:58" (1/3) ... [2024-10-10 23:20:01,367 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cae46e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 11:20:01, skipping insertion in model container [2024-10-10 23:20:01,367 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:19:59" (2/3) ... [2024-10-10 23:20:01,368 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cae46e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 11:20:01, skipping insertion in model container [2024-10-10 23:20:01,369 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:20:01" (3/3) ... [2024-10-10 23:20:01,371 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem11_label53.c [2024-10-10 23:20:01,390 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-10 23:20:01,390 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-10 23:20:01,471 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-10 23:20:01,478 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;@2ca527c5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-10 23:20:01,479 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-10 23:20:01,484 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:20:01,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-10-10 23:20:01,494 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:20:01,497 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:20:01,497 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:20:01,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:20:01,505 INFO L85 PathProgramCache]: Analyzing trace with hash -1665554782, now seen corresponding path program 1 times [2024-10-10 23:20:01,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:20:01,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618733823] [2024-10-10 23:20:01,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:20:01,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:20:01,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:20:01,741 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:20:01,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:20:01,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618733823] [2024-10-10 23:20:01,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618733823] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:20:01,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:20:01,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:20:01,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114083318] [2024-10-10 23:20:01,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:20:01,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-10 23:20:01,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:20:01,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-10 23:20:01,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-10 23:20:01,787 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 23.0) internal successors, (46), 2 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:20:01,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:20:01,841 INFO L93 Difference]: Finished difference Result 441 states and 839 transitions. [2024-10-10 23:20:01,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-10 23:20:01,846 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2024-10-10 23:20:01,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:20:01,859 INFO L225 Difference]: With dead ends: 441 [2024-10-10 23:20:01,859 INFO L226 Difference]: Without dead ends: 219 [2024-10-10 23:20:01,864 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:20:01,870 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:20:01,872 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:20:01,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2024-10-10 23:20:01,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 219. [2024-10-10 23:20:01,929 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:20:01,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 355 transitions. [2024-10-10 23:20:01,938 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 355 transitions. Word has length 46 [2024-10-10 23:20:01,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:20:01,939 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 355 transitions. [2024-10-10 23:20:01,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:20:01,940 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 355 transitions. [2024-10-10 23:20:01,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-10-10 23:20:01,942 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:20:01,942 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:20:01,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-10 23:20:01,942 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:20:01,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:20:01,943 INFO L85 PathProgramCache]: Analyzing trace with hash 464745230, now seen corresponding path program 1 times [2024-10-10 23:20:01,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:20:01,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581747611] [2024-10-10 23:20:01,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:20:01,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:20:01,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:20:02,180 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:20:02,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:20:02,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581747611] [2024-10-10 23:20:02,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1581747611] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:20:02,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:20:02,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:20:02,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275067505] [2024-10-10 23:20:02,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:20:02,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:20:02,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:20:02,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:20:02,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:20:02,185 INFO L87 Difference]: Start difference. First operand 219 states and 355 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 2 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:20:03,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:20:03,195 INFO L93 Difference]: Finished difference Result 639 states and 1042 transitions. [2024-10-10 23:20:03,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:20:03,196 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 2 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2024-10-10 23:20:03,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:20:03,202 INFO L225 Difference]: With dead ends: 639 [2024-10-10 23:20:03,205 INFO L226 Difference]: Without dead ends: 421 [2024-10-10 23:20:03,207 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:20:03,208 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 165 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 524 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 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, 1.0s IncrementalHoareTripleChecker+Time [2024-10-10 23:20:03,209 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 120 Invalid, 672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 524 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-10 23:20:03,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2024-10-10 23:20:03,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 411. [2024-10-10 23:20:03,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 411 states, 410 states have (on average 1.524390243902439) internal successors, (625), 410 states have internal predecessors, (625), 0 states have call successors, (0), 0 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:20:03,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 625 transitions. [2024-10-10 23:20:03,239 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 625 transitions. Word has length 46 [2024-10-10 23:20:03,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:20:03,239 INFO L471 AbstractCegarLoop]: Abstraction has 411 states and 625 transitions. [2024-10-10 23:20:03,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 2 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:20:03,240 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 625 transitions. [2024-10-10 23:20:03,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-10 23:20:03,245 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:20:03,245 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 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:20:03,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-10 23:20:03,246 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:20:03,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:20:03,247 INFO L85 PathProgramCache]: Analyzing trace with hash -363091472, now seen corresponding path program 1 times [2024-10-10 23:20:03,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:20:03,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028159825] [2024-10-10 23:20:03,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:20:03,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:20:03,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:20:03,419 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:20:03,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:20:03,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028159825] [2024-10-10 23:20:03,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028159825] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:20:03,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:20:03,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:20:03,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879110291] [2024-10-10 23:20:03,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:20:03,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:20:03,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:20:03,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:20:03,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:20:03,422 INFO L87 Difference]: Start difference. First operand 411 states and 625 transitions. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 2 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:20:04,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:20:04,201 INFO L93 Difference]: Finished difference Result 1193 states and 1820 transitions. [2024-10-10 23:20:04,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:20:04,202 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 2 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 112 [2024-10-10 23:20:04,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:20:04,206 INFO L225 Difference]: With dead ends: 1193 [2024-10-10 23:20:04,206 INFO L226 Difference]: Without dead ends: 783 [2024-10-10 23:20:04,207 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:20:04,208 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 175 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 449 mSolverCounterSat, 183 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 632 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 183 IncrementalHoareTripleChecker+Valid, 449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-10 23:20:04,209 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 152 Invalid, 632 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [183 Valid, 449 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-10 23:20:04,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 783 states. [2024-10-10 23:20:04,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 783 to 783. [2024-10-10 23:20:04,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 783 states, 782 states have (on average 1.3746803069053708) internal successors, (1075), 782 states have internal predecessors, (1075), 0 states have call successors, (0), 0 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:20:04,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 1075 transitions. [2024-10-10 23:20:04,255 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 1075 transitions. Word has length 112 [2024-10-10 23:20:04,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:20:04,255 INFO L471 AbstractCegarLoop]: Abstraction has 783 states and 1075 transitions. [2024-10-10 23:20:04,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 2 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:20:04,256 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 1075 transitions. [2024-10-10 23:20:04,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-10 23:20:04,258 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:20:04,259 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 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:20:04,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-10 23:20:04,260 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:20:04,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:20:04,260 INFO L85 PathProgramCache]: Analyzing trace with hash -1030547974, now seen corresponding path program 1 times [2024-10-10 23:20:04,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:20:04,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332979792] [2024-10-10 23:20:04,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:20:04,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:20:04,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:20:04,627 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:20:04,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:20:04,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332979792] [2024-10-10 23:20:04,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332979792] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:20:04,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:20:04,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:20:04,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986341706] [2024-10-10 23:20:04,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:20:04,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:20:04,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:20:04,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:20:04,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:20:04,630 INFO L87 Difference]: Start difference. First operand 783 states and 1075 transitions. Second operand has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 2 states have internal predecessors, (116), 0 states have call successors, (0), 0 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:20:05,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:20:05,337 INFO L93 Difference]: Finished difference Result 1935 states and 2598 transitions. [2024-10-10 23:20:05,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:20:05,338 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 2 states have internal predecessors, (116), 0 states have call successors, (0), 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 116 [2024-10-10 23:20:05,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:20:05,342 INFO L225 Difference]: With dead ends: 1935 [2024-10-10 23:20:05,342 INFO L226 Difference]: Without dead ends: 1153 [2024-10-10 23:20:05,344 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:20:05,345 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 119 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 530 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 530 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-10 23:20:05,346 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 188 Invalid, 568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 530 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-10 23:20:05,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1153 states. [2024-10-10 23:20:05,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1153 to 1152. [2024-10-10 23:20:05,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1152 states, 1151 states have (on average 1.2701998262380538) internal successors, (1462), 1151 states have internal predecessors, (1462), 0 states have call successors, (0), 0 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:20:05,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1152 states to 1152 states and 1462 transitions. [2024-10-10 23:20:05,380 INFO L78 Accepts]: Start accepts. Automaton has 1152 states and 1462 transitions. Word has length 116 [2024-10-10 23:20:05,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:20:05,380 INFO L471 AbstractCegarLoop]: Abstraction has 1152 states and 1462 transitions. [2024-10-10 23:20:05,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 2 states have internal predecessors, (116), 0 states have call successors, (0), 0 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:20:05,381 INFO L276 IsEmpty]: Start isEmpty. Operand 1152 states and 1462 transitions. [2024-10-10 23:20:05,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-10-10 23:20:05,389 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:20:05,389 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:05,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-10 23:20:05,390 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:20:05,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:20:05,390 INFO L85 PathProgramCache]: Analyzing trace with hash -1668799311, now seen corresponding path program 1 times [2024-10-10 23:20:05,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:20:05,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232388398] [2024-10-10 23:20:05,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:20:05,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:20:05,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:20:05,672 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:20:05,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:20:05,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232388398] [2024-10-10 23:20:05,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232388398] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:20:05,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:20:05,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:20:05,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626745548] [2024-10-10 23:20:05,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:20:05,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:20:05,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:20:05,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:20:05,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:20:05,677 INFO L87 Difference]: Start difference. First operand 1152 states and 1462 transitions. Second operand has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 0 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:20:06,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:20:06,480 INFO L93 Difference]: Finished difference Result 2678 states and 3480 transitions. [2024-10-10 23:20:06,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:20:06,481 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 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 158 [2024-10-10 23:20:06,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:20:06,488 INFO L225 Difference]: With dead ends: 2678 [2024-10-10 23:20:06,488 INFO L226 Difference]: Without dead ends: 1711 [2024-10-10 23:20:06,490 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:20:06,491 INFO L432 NwaCegarLoop]: 310 mSDtfsCounter, 159 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 547 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 646 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-10 23:20:06,492 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 329 Invalid, 646 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 547 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-10 23:20:06,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1711 states. [2024-10-10 23:20:06,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1711 to 1520. [2024-10-10 23:20:06,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1520 states, 1519 states have (on average 1.2560895325872283) internal successors, (1908), 1519 states have internal predecessors, (1908), 0 states have call successors, (0), 0 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:20:06,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1520 states to 1520 states and 1908 transitions. [2024-10-10 23:20:06,522 INFO L78 Accepts]: Start accepts. Automaton has 1520 states and 1908 transitions. Word has length 158 [2024-10-10 23:20:06,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:20:06,523 INFO L471 AbstractCegarLoop]: Abstraction has 1520 states and 1908 transitions. [2024-10-10 23:20:06,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 0 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:20:06,524 INFO L276 IsEmpty]: Start isEmpty. Operand 1520 states and 1908 transitions. [2024-10-10 23:20:06,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2024-10-10 23:20:06,527 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:20:06,527 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 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:20:06,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-10 23:20:06,528 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:20:06,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:20:06,529 INFO L85 PathProgramCache]: Analyzing trace with hash -1876285091, now seen corresponding path program 1 times [2024-10-10 23:20:06,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:20:06,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821092219] [2024-10-10 23:20:06,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:20:06,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:20:06,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:20:06,794 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-10-10 23:20:06,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:20:06,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821092219] [2024-10-10 23:20:06,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821092219] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:20:06,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:20:06,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:20:06,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907434698] [2024-10-10 23:20:06,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:20:06,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:20:06,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:20:06,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:20:06,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:20:06,797 INFO L87 Difference]: Start difference. First operand 1520 states and 1908 transitions. Second operand has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 0 states have call successors, (0), 0 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:20:07,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:20:07,633 INFO L93 Difference]: Finished difference Result 3596 states and 4558 transitions. [2024-10-10 23:20:07,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:20:07,634 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 0 states have call successors, (0), 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 228 [2024-10-10 23:20:07,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:20:07,642 INFO L225 Difference]: With dead ends: 3596 [2024-10-10 23:20:07,643 INFO L226 Difference]: Without dead ends: 2077 [2024-10-10 23:20:07,645 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:20:07,646 INFO L432 NwaCegarLoop]: 368 mSDtfsCounter, 150 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 595 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 681 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 595 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-10 23:20:07,646 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 388 Invalid, 681 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 595 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-10 23:20:07,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2077 states. [2024-10-10 23:20:07,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2077 to 1888. [2024-10-10 23:20:07,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1888 states, 1887 states have (on average 1.2474827768945416) internal successors, (2354), 1887 states have internal predecessors, (2354), 0 states have call successors, (0), 0 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:20:07,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1888 states to 1888 states and 2354 transitions. [2024-10-10 23:20:07,681 INFO L78 Accepts]: Start accepts. Automaton has 1888 states and 2354 transitions. Word has length 228 [2024-10-10 23:20:07,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:20:07,682 INFO L471 AbstractCegarLoop]: Abstraction has 1888 states and 2354 transitions. [2024-10-10 23:20:07,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 0 states have call successors, (0), 0 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:20:07,683 INFO L276 IsEmpty]: Start isEmpty. Operand 1888 states and 2354 transitions. [2024-10-10 23:20:07,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-10-10 23:20:07,686 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:20:07,687 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:20:07,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-10 23:20:07,687 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:20:07,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:20:07,688 INFO L85 PathProgramCache]: Analyzing trace with hash 1297156318, now seen corresponding path program 1 times [2024-10-10 23:20:07,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:20:07,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321499163] [2024-10-10 23:20:07,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:20:07,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:20:07,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:20:08,094 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 185 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:20:08,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:20:08,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321499163] [2024-10-10 23:20:08,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321499163] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:20:08,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:20:08,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:20:08,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693755409] [2024-10-10 23:20:08,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:20:08,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:20:08,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:20:08,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:20:08,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:20:08,098 INFO L87 Difference]: Start difference. First operand 1888 states and 2354 transitions. Second operand has 3 states, 3 states have (on average 85.0) internal successors, (255), 3 states have internal predecessors, (255), 0 states have call successors, (0), 0 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:20:08,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:20:08,921 INFO L93 Difference]: Finished difference Result 5074 states and 6325 transitions. [2024-10-10 23:20:08,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:20:08,922 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 85.0) internal successors, (255), 3 states have internal predecessors, (255), 0 states have call successors, (0), 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 255 [2024-10-10 23:20:08,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:20:08,933 INFO L225 Difference]: With dead ends: 5074 [2024-10-10 23:20:08,934 INFO L226 Difference]: Without dead ends: 3187 [2024-10-10 23:20:08,937 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:20:08,938 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 120 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 592 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 666 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 592 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-10 23:20:08,939 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 140 Invalid, 666 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 592 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-10 23:20:08,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3187 states. [2024-10-10 23:20:08,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3187 to 3185. [2024-10-10 23:20:08,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3185 states, 3184 states have (on average 1.2157663316582914) internal successors, (3871), 3184 states have internal predecessors, (3871), 0 states have call successors, (0), 0 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:20:08,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3185 states to 3185 states and 3871 transitions. [2024-10-10 23:20:08,997 INFO L78 Accepts]: Start accepts. Automaton has 3185 states and 3871 transitions. Word has length 255 [2024-10-10 23:20:08,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:20:08,998 INFO L471 AbstractCegarLoop]: Abstraction has 3185 states and 3871 transitions. [2024-10-10 23:20:08,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.0) internal successors, (255), 3 states have internal predecessors, (255), 0 states have call successors, (0), 0 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:20:08,998 INFO L276 IsEmpty]: Start isEmpty. Operand 3185 states and 3871 transitions. [2024-10-10 23:20:09,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2024-10-10 23:20:09,002 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:20:09,003 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:20:09,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-10 23:20:09,003 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:20:09,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:20:09,004 INFO L85 PathProgramCache]: Analyzing trace with hash 1208941470, now seen corresponding path program 1 times [2024-10-10 23:20:09,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:20:09,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643807318] [2024-10-10 23:20:09,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:20:09,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:20:09,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:20:09,510 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2024-10-10 23:20:09,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:20:09,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643807318] [2024-10-10 23:20:09,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643807318] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:20:09,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:20:09,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:20:09,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229176746] [2024-10-10 23:20:09,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:20:09,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:20:09,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:20:09,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:20:09,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:20:09,513 INFO L87 Difference]: Start difference. First operand 3185 states and 3871 transitions. Second operand has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 0 states have call successors, (0), 0 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:20:10,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:20:10,269 INFO L93 Difference]: Finished difference Result 6927 states and 8406 transitions. [2024-10-10 23:20:10,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:20:10,270 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 0 states have call successors, (0), 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 264 [2024-10-10 23:20:10,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:20:10,282 INFO L225 Difference]: With dead ends: 6927 [2024-10-10 23:20:10,282 INFO L226 Difference]: Without dead ends: 3743 [2024-10-10 23:20:10,286 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:20:10,287 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 172 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 587 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 649 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 587 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-10 23:20:10,288 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 138 Invalid, 649 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 587 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-10 23:20:10,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3743 states. [2024-10-10 23:20:10,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3743 to 3185. [2024-10-10 23:20:10,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3185 states, 3184 states have (on average 1.2157663316582914) internal successors, (3871), 3184 states have internal predecessors, (3871), 0 states have call successors, (0), 0 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:20:10,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3185 states to 3185 states and 3871 transitions. [2024-10-10 23:20:10,345 INFO L78 Accepts]: Start accepts. Automaton has 3185 states and 3871 transitions. Word has length 264 [2024-10-10 23:20:10,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:20:10,346 INFO L471 AbstractCegarLoop]: Abstraction has 3185 states and 3871 transitions. [2024-10-10 23:20:10,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 0 states have call successors, (0), 0 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:20:10,346 INFO L276 IsEmpty]: Start isEmpty. Operand 3185 states and 3871 transitions. [2024-10-10 23:20:10,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2024-10-10 23:20:10,350 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:20:10,351 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-10 23:20:10,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-10 23:20:10,351 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:20:10,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:20:10,352 INFO L85 PathProgramCache]: Analyzing trace with hash -1438832667, now seen corresponding path program 1 times [2024-10-10 23:20:10,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:20:10,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994512802] [2024-10-10 23:20:10,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:20:10,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:20:10,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:20:11,002 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 185 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:20:11,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:20:11,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994512802] [2024-10-10 23:20:11,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994512802] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:20:11,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:20:11,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-10 23:20:11,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533957904] [2024-10-10 23:20:11,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:20:11,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-10 23:20:11,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:20:11,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-10 23:20:11,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-10 23:20:11,006 INFO L87 Difference]: Start difference. First operand 3185 states and 3871 transitions. Second operand has 5 states, 5 states have (on average 53.0) internal successors, (265), 4 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:20:12,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:20:12,783 INFO L93 Difference]: Finished difference Result 11356 states and 13865 transitions. [2024-10-10 23:20:12,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-10 23:20:12,785 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 53.0) internal successors, (265), 4 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 265 [2024-10-10 23:20:12,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:20:12,812 INFO L225 Difference]: With dead ends: 11356 [2024-10-10 23:20:12,813 INFO L226 Difference]: Without dead ends: 8172 [2024-10-10 23:20:12,819 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-10 23:20:12,820 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 383 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 1889 mSolverCounterSat, 315 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 383 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 2204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 315 IncrementalHoareTripleChecker+Valid, 1889 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-10 23:20:12,820 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [383 Valid, 147 Invalid, 2204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [315 Valid, 1889 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-10 23:20:12,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8172 states. [2024-10-10 23:20:12,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8172 to 7977. [2024-10-10 23:20:12,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7977 states, 7976 states have (on average 1.184679037111334) internal successors, (9449), 7976 states have internal predecessors, (9449), 0 states have call successors, (0), 0 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:20:12,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7977 states to 7977 states and 9449 transitions. [2024-10-10 23:20:12,972 INFO L78 Accepts]: Start accepts. Automaton has 7977 states and 9449 transitions. Word has length 265 [2024-10-10 23:20:12,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:20:12,973 INFO L471 AbstractCegarLoop]: Abstraction has 7977 states and 9449 transitions. [2024-10-10 23:20:12,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 53.0) internal successors, (265), 4 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:20:12,973 INFO L276 IsEmpty]: Start isEmpty. Operand 7977 states and 9449 transitions. [2024-10-10 23:20:12,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2024-10-10 23:20:12,979 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:20:12,980 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:20:12,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-10 23:20:12,980 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:20:12,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:20:12,984 INFO L85 PathProgramCache]: Analyzing trace with hash 676468911, now seen corresponding path program 1 times [2024-10-10 23:20:12,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:20:12,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581995728] [2024-10-10 23:20:12,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:20:12,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:20:13,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:20:13,280 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 185 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:20:13,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:20:13,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581995728] [2024-10-10 23:20:13,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1581995728] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:20:13,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:20:13,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:20:13,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521253319] [2024-10-10 23:20:13,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:20:13,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:20:13,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:20:13,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:20:13,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:20:13,284 INFO L87 Difference]: Start difference. First operand 7977 states and 9449 transitions. Second operand has 3 states, 3 states have (on average 90.0) internal successors, (270), 3 states have internal predecessors, (270), 0 states have call successors, (0), 0 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:20:14,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:20:14,032 INFO L93 Difference]: Finished difference Result 15583 states and 18509 transitions. [2024-10-10 23:20:14,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:20:14,033 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 90.0) internal successors, (270), 3 states have internal predecessors, (270), 0 states have call successors, (0), 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 270 [2024-10-10 23:20:14,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:20:14,065 INFO L225 Difference]: With dead ends: 15583 [2024-10-10 23:20:14,065 INFO L226 Difference]: Without dead ends: 7975 [2024-10-10 23:20:14,075 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:20:14,077 INFO L432 NwaCegarLoop]: 282 mSDtfsCounter, 136 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 552 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 552 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-10 23:20:14,078 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 301 Invalid, 603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 552 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-10 23:20:14,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7975 states. [2024-10-10 23:20:14,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7975 to 7791. [2024-10-10 23:20:14,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7791 states, 7790 states have (on average 1.1453145057766367) internal successors, (8922), 7790 states have internal predecessors, (8922), 0 states have call successors, (0), 0 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:20:14,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7791 states to 7791 states and 8922 transitions. [2024-10-10 23:20:14,226 INFO L78 Accepts]: Start accepts. Automaton has 7791 states and 8922 transitions. Word has length 270 [2024-10-10 23:20:14,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:20:14,227 INFO L471 AbstractCegarLoop]: Abstraction has 7791 states and 8922 transitions. [2024-10-10 23:20:14,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 90.0) internal successors, (270), 3 states have internal predecessors, (270), 0 states have call successors, (0), 0 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:20:14,227 INFO L276 IsEmpty]: Start isEmpty. Operand 7791 states and 8922 transitions. [2024-10-10 23:20:14,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2024-10-10 23:20:14,234 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:20:14,234 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:20:14,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-10 23:20:14,234 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:20:14,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:20:14,235 INFO L85 PathProgramCache]: Analyzing trace with hash 1933305162, now seen corresponding path program 1 times [2024-10-10 23:20:14,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:20:14,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662879570] [2024-10-10 23:20:14,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:20:14,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:20:14,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:20:14,650 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 195 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:20:14,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:20:14,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662879570] [2024-10-10 23:20:14,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662879570] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:20:14,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:20:14,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-10 23:20:14,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7797718] [2024-10-10 23:20:14,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:20:14,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:20:14,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:20:14,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:20:14,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:20:14,653 INFO L87 Difference]: Start difference. First operand 7791 states and 8922 transitions. Second operand has 4 states, 4 states have (on average 70.5) internal successors, (282), 4 states have internal predecessors, (282), 0 states have call successors, (0), 0 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:20:15,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:20:15,681 INFO L93 Difference]: Finished difference Result 17059 states and 19557 transitions. [2024-10-10 23:20:15,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:20:15,682 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 70.5) internal successors, (282), 4 states have internal predecessors, (282), 0 states have call successors, (0), 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 282 [2024-10-10 23:20:15,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:20:15,701 INFO L225 Difference]: With dead ends: 17059 [2024-10-10 23:20:15,701 INFO L226 Difference]: Without dead ends: 9637 [2024-10-10 23:20:15,708 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:20:15,709 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 269 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 1099 mSolverCounterSat, 175 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 1274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 175 IncrementalHoareTripleChecker+Valid, 1099 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-10 23:20:15,709 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [269 Valid, 95 Invalid, 1274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [175 Valid, 1099 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-10 23:20:15,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9637 states. [2024-10-10 23:20:15,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9637 to 9631. [2024-10-10 23:20:15,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9631 states, 9630 states have (on average 1.1318795430944963) internal successors, (10900), 9630 states have internal predecessors, (10900), 0 states have call successors, (0), 0 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:20:15,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9631 states to 9631 states and 10900 transitions. [2024-10-10 23:20:15,855 INFO L78 Accepts]: Start accepts. Automaton has 9631 states and 10900 transitions. Word has length 282 [2024-10-10 23:20:15,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:20:15,856 INFO L471 AbstractCegarLoop]: Abstraction has 9631 states and 10900 transitions. [2024-10-10 23:20:15,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 70.5) internal successors, (282), 4 states have internal predecessors, (282), 0 states have call successors, (0), 0 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:20:15,857 INFO L276 IsEmpty]: Start isEmpty. Operand 9631 states and 10900 transitions. [2024-10-10 23:20:15,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2024-10-10 23:20:15,864 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:20:15,866 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:20:15,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-10 23:20:15,866 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:20:15,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:20:15,867 INFO L85 PathProgramCache]: Analyzing trace with hash 1446416122, now seen corresponding path program 1 times [2024-10-10 23:20:15,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:20:15,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199403748] [2024-10-10 23:20:15,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:20:15,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:20:15,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:20:16,061 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2024-10-10 23:20:16,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:20:16,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199403748] [2024-10-10 23:20:16,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199403748] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:20:16,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:20:16,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:20:16,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153376661] [2024-10-10 23:20:16,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:20:16,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:20:16,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:20:16,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:20:16,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:20:16,064 INFO L87 Difference]: Start difference. First operand 9631 states and 10900 transitions. Second operand has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 3 states have internal predecessors, (176), 0 states have call successors, (0), 0 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:20:16,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:20:16,833 INFO L93 Difference]: Finished difference Result 19630 states and 22246 transitions. [2024-10-10 23:20:16,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:20:16,834 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 3 states have internal predecessors, (176), 0 states have call successors, (0), 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 314 [2024-10-10 23:20:16,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:20:16,855 INFO L225 Difference]: With dead ends: 19630 [2024-10-10 23:20:16,857 INFO L226 Difference]: Without dead ends: 10368 [2024-10-10 23:20:16,867 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:20:16,868 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 171 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 564 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 642 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 564 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-10 23:20:16,869 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 122 Invalid, 642 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 564 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-10 23:20:16,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10368 states. [2024-10-10 23:20:17,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10368 to 8887. [2024-10-10 23:20:17,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8887 states, 8886 states have (on average 1.1302048165653837) internal successors, (10043), 8886 states have internal predecessors, (10043), 0 states have call successors, (0), 0 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:20:17,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8887 states to 8887 states and 10043 transitions. [2024-10-10 23:20:17,060 INFO L78 Accepts]: Start accepts. Automaton has 8887 states and 10043 transitions. Word has length 314 [2024-10-10 23:20:17,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:20:17,061 INFO L471 AbstractCegarLoop]: Abstraction has 8887 states and 10043 transitions. [2024-10-10 23:20:17,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 3 states have internal predecessors, (176), 0 states have call successors, (0), 0 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:20:17,062 INFO L276 IsEmpty]: Start isEmpty. Operand 8887 states and 10043 transitions. [2024-10-10 23:20:17,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 412 [2024-10-10 23:20:17,080 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:20:17,081 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:20:17,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-10 23:20:17,082 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:20:17,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:20:17,082 INFO L85 PathProgramCache]: Analyzing trace with hash -1261370753, now seen corresponding path program 1 times [2024-10-10 23:20:17,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:20:17,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038417701] [2024-10-10 23:20:17,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:20:17,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:20:17,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:20:17,415 INFO L134 CoverageAnalysis]: Checked inductivity of 453 backedges. 356 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2024-10-10 23:20:17,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:20:17,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038417701] [2024-10-10 23:20:17,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038417701] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:20:17,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:20:17,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:20:17,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145406762] [2024-10-10 23:20:17,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:20:17,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:20:17,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:20:17,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:20:17,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:20:17,419 INFO L87 Difference]: Start difference. First operand 8887 states and 10043 transitions. Second operand has 3 states, 3 states have (on average 105.0) internal successors, (315), 3 states have internal predecessors, (315), 0 states have call successors, (0), 0 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:20:18,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:20:18,048 INFO L93 Difference]: Finished difference Result 18333 states and 20775 transitions. [2024-10-10 23:20:18,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:20:18,049 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 105.0) internal successors, (315), 3 states have internal predecessors, (315), 0 states have call successors, (0), 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 411 [2024-10-10 23:20:18,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:20:18,070 INFO L225 Difference]: With dead ends: 18333 [2024-10-10 23:20:18,070 INFO L226 Difference]: Without dead ends: 9815 [2024-10-10 23:20:18,081 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:20:18,081 INFO L432 NwaCegarLoop]: 334 mSDtfsCounter, 65 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 586 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 623 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-10 23:20:18,082 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 360 Invalid, 623 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 586 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-10 23:20:18,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9815 states. [2024-10-10 23:20:18,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9815 to 9812. [2024-10-10 23:20:18,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9812 states, 9811 states have (on average 1.1272041585974926) internal successors, (11059), 9811 states have internal predecessors, (11059), 0 states have call successors, (0), 0 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:20:18,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9812 states to 9812 states and 11059 transitions. [2024-10-10 23:20:18,227 INFO L78 Accepts]: Start accepts. Automaton has 9812 states and 11059 transitions. Word has length 411 [2024-10-10 23:20:18,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:20:18,228 INFO L471 AbstractCegarLoop]: Abstraction has 9812 states and 11059 transitions. [2024-10-10 23:20:18,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.0) internal successors, (315), 3 states have internal predecessors, (315), 0 states have call successors, (0), 0 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:20:18,229 INFO L276 IsEmpty]: Start isEmpty. Operand 9812 states and 11059 transitions. [2024-10-10 23:20:18,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 416 [2024-10-10 23:20:18,243 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:20:18,243 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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, 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:20:18,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-10 23:20:18,243 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:20:18,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:20:18,244 INFO L85 PathProgramCache]: Analyzing trace with hash -1605510508, now seen corresponding path program 1 times [2024-10-10 23:20:18,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:20:18,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004046344] [2024-10-10 23:20:18,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:20:18,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:20:18,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:20:19,318 INFO L134 CoverageAnalysis]: Checked inductivity of 663 backedges. 462 proven. 78 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2024-10-10 23:20:19,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:20:19,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004046344] [2024-10-10 23:20:19,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004046344] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:20:19,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2077442671] [2024-10-10 23:20:19,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:20:19,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:20:19,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:20:19,321 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:20:19,323 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:20:19,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:20:19,516 INFO L255 TraceCheckSpWp]: Trace formula consists of 574 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-10 23:20:19,532 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:20:19,917 INFO L134 CoverageAnalysis]: Checked inductivity of 663 backedges. 529 proven. 0 refuted. 0 times theorem prover too weak. 134 trivial. 0 not checked. [2024-10-10 23:20:19,917 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 23:20:19,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2077442671] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:20:19,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 23:20:19,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-10-10 23:20:19,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312491455] [2024-10-10 23:20:19,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:20:19,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:20:19,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:20:19,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:20:19,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-10 23:20:19,920 INFO L87 Difference]: Start difference. First operand 9812 states and 11059 transitions. Second operand has 3 states, 3 states have (on average 94.33333333333333) internal successors, (283), 3 states have internal predecessors, (283), 0 states have call successors, (0), 0 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:20:20,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:20:20,470 INFO L93 Difference]: Finished difference Result 19440 states and 21928 transitions. [2024-10-10 23:20:20,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:20:20,471 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 94.33333333333333) internal successors, (283), 3 states have internal predecessors, (283), 0 states have call successors, (0), 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 415 [2024-10-10 23:20:20,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:20:20,490 INFO L225 Difference]: With dead ends: 19440 [2024-10-10 23:20:20,490 INFO L226 Difference]: Without dead ends: 9997 [2024-10-10 23:20:20,501 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 420 GetRequests, 416 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-10 23:20:20,501 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 126 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 478 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 550 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 478 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-10 23:20:20,502 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 171 Invalid, 550 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 478 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-10 23:20:20,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9997 states. [2024-10-10 23:20:20,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9997 to 9812. [2024-10-10 23:20:20,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9812 states, 9811 states have (on average 1.1229232494139232) internal successors, (11017), 9811 states have internal predecessors, (11017), 0 states have call successors, (0), 0 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:20:20,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9812 states to 9812 states and 11017 transitions. [2024-10-10 23:20:20,724 INFO L78 Accepts]: Start accepts. Automaton has 9812 states and 11017 transitions. Word has length 415 [2024-10-10 23:20:20,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:20:20,725 INFO L471 AbstractCegarLoop]: Abstraction has 9812 states and 11017 transitions. [2024-10-10 23:20:20,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 94.33333333333333) internal successors, (283), 3 states have internal predecessors, (283), 0 states have call successors, (0), 0 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:20:20,726 INFO L276 IsEmpty]: Start isEmpty. Operand 9812 states and 11017 transitions. [2024-10-10 23:20:20,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 417 [2024-10-10 23:20:20,743 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:20:20,743 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:20:20,765 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:20:20,944 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,SelfDestructingSolverStorable13 [2024-10-10 23:20:20,944 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:20:20,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:20:20,945 INFO L85 PathProgramCache]: Analyzing trace with hash -486403200, now seen corresponding path program 1 times [2024-10-10 23:20:20,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:20:20,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062343139] [2024-10-10 23:20:20,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:20:20,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:20:21,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:20:22,250 INFO L134 CoverageAnalysis]: Checked inductivity of 438 backedges. 393 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-10-10 23:20:22,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:20:22,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062343139] [2024-10-10 23:20:22,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062343139] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:20:22,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:20:22,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-10 23:20:22,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850831819] [2024-10-10 23:20:22,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:20:22,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-10 23:20:22,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:20:22,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-10 23:20:22,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-10 23:20:22,256 INFO L87 Difference]: Start difference. First operand 9812 states and 11017 transitions. Second operand has 7 states, 7 states have (on average 53.142857142857146) internal successors, (372), 6 states have internal predecessors, (372), 0 states have call successors, (0), 0 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:20:23,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:20:23,869 INFO L93 Difference]: Finished difference Result 22757 states and 25536 transitions. [2024-10-10 23:20:23,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-10 23:20:23,869 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 53.142857142857146) internal successors, (372), 6 states have internal predecessors, (372), 0 states have call successors, (0), 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 416 [2024-10-10 23:20:23,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:20:23,892 INFO L225 Difference]: With dead ends: 22757 [2024-10-10 23:20:23,893 INFO L226 Difference]: Without dead ends: 13314 [2024-10-10 23:20:23,905 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-10-10 23:20:23,906 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 237 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 2002 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 2034 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 2002 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-10 23:20:23,908 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 239 Invalid, 2034 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 2002 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-10 23:20:23,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13314 states. [2024-10-10 23:20:24,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13314 to 12943. [2024-10-10 23:20:24,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12943 states, 12942 states have (on average 1.1210013908205843) internal successors, (14508), 12942 states have internal predecessors, (14508), 0 states have call successors, (0), 0 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:20:24,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12943 states to 12943 states and 14508 transitions. [2024-10-10 23:20:24,071 INFO L78 Accepts]: Start accepts. Automaton has 12943 states and 14508 transitions. Word has length 416 [2024-10-10 23:20:24,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:20:24,072 INFO L471 AbstractCegarLoop]: Abstraction has 12943 states and 14508 transitions. [2024-10-10 23:20:24,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 53.142857142857146) internal successors, (372), 6 states have internal predecessors, (372), 0 states have call successors, (0), 0 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:20:24,072 INFO L276 IsEmpty]: Start isEmpty. Operand 12943 states and 14508 transitions. [2024-10-10 23:20:24,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 418 [2024-10-10 23:20:24,090 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:20:24,090 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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, 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:20:24,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-10 23:20:24,090 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:20:24,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:20:24,091 INFO L85 PathProgramCache]: Analyzing trace with hash -369850321, now seen corresponding path program 1 times [2024-10-10 23:20:24,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:20:24,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756798367] [2024-10-10 23:20:24,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:20:24,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:20:24,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:20:24,505 INFO L134 CoverageAnalysis]: Checked inductivity of 647 backedges. 427 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-10 23:20:24,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:20:24,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756798367] [2024-10-10 23:20:24,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756798367] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:20:24,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:20:24,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:20:24,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334730356] [2024-10-10 23:20:24,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:20:24,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:20:24,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:20:24,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:20:24,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:20:24,509 INFO L87 Difference]: Start difference. First operand 12943 states and 14508 transitions. Second operand has 3 states, 3 states have (on average 89.33333333333333) internal successors, (268), 3 states have internal predecessors, (268), 0 states have call successors, (0), 0 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:20:25,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:20:25,385 INFO L93 Difference]: Finished difference Result 28093 states and 31493 transitions. [2024-10-10 23:20:25,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:20:25,386 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 89.33333333333333) internal successors, (268), 3 states have internal predecessors, (268), 0 states have call successors, (0), 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 417 [2024-10-10 23:20:25,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:20:25,413 INFO L225 Difference]: With dead ends: 28093 [2024-10-10 23:20:25,413 INFO L226 Difference]: Without dead ends: 13490 [2024-10-10 23:20:25,427 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:20:25,428 INFO L432 NwaCegarLoop]: 303 mSDtfsCounter, 122 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 574 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 667 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 574 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-10 23:20:25,428 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 320 Invalid, 667 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 574 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-10 23:20:25,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13490 states. [2024-10-10 23:20:25,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13490 to 13490. [2024-10-10 23:20:25,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13490 states, 13489 states have (on average 1.1066795166431906) internal successors, (14928), 13489 states have internal predecessors, (14928), 0 states have call successors, (0), 0 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:20:25,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13490 states to 13490 states and 14928 transitions. [2024-10-10 23:20:25,592 INFO L78 Accepts]: Start accepts. Automaton has 13490 states and 14928 transitions. Word has length 417 [2024-10-10 23:20:25,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:20:25,593 INFO L471 AbstractCegarLoop]: Abstraction has 13490 states and 14928 transitions. [2024-10-10 23:20:25,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 89.33333333333333) internal successors, (268), 3 states have internal predecessors, (268), 0 states have call successors, (0), 0 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:20:25,593 INFO L276 IsEmpty]: Start isEmpty. Operand 13490 states and 14928 transitions. [2024-10-10 23:20:25,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 426 [2024-10-10 23:20:25,606 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:20:25,606 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:20:25,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-10 23:20:25,606 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:20:25,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:20:25,607 INFO L85 PathProgramCache]: Analyzing trace with hash -1988468213, now seen corresponding path program 1 times [2024-10-10 23:20:25,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:20:25,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453520720] [2024-10-10 23:20:25,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:20:25,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:20:25,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:20:25,895 INFO L134 CoverageAnalysis]: Checked inductivity of 483 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 349 trivial. 0 not checked. [2024-10-10 23:20:25,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:20:25,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453520720] [2024-10-10 23:20:25,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453520720] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:20:25,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:20:25,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:20:25,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687687139] [2024-10-10 23:20:25,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:20:25,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:20:25,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:20:25,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:20:25,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:20:25,899 INFO L87 Difference]: Start difference. First operand 13490 states and 14928 transitions. Second operand has 3 states, 3 states have (on average 63.0) internal successors, (189), 3 states have internal predecessors, (189), 0 states have call successors, (0), 0 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:20:26,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:20:26,572 INFO L93 Difference]: Finished difference Result 27898 states and 30920 transitions. [2024-10-10 23:20:26,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:20:26,573 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 63.0) internal successors, (189), 3 states have internal predecessors, (189), 0 states have call successors, (0), 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 425 [2024-10-10 23:20:26,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:20:26,597 INFO L225 Difference]: With dead ends: 27898 [2024-10-10 23:20:26,597 INFO L226 Difference]: Without dead ends: 14777 [2024-10-10 23:20:26,611 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:20:26,611 INFO L432 NwaCegarLoop]: 318 mSDtfsCounter, 199 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 559 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 594 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 559 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-10 23:20:26,612 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 338 Invalid, 594 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 559 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-10 23:20:26,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14777 states. [2024-10-10 23:20:26,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14777 to 14593. [2024-10-10 23:20:26,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14593 states, 14592 states have (on average 1.1035498903508771) internal successors, (16103), 14592 states have internal predecessors, (16103), 0 states have call successors, (0), 0 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:20:26,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14593 states to 14593 states and 16103 transitions. [2024-10-10 23:20:26,851 INFO L78 Accepts]: Start accepts. Automaton has 14593 states and 16103 transitions. Word has length 425 [2024-10-10 23:20:26,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:20:26,852 INFO L471 AbstractCegarLoop]: Abstraction has 14593 states and 16103 transitions. [2024-10-10 23:20:26,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.0) internal successors, (189), 3 states have internal predecessors, (189), 0 states have call successors, (0), 0 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:20:26,853 INFO L276 IsEmpty]: Start isEmpty. Operand 14593 states and 16103 transitions. [2024-10-10 23:20:26,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 427 [2024-10-10 23:20:26,870 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:20:26,871 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:26,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-10 23:20:26,871 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:20:26,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:20:26,872 INFO L85 PathProgramCache]: Analyzing trace with hash -432168615, now seen corresponding path program 1 times [2024-10-10 23:20:26,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:20:26,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149386049] [2024-10-10 23:20:26,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:20:26,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:20:26,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:20:28,111 INFO L134 CoverageAnalysis]: Checked inductivity of 448 backedges. 395 proven. 8 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-10-10 23:20:28,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:20:28,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149386049] [2024-10-10 23:20:28,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149386049] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:20:28,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [514008126] [2024-10-10 23:20:28,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:20:28,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:20:28,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:20:28,116 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 23:20:28,118 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-10 23:20:28,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:20:28,289 INFO L255 TraceCheckSpWp]: Trace formula consists of 561 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-10 23:20:28,296 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:20:29,519 INFO L134 CoverageAnalysis]: Checked inductivity of 448 backedges. 282 proven. 121 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-10-10 23:20:29,520 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 23:20:32,697 INFO L134 CoverageAnalysis]: Checked inductivity of 448 backedges. 282 proven. 121 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-10-10 23:20:32,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [514008126] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-10 23:20:32,698 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-10 23:20:32,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 3, 3] total 10 [2024-10-10 23:20:32,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132556402] [2024-10-10 23:20:32,698 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-10 23:20:32,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-10 23:20:32,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:20:32,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-10 23:20:32,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-10-10 23:20:32,701 INFO L87 Difference]: Start difference. First operand 14593 states and 16103 transitions. Second operand has 11 states, 11 states have (on average 86.18181818181819) internal successors, (948), 10 states have internal predecessors, (948), 0 states have call successors, (0), 0 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:20:36,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:20:36,736 INFO L93 Difference]: Finished difference Result 34715 states and 38110 transitions. [2024-10-10 23:20:36,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-10 23:20:36,737 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 86.18181818181819) internal successors, (948), 10 states have internal predecessors, (948), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 426 [2024-10-10 23:20:36,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:20:36,768 INFO L225 Difference]: With dead ends: 34715 [2024-10-10 23:20:36,768 INFO L226 Difference]: Without dead ends: 19937 [2024-10-10 23:20:36,783 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 873 GetRequests, 848 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=227, Invalid=475, Unknown=0, NotChecked=0, Total=702 [2024-10-10 23:20:36,784 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 1436 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 4383 mSolverCounterSat, 577 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1436 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 4960 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 577 IncrementalHoareTripleChecker+Valid, 4383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2024-10-10 23:20:36,784 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1436 Valid, 184 Invalid, 4960 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [577 Valid, 4383 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2024-10-10 23:20:36,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19937 states. [2024-10-10 23:20:36,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19937 to 12561. [2024-10-10 23:20:36,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12561 states, 12560 states have (on average 1.0829617834394905) internal successors, (13602), 12560 states have internal predecessors, (13602), 0 states have call successors, (0), 0 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:20:36,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12561 states to 12561 states and 13602 transitions. [2024-10-10 23:20:36,980 INFO L78 Accepts]: Start accepts. Automaton has 12561 states and 13602 transitions. Word has length 426 [2024-10-10 23:20:36,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:20:36,980 INFO L471 AbstractCegarLoop]: Abstraction has 12561 states and 13602 transitions. [2024-10-10 23:20:36,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 86.18181818181819) internal successors, (948), 10 states have internal predecessors, (948), 0 states have call successors, (0), 0 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:20:36,981 INFO L276 IsEmpty]: Start isEmpty. Operand 12561 states and 13602 transitions. [2024-10-10 23:20:36,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 438 [2024-10-10 23:20:36,994 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:20:36,995 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:37,014 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-10 23:20:37,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-10-10 23:20:37,196 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:20:37,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:20:37,196 INFO L85 PathProgramCache]: Analyzing trace with hash 513469895, now seen corresponding path program 1 times [2024-10-10 23:20:37,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:20:37,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018862722] [2024-10-10 23:20:37,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:20:37,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:20:37,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:20:37,435 INFO L134 CoverageAnalysis]: Checked inductivity of 471 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 337 trivial. 0 not checked. [2024-10-10 23:20:37,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:20:37,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018862722] [2024-10-10 23:20:37,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018862722] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:20:37,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:20:37,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:20:37,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290950026] [2024-10-10 23:20:37,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:20:37,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:20:37,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:20:37,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:20:37,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:20:37,438 INFO L87 Difference]: Start difference. First operand 12561 states and 13602 transitions. Second operand has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 3 states have internal predecessors, (208), 0 states have call successors, (0), 0 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:20:38,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:20:38,035 INFO L93 Difference]: Finished difference Result 26224 states and 28443 transitions. [2024-10-10 23:20:38,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:20:38,035 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 3 states have internal predecessors, (208), 0 states have call successors, (0), 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 437 [2024-10-10 23:20:38,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:20:38,051 INFO L225 Difference]: With dead ends: 26224 [2024-10-10 23:20:38,051 INFO L226 Difference]: Without dead ends: 14032 [2024-10-10 23:20:38,062 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:20:38,062 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 172 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 463 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 463 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-10 23:20:38,063 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 110 Invalid, 520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 463 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-10 23:20:38,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14032 states. [2024-10-10 23:20:38,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14032 to 12376. [2024-10-10 23:20:38,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12376 states, 12375 states have (on average 1.0837171717171716) internal successors, (13411), 12375 states have internal predecessors, (13411), 0 states have call successors, (0), 0 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:20:38,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12376 states to 12376 states and 13411 transitions. [2024-10-10 23:20:38,215 INFO L78 Accepts]: Start accepts. Automaton has 12376 states and 13411 transitions. Word has length 437 [2024-10-10 23:20:38,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:20:38,216 INFO L471 AbstractCegarLoop]: Abstraction has 12376 states and 13411 transitions. [2024-10-10 23:20:38,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 3 states have internal predecessors, (208), 0 states have call successors, (0), 0 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:20:38,216 INFO L276 IsEmpty]: Start isEmpty. Operand 12376 states and 13411 transitions. [2024-10-10 23:20:38,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 449 [2024-10-10 23:20:38,225 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:20:38,225 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 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:20:38,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-10 23:20:38,226 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:20:38,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:20:38,226 INFO L85 PathProgramCache]: Analyzing trace with hash -1887433853, now seen corresponding path program 1 times [2024-10-10 23:20:38,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:20:38,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518105413] [2024-10-10 23:20:38,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:20:38,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:20:38,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:20:38,650 INFO L134 CoverageAnalysis]: Checked inductivity of 469 backedges. 469 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:20:38,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:20:38,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518105413] [2024-10-10 23:20:38,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518105413] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:20:38,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:20:38,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-10 23:20:38,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925779949] [2024-10-10 23:20:38,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:20:38,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:20:38,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:20:38,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:20:38,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:20:38,654 INFO L87 Difference]: Start difference. First operand 12376 states and 13411 transitions. Second operand has 4 states, 4 states have (on average 112.0) internal successors, (448), 4 states have internal predecessors, (448), 0 states have call successors, (0), 0 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:20:39,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:20:39,548 INFO L93 Difference]: Finished difference Result 26599 states and 28817 transitions. [2024-10-10 23:20:39,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:20:39,549 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 112.0) internal successors, (448), 4 states have internal predecessors, (448), 0 states have call successors, (0), 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 448 [2024-10-10 23:20:39,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:20:39,565 INFO L225 Difference]: With dead ends: 26599 [2024-10-10 23:20:39,565 INFO L226 Difference]: Without dead ends: 14592 [2024-10-10 23:20:39,576 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:20:39,576 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 174 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 984 mSolverCounterSat, 167 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 1151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 167 IncrementalHoareTripleChecker+Valid, 984 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-10 23:20:39,576 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 55 Invalid, 1151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [167 Valid, 984 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-10 23:20:39,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14592 states. [2024-10-10 23:20:39,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14592 to 13298. [2024-10-10 23:20:39,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13298 states, 13297 states have (on average 1.0792659998495902) internal successors, (14351), 13297 states have internal predecessors, (14351), 0 states have call successors, (0), 0 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:20:39,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13298 states to 13298 states and 14351 transitions. [2024-10-10 23:20:39,757 INFO L78 Accepts]: Start accepts. Automaton has 13298 states and 14351 transitions. Word has length 448 [2024-10-10 23:20:39,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:20:39,758 INFO L471 AbstractCegarLoop]: Abstraction has 13298 states and 14351 transitions. [2024-10-10 23:20:39,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 112.0) internal successors, (448), 4 states have internal predecessors, (448), 0 states have call successors, (0), 0 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:20:39,758 INFO L276 IsEmpty]: Start isEmpty. Operand 13298 states and 14351 transitions. [2024-10-10 23:20:39,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 464 [2024-10-10 23:20:39,767 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:20:39,768 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:39,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-10 23:20:39,768 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:20:39,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:20:39,769 INFO L85 PathProgramCache]: Analyzing trace with hash -362907692, now seen corresponding path program 1 times [2024-10-10 23:20:39,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:20:39,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391735648] [2024-10-10 23:20:39,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:20:39,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:20:39,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:20:40,133 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 327 proven. 0 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2024-10-10 23:20:40,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:20:40,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391735648] [2024-10-10 23:20:40,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391735648] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:20:40,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:20:40,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:20:40,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954500264] [2024-10-10 23:20:40,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:20:40,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:20:40,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:20:40,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:20:40,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:20:40,135 INFO L87 Difference]: Start difference. First operand 13298 states and 14351 transitions. Second operand has 3 states, 3 states have (on average 108.66666666666667) internal successors, (326), 3 states have internal predecessors, (326), 0 states have call successors, (0), 0 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:20:40,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:20:40,679 INFO L93 Difference]: Finished difference Result 27699 states and 29887 transitions. [2024-10-10 23:20:40,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:20:40,679 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 108.66666666666667) internal successors, (326), 3 states have internal predecessors, (326), 0 states have call successors, (0), 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 463 [2024-10-10 23:20:40,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:20:40,692 INFO L225 Difference]: With dead ends: 27699 [2024-10-10 23:20:40,692 INFO L226 Difference]: Without dead ends: 12929 [2024-10-10 23:20:40,700 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:20:40,701 INFO L432 NwaCegarLoop]: 274 mSDtfsCounter, 109 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 520 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 588 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 520 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-10 23:20:40,701 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 287 Invalid, 588 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 520 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-10 23:20:40,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12929 states. [2024-10-10 23:20:40,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12929 to 12008. [2024-10-10 23:20:40,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12008 states, 12007 states have (on average 1.0646289664362456) internal successors, (12783), 12007 states have internal predecessors, (12783), 0 states have call successors, (0), 0 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:20:40,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12008 states to 12008 states and 12783 transitions. [2024-10-10 23:20:40,826 INFO L78 Accepts]: Start accepts. Automaton has 12008 states and 12783 transitions. Word has length 463 [2024-10-10 23:20:40,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:20:40,826 INFO L471 AbstractCegarLoop]: Abstraction has 12008 states and 12783 transitions. [2024-10-10 23:20:40,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.66666666666667) internal successors, (326), 3 states have internal predecessors, (326), 0 states have call successors, (0), 0 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:20:40,827 INFO L276 IsEmpty]: Start isEmpty. Operand 12008 states and 12783 transitions. [2024-10-10 23:20:40,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 502 [2024-10-10 23:20:40,836 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:20:40,837 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2024-10-10 23:20:40,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-10 23:20:40,837 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:20:40,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:20:40,838 INFO L85 PathProgramCache]: Analyzing trace with hash 248434729, now seen corresponding path program 1 times [2024-10-10 23:20:40,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:20:40,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947192413] [2024-10-10 23:20:40,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:20:40,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:20:40,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:20:41,848 INFO L134 CoverageAnalysis]: Checked inductivity of 803 backedges. 535 proven. 162 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2024-10-10 23:20:41,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:20:41,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947192413] [2024-10-10 23:20:41,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947192413] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:20:41,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1260977421] [2024-10-10 23:20:41,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:20:41,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:20:41,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:20:41,850 INFO L229 MonitoredProcess]: Starting monitored process 4 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:20:41,851 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-10 23:20:42,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:20:42,032 INFO L255 TraceCheckSpWp]: Trace formula consists of 668 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-10 23:20:42,041 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:20:42,170 INFO L134 CoverageAnalysis]: Checked inductivity of 803 backedges. 652 proven. 0 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2024-10-10 23:20:42,170 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 23:20:42,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1260977421] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:20:42,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 23:20:42,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2024-10-10 23:20:42,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940807880] [2024-10-10 23:20:42,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:20:42,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:20:42,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:20:42,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:20:42,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-10 23:20:42,173 INFO L87 Difference]: Start difference. First operand 12008 states and 12783 transitions. Second operand has 3 states, 3 states have (on average 117.33333333333333) internal successors, (352), 3 states have internal predecessors, (352), 0 states have call successors, (0), 0 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:20:42,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:20:42,677 INFO L93 Difference]: Finished difference Result 23835 states and 25385 transitions. [2024-10-10 23:20:42,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:20:42,678 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 117.33333333333333) internal successors, (352), 3 states have internal predecessors, (352), 0 states have call successors, (0), 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 501 [2024-10-10 23:20:42,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:20:42,691 INFO L225 Difference]: With dead ends: 23835 [2024-10-10 23:20:42,691 INFO L226 Difference]: Without dead ends: 12012 [2024-10-10 23:20:42,698 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 507 GetRequests, 501 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-10 23:20:42,699 INFO L432 NwaCegarLoop]: 304 mSDtfsCounter, 72 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 505 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 559 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 505 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-10 23:20:42,699 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 320 Invalid, 559 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 505 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-10 23:20:42,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12012 states. [2024-10-10 23:20:42,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12012 to 12008. [2024-10-10 23:20:42,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12008 states, 12007 states have (on average 1.0543016573665362) internal successors, (12659), 12007 states have internal predecessors, (12659), 0 states have call successors, (0), 0 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:20:42,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12008 states to 12008 states and 12659 transitions. [2024-10-10 23:20:42,808 INFO L78 Accepts]: Start accepts. Automaton has 12008 states and 12659 transitions. Word has length 501 [2024-10-10 23:20:42,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:20:42,808 INFO L471 AbstractCegarLoop]: Abstraction has 12008 states and 12659 transitions. [2024-10-10 23:20:42,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 117.33333333333333) internal successors, (352), 3 states have internal predecessors, (352), 0 states have call successors, (0), 0 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:20:42,809 INFO L276 IsEmpty]: Start isEmpty. Operand 12008 states and 12659 transitions. [2024-10-10 23:20:42,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 506 [2024-10-10 23:20:42,815 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:20:42,816 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2024-10-10 23:20:42,828 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-10 23:20:43,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:20:43,016 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:20:43,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:20:43,017 INFO L85 PathProgramCache]: Analyzing trace with hash 1386045834, now seen corresponding path program 1 times [2024-10-10 23:20:43,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:20:43,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295248378] [2024-10-10 23:20:43,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:20:43,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:20:43,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:20:43,441 INFO L134 CoverageAnalysis]: Checked inductivity of 796 backedges. 609 proven. 0 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2024-10-10 23:20:43,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:20:43,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295248378] [2024-10-10 23:20:43,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295248378] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:20:43,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:20:43,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:20:43,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28199781] [2024-10-10 23:20:43,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:20:43,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:20:43,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:20:43,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:20:43,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:20:43,444 INFO L87 Difference]: Start difference. First operand 12008 states and 12659 transitions. Second operand has 4 states, 4 states have (on average 91.25) internal successors, (365), 3 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:20:44,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:20:44,319 INFO L93 Difference]: Finished difference Result 30655 states and 32328 transitions. [2024-10-10 23:20:44,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:20:44,319 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 91.25) internal successors, (365), 3 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 505 [2024-10-10 23:20:44,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:20:44,337 INFO L225 Difference]: With dead ends: 30655 [2024-10-10 23:20:44,337 INFO L226 Difference]: Without dead ends: 18832 [2024-10-10 23:20:44,346 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:20:44,346 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 181 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 1007 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 1062 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 1007 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-10 23:20:44,347 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 80 Invalid, 1062 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 1007 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-10 23:20:44,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18832 states. [2024-10-10 23:20:44,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18832 to 16432. [2024-10-10 23:20:44,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16432 states, 16431 states have (on average 1.0527052522670561) internal successors, (17297), 16431 states have internal predecessors, (17297), 0 states have call successors, (0), 0 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:20:44,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16432 states to 16432 states and 17297 transitions. [2024-10-10 23:20:44,495 INFO L78 Accepts]: Start accepts. Automaton has 16432 states and 17297 transitions. Word has length 505 [2024-10-10 23:20:44,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:20:44,495 INFO L471 AbstractCegarLoop]: Abstraction has 16432 states and 17297 transitions. [2024-10-10 23:20:44,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 91.25) internal successors, (365), 3 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:20:44,496 INFO L276 IsEmpty]: Start isEmpty. Operand 16432 states and 17297 transitions. [2024-10-10 23:20:44,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 530 [2024-10-10 23:20:44,504 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:20:44,505 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:20:44,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-10 23:20:44,505 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:20:44,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:20:44,505 INFO L85 PathProgramCache]: Analyzing trace with hash -330696408, now seen corresponding path program 1 times [2024-10-10 23:20:44,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:20:44,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168400695] [2024-10-10 23:20:44,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:20:44,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:20:44,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:20:45,047 INFO L134 CoverageAnalysis]: Checked inductivity of 788 backedges. 601 proven. 0 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2024-10-10 23:20:45,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:20:45,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168400695] [2024-10-10 23:20:45,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168400695] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:20:45,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:20:45,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:20:45,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297656348] [2024-10-10 23:20:45,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:20:45,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:20:45,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:20:45,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:20:45,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:20:45,050 INFO L87 Difference]: Start difference. First operand 16432 states and 17297 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:20:45,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:20:45,915 INFO L93 Difference]: Finished difference Result 31765 states and 33486 transitions. [2024-10-10 23:20:45,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:20:45,916 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 529 [2024-10-10 23:20:45,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:20:45,933 INFO L225 Difference]: With dead ends: 31765 [2024-10-10 23:20:45,934 INFO L226 Difference]: Without dead ends: 17176 [2024-10-10 23:20:45,942 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:20:45,943 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 219 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 916 mSolverCounterSat, 167 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 1083 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 167 IncrementalHoareTripleChecker+Valid, 916 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-10 23:20:45,943 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 86 Invalid, 1083 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [167 Valid, 916 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-10 23:20:45,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17176 states. [2024-10-10 23:20:46,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17176 to 16802. [2024-10-10 23:20:46,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16802 states, 16801 states have (on average 1.0520802333194452) internal successors, (17676), 16801 states have internal predecessors, (17676), 0 states have call successors, (0), 0 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:20:46,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16802 states to 16802 states and 17676 transitions. [2024-10-10 23:20:46,088 INFO L78 Accepts]: Start accepts. Automaton has 16802 states and 17676 transitions. Word has length 529 [2024-10-10 23:20:46,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:20:46,088 INFO L471 AbstractCegarLoop]: Abstraction has 16802 states and 17676 transitions. [2024-10-10 23:20:46,088 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:20:46,088 INFO L276 IsEmpty]: Start isEmpty. Operand 16802 states and 17676 transitions. [2024-10-10 23:20:46,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 583 [2024-10-10 23:20:46,100 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:20:46,100 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, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:20:46,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-10 23:20:46,101 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:20:46,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:20:46,101 INFO L85 PathProgramCache]: Analyzing trace with hash -1363550818, now seen corresponding path program 1 times [2024-10-10 23:20:46,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:20:46,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601237559] [2024-10-10 23:20:46,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:20:46,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:20:46,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:20:46,341 INFO L134 CoverageAnalysis]: Checked inductivity of 1165 backedges. 694 proven. 0 refuted. 0 times theorem prover too weak. 471 trivial. 0 not checked. [2024-10-10 23:20:46,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:20:46,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601237559] [2024-10-10 23:20:46,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601237559] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:20:46,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:20:46,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:20:46,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788986120] [2024-10-10 23:20:46,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:20:46,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:20:46,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:20:46,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:20:46,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:20:46,343 INFO L87 Difference]: Start difference. First operand 16802 states and 17676 transitions. Second operand has 3 states, 3 states have (on average 80.33333333333333) internal successors, (241), 3 states have internal predecessors, (241), 0 states have call successors, (0), 0 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:20:46,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:20:46,811 INFO L93 Difference]: Finished difference Result 31576 states and 33241 transitions. [2024-10-10 23:20:46,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:20:46,812 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 80.33333333333333) internal successors, (241), 3 states have internal predecessors, (241), 0 states have call successors, (0), 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 582 [2024-10-10 23:20:46,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:20:46,826 INFO L225 Difference]: With dead ends: 31576 [2024-10-10 23:20:46,826 INFO L226 Difference]: Without dead ends: 16617 [2024-10-10 23:20:46,835 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:20:46,836 INFO L432 NwaCegarLoop]: 291 mSDtfsCounter, 191 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 467 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 467 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-10 23:20:46,836 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 310 Invalid, 474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 467 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-10 23:20:46,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16617 states. [2024-10-10 23:20:46,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16617 to 16617. [2024-10-10 23:20:46,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16617 states, 16616 states have (on average 1.0513962445835339) internal successors, (17470), 16616 states have internal predecessors, (17470), 0 states have call successors, (0), 0 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:20:46,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16617 states to 16617 states and 17470 transitions. [2024-10-10 23:20:46,972 INFO L78 Accepts]: Start accepts. Automaton has 16617 states and 17470 transitions. Word has length 582 [2024-10-10 23:20:46,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:20:46,973 INFO L471 AbstractCegarLoop]: Abstraction has 16617 states and 17470 transitions. [2024-10-10 23:20:46,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.33333333333333) internal successors, (241), 3 states have internal predecessors, (241), 0 states have call successors, (0), 0 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:20:46,973 INFO L276 IsEmpty]: Start isEmpty. Operand 16617 states and 17470 transitions. [2024-10-10 23:20:46,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 613 [2024-10-10 23:20:46,981 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:20:46,981 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, 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:20:46,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-10 23:20:46,981 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:20:46,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:20:46,982 INFO L85 PathProgramCache]: Analyzing trace with hash -2062760628, now seen corresponding path program 1 times [2024-10-10 23:20:46,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:20:46,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648074329] [2024-10-10 23:20:46,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:20:46,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:20:47,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:20:47,411 INFO L134 CoverageAnalysis]: Checked inductivity of 1215 backedges. 886 proven. 0 refuted. 0 times theorem prover too weak. 329 trivial. 0 not checked. [2024-10-10 23:20:47,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:20:47,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648074329] [2024-10-10 23:20:47,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648074329] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:20:47,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:20:47,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:20:47,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821613124] [2024-10-10 23:20:47,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:20:47,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:20:47,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:20:47,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:20:47,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:20:47,414 INFO L87 Difference]: Start difference. First operand 16617 states and 17470 transitions. Second operand has 3 states, 3 states have (on average 122.33333333333333) internal successors, (367), 3 states have internal predecessors, (367), 0 states have call successors, (0), 0 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:20:47,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:20:47,901 INFO L93 Difference]: Finished difference Result 34353 states and 36149 transitions. [2024-10-10 23:20:47,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:20:47,901 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 122.33333333333333) internal successors, (367), 3 states have internal predecessors, (367), 0 states have call successors, (0), 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 612 [2024-10-10 23:20:47,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:20:47,924 INFO L225 Difference]: With dead ends: 34353 [2024-10-10 23:20:47,924 INFO L226 Difference]: Without dead ends: 19579 [2024-10-10 23:20:47,936 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:20:47,936 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 60 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 485 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 509 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 485 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-10 23:20:47,937 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 115 Invalid, 509 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 485 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-10 23:20:47,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19579 states. [2024-10-10 23:20:48,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19579 to 17169. [2024-10-10 23:20:48,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17169 states, 17168 states have (on average 1.0509669151910532) internal successors, (18043), 17168 states have internal predecessors, (18043), 0 states have call successors, (0), 0 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:20:48,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17169 states to 17169 states and 18043 transitions. [2024-10-10 23:20:48,104 INFO L78 Accepts]: Start accepts. Automaton has 17169 states and 18043 transitions. Word has length 612 [2024-10-10 23:20:48,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:20:48,104 INFO L471 AbstractCegarLoop]: Abstraction has 17169 states and 18043 transitions. [2024-10-10 23:20:48,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 122.33333333333333) internal successors, (367), 3 states have internal predecessors, (367), 0 states have call successors, (0), 0 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:20:48,105 INFO L276 IsEmpty]: Start isEmpty. Operand 17169 states and 18043 transitions. [2024-10-10 23:20:48,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 614 [2024-10-10 23:20:48,114 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:20:48,115 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, 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, 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, 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:20:48,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-10 23:20:48,115 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:20:48,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:20:48,115 INFO L85 PathProgramCache]: Analyzing trace with hash 1428540275, now seen corresponding path program 1 times [2024-10-10 23:20:48,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:20:48,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886960665] [2024-10-10 23:20:48,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:20:48,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:20:48,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:20:48,592 INFO L134 CoverageAnalysis]: Checked inductivity of 1214 backedges. 946 proven. 0 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2024-10-10 23:20:48,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:20:48,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886960665] [2024-10-10 23:20:48,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886960665] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:20:48,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:20:48,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:20:48,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119167632] [2024-10-10 23:20:48,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:20:48,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:20:48,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:20:48,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:20:48,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:20:48,595 INFO L87 Difference]: Start difference. First operand 17169 states and 18043 transitions. Second operand has 4 states, 4 states have (on average 98.25) internal successors, (393), 3 states have internal predecessors, (393), 0 states have call successors, (0), 0 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:20:49,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:20:49,346 INFO L93 Difference]: Finished difference Result 34529 states and 36319 transitions. [2024-10-10 23:20:49,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:20:49,347 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 98.25) internal successors, (393), 3 states have internal predecessors, (393), 0 states have call successors, (0), 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 613 [2024-10-10 23:20:49,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:20:49,366 INFO L225 Difference]: With dead ends: 34529 [2024-10-10 23:20:49,366 INFO L226 Difference]: Without dead ends: 19019 [2024-10-10 23:20:49,377 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:20:49,377 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 203 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 952 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 1000 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 952 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-10 23:20:49,378 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 62 Invalid, 1000 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 952 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-10 23:20:49,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19019 states. [2024-10-10 23:20:49,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19019 to 16249. [2024-10-10 23:20:49,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16249 states, 16248 states have (on average 1.0507754800590843) internal successors, (17073), 16248 states have internal predecessors, (17073), 0 states have call successors, (0), 0 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:20:49,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16249 states to 16249 states and 17073 transitions. [2024-10-10 23:20:49,587 INFO L78 Accepts]: Start accepts. Automaton has 16249 states and 17073 transitions. Word has length 613 [2024-10-10 23:20:49,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:20:49,587 INFO L471 AbstractCegarLoop]: Abstraction has 16249 states and 17073 transitions. [2024-10-10 23:20:49,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 98.25) internal successors, (393), 3 states have internal predecessors, (393), 0 states have call successors, (0), 0 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:20:49,587 INFO L276 IsEmpty]: Start isEmpty. Operand 16249 states and 17073 transitions. [2024-10-10 23:20:49,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 620 [2024-10-10 23:20:49,595 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:20:49,595 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, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:20:49,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-10-10 23:20:49,596 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:20:49,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:20:49,596 INFO L85 PathProgramCache]: Analyzing trace with hash -1358139218, now seen corresponding path program 1 times [2024-10-10 23:20:49,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:20:49,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325242263] [2024-10-10 23:20:49,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:20:49,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:20:49,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:20:50,159 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 1140 proven. 0 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2024-10-10 23:20:50,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:20:50,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325242263] [2024-10-10 23:20:50,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325242263] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:20:50,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:20:50,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-10 23:20:50,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899786929] [2024-10-10 23:20:50,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:20:50,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:20:50,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:20:50,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:20:50,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:20:50,162 INFO L87 Difference]: Start difference. First operand 16249 states and 17073 transitions. Second operand has 4 states, 4 states have (on average 116.25) internal successors, (465), 4 states have internal predecessors, (465), 0 states have call successors, (0), 0 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:20:51,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:20:51,003 INFO L93 Difference]: Finished difference Result 33976 states and 35785 transitions. [2024-10-10 23:20:51,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:20:51,004 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 116.25) internal successors, (465), 4 states have internal predecessors, (465), 0 states have call successors, (0), 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 619 [2024-10-10 23:20:51,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:20:51,019 INFO L225 Difference]: With dead ends: 33976 [2024-10-10 23:20:51,019 INFO L226 Difference]: Without dead ends: 17914 [2024-10-10 23:20:51,029 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:20:51,029 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 185 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 958 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 1070 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 958 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-10 23:20:51,029 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 70 Invalid, 1070 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 958 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-10 23:20:51,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17914 states. [2024-10-10 23:20:51,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17914 to 17909. [2024-10-10 23:20:51,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17909 states, 17908 states have (on average 1.051876256421711) internal successors, (18837), 17908 states have internal predecessors, (18837), 0 states have call successors, (0), 0 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:20:51,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17909 states to 17909 states and 18837 transitions. [2024-10-10 23:20:51,279 INFO L78 Accepts]: Start accepts. Automaton has 17909 states and 18837 transitions. Word has length 619 [2024-10-10 23:20:51,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:20:51,279 INFO L471 AbstractCegarLoop]: Abstraction has 17909 states and 18837 transitions. [2024-10-10 23:20:51,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 116.25) internal successors, (465), 4 states have internal predecessors, (465), 0 states have call successors, (0), 0 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:20:51,280 INFO L276 IsEmpty]: Start isEmpty. Operand 17909 states and 18837 transitions. [2024-10-10 23:20:51,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 627 [2024-10-10 23:20:51,293 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:20:51,294 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:20:51,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-10-10 23:20:51,294 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:20:51,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:20:51,295 INFO L85 PathProgramCache]: Analyzing trace with hash -567983496, now seen corresponding path program 1 times [2024-10-10 23:20:51,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:20:51,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141668403] [2024-10-10 23:20:51,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:20:51,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:20:51,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:20:51,959 INFO L134 CoverageAnalysis]: Checked inductivity of 938 backedges. 179 proven. 0 refuted. 0 times theorem prover too weak. 759 trivial. 0 not checked. [2024-10-10 23:20:51,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:20:51,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141668403] [2024-10-10 23:20:51,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141668403] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:20:51,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:20:51,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:20:51,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760836081] [2024-10-10 23:20:51,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:20:51,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:20:51,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:20:51,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:20:51,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:20:51,962 INFO L87 Difference]: Start difference. First operand 17909 states and 18837 transitions. Second operand has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 3 states have internal predecessors, (217), 0 states have call successors, (0), 0 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:20:52,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:20:52,408 INFO L93 Difference]: Finished difference Result 18096 states and 19035 transitions. [2024-10-10 23:20:52,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:20:52,408 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 3 states have internal predecessors, (217), 0 states have call successors, (0), 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 626 [2024-10-10 23:20:52,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:20:52,410 INFO L225 Difference]: With dead ends: 18096 [2024-10-10 23:20:52,410 INFO L226 Difference]: Without dead ends: 0 [2024-10-10 23:20:52,415 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:20:52,416 INFO L432 NwaCegarLoop]: 298 mSDtfsCounter, 143 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 480 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 481 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 480 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-10 23:20:52,416 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 319 Invalid, 481 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 480 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-10 23:20:52,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-10 23:20:52,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-10 23:20:52,416 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:20:52,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-10 23:20:52,417 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 626 [2024-10-10 23:20:52,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:20:52,417 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-10 23:20:52,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 3 states have internal predecessors, (217), 0 states have call successors, (0), 0 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:20:52,417 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-10 23:20:52,417 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-10 23:20:52,419 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-10 23:20:52,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-10-10 23:20:52,422 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:20:52,424 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-10 23:20:58,388 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-10 23:20:58,442 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.10 11:20:58 BoogieIcfgContainer [2024-10-10 23:20:58,443 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-10 23:20:58,444 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-10 23:20:58,444 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-10 23:20:58,444 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-10 23:20:58,445 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:20:01" (3/4) ... [2024-10-10 23:20:58,454 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-10 23:20:58,483 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2024-10-10 23:20:58,487 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-10-10 23:20:58,488 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-10 23:20:58,489 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-10 23:20:58,674 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-10 23:20:58,675 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-10 23:20:58,675 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-10 23:20:58,676 INFO L158 Benchmark]: Toolchain (without parser) took 60351.08ms. Allocated memory was 144.7MB in the beginning and 1.8GB in the end (delta: 1.7GB). Free memory was 85.8MB in the beginning and 835.6MB in the end (delta: -749.8MB). Peak memory consumption was 915.4MB. Max. memory is 16.1GB. [2024-10-10 23:20:58,676 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 144.7MB. Free memory is still 104.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-10 23:20:58,677 INFO L158 Benchmark]: CACSL2BoogieTranslator took 742.59ms. Allocated memory was 144.7MB in the beginning and 207.6MB in the end (delta: 62.9MB). Free memory was 85.5MB in the beginning and 156.6MB in the end (delta: -71.1MB). Peak memory consumption was 34.1MB. Max. memory is 16.1GB. [2024-10-10 23:20:58,677 INFO L158 Benchmark]: Boogie Procedure Inliner took 150.54ms. Allocated memory is still 207.6MB. Free memory was 156.6MB in the beginning and 139.8MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-10 23:20:58,679 INFO L158 Benchmark]: Boogie Preprocessor took 204.39ms. Allocated memory is still 207.6MB. Free memory was 139.8MB in the beginning and 113.6MB in the end (delta: 26.2MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-10-10 23:20:58,679 INFO L158 Benchmark]: RCFGBuilder took 1933.85ms. Allocated memory is still 207.6MB. Free memory was 113.6MB in the beginning and 129.6MB in the end (delta: -16.0MB). Peak memory consumption was 88.9MB. Max. memory is 16.1GB. [2024-10-10 23:20:58,680 INFO L158 Benchmark]: TraceAbstraction took 57082.02ms. Allocated memory was 207.6MB in the beginning and 1.8GB in the end (delta: 1.6GB). Free memory was 128.5MB in the beginning and 853.4MB in the end (delta: -724.9MB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2024-10-10 23:20:58,680 INFO L158 Benchmark]: Witness Printer took 231.00ms. Allocated memory is still 1.8GB. Free memory was 853.4MB in the beginning and 835.6MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-10 23:20:58,681 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.27ms. Allocated memory is still 144.7MB. Free memory is still 104.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 742.59ms. Allocated memory was 144.7MB in the beginning and 207.6MB in the end (delta: 62.9MB). Free memory was 85.5MB in the beginning and 156.6MB in the end (delta: -71.1MB). Peak memory consumption was 34.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 150.54ms. Allocated memory is still 207.6MB. Free memory was 156.6MB in the beginning and 139.8MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 204.39ms. Allocated memory is still 207.6MB. Free memory was 139.8MB in the beginning and 113.6MB in the end (delta: 26.2MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * RCFGBuilder took 1933.85ms. Allocated memory is still 207.6MB. Free memory was 113.6MB in the beginning and 129.6MB in the end (delta: -16.0MB). Peak memory consumption was 88.9MB. Max. memory is 16.1GB. * TraceAbstraction took 57082.02ms. Allocated memory was 207.6MB in the beginning and 1.8GB in the end (delta: 1.6GB). Free memory was 128.5MB in the beginning and 853.4MB in the end (delta: -724.9MB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. * Witness Printer took 231.00ms. Allocated memory is still 1.8GB. Free memory was 853.4MB in the beginning and 835.6MB in the end (delta: 17.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: 157]: 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: 51.0s, OverallIterations: 29, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.3s, AutomataDifference: 26.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5913 SdHoareTripleChecker+Valid, 23.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5913 mSDsluCounter, 5901 SdHoareTripleChecker+Invalid, 19.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 881 mSDsCounter, 2915 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 24249 IncrementalHoareTripleChecker+Invalid, 27164 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2915 mSolverCounterUnsat, 5020 mSDtfsCounter, 24249 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1884 GetRequests, 1810 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=17909occurred in iteration=28, InterpolantAutomatonStates: 116, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.7s AutomataMinimizationTime, 29 MinimizatonAttempts, 22770 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 16.9s InterpolantComputationTime, 12143 NumberOfCodeBlocks, 12143 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 12536 ConstructedInterpolants, 0 QuantifiedInterpolants, 43940 SizeOfPredicates, 1 NumberOfNonLiveVariables, 1803 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 33 InterpolantComputations, 28 PerfectInterpolantSequences, 16196/16686 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 <= 10) && (a23 <= 138)) && (a4 == 1)) || (((((a25 == 12) && (a29 <= 274)) && (a4 == 1)) && (0 <= ((long long) a23 + 42))) && (130 <= a29))) || ((((((long long) a23 + 43) <= 0) && (a25 == 12)) && (a4 == 0)) && (((long long) a29 + 22) <= 0))) || ((((a25 == 11) && (a4 == 1)) && (a23 <= 312)) && (0 <= ((long long) a23 + 42)))) || ((((((a25 != 13) || (a23 < 307)) && (((a23 < 307) || (a25 != 12)) || (a29 < 278))) && (a4 == 1)) && (99915 <= a29)) && (0 <= ((long long) a23 + 42)))) || (((((((long long) a23 + 43) <= 0) && (261 <= a29)) && (a4 == 0)) && (a25 <= 10)) && (a29 <= 599998))) || ((((a25 == 13) && (307 <= a23)) && (a29 <= 599998)) && (a4 == 1))) || ((a4 == 1) && (a25 == 10))) || ((((((long long) a23 + 43) <= 0) && (a29 <= 245)) && (a4 == 1)) && (130 <= a29))) || ((((a25 == 13) && (a29 <= 245)) && (a4 == 1)) && (130 <= a29))) || ((((a4 == 0) && (((long long) a29 + 22) <= 0)) && (0 <= ((long long) a29 + 28553))) && (a25 == 10))) || ((((a25 == 12) && (a4 == 0)) && (a29 <= 274)) && (130 <= a29))) || (((((a25 == 13) && (((long long) a23 + 43) <= 0)) && (a4 == 0)) && (a29 <= 274)) && (130 <= a29))) || (((((261 <= a29) && (a4 == 0)) && (a25 == 11)) && (a29 <= 599998)) && (((long long) 119992 + a23) <= 0))) || (((a25 == 11) && (a4 == 1)) && (130 <= a29))) || (((a25 == 12) && (a4 == 0)) && (((long long) a29 + 554036) <= 0))) || (((a25 <= 10) && (a4 == 1)) && (130 <= a29))) || (((((a25 == 13) && (a23 <= 278)) && (99912 <= a29)) && (a4 == 1)) && (0 <= ((long long) a23 + 42)))) || ((((a25 == 12) && (a23 <= 138)) && (a4 == 1)) && (a29 <= 232))) || (((((a25 == 12) && (261 <= a29)) && (307 <= a23)) && (a29 <= 277)) && (a4 == 1))) || ((((a25 == 13) && (a4 == 1)) && (a29 <= 232)) && (0 <= ((long long) a23 + 42)))) || ((((a4 == 0) && (a25 == 11)) && (a29 <= 220)) && (((long long) 119992 + a23) <= 0))) || ((((((long long) a23 + 43) <= 0) && (a4 == 0)) && (a25 == 11)) && (((long long) a29 + 22) <= 0))) || (((((a23 < 307) || (a25 != 12)) || (a29 < 278)) && ((((a4 == 0) && (a25 <= 10)) && (99915 <= a29)) || (((a25 == 12) && (261 <= a29)) && (a4 == 0)))) && (a29 <= 599998))) || (((((a4 == 0) && (((long long) a29 + 22) <= 0)) && (a25 <= 10)) && (((long long) a23 + 599772) <= 0)) && (a25 != 9))) || ((((a23 <= 278) && (a25 == 12)) && (a4 == 1)) && (0 <= ((long long) a23 + 42)))) || ((((((long long) a23 + 43) <= 0) && (a4 == 0)) && (a25 <= 10)) && (((long long) a29 + 554036) <= 0))) || ((((a23 <= 278) && (((long long) a29 + 22) <= 0)) && (a4 == 1)) && (0 <= ((long long) a23 + 42)))) || ((((a4 == 0) && (a29 <= 599998)) && (a23 <= 138)) && (0 <= ((long long) a23 + 42)))) || ((((((a25 == 12) && (((long long) a29 + 22) <= 0)) && (a3 == 1)) && (a4 == 1)) && (312 <= a23)) && (a8 == 15))) RESULT: Ultimate proved your program to be correct! [2024-10-10 23:20:58,714 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE