./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_label50.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_label50.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 56e7a4db9e890bad4c6ba22e9e20439c94d0afdecfe3e8cad4ffb71abf5e0a33 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-10 23:19:42,182 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-10 23:19:42,251 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:42,257 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-10 23:19:42,258 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-10 23:19:42,287 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-10 23:19:42,288 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-10 23:19:42,288 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-10 23:19:42,289 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-10 23:19:42,291 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-10 23:19:42,291 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-10 23:19:42,292 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-10 23:19:42,292 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-10 23:19:42,294 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-10 23:19:42,294 INFO L153 SettingsManager]: * Use SBE=true [2024-10-10 23:19:42,295 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-10 23:19:42,295 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-10 23:19:42,295 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-10 23:19:42,296 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-10 23:19:42,296 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-10 23:19:42,296 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-10 23:19:42,299 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-10 23:19:42,299 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-10 23:19:42,300 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-10 23:19:42,300 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-10 23:19:42,300 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-10 23:19:42,301 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-10 23:19:42,301 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-10 23:19:42,301 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-10 23:19:42,301 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-10 23:19:42,302 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-10 23:19:42,302 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-10 23:19:42,302 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 23:19:42,302 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-10 23:19:42,303 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-10 23:19:42,303 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-10 23:19:42,304 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-10 23:19:42,305 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-10 23:19:42,305 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-10 23:19:42,305 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-10 23:19:42,306 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-10 23:19:42,306 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-10 23:19:42,306 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 -> 56e7a4db9e890bad4c6ba22e9e20439c94d0afdecfe3e8cad4ffb71abf5e0a33 [2024-10-10 23:19:42,571 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-10 23:19:42,595 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-10 23:19:42,598 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-10 23:19:42,600 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-10 23:19:42,600 INFO L274 PluginConnector]: CDTParser initialized [2024-10-10 23:19:42,602 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label50.c [2024-10-10 23:19:44,070 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-10 23:19:44,381 INFO L384 CDTParser]: Found 1 translation units. [2024-10-10 23:19:44,385 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label50.c [2024-10-10 23:19:44,405 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/9f605fa7f/a250e71209494a2a979ae4f7b503d2ab/FLAG3be73db50 [2024-10-10 23:19:44,422 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/9f605fa7f/a250e71209494a2a979ae4f7b503d2ab [2024-10-10 23:19:44,426 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-10 23:19:44,427 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-10 23:19:44,428 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-10 23:19:44,431 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-10 23:19:44,436 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-10 23:19:44,438 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 11:19:44" (1/1) ... [2024-10-10 23:19:44,439 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60f3e48e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:19:44, skipping insertion in model container [2024-10-10 23:19:44,439 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 11:19:44" (1/1) ... [2024-10-10 23:19:44,489 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-10 23:19:44,720 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_label50.c[5287,5300] [2024-10-10 23:19:45,040 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 23:19:45,054 INFO L200 MainTranslator]: Completed pre-run [2024-10-10 23:19:45,089 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_label50.c[5287,5300] [2024-10-10 23:19:45,207 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 23:19:45,228 INFO L204 MainTranslator]: Completed translation [2024-10-10 23:19:45,229 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:19:45 WrapperNode [2024-10-10 23:19:45,229 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-10 23:19:45,230 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-10 23:19:45,230 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-10 23:19:45,231 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-10 23:19:45,238 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:45" (1/1) ... [2024-10-10 23:19:45,262 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:45" (1/1) ... [2024-10-10 23:19:45,363 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1000 [2024-10-10 23:19:45,363 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-10 23:19:45,364 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-10 23:19:45,364 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-10 23:19:45,364 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-10 23:19:45,376 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:45" (1/1) ... [2024-10-10 23:19:45,376 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:45" (1/1) ... [2024-10-10 23:19:45,394 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:45" (1/1) ... [2024-10-10 23:19:45,462 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:45,463 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:45" (1/1) ... [2024-10-10 23:19:45,463 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:45" (1/1) ... [2024-10-10 23:19:45,505 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:45" (1/1) ... [2024-10-10 23:19:45,516 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:45" (1/1) ... [2024-10-10 23:19:45,532 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:45" (1/1) ... [2024-10-10 23:19:45,540 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:45" (1/1) ... [2024-10-10 23:19:45,563 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-10 23:19:45,564 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-10 23:19:45,565 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-10 23:19:45,565 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-10 23:19:45,566 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:19:45" (1/1) ... [2024-10-10 23:19:45,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 23:19:45,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:19:45,598 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:45,601 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:45,649 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-10 23:19:45,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-10 23:19:45,651 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-10 23:19:45,651 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-10 23:19:45,727 INFO L238 CfgBuilder]: Building ICFG [2024-10-10 23:19:45,729 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-10 23:19:47,362 INFO L? ?]: Removed 129 outVars from TransFormulas that were not future-live. [2024-10-10 23:19:47,362 INFO L287 CfgBuilder]: Performing block encoding [2024-10-10 23:19:47,436 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-10 23:19:47,437 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-10 23:19:47,437 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:19:47 BoogieIcfgContainer [2024-10-10 23:19:47,437 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-10 23:19:47,439 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-10 23:19:47,440 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-10 23:19:47,443 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-10 23:19:47,444 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.10 11:19:44" (1/3) ... [2024-10-10 23:19:47,444 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@435e0b41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 11:19:47, skipping insertion in model container [2024-10-10 23:19:47,444 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:19:45" (2/3) ... [2024-10-10 23:19:47,445 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@435e0b41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 11:19:47, skipping insertion in model container [2024-10-10 23:19:47,445 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:19:47" (3/3) ... [2024-10-10 23:19:47,446 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem11_label50.c [2024-10-10 23:19:47,463 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-10 23:19:47,463 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-10 23:19:47,542 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-10 23:19:47,551 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;@70eeb777, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-10 23:19:47,552 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-10 23:19:47,558 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:19:47,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-10-10 23:19:47,569 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:19:47,571 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] [2024-10-10 23:19:47,572 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:19:47,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:19:47,578 INFO L85 PathProgramCache]: Analyzing trace with hash 134667761, now seen corresponding path program 1 times [2024-10-10 23:19:47,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:19:47,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949684378] [2024-10-10 23:19:47,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:19:47,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:19:47,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:19:47,783 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:19:47,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:19:47,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949684378] [2024-10-10 23:19:47,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949684378] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:19:47,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:19:47,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:19:47,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390734012] [2024-10-10 23:19:47,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:19:47,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-10 23:19:47,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:19:47,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-10 23:19:47,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-10 23:19:47,823 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 17.5) internal successors, (35), 2 states have internal predecessors, (35), 0 states have call successors, (0), 0 states 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:19:47,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:19:47,882 INFO L93 Difference]: Finished difference Result 441 states and 839 transitions. [2024-10-10 23:19:47,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-10 23:19:47,886 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 0 states have call successors, (0), 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 35 [2024-10-10 23:19:47,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:19:47,899 INFO L225 Difference]: With dead ends: 441 [2024-10-10 23:19:47,900 INFO L226 Difference]: Without dead ends: 219 [2024-10-10 23:19:47,905 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:19:47,908 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:19:47,912 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:19:47,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2024-10-10 23:19:47,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 219. [2024-10-10 23:19:47,967 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:19:47,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 355 transitions. [2024-10-10 23:19:47,972 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 355 transitions. Word has length 35 [2024-10-10 23:19:47,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:19:47,972 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 355 transitions. [2024-10-10 23:19:47,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 0 states have call successors, (0), 0 states 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:19:47,973 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 355 transitions. [2024-10-10 23:19:47,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-10-10 23:19:47,974 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:19:47,974 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] [2024-10-10 23:19:47,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-10 23:19:47,975 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:19:47,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:19:47,975 INFO L85 PathProgramCache]: Analyzing trace with hash 235970340, now seen corresponding path program 1 times [2024-10-10 23:19:47,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:19:47,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227471664] [2024-10-10 23:19:47,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:19:47,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:19:48,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:19:48,174 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:19:48,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:19:48,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227471664] [2024-10-10 23:19:48,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227471664] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:19:48,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:19:48,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:19:48,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735774401] [2024-10-10 23:19:48,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:19:48,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:19:48,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:19:48,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:19:48,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:19:48,179 INFO L87 Difference]: Start difference. First operand 219 states and 355 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 2 states have internal predecessors, (35), 0 states have call successors, (0), 0 states 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:19:49,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:19:49,110 INFO L93 Difference]: Finished difference Result 630 states and 1029 transitions. [2024-10-10 23:19:49,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:19:49,111 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 2 states have internal predecessors, (35), 0 states have call successors, (0), 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 35 [2024-10-10 23:19:49,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:19:49,114 INFO L225 Difference]: With dead ends: 630 [2024-10-10 23:19:49,114 INFO L226 Difference]: Without dead ends: 412 [2024-10-10 23:19:49,119 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:19:49,121 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 172 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 557 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 644 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 557 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-10 23:19:49,121 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 144 Invalid, 644 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 557 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-10 23:19:49,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2024-10-10 23:19:49,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 410. [2024-10-10 23:19:49,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 410 states, 409 states have (on average 1.4596577017114913) internal successors, (597), 409 states have internal predecessors, (597), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:19:49,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 597 transitions. [2024-10-10 23:19:49,145 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 597 transitions. Word has length 35 [2024-10-10 23:19:49,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:19:49,145 INFO L471 AbstractCegarLoop]: Abstraction has 410 states and 597 transitions. [2024-10-10 23:19:49,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 2 states have internal predecessors, (35), 0 states have call successors, (0), 0 states 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:19:49,146 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 597 transitions. [2024-10-10 23:19:49,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-10 23:19:49,148 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:19:49,149 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:49,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-10 23:19:49,149 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:19:49,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:19:49,150 INFO L85 PathProgramCache]: Analyzing trace with hash -1422980324, now seen corresponding path program 1 times [2024-10-10 23:19:49,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:19:49,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690422868] [2024-10-10 23:19:49,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:19:49,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:19:49,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:19:49,370 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:19:49,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:19:49,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690422868] [2024-10-10 23:19:49,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690422868] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:19:49,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:19:49,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:19:49,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051153869] [2024-10-10 23:19:49,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:19:49,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:19:49,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:19:49,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:19:49,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:19:49,376 INFO L87 Difference]: Start difference. First operand 410 states and 597 transitions. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 2 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:19:50,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:19:50,138 INFO L93 Difference]: Finished difference Result 1208 states and 1764 transitions. [2024-10-10 23:19:50,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:19:50,138 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 2 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 103 [2024-10-10 23:19:50,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:19:50,142 INFO L225 Difference]: With dead ends: 1208 [2024-10-10 23:19:50,142 INFO L226 Difference]: Without dead ends: 799 [2024-10-10 23:19:50,144 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:19:50,145 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 144 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 524 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 524 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-10 23:19:50,145 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 118 Invalid, 672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 524 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-10 23:19:50,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 799 states. [2024-10-10 23:19:50,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 799 to 786. [2024-10-10 23:19:50,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 786 states, 785 states have (on average 1.3859872611464967) internal successors, (1088), 785 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states 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:19:50,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 1088 transitions. [2024-10-10 23:19:50,178 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 1088 transitions. Word has length 103 [2024-10-10 23:19:50,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:19:50,178 INFO L471 AbstractCegarLoop]: Abstraction has 786 states and 1088 transitions. [2024-10-10 23:19:50,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 2 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:19:50,179 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 1088 transitions. [2024-10-10 23:19:50,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-10 23:19:50,180 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:19:50,181 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:50,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-10 23:19:50,181 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:19:50,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:19:50,182 INFO L85 PathProgramCache]: Analyzing trace with hash 1927198170, now seen corresponding path program 1 times [2024-10-10 23:19:50,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:19:50,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828900384] [2024-10-10 23:19:50,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:19:50,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:19:50,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:19:50,505 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:19:50,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:19:50,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828900384] [2024-10-10 23:19:50,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828900384] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:19:50,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:19:50,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:19:50,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912604741] [2024-10-10 23:19:50,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:19:50,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:19:50,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:19:50,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:19:50,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:19:50,508 INFO L87 Difference]: Start difference. First operand 786 states and 1088 transitions. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 2 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:19:51,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:19:51,176 INFO L93 Difference]: Finished difference Result 1941 states and 2630 transitions. [2024-10-10 23:19:51,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:19:51,176 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 2 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 104 [2024-10-10 23:19:51,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:19:51,181 INFO L225 Difference]: With dead ends: 1941 [2024-10-10 23:19:51,181 INFO L226 Difference]: Without dead ends: 1156 [2024-10-10 23:19:51,183 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:19:51,184 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 120 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 532 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-10 23:19:51,184 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 188 Invalid, 569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 532 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-10 23:19:51,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1156 states. [2024-10-10 23:19:51,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1156 to 1155. [2024-10-10 23:19:51,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1155 states, 1154 states have (on average 1.2781629116117852) internal successors, (1475), 1154 states have internal predecessors, (1475), 0 states have call successors, (0), 0 states 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:19:51,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1155 states to 1155 states and 1475 transitions. [2024-10-10 23:19:51,208 INFO L78 Accepts]: Start accepts. Automaton has 1155 states and 1475 transitions. Word has length 104 [2024-10-10 23:19:51,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:19:51,209 INFO L471 AbstractCegarLoop]: Abstraction has 1155 states and 1475 transitions. [2024-10-10 23:19:51,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 2 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:19:51,210 INFO L276 IsEmpty]: Start isEmpty. Operand 1155 states and 1475 transitions. [2024-10-10 23:19:51,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-10-10 23:19:51,212 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:19:51,212 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:51,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-10 23:19:51,212 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:19:51,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:19:51,213 INFO L85 PathProgramCache]: Analyzing trace with hash -1971581728, now seen corresponding path program 1 times [2024-10-10 23:19:51,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:19:51,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635728619] [2024-10-10 23:19:51,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:19:51,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:19:51,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:19:51,531 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:19:51,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:19:51,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635728619] [2024-10-10 23:19:51,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635728619] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:19:51,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:19:51,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:19:51,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711592437] [2024-10-10 23:19:51,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:19:51,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:19:51,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:19:51,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:19:51,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:19:51,534 INFO L87 Difference]: Start difference. First operand 1155 states and 1475 transitions. Second operand has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 0 states have call successors, (0), 0 states 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:19:52,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:19:52,313 INFO L93 Difference]: Finished difference Result 2690 states and 3514 transitions. [2024-10-10 23:19:52,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:19:52,313 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 0 states have call successors, (0), 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 147 [2024-10-10 23:19:52,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:19:52,319 INFO L225 Difference]: With dead ends: 2690 [2024-10-10 23:19:52,320 INFO L226 Difference]: Without dead ends: 1720 [2024-10-10 23:19:52,321 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:19:52,324 INFO L432 NwaCegarLoop]: 313 mSDtfsCounter, 170 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 549 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 648 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 549 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-10 23:19:52,325 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 333 Invalid, 648 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 549 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-10 23:19:52,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1720 states. [2024-10-10 23:19:52,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1720 to 1527. [2024-10-10 23:19:52,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1527 states, 1526 states have (on average 1.261467889908257) internal successors, (1925), 1526 states have internal predecessors, (1925), 0 states have call successors, (0), 0 states 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:19:52,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1527 states to 1527 states and 1925 transitions. [2024-10-10 23:19:52,358 INFO L78 Accepts]: Start accepts. Automaton has 1527 states and 1925 transitions. Word has length 147 [2024-10-10 23:19:52,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:19:52,359 INFO L471 AbstractCegarLoop]: Abstraction has 1527 states and 1925 transitions. [2024-10-10 23:19:52,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 0 states have call successors, (0), 0 states 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:19:52,361 INFO L276 IsEmpty]: Start isEmpty. Operand 1527 states and 1925 transitions. [2024-10-10 23:19:52,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-10 23:19:52,366 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:19:52,366 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:52,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-10 23:19:52,367 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:19:52,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:19:52,367 INFO L85 PathProgramCache]: Analyzing trace with hash 524426743, now seen corresponding path program 1 times [2024-10-10 23:19:52,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:19:52,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169224275] [2024-10-10 23:19:52,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:19:52,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:19:52,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:19:52,519 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:19:52,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:19:52,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169224275] [2024-10-10 23:19:52,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169224275] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:19:52,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:19:52,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:19:52,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782576399] [2024-10-10 23:19:52,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:19:52,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:19:52,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:19:52,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:19:52,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:19:52,523 INFO L87 Difference]: Start difference. First operand 1527 states and 1925 transitions. Second operand has 3 states, 3 states have (on average 54.0) internal successors, (162), 2 states have internal predecessors, (162), 0 states have call successors, (0), 0 states 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:19:53,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:19:53,227 INFO L93 Difference]: Finished difference Result 4157 states and 5315 transitions. [2024-10-10 23:19:53,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:19:53,227 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 2 states have internal predecessors, (162), 0 states have call successors, (0), 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 162 [2024-10-10 23:19:53,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:19:53,237 INFO L225 Difference]: With dead ends: 4157 [2024-10-10 23:19:53,237 INFO L226 Difference]: Without dead ends: 2631 [2024-10-10 23:19:53,240 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:19:53,241 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 115 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 449 mSolverCounterSat, 183 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 153 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:19:53,241 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 153 Invalid, 632 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [183 Valid, 449 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-10 23:19:53,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2631 states. [2024-10-10 23:19:53,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2631 to 2447. [2024-10-10 23:19:53,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2447 states, 2446 states have (on average 1.2174979558462797) internal successors, (2978), 2446 states have internal predecessors, (2978), 0 states have call successors, (0), 0 states 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:19:53,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2447 states to 2447 states and 2978 transitions. [2024-10-10 23:19:53,285 INFO L78 Accepts]: Start accepts. Automaton has 2447 states and 2978 transitions. Word has length 162 [2024-10-10 23:19:53,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:19:53,286 INFO L471 AbstractCegarLoop]: Abstraction has 2447 states and 2978 transitions. [2024-10-10 23:19:53,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 2 states have internal predecessors, (162), 0 states have call successors, (0), 0 states 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:19:53,286 INFO L276 IsEmpty]: Start isEmpty. Operand 2447 states and 2978 transitions. [2024-10-10 23:19:53,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-10-10 23:19:53,288 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:19:53,289 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:53,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-10 23:19:53,289 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:19:53,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:19:53,290 INFO L85 PathProgramCache]: Analyzing trace with hash 1957081431, now seen corresponding path program 1 times [2024-10-10 23:19:53,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:19:53,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722192128] [2024-10-10 23:19:53,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:19:53,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:19:53,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:19:53,526 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:19:53,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:19:53,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722192128] [2024-10-10 23:19:53,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722192128] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:19:53,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:19:53,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:19:53,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109026736] [2024-10-10 23:19:53,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:19:53,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:19:53,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:19:53,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:19:53,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:19:53,530 INFO L87 Difference]: Start difference. First operand 2447 states and 2978 transitions. Second operand has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 0 states have call successors, (0), 0 states 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:19:54,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:19:54,224 INFO L93 Difference]: Finished difference Result 5638 states and 6867 transitions. [2024-10-10 23:19:54,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:19:54,224 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 0 states have call successors, (0), 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 178 [2024-10-10 23:19:54,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:19:54,234 INFO L225 Difference]: With dead ends: 5638 [2024-10-10 23:19:54,234 INFO L226 Difference]: Without dead ends: 3192 [2024-10-10 23:19:54,237 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:19:54,238 INFO L432 NwaCegarLoop]: 336 mSDtfsCounter, 165 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 547 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 614 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-10 23:19:54,238 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 356 Invalid, 614 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 547 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-10 23:19:54,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3192 states. [2024-10-10 23:19:54,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3192 to 3183. [2024-10-10 23:19:54,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3183 states, 3182 states have (on average 1.1992457573852924) internal successors, (3816), 3182 states have internal predecessors, (3816), 0 states have call successors, (0), 0 states 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:19:54,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3183 states to 3183 states and 3816 transitions. [2024-10-10 23:19:54,290 INFO L78 Accepts]: Start accepts. Automaton has 3183 states and 3816 transitions. Word has length 178 [2024-10-10 23:19:54,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:19:54,291 INFO L471 AbstractCegarLoop]: Abstraction has 3183 states and 3816 transitions. [2024-10-10 23:19:54,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 0 states have call successors, (0), 0 states 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:19:54,292 INFO L276 IsEmpty]: Start isEmpty. Operand 3183 states and 3816 transitions. [2024-10-10 23:19:54,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-10-10 23:19:54,294 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:19:54,295 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:54,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-10 23:19:54,295 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:19:54,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:19:54,296 INFO L85 PathProgramCache]: Analyzing trace with hash 907247093, now seen corresponding path program 1 times [2024-10-10 23:19:54,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:19:54,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104511588] [2024-10-10 23:19:54,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:19:54,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:19:54,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:19:54,587 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-10-10 23:19:54,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:19:54,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104511588] [2024-10-10 23:19:54,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104511588] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:19:54,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:19:54,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:19:54,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056484527] [2024-10-10 23:19:54,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:19:54,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:19:54,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:19:54,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:19:54,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:19:54,591 INFO L87 Difference]: Start difference. First operand 3183 states and 3816 transitions. Second operand has 3 states, 3 states have (on average 61.333333333333336) internal successors, (184), 2 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:19:55,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:19:55,242 INFO L93 Difference]: Finished difference Result 7107 states and 8503 transitions. [2024-10-10 23:19:55,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:19:55,243 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 61.333333333333336) internal successors, (184), 2 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 216 [2024-10-10 23:19:55,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:19:55,253 INFO L225 Difference]: With dead ends: 7107 [2024-10-10 23:19:55,253 INFO L226 Difference]: Without dead ends: 3925 [2024-10-10 23:19:55,256 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:19:55,259 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 37 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 536 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 562 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 536 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-10 23:19:55,259 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 152 Invalid, 562 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 536 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-10 23:19:55,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3925 states. [2024-10-10 23:19:55,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3925 to 3924. [2024-10-10 23:19:55,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3924 states, 3923 states have (on average 1.1939841957685444) internal successors, (4684), 3923 states have internal predecessors, (4684), 0 states have call successors, (0), 0 states 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:19:55,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3924 states to 3924 states and 4684 transitions. [2024-10-10 23:19:55,323 INFO L78 Accepts]: Start accepts. Automaton has 3924 states and 4684 transitions. Word has length 216 [2024-10-10 23:19:55,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:19:55,324 INFO L471 AbstractCegarLoop]: Abstraction has 3924 states and 4684 transitions. [2024-10-10 23:19:55,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 61.333333333333336) internal successors, (184), 2 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:19:55,324 INFO L276 IsEmpty]: Start isEmpty. Operand 3924 states and 4684 transitions. [2024-10-10 23:19:55,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2024-10-10 23:19:55,327 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:19:55,327 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:19:55,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-10 23:19:55,327 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:19:55,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:19:55,328 INFO L85 PathProgramCache]: Analyzing trace with hash -1107964557, now seen corresponding path program 1 times [2024-10-10 23:19:55,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:19:55,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802124223] [2024-10-10 23:19:55,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:19:55,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:19:55,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:19:55,539 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-10-10 23:19:55,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:19:55,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802124223] [2024-10-10 23:19:55,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802124223] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:19:55,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:19:55,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:19:55,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143478677] [2024-10-10 23:19:55,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:19:55,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:19:55,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:19:55,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:19:55,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:19:55,543 INFO L87 Difference]: Start difference. First operand 3924 states and 4684 transitions. Second operand has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 0 states have call successors, (0), 0 states 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:19:56,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:19:56,395 INFO L93 Difference]: Finished difference Result 8590 states and 10346 transitions. [2024-10-10 23:19:56,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:19:56,396 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 0 states have call successors, (0), 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 217 [2024-10-10 23:19:56,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:19:56,413 INFO L225 Difference]: With dead ends: 8590 [2024-10-10 23:19:56,414 INFO L226 Difference]: Without dead ends: 4667 [2024-10-10 23:19:56,418 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:19:56,419 INFO L432 NwaCegarLoop]: 367 mSDtfsCounter, 161 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 595 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 387 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:19:56,420 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 387 Invalid, 681 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 595 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-10 23:19:56,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4667 states. [2024-10-10 23:19:56,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4667 to 4476. [2024-10-10 23:19:56,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4476 states, 4475 states have (on average 1.186145251396648) internal successors, (5308), 4475 states have internal predecessors, (5308), 0 states have call successors, (0), 0 states 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:19:56,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4476 states to 4476 states and 5308 transitions. [2024-10-10 23:19:56,492 INFO L78 Accepts]: Start accepts. Automaton has 4476 states and 5308 transitions. Word has length 217 [2024-10-10 23:19:56,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:19:56,493 INFO L471 AbstractCegarLoop]: Abstraction has 4476 states and 5308 transitions. [2024-10-10 23:19:56,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 0 states have call successors, (0), 0 states 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:19:56,493 INFO L276 IsEmpty]: Start isEmpty. Operand 4476 states and 5308 transitions. [2024-10-10 23:19:56,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2024-10-10 23:19:56,496 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:19:56,497 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:19:56,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-10 23:19:56,498 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:19:56,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:19:56,498 INFO L85 PathProgramCache]: Analyzing trace with hash -1680856191, now seen corresponding path program 1 times [2024-10-10 23:19:56,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:19:56,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199193371] [2024-10-10 23:19:56,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:19:56,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:19:56,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:19:56,913 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:19:56,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:19:56,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199193371] [2024-10-10 23:19:56,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199193371] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:19:56,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:19:56,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-10 23:19:56,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049319611] [2024-10-10 23:19:56,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:19:56,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:19:56,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:19:56,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:19:56,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:19:56,917 INFO L87 Difference]: Start difference. First operand 4476 states and 5308 transitions. Second operand has 4 states, 4 states have (on average 59.25) internal successors, (237), 4 states have internal predecessors, (237), 0 states have call successors, (0), 0 states 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:19:58,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:19:58,207 INFO L93 Difference]: Finished difference Result 14320 states and 17013 transitions. [2024-10-10 23:19:58,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:19:58,207 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 59.25) internal successors, (237), 4 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 237 [2024-10-10 23:19:58,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:19:58,237 INFO L225 Difference]: With dead ends: 14320 [2024-10-10 23:19:58,238 INFO L226 Difference]: Without dead ends: 9845 [2024-10-10 23:19:58,245 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:19:58,246 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 301 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 1073 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 301 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 1201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 1073 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-10 23:19:58,246 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [301 Valid, 188 Invalid, 1201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 1073 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-10 23:19:58,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9845 states. [2024-10-10 23:19:58,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9845 to 7626. [2024-10-10 23:19:58,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7626 states, 7625 states have (on average 1.1702295081967213) internal successors, (8923), 7625 states have internal predecessors, (8923), 0 states have call successors, (0), 0 states 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:19:58,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7626 states to 7626 states and 8923 transitions. [2024-10-10 23:19:58,389 INFO L78 Accepts]: Start accepts. Automaton has 7626 states and 8923 transitions. Word has length 237 [2024-10-10 23:19:58,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:19:58,390 INFO L471 AbstractCegarLoop]: Abstraction has 7626 states and 8923 transitions. [2024-10-10 23:19:58,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 59.25) internal successors, (237), 4 states have internal predecessors, (237), 0 states have call successors, (0), 0 states 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:19:58,390 INFO L276 IsEmpty]: Start isEmpty. Operand 7626 states and 8923 transitions. [2024-10-10 23:19:58,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2024-10-10 23:19:58,394 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:19:58,394 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:19:58,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-10 23:19:58,395 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:19:58,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:19:58,396 INFO L85 PathProgramCache]: Analyzing trace with hash -1493788472, now seen corresponding path program 1 times [2024-10-10 23:19:58,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:19:58,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968419840] [2024-10-10 23:19:58,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:19:58,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:19:58,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:19:58,817 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:19:58,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:19:58,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968419840] [2024-10-10 23:19:58,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968419840] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:19:58,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:19:58,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-10 23:19:58,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947597465] [2024-10-10 23:19:58,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:19:58,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:19:58,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:19:58,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:19:58,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:19:58,820 INFO L87 Difference]: Start difference. First operand 7626 states and 8923 transitions. Second operand has 4 states, 4 states have (on average 61.75) internal successors, (247), 4 states have internal predecessors, (247), 0 states have call successors, (0), 0 states 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:00,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:20:00,108 INFO L93 Difference]: Finished difference Result 20233 states and 23745 transitions. [2024-10-10 23:20:00,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:20:00,109 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 61.75) internal successors, (247), 4 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 247 [2024-10-10 23:20:00,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:20:00,134 INFO L225 Difference]: With dead ends: 20233 [2024-10-10 23:20:00,134 INFO L226 Difference]: Without dead ends: 12608 [2024-10-10 23:20:00,144 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:00,145 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 322 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 1076 mSolverCounterSat, 215 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 322 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 1291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 215 IncrementalHoareTripleChecker+Valid, 1076 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-10 23:20:00,145 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [322 Valid, 107 Invalid, 1291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [215 Valid, 1076 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-10 23:20:00,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12608 states. [2024-10-10 23:20:00,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12608 to 10201. [2024-10-10 23:20:00,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10201 states, 10200 states have (on average 1.1734313725490195) internal successors, (11969), 10200 states have internal predecessors, (11969), 0 states have call successors, (0), 0 states 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:00,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10201 states to 10201 states and 11969 transitions. [2024-10-10 23:20:00,346 INFO L78 Accepts]: Start accepts. Automaton has 10201 states and 11969 transitions. Word has length 247 [2024-10-10 23:20:00,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:20:00,347 INFO L471 AbstractCegarLoop]: Abstraction has 10201 states and 11969 transitions. [2024-10-10 23:20:00,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 61.75) internal successors, (247), 4 states have internal predecessors, (247), 0 states have call successors, (0), 0 states 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:00,348 INFO L276 IsEmpty]: Start isEmpty. Operand 10201 states and 11969 transitions. [2024-10-10 23:20:00,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2024-10-10 23:20:00,351 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:20:00,352 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:00,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-10 23:20:00,352 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:20:00,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:20:00,353 INFO L85 PathProgramCache]: Analyzing trace with hash 990690945, now seen corresponding path program 1 times [2024-10-10 23:20:00,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:20:00,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603524063] [2024-10-10 23:20:00,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:20:00,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:20:00,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:20:00,558 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 151 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:20:00,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:20:00,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603524063] [2024-10-10 23:20:00,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603524063] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:20:00,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:20:00,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:20:00,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991641652] [2024-10-10 23:20:00,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:20:00,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:20:00,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:20:00,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:20:00,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:20:00,562 INFO L87 Difference]: Start difference. First operand 10201 states and 11969 transitions. Second operand has 3 states, 3 states have (on average 82.33333333333333) internal successors, (247), 3 states have internal predecessors, (247), 0 states have call successors, (0), 0 states 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,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:20:01,259 INFO L93 Difference]: Finished difference Result 20398 states and 23934 transitions. [2024-10-10 23:20:01,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:20:01,260 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 82.33333333333333) internal successors, (247), 3 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 247 [2024-10-10 23:20:01,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:20:01,281 INFO L225 Difference]: With dead ends: 20398 [2024-10-10 23:20:01,282 INFO L226 Difference]: Without dead ends: 10198 [2024-10-10 23:20:01,293 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:01,294 INFO L432 NwaCegarLoop]: 283 mSDtfsCounter, 148 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 553 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 604 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 553 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-10 23:20:01,294 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 302 Invalid, 604 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 553 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-10 23:20:01,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10198 states. [2024-10-10 23:20:01,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10198 to 10198. [2024-10-10 23:20:01,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10198 states, 10197 states have (on average 1.1445523193096008) internal successors, (11671), 10197 states have internal predecessors, (11671), 0 states have call successors, (0), 0 states 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,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10198 states to 10198 states and 11671 transitions. [2024-10-10 23:20:01,487 INFO L78 Accepts]: Start accepts. Automaton has 10198 states and 11671 transitions. Word has length 247 [2024-10-10 23:20:01,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:20:01,488 INFO L471 AbstractCegarLoop]: Abstraction has 10198 states and 11671 transitions. [2024-10-10 23:20:01,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 82.33333333333333) internal successors, (247), 3 states have internal predecessors, (247), 0 states have call successors, (0), 0 states 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,489 INFO L276 IsEmpty]: Start isEmpty. Operand 10198 states and 11671 transitions. [2024-10-10 23:20:01,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2024-10-10 23:20:01,492 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:20:01,493 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:01,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-10 23:20:01,493 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:20:01,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:20:01,494 INFO L85 PathProgramCache]: Analyzing trace with hash 357948476, now seen corresponding path program 1 times [2024-10-10 23:20:01,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:20:01,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208460536] [2024-10-10 23:20:01,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:20:01,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:20:01,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:20:01,895 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 39 proven. 28 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2024-10-10 23:20:01,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:20:01,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208460536] [2024-10-10 23:20:01,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208460536] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:20:01,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [606548229] [2024-10-10 23:20:01,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:20:01,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:20:01,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:20:01,899 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:01,900 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:02,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:20:02,025 INFO L255 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-10 23:20:02,037 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:20:02,152 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2024-10-10 23:20:02,152 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 23:20:02,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [606548229] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:20:02,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 23:20:02,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2024-10-10 23:20:02,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072748057] [2024-10-10 23:20:02,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:20:02,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:20:02,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:20:02,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:20:02,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-10-10 23:20:02,154 INFO L87 Difference]: Start difference. First operand 10198 states and 11671 transitions. Second operand has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 0 states have call successors, (0), 0 states 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:02,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:20:02,883 INFO L93 Difference]: Finished difference Result 22786 states and 26112 transitions. [2024-10-10 23:20:02,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:20:02,883 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 0 states have call successors, (0), 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 249 [2024-10-10 23:20:02,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:20:02,905 INFO L225 Difference]: With dead ends: 22786 [2024-10-10 23:20:02,905 INFO L226 Difference]: Without dead ends: 12589 [2024-10-10 23:20:02,918 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 248 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-10-10 23:20:02,919 INFO L432 NwaCegarLoop]: 345 mSDtfsCounter, 162 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 588 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 676 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 588 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-10 23:20:02,919 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 367 Invalid, 676 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 588 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-10 23:20:02,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12589 states. [2024-10-10 23:20:03,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12589 to 11113. [2024-10-10 23:20:03,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11113 states, 11112 states have (on average 1.1383189344852411) internal successors, (12649), 11112 states have internal predecessors, (12649), 0 states have call successors, (0), 0 states 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,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11113 states to 11113 states and 12649 transitions. [2024-10-10 23:20:03,064 INFO L78 Accepts]: Start accepts. Automaton has 11113 states and 12649 transitions. Word has length 249 [2024-10-10 23:20:03,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:20:03,064 INFO L471 AbstractCegarLoop]: Abstraction has 11113 states and 12649 transitions. [2024-10-10 23:20:03,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 0 states have call successors, (0), 0 states 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,065 INFO L276 IsEmpty]: Start isEmpty. Operand 11113 states and 12649 transitions. [2024-10-10 23:20:03,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2024-10-10 23:20:03,069 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:20:03,069 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:03,091 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-10 23:20:03,270 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,SelfDestructingSolverStorable12 [2024-10-10 23:20:03,271 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:20:03,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:20:03,271 INFO L85 PathProgramCache]: Analyzing trace with hash -1519230895, now seen corresponding path program 1 times [2024-10-10 23:20:03,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:20:03,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124504276] [2024-10-10 23:20:03,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:20:03,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:20:03,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:20:03,609 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2024-10-10 23:20:03,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:20:03,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124504276] [2024-10-10 23:20:03,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124504276] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:20:03,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:20:03,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:20:03,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699722228] [2024-10-10 23:20:03,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:20:03,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:20:03,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:20:03,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:20:03,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:20:03,614 INFO L87 Difference]: Start difference. First operand 11113 states and 12649 transitions. Second operand has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 0 states have call successors, (0), 0 states 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,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:20:04,449 INFO L93 Difference]: Finished difference Result 22412 states and 25493 transitions. [2024-10-10 23:20:04,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:20:04,450 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 0 states have call successors, (0), 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 254 [2024-10-10 23:20:04,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:20:04,468 INFO L225 Difference]: With dead ends: 22412 [2024-10-10 23:20:04,468 INFO L226 Difference]: Without dead ends: 11300 [2024-10-10 23:20:04,481 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:04,481 INFO L432 NwaCegarLoop]: 349 mSDtfsCounter, 164 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 576 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 662 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 576 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-10 23:20:04,482 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 370 Invalid, 662 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 576 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-10 23:20:04,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11300 states. [2024-10-10 23:20:04,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11300 to 11112. [2024-10-10 23:20:04,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11112 states, 11111 states have (on average 1.1175411754117541) internal successors, (12417), 11111 states have internal predecessors, (12417), 0 states have call successors, (0), 0 states 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,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11112 states to 11112 states and 12417 transitions. [2024-10-10 23:20:04,622 INFO L78 Accepts]: Start accepts. Automaton has 11112 states and 12417 transitions. Word has length 254 [2024-10-10 23:20:04,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:20:04,623 INFO L471 AbstractCegarLoop]: Abstraction has 11112 states and 12417 transitions. [2024-10-10 23:20:04,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 0 states have call successors, (0), 0 states 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,623 INFO L276 IsEmpty]: Start isEmpty. Operand 11112 states and 12417 transitions. [2024-10-10 23:20:04,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2024-10-10 23:20:04,628 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:20:04,629 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-10 23:20:04,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-10 23:20:04,630 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:20:04,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:20:04,630 INFO L85 PathProgramCache]: Analyzing trace with hash -757374664, now seen corresponding path program 1 times [2024-10-10 23:20:04,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:20:04,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676672091] [2024-10-10 23:20:04,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:20:04,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:20:04,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:20:05,275 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 123 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:20:05,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:20:05,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676672091] [2024-10-10 23:20:05,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676672091] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:20:05,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [210273505] [2024-10-10 23:20:05,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:20:05,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:20:05,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:20:05,278 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:05,280 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:05,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:20:05,403 INFO L255 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-10 23:20:05,410 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:20:05,857 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:20:05,857 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 23:20:05,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [210273505] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:20:05,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 23:20:05,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-10-10 23:20:05,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754591190] [2024-10-10 23:20:05,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:20:05,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:20:05,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:20:05,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:20:05,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-10-10 23:20:05,859 INFO L87 Difference]: Start difference. First operand 11112 states and 12417 transitions. Second operand has 4 states, 4 states have (on average 67.0) 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:06,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:20:06,654 INFO L93 Difference]: Finished difference Result 22226 states and 24837 transitions. [2024-10-10 23:20:06,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:20:06,654 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 67.0) 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 268 [2024-10-10 23:20:06,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:20:06,671 INFO L225 Difference]: With dead ends: 22226 [2024-10-10 23:20:06,671 INFO L226 Difference]: Without dead ends: 11115 [2024-10-10 23:20:06,680 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 266 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-10-10 23:20:06,681 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 187 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 933 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 983 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 933 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-10 23:20:06,681 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 152 Invalid, 983 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 933 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-10 23:20:06,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11115 states. [2024-10-10 23:20:06,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11115 to 11112. [2024-10-10 23:20:06,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11112 states, 11111 states have (on average 1.116461164611646) internal successors, (12405), 11111 states have internal predecessors, (12405), 0 states have call successors, (0), 0 states 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,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11112 states to 11112 states and 12405 transitions. [2024-10-10 23:20:06,824 INFO L78 Accepts]: Start accepts. Automaton has 11112 states and 12405 transitions. Word has length 268 [2024-10-10 23:20:06,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:20:06,824 INFO L471 AbstractCegarLoop]: Abstraction has 11112 states and 12405 transitions. [2024-10-10 23:20:06,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 67.0) 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:06,825 INFO L276 IsEmpty]: Start isEmpty. Operand 11112 states and 12405 transitions. [2024-10-10 23:20:06,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2024-10-10 23:20:06,831 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:20:06,831 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-10-10 23:20:06,847 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-10 23:20:07,031 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,SelfDestructingSolverStorable14 [2024-10-10 23:20:07,032 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:20:07,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:20:07,033 INFO L85 PathProgramCache]: Analyzing trace with hash 1856631491, now seen corresponding path program 1 times [2024-10-10 23:20:07,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:20:07,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251346979] [2024-10-10 23:20:07,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:20:07,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:20:07,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:20:07,256 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 223 trivial. 0 not checked. [2024-10-10 23:20:07,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:20:07,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251346979] [2024-10-10 23:20:07,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251346979] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:20:07,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:20:07,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:20:07,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554993226] [2024-10-10 23:20:07,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:20:07,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:20:07,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:20:07,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:20:07,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:20:07,258 INFO L87 Difference]: Start difference. First operand 11112 states and 12405 transitions. Second operand has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 0 states have call successors, (0), 0 states 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,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:20:07,890 INFO L93 Difference]: Finished difference Result 23511 states and 26254 transitions. [2024-10-10 23:20:07,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:20:07,890 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 0 states have call successors, (0), 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 302 [2024-10-10 23:20:07,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:20:07,906 INFO L225 Difference]: With dead ends: 23511 [2024-10-10 23:20:07,906 INFO L226 Difference]: Without dead ends: 12400 [2024-10-10 23:20:07,916 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,916 INFO L432 NwaCegarLoop]: 353 mSDtfsCounter, 157 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 520 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 520 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-10 23:20:07,917 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 379 Invalid, 554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 520 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-10 23:20:07,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12400 states. [2024-10-10 23:20:08,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12400 to 11848. [2024-10-10 23:20:08,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11848 states, 11847 states have (on average 1.1122647083649868) internal successors, (13177), 11847 states have internal predecessors, (13177), 0 states have call successors, (0), 0 states 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,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11848 states to 11848 states and 13177 transitions. [2024-10-10 23:20:08,046 INFO L78 Accepts]: Start accepts. Automaton has 11848 states and 13177 transitions. Word has length 302 [2024-10-10 23:20:08,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:20:08,046 INFO L471 AbstractCegarLoop]: Abstraction has 11848 states and 13177 transitions. [2024-10-10 23:20:08,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 0 states have call successors, (0), 0 states 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,047 INFO L276 IsEmpty]: Start isEmpty. Operand 11848 states and 13177 transitions. [2024-10-10 23:20:08,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2024-10-10 23:20:08,054 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:20:08,054 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 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:08,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-10 23:20:08,055 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:20:08,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:20:08,056 INFO L85 PathProgramCache]: Analyzing trace with hash 945814207, now seen corresponding path program 1 times [2024-10-10 23:20:08,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:20:08,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441267727] [2024-10-10 23:20:08,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:20:08,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:20:08,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:20:08,564 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 259 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-10-10 23:20:08,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:20:08,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441267727] [2024-10-10 23:20:08,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441267727] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:20:08,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:20:08,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-10 23:20:08,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005481301] [2024-10-10 23:20:08,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:20:08,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:20:08,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:20:08,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:20:08,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:20:08,566 INFO L87 Difference]: Start difference. First operand 11848 states and 13177 transitions. Second operand has 4 states, 4 states have (on average 59.75) internal successors, (239), 4 states have internal predecessors, (239), 0 states have call successors, (0), 0 states 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:09,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:20:09,759 INFO L93 Difference]: Finished difference Result 29437 states and 32745 transitions. [2024-10-10 23:20:09,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:20:09,760 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 59.75) internal successors, (239), 4 states have internal predecessors, (239), 0 states have call successors, (0), 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 306 [2024-10-10 23:20:09,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:20:09,776 INFO L225 Difference]: With dead ends: 29437 [2024-10-10 23:20:09,776 INFO L226 Difference]: Without dead ends: 16849 [2024-10-10 23:20:09,787 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:09,788 INFO L432 NwaCegarLoop]: 358 mSDtfsCounter, 306 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 1141 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 306 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 1221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 1141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-10 23:20:09,788 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [306 Valid, 398 Invalid, 1221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 1141 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-10 23:20:09,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16849 states. [2024-10-10 23:20:09,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16849 to 13337. [2024-10-10 23:20:10,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13337 states, 13336 states have (on average 1.1131523695260948) internal successors, (14845), 13336 states have internal predecessors, (14845), 0 states have call successors, (0), 0 states 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,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13337 states to 13337 states and 14845 transitions. [2024-10-10 23:20:10,038 INFO L78 Accepts]: Start accepts. Automaton has 13337 states and 14845 transitions. Word has length 306 [2024-10-10 23:20:10,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:20:10,038 INFO L471 AbstractCegarLoop]: Abstraction has 13337 states and 14845 transitions. [2024-10-10 23:20:10,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 59.75) internal successors, (239), 4 states have internal predecessors, (239), 0 states have call successors, (0), 0 states 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,039 INFO L276 IsEmpty]: Start isEmpty. Operand 13337 states and 14845 transitions. [2024-10-10 23:20:10,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2024-10-10 23:20:10,052 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:20:10,052 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:20:10,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-10 23:20:10,052 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:20:10,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:20:10,053 INFO L85 PathProgramCache]: Analyzing trace with hash 723366039, now seen corresponding path program 1 times [2024-10-10 23:20:10,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:20:10,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319985011] [2024-10-10 23:20:10,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:20:10,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:20:10,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:20:10,426 INFO L134 CoverageAnalysis]: Checked inductivity of 359 backedges. 275 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-10 23:20:10,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:20:10,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319985011] [2024-10-10 23:20:10,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319985011] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:20:10,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:20:10,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-10 23:20:10,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276555412] [2024-10-10 23:20:10,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:20:10,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:20:10,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:20:10,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:20:10,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:20:10,429 INFO L87 Difference]: Start difference. First operand 13337 states and 14845 transitions. Second operand has 4 states, 4 states have (on average 59.75) internal successors, (239), 4 states have internal predecessors, (239), 0 states have call successors, (0), 0 states 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:11,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:20:11,552 INFO L93 Difference]: Finished difference Result 34065 states and 37870 transitions. [2024-10-10 23:20:11,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:20:11,552 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 59.75) internal successors, (239), 4 states have internal predecessors, (239), 0 states have call successors, (0), 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 322 [2024-10-10 23:20:11,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:20:11,576 INFO L225 Difference]: With dead ends: 34065 [2024-10-10 23:20:11,576 INFO L226 Difference]: Without dead ends: 20729 [2024-10-10 23:20:11,587 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:11,588 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 325 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 1125 mSolverCounterSat, 239 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 325 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 1364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 239 IncrementalHoareTripleChecker+Valid, 1125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-10 23:20:11,588 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [325 Valid, 85 Invalid, 1364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [239 Valid, 1125 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-10 23:20:11,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20729 states. [2024-10-10 23:20:11,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20729 to 19062. [2024-10-10 23:20:11,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19062 states, 19061 states have (on average 1.1078642253816693) internal successors, (21117), 19061 states have internal predecessors, (21117), 0 states have call successors, (0), 0 states 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:11,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19062 states to 19062 states and 21117 transitions. [2024-10-10 23:20:11,784 INFO L78 Accepts]: Start accepts. Automaton has 19062 states and 21117 transitions. Word has length 322 [2024-10-10 23:20:11,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:20:11,784 INFO L471 AbstractCegarLoop]: Abstraction has 19062 states and 21117 transitions. [2024-10-10 23:20:11,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 59.75) internal successors, (239), 4 states have internal predecessors, (239), 0 states have call successors, (0), 0 states 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:11,784 INFO L276 IsEmpty]: Start isEmpty. Operand 19062 states and 21117 transitions. [2024-10-10 23:20:11,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2024-10-10 23:20:11,793 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:20:11,794 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-10-10 23:20:11,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-10 23:20:11,794 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:20:11,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:20:11,795 INFO L85 PathProgramCache]: Analyzing trace with hash 1397195530, now seen corresponding path program 1 times [2024-10-10 23:20:11,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:20:11,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293457632] [2024-10-10 23:20:11,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:20:11,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:20:11,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:20:11,963 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2024-10-10 23:20:11,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:20:11,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293457632] [2024-10-10 23:20:11,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293457632] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:20:11,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:20:11,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:20:11,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864787923] [2024-10-10 23:20:11,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:20:11,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:20:11,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:20:11,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:20:11,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:20:11,965 INFO L87 Difference]: Start difference. First operand 19062 states and 21117 transitions. Second operand has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:20:12,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:20:12,504 INFO L93 Difference]: Finished difference Result 40514 states and 44894 transitions. [2024-10-10 23:20:12,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:20:12,505 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 331 [2024-10-10 23:20:12,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:20:12,526 INFO L225 Difference]: With dead ends: 40514 [2024-10-10 23:20:12,526 INFO L226 Difference]: Without dead ends: 21453 [2024-10-10 23:20:12,541 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:12,541 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 184 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 495 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 555 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 495 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-10 23:20:12,542 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 142 Invalid, 555 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 495 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-10 23:20:12,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21453 states. [2024-10-10 23:20:12,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21453 to 19057. [2024-10-10 23:20:12,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19057 states, 19056 states have (on average 1.1083123425692696) internal successors, (21120), 19056 states have internal predecessors, (21120), 0 states have call successors, (0), 0 states 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,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19057 states to 19057 states and 21120 transitions. [2024-10-10 23:20:12,819 INFO L78 Accepts]: Start accepts. Automaton has 19057 states and 21120 transitions. Word has length 331 [2024-10-10 23:20:12,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:20:12,819 INFO L471 AbstractCegarLoop]: Abstraction has 19057 states and 21120 transitions. [2024-10-10 23:20:12,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:20:12,820 INFO L276 IsEmpty]: Start isEmpty. Operand 19057 states and 21120 transitions. [2024-10-10 23:20:12,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2024-10-10 23:20:12,827 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:20:12,827 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-10 23:20:12,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-10 23:20:12,827 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:20:12,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:20:12,828 INFO L85 PathProgramCache]: Analyzing trace with hash 1057490485, now seen corresponding path program 1 times [2024-10-10 23:20:12,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:20:12,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444034578] [2024-10-10 23:20:12,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:20:12,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:20:12,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:20:13,109 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-10-10 23:20:13,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:20:13,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444034578] [2024-10-10 23:20:13,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444034578] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:20:13,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:20:13,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:20:13,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996944763] [2024-10-10 23:20:13,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:20:13,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:20:13,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:20:13,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:20:13,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:20:13,113 INFO L87 Difference]: Start difference. First operand 19057 states and 21120 transitions. Second operand has 3 states, 3 states have (on average 70.0) internal successors, (210), 3 states have internal predecessors, (210), 0 states have call successors, (0), 0 states 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:13,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:20:13,816 INFO L93 Difference]: Finished difference Result 40701 states and 45084 transitions. [2024-10-10 23:20:13,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:20:13,816 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 70.0) internal successors, (210), 3 states have internal predecessors, (210), 0 states have call successors, (0), 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 333 [2024-10-10 23:20:13,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:20:13,838 INFO L225 Difference]: With dead ends: 40701 [2024-10-10 23:20:13,838 INFO L226 Difference]: Without dead ends: 21645 [2024-10-10 23:20:13,850 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:13,851 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 185 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 567 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 635 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 567 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-10 23:20:13,851 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 133 Invalid, 635 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 567 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-10 23:20:13,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21645 states. [2024-10-10 23:20:14,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21645 to 17384. [2024-10-10 23:20:14,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17384 states, 17383 states have (on average 1.1077489501236841) internal successors, (19256), 17383 states have internal predecessors, (19256), 0 states have call successors, (0), 0 states 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,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17384 states to 17384 states and 19256 transitions. [2024-10-10 23:20:14,031 INFO L78 Accepts]: Start accepts. Automaton has 17384 states and 19256 transitions. Word has length 333 [2024-10-10 23:20:14,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:20:14,031 INFO L471 AbstractCegarLoop]: Abstraction has 17384 states and 19256 transitions. [2024-10-10 23:20:14,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 70.0) internal successors, (210), 3 states have internal predecessors, (210), 0 states have call successors, (0), 0 states 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,031 INFO L276 IsEmpty]: Start isEmpty. Operand 17384 states and 19256 transitions. [2024-10-10 23:20:14,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 358 [2024-10-10 23:20:14,040 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:20:14,040 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:20:14,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-10 23:20:14,041 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:20:14,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:20:14,041 INFO L85 PathProgramCache]: Analyzing trace with hash 1530174800, now seen corresponding path program 1 times [2024-10-10 23:20:14,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:20:14,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957410344] [2024-10-10 23:20:14,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:20:14,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:20:14,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:20:14,471 INFO L134 CoverageAnalysis]: Checked inductivity of 384 backedges. 280 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2024-10-10 23:20:14,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:20:14,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957410344] [2024-10-10 23:20:14,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957410344] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:20:14,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:20:14,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-10 23:20:14,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988674038] [2024-10-10 23:20:14,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:20:14,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:20:14,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:20:14,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:20:14,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:20:14,474 INFO L87 Difference]: Start difference. First operand 17384 states and 19256 transitions. Second operand has 4 states, 4 states have (on average 63.5) internal successors, (254), 4 states have internal predecessors, (254), 0 states have call successors, (0), 0 states 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,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:20:15,301 INFO L93 Difference]: Finished difference Result 37720 states and 41613 transitions. [2024-10-10 23:20:15,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:20:15,302 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 63.5) internal successors, (254), 4 states have internal predecessors, (254), 0 states have call successors, (0), 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 357 [2024-10-10 23:20:15,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:20:15,303 INFO L225 Difference]: With dead ends: 37720 [2024-10-10 23:20:15,303 INFO L226 Difference]: Without dead ends: 0 [2024-10-10 23:20:15,316 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,317 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 321 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 889 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 321 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 1029 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 889 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-10 23:20:15,317 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [321 Valid, 54 Invalid, 1029 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 889 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-10 23:20:15,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-10 23:20:15,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-10 23:20:15,318 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:15,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-10 23:20:15,319 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 357 [2024-10-10 23:20:15,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:20:15,319 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-10 23:20:15,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 63.5) internal successors, (254), 4 states have internal predecessors, (254), 0 states have call successors, (0), 0 states 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,319 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-10 23:20:15,319 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-10 23:20:15,322 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-10 23:20:15,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-10 23:20:15,324 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] [2024-10-10 23:20:15,326 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-10 23:20:20,656 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-10 23:20:20,671 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.10 11:20:20 BoogieIcfgContainer [2024-10-10 23:20:20,672 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-10 23:20:20,672 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-10 23:20:20,672 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-10 23:20:20,673 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-10 23:20:20,673 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:19:47" (3/4) ... [2024-10-10 23:20:20,675 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-10 23:20:20,693 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2024-10-10 23:20:20,694 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-10-10 23:20:20,695 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-10 23:20:20,696 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-10 23:20:20,869 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-10 23:20:20,870 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-10 23:20:20,870 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-10 23:20:20,870 INFO L158 Benchmark]: Toolchain (without parser) took 36442.99ms. Allocated memory was 155.2MB in the beginning and 1.0GB in the end (delta: 893.4MB). Free memory was 95.9MB in the beginning and 669.9MB in the end (delta: -574.0MB). Peak memory consumption was 320.8MB. Max. memory is 16.1GB. [2024-10-10 23:20:20,871 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 155.2MB. Free memory is still 88.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-10 23:20:20,871 INFO L158 Benchmark]: CACSL2BoogieTranslator took 800.94ms. Allocated memory was 155.2MB in the beginning and 224.4MB in the end (delta: 69.2MB). Free memory was 95.5MB in the beginning and 168.6MB in the end (delta: -73.1MB). Peak memory consumption was 34.7MB. Max. memory is 16.1GB. [2024-10-10 23:20:20,875 INFO L158 Benchmark]: Boogie Procedure Inliner took 133.31ms. Allocated memory is still 224.4MB. Free memory was 168.6MB in the beginning and 150.8MB in the end (delta: 17.7MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-10 23:20:20,876 INFO L158 Benchmark]: Boogie Preprocessor took 199.36ms. Allocated memory is still 224.4MB. Free memory was 150.8MB in the beginning and 125.7MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-10-10 23:20:20,876 INFO L158 Benchmark]: RCFGBuilder took 1873.26ms. Allocated memory was 224.4MB in the beginning and 352.3MB in the end (delta: 127.9MB). Free memory was 125.7MB in the beginning and 227.0MB in the end (delta: -101.4MB). Peak memory consumption was 45.3MB. Max. memory is 16.1GB. [2024-10-10 23:20:20,876 INFO L158 Benchmark]: TraceAbstraction took 33232.08ms. Allocated memory was 352.3MB in the beginning and 1.0GB in the end (delta: 696.3MB). Free memory was 227.0MB in the beginning and 687.7MB in the end (delta: -460.7MB). Peak memory consumption was 588.4MB. Max. memory is 16.1GB. [2024-10-10 23:20:20,876 INFO L158 Benchmark]: Witness Printer took 197.54ms. Allocated memory is still 1.0GB. Free memory was 686.7MB in the beginning and 669.9MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-10 23:20:20,878 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.20ms. Allocated memory is still 155.2MB. Free memory is still 88.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 800.94ms. Allocated memory was 155.2MB in the beginning and 224.4MB in the end (delta: 69.2MB). Free memory was 95.5MB in the beginning and 168.6MB in the end (delta: -73.1MB). Peak memory consumption was 34.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 133.31ms. Allocated memory is still 224.4MB. Free memory was 168.6MB in the beginning and 150.8MB in the end (delta: 17.7MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Preprocessor took 199.36ms. Allocated memory is still 224.4MB. Free memory was 150.8MB in the beginning and 125.7MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1873.26ms. Allocated memory was 224.4MB in the beginning and 352.3MB in the end (delta: 127.9MB). Free memory was 125.7MB in the beginning and 227.0MB in the end (delta: -101.4MB). Peak memory consumption was 45.3MB. Max. memory is 16.1GB. * TraceAbstraction took 33232.08ms. Allocated memory was 352.3MB in the beginning and 1.0GB in the end (delta: 696.3MB). Free memory was 227.0MB in the beginning and 687.7MB in the end (delta: -460.7MB). Peak memory consumption was 588.4MB. Max. memory is 16.1GB. * Witness Printer took 197.54ms. Allocated memory is still 1.0GB. Free memory was 686.7MB in the beginning and 669.9MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 124]: 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: 27.8s, OverallIterations: 21, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 17.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3846 SdHoareTripleChecker+Valid, 15.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3846 mSDsluCounter, 4863 SdHoareTripleChecker+Invalid, 12.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 510 mSDsCounter, 1972 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 13827 IncrementalHoareTripleChecker+Invalid, 15799 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1972 mSolverCounterUnsat, 4353 mSDtfsCounter, 13827 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 580 GetRequests, 547 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=19062occurred in iteration=18, InterpolantAutomatonStates: 68, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.4s AutomataMinimizationTime, 21 MinimizatonAttempts, 19275 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 5.9s InterpolantComputationTime, 5167 NumberOfCodeBlocks, 5167 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 5144 ConstructedInterpolants, 0 QuantifiedInterpolants, 14047 SizeOfPredicates, 0 NumberOfNonLiveVariables, 737 ConjunctsInSsa, 5 ConjunctsInUnsatCore, 23 InterpolantComputations, 21 PerfectInterpolantSequences, 3453/3514 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: (((((((((((((((((((((long long) a23 + 43) <= 0) && (a29 <= 384312)) && (a4 == 0)) && (a25 <= 9)) || (((a25 == 11) && (a29 <= 599999)) && (a4 == 1))) || (((a4 == 0) && (a25 <= 10)) && (a29 <= 220))) || (((a25 == 13) && (a29 <= 384312)) && (a4 == 1))) || (((a29 <= 384312) && (a4 == 1)) && (a25 <= 9))) || (((a29 <= 244) && (a25 <= 10)) && (a4 == 1))) || (((a29 <= 275) && (a25 == 12)) && (a4 == 0))) || ((((a25 == 13) && (a4 == 0)) && (((long long) 35913 + a29) <= 0)) && (a23 <= 137))) || ((((307 <= a23) && (a25 <= 10)) && (a29 <= 599999)) && (a4 == 1))) || (((a25 == 12) && (a29 <= 599999)) && (a4 == 1))) || ((((a25 <= 10) && (a29 <= 599999)) && (381712 <= a29)) && (a4 == 1))) || ((a29 <= 599999) && ((((((long long) a23 + 43) <= 0) && (a29 <= 275)) && (a4 == 1)) || (((((long long) a23 + 43) <= 0) && (a25 <= 10)) && (a4 == 1))))) || (((a25 == 11) && (a4 == 1)) && (a23 <= 137))) || ((((a25 == 12) && (a4 == 0)) && (a29 <= 599999)) && (a23 <= 137))) || (((a4 == 0) && (a25 == 11)) && (a29 <= 599999))) || ((((a25 == 13) && (((long long) a23 + 43) <= 0)) && (a29 <= 275)) && (a4 == 0))) RESULT: Ultimate proved your program to be correct! [2024-10-10 23:20:20,906 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE