./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem17_label43.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem17_label43.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b76d5bd3a937dd443771d4fd333665d0cd3fbe44dd72d1f97738d181d0765bea --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 04:19:57,029 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 04:19:57,115 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 04:19:57,119 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 04:19:57,119 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 04:19:57,152 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 04:19:57,153 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 04:19:57,153 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 04:19:57,154 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 04:19:57,155 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 04:19:57,156 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 04:19:57,156 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 04:19:57,157 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 04:19:57,159 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 04:19:57,160 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 04:19:57,160 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 04:19:57,160 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 04:19:57,160 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 04:19:57,161 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 04:19:57,161 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 04:19:57,161 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 04:19:57,162 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 04:19:57,162 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 04:19:57,163 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 04:19:57,163 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 04:19:57,163 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 04:19:57,163 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 04:19:57,164 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 04:19:57,164 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 04:19:57,164 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 04:19:57,165 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 04:19:57,165 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 04:19:57,165 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 04:19:57,166 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 04:19:57,166 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 04:19:57,167 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 04:19:57,167 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 04:19:57,167 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 04:19:57,168 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 04:19:57,168 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 04:19:57,168 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 04:19:57,169 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 04:19:57,170 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b76d5bd3a937dd443771d4fd333665d0cd3fbe44dd72d1f97738d181d0765bea [2024-11-16 04:19:57,450 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 04:19:57,476 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 04:19:57,479 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 04:19:57,480 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 04:19:57,481 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 04:19:57,482 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem17_label43.c [2024-11-16 04:19:59,003 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 04:19:59,390 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 04:19:59,391 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label43.c [2024-11-16 04:19:59,418 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8da3dedb8/5d85a876bec74e419978c3d14966695c/FLAGaf74e5037 [2024-11-16 04:19:59,436 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8da3dedb8/5d85a876bec74e419978c3d14966695c [2024-11-16 04:19:59,440 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 04:19:59,441 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 04:19:59,442 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 04:19:59,445 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 04:19:59,450 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 04:19:59,451 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 04:19:59" (1/1) ... [2024-11-16 04:19:59,452 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ac2dceb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:19:59, skipping insertion in model container [2024-11-16 04:19:59,452 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 04:19:59" (1/1) ... [2024-11-16 04:19:59,534 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 04:19:59,817 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label43.c[9211,9224] [2024-11-16 04:20:00,362 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 04:20:00,372 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 04:20:00,408 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label43.c[9211,9224] [2024-11-16 04:20:00,671 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 04:20:00,695 INFO L204 MainTranslator]: Completed translation [2024-11-16 04:20:00,696 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:20:00 WrapperNode [2024-11-16 04:20:00,696 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 04:20:00,697 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 04:20:00,697 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 04:20:00,697 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 04:20:00,704 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:20:00" (1/1) ... [2024-11-16 04:20:00,761 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:20:00" (1/1) ... [2024-11-16 04:20:01,089 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 2612 [2024-11-16 04:20:01,090 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 04:20:01,090 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 04:20:01,091 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 04:20:01,091 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 04:20:01,105 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:20:00" (1/1) ... [2024-11-16 04:20:01,105 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:20:00" (1/1) ... [2024-11-16 04:20:01,284 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:20:00" (1/1) ... [2024-11-16 04:20:01,430 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-16 04:20:01,434 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:20:00" (1/1) ... [2024-11-16 04:20:01,434 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:20:00" (1/1) ... [2024-11-16 04:20:01,561 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:20:00" (1/1) ... [2024-11-16 04:20:01,574 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:20:00" (1/1) ... [2024-11-16 04:20:01,592 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:20:00" (1/1) ... [2024-11-16 04:20:01,603 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:20:00" (1/1) ... [2024-11-16 04:20:01,643 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 04:20:01,645 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 04:20:01,645 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 04:20:01,645 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 04:20:01,646 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:20:00" (1/1) ... [2024-11-16 04:20:01,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 04:20:01,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 04:20:01,686 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-16 04:20:01,688 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-16 04:20:01,733 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 04:20:01,734 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 04:20:01,734 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 04:20:01,734 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 04:20:01,794 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 04:20:01,796 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 04:20:05,125 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L1653: havoc calculate_output_#t~ret7#1; [2024-11-16 04:20:05,240 INFO L? ?]: Removed 372 outVars from TransFormulas that were not future-live. [2024-11-16 04:20:05,241 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 04:20:05,276 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 04:20:05,277 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 04:20:05,277 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 04:20:05 BoogieIcfgContainer [2024-11-16 04:20:05,277 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 04:20:05,279 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 04:20:05,282 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 04:20:05,286 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 04:20:05,286 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 04:19:59" (1/3) ... [2024-11-16 04:20:05,287 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@322cab4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 04:20:05, skipping insertion in model container [2024-11-16 04:20:05,288 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:20:00" (2/3) ... [2024-11-16 04:20:05,288 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@322cab4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 04:20:05, skipping insertion in model container [2024-11-16 04:20:05,289 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 04:20:05" (3/3) ... [2024-11-16 04:20:05,290 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem17_label43.c [2024-11-16 04:20:05,308 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 04:20:05,308 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 04:20:05,398 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 04:20:05,405 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;@3fdd5717, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 04:20:05,406 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 04:20:05,412 INFO L276 IsEmpty]: Start isEmpty. Operand has 593 states, 591 states have (on average 1.8020304568527918) internal successors, (1065), 592 states have internal predecessors, (1065), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 04:20:05,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-16 04:20:05,421 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 04:20:05,421 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 04:20:05,422 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 04:20:05,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 04:20:05,427 INFO L85 PathProgramCache]: Analyzing trace with hash -140900316, now seen corresponding path program 1 times [2024-11-16 04:20:05,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 04:20:05,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429331545] [2024-11-16 04:20:05,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 04:20:05,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 04:20:05,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 04:20:05,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 04:20:05,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 04:20:05,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429331545] [2024-11-16 04:20:05,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429331545] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 04:20:05,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 04:20:05,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 04:20:05,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471196896] [2024-11-16 04:20:05,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 04:20:05,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 04:20:05,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 04:20:05,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 04:20:05,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 04:20:05,890 INFO L87 Difference]: Start difference. First operand has 593 states, 591 states have (on average 1.8020304568527918) internal successors, (1065), 592 states have internal predecessors, (1065), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 2 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 04:20:08,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 04:20:08,393 INFO L93 Difference]: Finished difference Result 1648 states and 3030 transitions. [2024-11-16 04:20:08,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 04:20:08,396 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 2 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2024-11-16 04:20:08,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 04:20:08,419 INFO L225 Difference]: With dead ends: 1648 [2024-11-16 04:20:08,419 INFO L226 Difference]: Without dead ends: 978 [2024-11-16 04:20:08,424 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-11-16 04:20:08,427 INFO L432 NwaCegarLoop]: 477 mSDtfsCounter, 428 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 1413 mSolverCounterSat, 372 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 428 SdHoareTripleChecker+Valid, 555 SdHoareTripleChecker+Invalid, 1785 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 372 IncrementalHoareTripleChecker+Valid, 1413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-16 04:20:08,428 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [428 Valid, 555 Invalid, 1785 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [372 Valid, 1413 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-16 04:20:08,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 978 states. [2024-11-16 04:20:08,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 978 to 975. [2024-11-16 04:20:08,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 975 states, 974 states have (on average 1.5061601642710472) internal successors, (1467), 974 states have internal predecessors, (1467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 04:20:08,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 975 states to 975 states and 1467 transitions. [2024-11-16 04:20:08,535 INFO L78 Accepts]: Start accepts. Automaton has 975 states and 1467 transitions. Word has length 64 [2024-11-16 04:20:08,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 04:20:08,535 INFO L471 AbstractCegarLoop]: Abstraction has 975 states and 1467 transitions. [2024-11-16 04:20:08,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 2 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 04:20:08,536 INFO L276 IsEmpty]: Start isEmpty. Operand 975 states and 1467 transitions. [2024-11-16 04:20:08,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-16 04:20:08,541 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 04:20:08,542 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 04:20:08,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 04:20:08,543 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 04:20:08,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 04:20:08,544 INFO L85 PathProgramCache]: Analyzing trace with hash -1341393313, now seen corresponding path program 1 times [2024-11-16 04:20:08,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 04:20:08,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575655805] [2024-11-16 04:20:08,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 04:20:08,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 04:20:08,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 04:20:08,946 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 04:20:08,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 04:20:08,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575655805] [2024-11-16 04:20:08,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575655805] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 04:20:08,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 04:20:08,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 04:20:08,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168817809] [2024-11-16 04:20:08,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 04:20:08,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 04:20:08,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 04:20:08,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 04:20:08,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 04:20:08,954 INFO L87 Difference]: Start difference. First operand 975 states and 1467 transitions. Second operand has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 04:20:11,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 04:20:11,274 INFO L93 Difference]: Finished difference Result 2822 states and 4250 transitions. [2024-11-16 04:20:11,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 04:20:11,279 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 0 states have call successors, (0), 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 135 [2024-11-16 04:20:11,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 04:20:11,288 INFO L225 Difference]: With dead ends: 2822 [2024-11-16 04:20:11,289 INFO L226 Difference]: Without dead ends: 1849 [2024-11-16 04:20:11,292 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 04:20:11,294 INFO L432 NwaCegarLoop]: 856 mSDtfsCounter, 429 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 1283 mSolverCounterSat, 414 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 429 SdHoareTripleChecker+Valid, 926 SdHoareTripleChecker+Invalid, 1697 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 414 IncrementalHoareTripleChecker+Valid, 1283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-16 04:20:11,295 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [429 Valid, 926 Invalid, 1697 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [414 Valid, 1283 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-16 04:20:11,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1849 states. [2024-11-16 04:20:11,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1849 to 1847. [2024-11-16 04:20:11,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1847 states, 1846 states have (on average 1.3591549295774648) internal successors, (2509), 1846 states have internal predecessors, (2509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 04:20:11,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1847 states to 1847 states and 2509 transitions. [2024-11-16 04:20:11,342 INFO L78 Accepts]: Start accepts. Automaton has 1847 states and 2509 transitions. Word has length 135 [2024-11-16 04:20:11,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 04:20:11,343 INFO L471 AbstractCegarLoop]: Abstraction has 1847 states and 2509 transitions. [2024-11-16 04:20:11,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 04:20:11,344 INFO L276 IsEmpty]: Start isEmpty. Operand 1847 states and 2509 transitions. [2024-11-16 04:20:11,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-16 04:20:11,349 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 04:20:11,349 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-11-16 04:20:11,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 04:20:11,350 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 04:20:11,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 04:20:11,350 INFO L85 PathProgramCache]: Analyzing trace with hash -738193516, now seen corresponding path program 1 times [2024-11-16 04:20:11,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 04:20:11,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295439224] [2024-11-16 04:20:11,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 04:20:11,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 04:20:11,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 04:20:11,570 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 04:20:11,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 04:20:11,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295439224] [2024-11-16 04:20:11,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295439224] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 04:20:11,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 04:20:11,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 04:20:11,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645074784] [2024-11-16 04:20:11,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 04:20:11,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 04:20:11,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 04:20:11,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 04:20:11,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 04:20:11,577 INFO L87 Difference]: Start difference. First operand 1847 states and 2509 transitions. Second operand has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 2 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 04:20:13,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 04:20:13,805 INFO L93 Difference]: Finished difference Result 5409 states and 7340 transitions. [2024-11-16 04:20:13,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 04:20:13,808 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 2 states have internal predecessors, (157), 0 states have call successors, (0), 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 157 [2024-11-16 04:20:13,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 04:20:13,817 INFO L225 Difference]: With dead ends: 5409 [2024-11-16 04:20:13,818 INFO L226 Difference]: Without dead ends: 2708 [2024-11-16 04:20:13,822 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-11-16 04:20:13,824 INFO L432 NwaCegarLoop]: 517 mSDtfsCounter, 369 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 1081 mSolverCounterSat, 548 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 369 SdHoareTripleChecker+Valid, 593 SdHoareTripleChecker+Invalid, 1629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 548 IncrementalHoareTripleChecker+Valid, 1081 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-16 04:20:13,825 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [369 Valid, 593 Invalid, 1629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [548 Valid, 1081 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-16 04:20:13,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2708 states. [2024-11-16 04:20:13,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2708 to 2708. [2024-11-16 04:20:13,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2708 states, 2707 states have (on average 1.1913557443664573) internal successors, (3225), 2707 states have internal predecessors, (3225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 04:20:13,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2708 states to 2708 states and 3225 transitions. [2024-11-16 04:20:13,876 INFO L78 Accepts]: Start accepts. Automaton has 2708 states and 3225 transitions. Word has length 157 [2024-11-16 04:20:13,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 04:20:13,876 INFO L471 AbstractCegarLoop]: Abstraction has 2708 states and 3225 transitions. [2024-11-16 04:20:13,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 2 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 04:20:13,878 INFO L276 IsEmpty]: Start isEmpty. Operand 2708 states and 3225 transitions. [2024-11-16 04:20:13,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2024-11-16 04:20:13,885 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 04:20:13,885 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 04:20:13,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 04:20:13,885 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 04:20:13,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 04:20:13,886 INFO L85 PathProgramCache]: Analyzing trace with hash 408067859, now seen corresponding path program 1 times [2024-11-16 04:20:13,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 04:20:13,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14970270] [2024-11-16 04:20:13,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 04:20:13,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 04:20:13,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 04:20:14,134 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 190 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 04:20:14,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 04:20:14,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14970270] [2024-11-16 04:20:14,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14970270] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 04:20:14,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 04:20:14,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 04:20:14,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873814261] [2024-11-16 04:20:14,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 04:20:14,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 04:20:14,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 04:20:14,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 04:20:14,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 04:20:14,140 INFO L87 Difference]: Start difference. First operand 2708 states and 3225 transitions. Second operand has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 3 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 04:20:15,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 04:20:15,785 INFO L93 Difference]: Finished difference Result 7126 states and 8616 transitions. [2024-11-16 04:20:15,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 04:20:15,786 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 3 states have internal predecessors, (218), 0 states have call successors, (0), 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 218 [2024-11-16 04:20:15,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 04:20:15,802 INFO L225 Difference]: With dead ends: 7126 [2024-11-16 04:20:15,802 INFO L226 Difference]: Without dead ends: 4420 [2024-11-16 04:20:15,807 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 04:20:15,808 INFO L432 NwaCegarLoop]: 729 mSDtfsCounter, 496 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 1136 mSolverCounterSat, 306 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 496 SdHoareTripleChecker+Valid, 789 SdHoareTripleChecker+Invalid, 1442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 306 IncrementalHoareTripleChecker+Valid, 1136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-16 04:20:15,810 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [496 Valid, 789 Invalid, 1442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [306 Valid, 1136 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-16 04:20:15,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4420 states. [2024-11-16 04:20:15,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4420 to 4420. [2024-11-16 04:20:15,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4420 states, 4419 states have (on average 1.170174247567323) internal successors, (5171), 4419 states have internal predecessors, (5171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 04:20:15,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4420 states to 4420 states and 5171 transitions. [2024-11-16 04:20:15,889 INFO L78 Accepts]: Start accepts. Automaton has 4420 states and 5171 transitions. Word has length 218 [2024-11-16 04:20:15,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 04:20:15,889 INFO L471 AbstractCegarLoop]: Abstraction has 4420 states and 5171 transitions. [2024-11-16 04:20:15,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 3 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 04:20:15,890 INFO L276 IsEmpty]: Start isEmpty. Operand 4420 states and 5171 transitions. [2024-11-16 04:20:15,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2024-11-16 04:20:15,894 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 04:20:15,894 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 04:20:15,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-16 04:20:15,895 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 04:20:15,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 04:20:15,895 INFO L85 PathProgramCache]: Analyzing trace with hash -1502428242, now seen corresponding path program 1 times [2024-11-16 04:20:15,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 04:20:15,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090113684] [2024-11-16 04:20:15,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 04:20:15,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 04:20:15,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 04:20:16,069 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2024-11-16 04:20:16,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 04:20:16,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090113684] [2024-11-16 04:20:16,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090113684] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 04:20:16,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 04:20:16,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 04:20:16,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873348484] [2024-11-16 04:20:16,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 04:20:16,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 04:20:16,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 04:20:16,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 04:20:16,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 04:20:16,075 INFO L87 Difference]: Start difference. First operand 4420 states and 5171 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-11-16 04:20:18,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 04:20:18,033 INFO L93 Difference]: Finished difference Result 10963 states and 12997 transitions. [2024-11-16 04:20:18,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 04:20:18,034 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 220 [2024-11-16 04:20:18,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 04:20:18,056 INFO L225 Difference]: With dead ends: 10963 [2024-11-16 04:20:18,057 INFO L226 Difference]: Without dead ends: 6544 [2024-11-16 04:20:18,064 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 04:20:18,066 INFO L432 NwaCegarLoop]: 385 mSDtfsCounter, 389 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 1215 mSolverCounterSat, 274 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 389 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 1489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 274 IncrementalHoareTripleChecker+Valid, 1215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-16 04:20:18,067 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [389 Valid, 449 Invalid, 1489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [274 Valid, 1215 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-16 04:20:18,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6544 states. [2024-11-16 04:20:18,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6544 to 4393. [2024-11-16 04:20:18,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4393 states, 4392 states have (on average 1.1680327868852458) internal successors, (5130), 4392 states have internal predecessors, (5130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 04:20:18,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4393 states to 4393 states and 5130 transitions. [2024-11-16 04:20:18,163 INFO L78 Accepts]: Start accepts. Automaton has 4393 states and 5130 transitions. Word has length 220 [2024-11-16 04:20:18,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 04:20:18,164 INFO L471 AbstractCegarLoop]: Abstraction has 4393 states and 5130 transitions. [2024-11-16 04:20:18,165 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-11-16 04:20:18,165 INFO L276 IsEmpty]: Start isEmpty. Operand 4393 states and 5130 transitions. [2024-11-16 04:20:18,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2024-11-16 04:20:18,169 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 04:20:18,170 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 04:20:18,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-16 04:20:18,170 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 04:20:18,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 04:20:18,171 INFO L85 PathProgramCache]: Analyzing trace with hash -1979759818, now seen corresponding path program 1 times [2024-11-16 04:20:18,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 04:20:18,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439431598] [2024-11-16 04:20:18,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 04:20:18,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 04:20:18,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 04:20:18,535 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2024-11-16 04:20:18,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 04:20:18,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439431598] [2024-11-16 04:20:18,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439431598] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 04:20:18,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 04:20:18,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 04:20:18,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168262827] [2024-11-16 04:20:18,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 04:20:18,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 04:20:18,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 04:20:18,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 04:20:18,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 04:20:18,540 INFO L87 Difference]: Start difference. First operand 4393 states and 5130 transitions. Second operand has 3 states, 3 states have (on average 68.0) internal successors, (204), 3 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 04:20:20,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 04:20:20,322 INFO L93 Difference]: Finished difference Result 10070 states and 11731 transitions. [2024-11-16 04:20:20,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 04:20:20,323 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 68.0) internal successors, (204), 3 states have internal predecessors, (204), 0 states have call successors, (0), 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 286 [2024-11-16 04:20:20,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 04:20:20,343 INFO L225 Difference]: With dead ends: 10070 [2024-11-16 04:20:20,343 INFO L226 Difference]: Without dead ends: 5679 [2024-11-16 04:20:20,350 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 04:20:20,351 INFO L432 NwaCegarLoop]: 836 mSDtfsCounter, 374 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 1342 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 374 SdHoareTripleChecker+Valid, 899 SdHoareTripleChecker+Invalid, 1409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 1342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-16 04:20:20,351 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [374 Valid, 899 Invalid, 1409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 1342 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-16 04:20:20,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5679 states. [2024-11-16 04:20:20,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5679 to 5247. [2024-11-16 04:20:20,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5247 states, 5246 states have (on average 1.1584064048799085) internal successors, (6077), 5246 states have internal predecessors, (6077), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 04:20:20,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5247 states to 5247 states and 6077 transitions. [2024-11-16 04:20:20,443 INFO L78 Accepts]: Start accepts. Automaton has 5247 states and 6077 transitions. Word has length 286 [2024-11-16 04:20:20,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 04:20:20,444 INFO L471 AbstractCegarLoop]: Abstraction has 5247 states and 6077 transitions. [2024-11-16 04:20:20,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.0) internal successors, (204), 3 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 04:20:20,444 INFO L276 IsEmpty]: Start isEmpty. Operand 5247 states and 6077 transitions. [2024-11-16 04:20:20,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2024-11-16 04:20:20,448 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 04:20:20,449 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2024-11-16 04:20:20,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-16 04:20:20,449 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 04:20:20,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 04:20:20,450 INFO L85 PathProgramCache]: Analyzing trace with hash -1708511384, now seen corresponding path program 1 times [2024-11-16 04:20:20,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 04:20:20,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730157949] [2024-11-16 04:20:20,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 04:20:20,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 04:20:20,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 04:20:20,680 INFO L134 CoverageAnalysis]: Checked inductivity of 399 backedges. 256 proven. 0 refuted. 0 times theorem prover too weak. 143 trivial. 0 not checked. [2024-11-16 04:20:20,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 04:20:20,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730157949] [2024-11-16 04:20:20,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730157949] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 04:20:20,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 04:20:20,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 04:20:20,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190422496] [2024-11-16 04:20:20,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 04:20:20,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 04:20:20,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 04:20:20,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 04:20:20,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 04:20:20,683 INFO L87 Difference]: Start difference. First operand 5247 states and 6077 transitions. Second operand has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 04:20:22,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 04:20:22,415 INFO L93 Difference]: Finished difference Result 12624 states and 14814 transitions. [2024-11-16 04:20:22,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 04:20:22,416 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 299 [2024-11-16 04:20:22,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 04:20:22,441 INFO L225 Difference]: With dead ends: 12624 [2024-11-16 04:20:22,442 INFO L226 Difference]: Without dead ends: 6953 [2024-11-16 04:20:22,451 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 04:20:22,452 INFO L432 NwaCegarLoop]: 781 mSDtfsCounter, 383 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 1199 mSolverCounterSat, 258 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 383 SdHoareTripleChecker+Valid, 852 SdHoareTripleChecker+Invalid, 1457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 258 IncrementalHoareTripleChecker+Valid, 1199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-16 04:20:22,452 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [383 Valid, 852 Invalid, 1457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [258 Valid, 1199 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-16 04:20:22,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6953 states. [2024-11-16 04:20:22,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6953 to 6953. [2024-11-16 04:20:22,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6953 states, 6952 states have (on average 1.131904487917146) internal successors, (7869), 6952 states have internal predecessors, (7869), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 04:20:22,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6953 states to 6953 states and 7869 transitions. [2024-11-16 04:20:22,617 INFO L78 Accepts]: Start accepts. Automaton has 6953 states and 7869 transitions. Word has length 299 [2024-11-16 04:20:22,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 04:20:22,618 INFO L471 AbstractCegarLoop]: Abstraction has 6953 states and 7869 transitions. [2024-11-16 04:20:22,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 04:20:22,618 INFO L276 IsEmpty]: Start isEmpty. Operand 6953 states and 7869 transitions. [2024-11-16 04:20:22,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2024-11-16 04:20:22,625 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 04:20:22,625 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 04:20:22,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-16 04:20:22,626 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 04:20:22,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 04:20:22,626 INFO L85 PathProgramCache]: Analyzing trace with hash 1130500907, now seen corresponding path program 1 times [2024-11-16 04:20:22,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 04:20:22,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920349505] [2024-11-16 04:20:22,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 04:20:22,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 04:20:22,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 04:20:22,892 INFO L134 CoverageAnalysis]: Checked inductivity of 433 backedges. 182 proven. 0 refuted. 0 times theorem prover too weak. 251 trivial. 0 not checked. [2024-11-16 04:20:22,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 04:20:22,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920349505] [2024-11-16 04:20:22,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920349505] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 04:20:22,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 04:20:22,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 04:20:22,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897257470] [2024-11-16 04:20:22,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 04:20:22,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 04:20:22,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 04:20:22,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 04:20:22,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 04:20:22,895 INFO L87 Difference]: Start difference. First operand 6953 states and 7869 transitions. Second operand has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 04:20:24,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 04:20:24,714 INFO L93 Difference]: Finished difference Result 17321 states and 19725 transitions. [2024-11-16 04:20:24,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 04:20:24,715 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 0 states have call successors, (0), 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 339 [2024-11-16 04:20:24,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 04:20:24,738 INFO L225 Difference]: With dead ends: 17321 [2024-11-16 04:20:24,739 INFO L226 Difference]: Without dead ends: 9491 [2024-11-16 04:20:24,748 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 04:20:24,750 INFO L432 NwaCegarLoop]: 613 mSDtfsCounter, 483 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 1183 mSolverCounterSat, 348 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 483 SdHoareTripleChecker+Valid, 645 SdHoareTripleChecker+Invalid, 1531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 348 IncrementalHoareTripleChecker+Valid, 1183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-16 04:20:24,750 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [483 Valid, 645 Invalid, 1531 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [348 Valid, 1183 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-16 04:20:24,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9491 states. [2024-11-16 04:20:24,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9491 to 9060. [2024-11-16 04:20:24,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9060 states, 9059 states have (on average 1.1246274423225522) internal successors, (10188), 9059 states have internal predecessors, (10188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 04:20:24,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9060 states to 9060 states and 10188 transitions. [2024-11-16 04:20:24,934 INFO L78 Accepts]: Start accepts. Automaton has 9060 states and 10188 transitions. Word has length 339 [2024-11-16 04:20:24,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 04:20:24,935 INFO L471 AbstractCegarLoop]: Abstraction has 9060 states and 10188 transitions. [2024-11-16 04:20:24,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 04:20:24,936 INFO L276 IsEmpty]: Start isEmpty. Operand 9060 states and 10188 transitions. [2024-11-16 04:20:24,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 405 [2024-11-16 04:20:24,943 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 04:20:24,943 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 04:20:24,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-16 04:20:24,944 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 04:20:24,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 04:20:24,945 INFO L85 PathProgramCache]: Analyzing trace with hash 378292278, now seen corresponding path program 1 times [2024-11-16 04:20:24,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 04:20:24,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572398600] [2024-11-16 04:20:24,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 04:20:24,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 04:20:25,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 04:20:25,339 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 04:20:25,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 04:20:25,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572398600] [2024-11-16 04:20:25,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572398600] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 04:20:25,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 04:20:25,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 04:20:25,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149283046] [2024-11-16 04:20:25,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 04:20:25,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 04:20:25,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 04:20:25,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 04:20:25,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-16 04:20:25,343 INFO L87 Difference]: Start difference. First operand 9060 states and 10188 transitions. Second operand has 4 states, 4 states have (on average 101.0) internal successors, (404), 3 states have internal predecessors, (404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 04:20:27,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 04:20:27,317 INFO L93 Difference]: Finished difference Result 23257 states and 26113 transitions. [2024-11-16 04:20:27,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 04:20:27,318 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 101.0) internal successors, (404), 3 states have internal predecessors, (404), 0 states have call successors, (0), 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 404 [2024-11-16 04:20:27,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 04:20:27,344 INFO L225 Difference]: With dead ends: 23257 [2024-11-16 04:20:27,345 INFO L226 Difference]: Without dead ends: 13773 [2024-11-16 04:20:27,357 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-16 04:20:27,358 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 590 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 2301 mSolverCounterSat, 257 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 590 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 2558 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 257 IncrementalHoareTripleChecker+Valid, 2301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-16 04:20:27,358 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [590 Valid, 185 Invalid, 2558 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [257 Valid, 2301 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-16 04:20:27,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13773 states. [2024-11-16 04:20:27,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13773 to 13770. [2024-11-16 04:20:27,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13770 states, 13769 states have (on average 1.124990921635558) internal successors, (15490), 13769 states have internal predecessors, (15490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 04:20:27,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13770 states to 13770 states and 15490 transitions. [2024-11-16 04:20:27,646 INFO L78 Accepts]: Start accepts. Automaton has 13770 states and 15490 transitions. Word has length 404 [2024-11-16 04:20:27,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 04:20:27,647 INFO L471 AbstractCegarLoop]: Abstraction has 13770 states and 15490 transitions. [2024-11-16 04:20:27,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 101.0) internal successors, (404), 3 states have internal predecessors, (404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 04:20:27,647 INFO L276 IsEmpty]: Start isEmpty. Operand 13770 states and 15490 transitions. [2024-11-16 04:20:27,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 411 [2024-11-16 04:20:27,656 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 04:20:27,657 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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-11-16 04:20:27,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-16 04:20:27,657 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 04:20:27,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 04:20:27,657 INFO L85 PathProgramCache]: Analyzing trace with hash 491199813, now seen corresponding path program 1 times [2024-11-16 04:20:27,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 04:20:27,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876774371] [2024-11-16 04:20:27,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 04:20:27,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 04:20:27,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 04:20:28,032 INFO L134 CoverageAnalysis]: Checked inductivity of 454 backedges. 182 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2024-11-16 04:20:28,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 04:20:28,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876774371] [2024-11-16 04:20:28,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876774371] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 04:20:28,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 04:20:28,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 04:20:28,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650792289] [2024-11-16 04:20:28,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 04:20:28,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 04:20:28,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 04:20:28,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 04:20:28,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 04:20:28,038 INFO L87 Difference]: Start difference. First operand 13770 states and 15490 transitions. Second operand has 3 states, 3 states have (on average 74.33333333333333) internal successors, (223), 3 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 04:20:29,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 04:20:29,813 INFO L93 Difference]: Finished difference Result 35661 states and 40055 transitions. [2024-11-16 04:20:29,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 04:20:29,814 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 74.33333333333333) internal successors, (223), 3 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 410 [2024-11-16 04:20:29,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 04:20:29,853 INFO L225 Difference]: With dead ends: 35661 [2024-11-16 04:20:29,853 INFO L226 Difference]: Without dead ends: 21893 [2024-11-16 04:20:29,871 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 04:20:29,872 INFO L432 NwaCegarLoop]: 725 mSDtfsCounter, 401 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 1324 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 401 SdHoareTripleChecker+Valid, 778 SdHoareTripleChecker+Invalid, 1431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 1324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-16 04:20:29,872 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [401 Valid, 778 Invalid, 1431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 1324 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-16 04:20:29,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21893 states. [2024-11-16 04:20:30,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21893 to 20596. [2024-11-16 04:20:30,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20596 states, 20595 states have (on average 1.116290361738286) internal successors, (22990), 20595 states have internal predecessors, (22990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 04:20:30,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20596 states to 20596 states and 22990 transitions. [2024-11-16 04:20:30,235 INFO L78 Accepts]: Start accepts. Automaton has 20596 states and 22990 transitions. Word has length 410 [2024-11-16 04:20:30,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 04:20:30,237 INFO L471 AbstractCegarLoop]: Abstraction has 20596 states and 22990 transitions. [2024-11-16 04:20:30,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 74.33333333333333) internal successors, (223), 3 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 04:20:30,237 INFO L276 IsEmpty]: Start isEmpty. Operand 20596 states and 22990 transitions. [2024-11-16 04:20:30,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 691 [2024-11-16 04:20:30,276 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 04:20:30,276 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 04:20:30,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-16 04:20:30,277 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 04:20:30,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 04:20:30,281 INFO L85 PathProgramCache]: Analyzing trace with hash -809738702, now seen corresponding path program 1 times [2024-11-16 04:20:30,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 04:20:30,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637514912] [2024-11-16 04:20:30,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 04:20:30,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 04:20:30,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 04:20:30,678 INFO L134 CoverageAnalysis]: Checked inductivity of 508 backedges. 364 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-16 04:20:30,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 04:20:30,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637514912] [2024-11-16 04:20:30,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637514912] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 04:20:30,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 04:20:30,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 04:20:30,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161171373] [2024-11-16 04:20:30,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 04:20:30,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 04:20:30,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 04:20:30,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 04:20:30,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 04:20:30,681 INFO L87 Difference]: Start difference. First operand 20596 states and 22990 transitions. Second operand has 3 states, 3 states have (on average 182.66666666666666) internal successors, (548), 3 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 04:20:32,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 04:20:32,425 INFO L93 Difference]: Finished difference Result 51007 states and 56982 transitions. [2024-11-16 04:20:32,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 04:20:32,426 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 182.66666666666666) internal successors, (548), 3 states have internal predecessors, (548), 0 states have call successors, (0), 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 690 [2024-11-16 04:20:32,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 04:20:32,473 INFO L225 Difference]: With dead ends: 51007 [2024-11-16 04:20:32,473 INFO L226 Difference]: Without dead ends: 30413 [2024-11-16 04:20:32,495 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 04:20:32,496 INFO L432 NwaCegarLoop]: 206 mSDtfsCounter, 486 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 1226 mSolverCounterSat, 192 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 486 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 1418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 192 IncrementalHoareTripleChecker+Valid, 1226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-16 04:20:32,496 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [486 Valid, 248 Invalid, 1418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [192 Valid, 1226 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-16 04:20:32,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30413 states. [2024-11-16 04:20:32,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30413 to 30400. [2024-11-16 04:20:32,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30400 states, 30399 states have (on average 1.1100036185400834) internal successors, (33743), 30399 states have internal predecessors, (33743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 04:20:32,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30400 states to 30400 states and 33743 transitions. [2024-11-16 04:20:32,944 INFO L78 Accepts]: Start accepts. Automaton has 30400 states and 33743 transitions. Word has length 690 [2024-11-16 04:20:32,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 04:20:32,945 INFO L471 AbstractCegarLoop]: Abstraction has 30400 states and 33743 transitions. [2024-11-16 04:20:32,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 182.66666666666666) internal successors, (548), 3 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 04:20:32,945 INFO L276 IsEmpty]: Start isEmpty. Operand 30400 states and 33743 transitions. [2024-11-16 04:20:32,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 804 [2024-11-16 04:20:32,997 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 04:20:32,998 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-16 04:20:32,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-16 04:20:32,999 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 04:20:32,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 04:20:32,999 INFO L85 PathProgramCache]: Analyzing trace with hash 855031016, now seen corresponding path program 1 times [2024-11-16 04:20:32,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 04:20:32,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477873614] [2024-11-16 04:20:33,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 04:20:33,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 04:20:33,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 04:20:33,401 INFO L134 CoverageAnalysis]: Checked inductivity of 895 backedges. 586 proven. 0 refuted. 0 times theorem prover too weak. 309 trivial. 0 not checked. [2024-11-16 04:20:33,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 04:20:33,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477873614] [2024-11-16 04:20:33,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477873614] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 04:20:33,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 04:20:33,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 04:20:33,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240611984] [2024-11-16 04:20:33,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 04:20:33,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 04:20:33,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 04:20:33,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 04:20:33,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 04:20:33,404 INFO L87 Difference]: Start difference. First operand 30400 states and 33743 transitions. Second operand has 3 states, 3 states have (on average 193.0) internal successors, (579), 3 states have internal predecessors, (579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 04:20:34,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 04:20:34,828 INFO L93 Difference]: Finished difference Result 67620 states and 75347 transitions. [2024-11-16 04:20:34,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 04:20:34,829 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 193.0) internal successors, (579), 3 states have internal predecessors, (579), 0 states have call successors, (0), 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 803 [2024-11-16 04:20:34,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 04:20:34,883 INFO L225 Difference]: With dead ends: 67620 [2024-11-16 04:20:34,883 INFO L226 Difference]: Without dead ends: 37222 [2024-11-16 04:20:34,907 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 04:20:34,908 INFO L432 NwaCegarLoop]: 661 mSDtfsCounter, 484 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 1151 mSolverCounterSat, 175 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 484 SdHoareTripleChecker+Valid, 707 SdHoareTripleChecker+Invalid, 1326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 175 IncrementalHoareTripleChecker+Valid, 1151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-16 04:20:34,908 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [484 Valid, 707 Invalid, 1326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [175 Valid, 1151 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-16 04:20:34,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37222 states. [2024-11-16 04:20:35,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37222 to 37218. [2024-11-16 04:20:35,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37218 states, 37217 states have (on average 1.1061074240266544) internal successors, (41166), 37217 states have internal predecessors, (41166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 04:20:35,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37218 states to 37218 states and 41166 transitions. [2024-11-16 04:20:35,336 INFO L78 Accepts]: Start accepts. Automaton has 37218 states and 41166 transitions. Word has length 803 [2024-11-16 04:20:35,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 04:20:35,337 INFO L471 AbstractCegarLoop]: Abstraction has 37218 states and 41166 transitions. [2024-11-16 04:20:35,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 193.0) internal successors, (579), 3 states have internal predecessors, (579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 04:20:35,337 INFO L276 IsEmpty]: Start isEmpty. Operand 37218 states and 41166 transitions. [2024-11-16 04:20:35,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 846 [2024-11-16 04:20:35,379 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 04:20:35,379 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-16 04:20:35,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-16 04:20:35,380 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 04:20:35,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 04:20:35,380 INFO L85 PathProgramCache]: Analyzing trace with hash 1497580927, now seen corresponding path program 1 times [2024-11-16 04:20:35,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 04:20:35,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139906795] [2024-11-16 04:20:35,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 04:20:35,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 04:20:35,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 04:20:37,132 INFO L134 CoverageAnalysis]: Checked inductivity of 665 backedges. 520 proven. 62 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2024-11-16 04:20:37,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 04:20:37,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139906795] [2024-11-16 04:20:37,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139906795] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 04:20:37,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1574247690] [2024-11-16 04:20:37,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 04:20:37,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 04:20:37,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 04:20:37,135 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 04:20:37,137 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-16 04:20:37,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 04:20:37,443 INFO L255 TraceCheckSpWp]: Trace formula consists of 981 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-16 04:20:37,478 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 04:20:38,049 INFO L134 CoverageAnalysis]: Checked inductivity of 665 backedges. 520 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-11-16 04:20:38,049 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 04:20:38,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1574247690] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 04:20:38,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-16 04:20:38,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2024-11-16 04:20:38,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753751136] [2024-11-16 04:20:38,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 04:20:38,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 04:20:38,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 04:20:38,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 04:20:38,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-16 04:20:38,052 INFO L87 Difference]: Start difference. First operand 37218 states and 41166 transitions. Second operand has 3 states, 3 states have (on average 234.0) internal successors, (702), 3 states have internal predecessors, (702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 04:20:39,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 04:20:39,328 INFO L93 Difference]: Finished difference Result 74432 states and 82328 transitions. [2024-11-16 04:20:39,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 04:20:39,329 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 234.0) internal successors, (702), 3 states have internal predecessors, (702), 0 states have call successors, (0), 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 845 [2024-11-16 04:20:39,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 04:20:39,378 INFO L225 Difference]: With dead ends: 74432 [2024-11-16 04:20:39,379 INFO L226 Difference]: Without dead ends: 37216 [2024-11-16 04:20:39,405 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 851 GetRequests, 845 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-16 04:20:39,406 INFO L432 NwaCegarLoop]: 639 mSDtfsCounter, 116 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 1144 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 698 SdHoareTripleChecker+Invalid, 1264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 1144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-16 04:20:39,406 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 698 Invalid, 1264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 1144 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-16 04:20:39,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37216 states. [2024-11-16 04:20:39,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37216 to 36790. [2024-11-16 04:20:39,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36790 states, 36789 states have (on average 1.0819810269373997) internal successors, (39805), 36789 states have internal predecessors, (39805), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 04:20:39,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36790 states to 36790 states and 39805 transitions. [2024-11-16 04:20:39,962 INFO L78 Accepts]: Start accepts. Automaton has 36790 states and 39805 transitions. Word has length 845 [2024-11-16 04:20:39,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 04:20:39,964 INFO L471 AbstractCegarLoop]: Abstraction has 36790 states and 39805 transitions. [2024-11-16 04:20:39,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 234.0) internal successors, (702), 3 states have internal predecessors, (702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 04:20:39,964 INFO L276 IsEmpty]: Start isEmpty. Operand 36790 states and 39805 transitions. [2024-11-16 04:20:40,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 850 [2024-11-16 04:20:40,009 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 04:20:40,010 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-16 04:20:40,033 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-16 04:20:40,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-16 04:20:40,212 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 04:20:40,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 04:20:40,213 INFO L85 PathProgramCache]: Analyzing trace with hash 1739856576, now seen corresponding path program 1 times [2024-11-16 04:20:40,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 04:20:40,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951471376] [2024-11-16 04:20:40,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 04:20:40,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 04:20:40,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 04:20:40,728 INFO L134 CoverageAnalysis]: Checked inductivity of 945 backedges. 612 proven. 0 refuted. 0 times theorem prover too weak. 333 trivial. 0 not checked. [2024-11-16 04:20:40,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 04:20:40,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951471376] [2024-11-16 04:20:40,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951471376] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 04:20:40,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 04:20:40,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 04:20:40,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419011163] [2024-11-16 04:20:40,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 04:20:40,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 04:20:40,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 04:20:40,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 04:20:40,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 04:20:40,732 INFO L87 Difference]: Start difference. First operand 36790 states and 39805 transitions. Second operand has 3 states, 3 states have (on average 200.66666666666666) internal successors, (602), 3 states have internal predecessors, (602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 04:20:42,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 04:20:42,288 INFO L93 Difference]: Finished difference Result 80398 states and 87112 transitions. [2024-11-16 04:20:42,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 04:20:42,289 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 200.66666666666666) internal successors, (602), 3 states have internal predecessors, (602), 0 states have call successors, (0), 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 849 [2024-11-16 04:20:42,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 04:20:42,341 INFO L225 Difference]: With dead ends: 80398 [2024-11-16 04:20:42,341 INFO L226 Difference]: Without dead ends: 43610 [2024-11-16 04:20:42,369 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 04:20:42,369 INFO L432 NwaCegarLoop]: 292 mSDtfsCounter, 459 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 1164 mSolverCounterSat, 196 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 459 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 1360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 196 IncrementalHoareTripleChecker+Valid, 1164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-16 04:20:42,370 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [459 Valid, 344 Invalid, 1360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [196 Valid, 1164 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-16 04:20:42,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43610 states. [2024-11-16 04:20:42,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43610 to 40624. [2024-11-16 04:20:42,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40624 states, 40623 states have (on average 1.0772468798463923) internal successors, (43761), 40623 states have internal predecessors, (43761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 04:20:42,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40624 states to 40624 states and 43761 transitions. [2024-11-16 04:20:42,973 INFO L78 Accepts]: Start accepts. Automaton has 40624 states and 43761 transitions. Word has length 849 [2024-11-16 04:20:42,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 04:20:42,973 INFO L471 AbstractCegarLoop]: Abstraction has 40624 states and 43761 transitions. [2024-11-16 04:20:42,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 200.66666666666666) internal successors, (602), 3 states have internal predecessors, (602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 04:20:42,974 INFO L276 IsEmpty]: Start isEmpty. Operand 40624 states and 43761 transitions. [2024-11-16 04:20:43,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 876 [2024-11-16 04:20:43,007 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 04:20:43,007 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 04:20:43,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-16 04:20:43,007 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 04:20:43,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 04:20:43,008 INFO L85 PathProgramCache]: Analyzing trace with hash 19473237, now seen corresponding path program 1 times [2024-11-16 04:20:43,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 04:20:43,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598323574] [2024-11-16 04:20:43,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 04:20:43,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 04:20:43,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 04:20:44,085 INFO L134 CoverageAnalysis]: Checked inductivity of 898 backedges. 243 proven. 0 refuted. 0 times theorem prover too weak. 655 trivial. 0 not checked. [2024-11-16 04:20:44,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 04:20:44,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598323574] [2024-11-16 04:20:44,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598323574] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 04:20:44,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 04:20:44,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 04:20:44,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280076553] [2024-11-16 04:20:44,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 04:20:44,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 04:20:44,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 04:20:44,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 04:20:44,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 04:20:44,088 INFO L87 Difference]: Start difference. First operand 40624 states and 43761 transitions. Second operand has 3 states, 3 states have (on average 157.0) internal successors, (471), 3 states have internal predecessors, (471), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 04:20:45,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 04:20:45,596 INFO L93 Difference]: Finished difference Result 86801 states and 93665 transitions. [2024-11-16 04:20:45,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 04:20:45,596 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 157.0) internal successors, (471), 3 states have internal predecessors, (471), 0 states have call successors, (0), 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 875 [2024-11-16 04:20:45,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 04:20:45,645 INFO L225 Difference]: With dead ends: 86801 [2024-11-16 04:20:45,645 INFO L226 Difference]: Without dead ends: 45753 [2024-11-16 04:20:45,676 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 04:20:45,676 INFO L432 NwaCegarLoop]: 706 mSDtfsCounter, 405 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 1219 mSolverCounterSat, 157 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 405 SdHoareTripleChecker+Valid, 766 SdHoareTripleChecker+Invalid, 1376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 157 IncrementalHoareTripleChecker+Valid, 1219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-16 04:20:45,676 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [405 Valid, 766 Invalid, 1376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [157 Valid, 1219 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-16 04:20:45,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45753 states. [2024-11-16 04:20:46,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45753 to 45319. [2024-11-16 04:20:46,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45319 states, 45318 states have (on average 1.074253056180767) internal successors, (48683), 45318 states have internal predecessors, (48683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 04:20:46,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45319 states to 45319 states and 48683 transitions. [2024-11-16 04:20:46,279 INFO L78 Accepts]: Start accepts. Automaton has 45319 states and 48683 transitions. Word has length 875 [2024-11-16 04:20:46,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 04:20:46,280 INFO L471 AbstractCegarLoop]: Abstraction has 45319 states and 48683 transitions. [2024-11-16 04:20:46,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 157.0) internal successors, (471), 3 states have internal predecessors, (471), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 04:20:46,280 INFO L276 IsEmpty]: Start isEmpty. Operand 45319 states and 48683 transitions. [2024-11-16 04:20:46,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 879 [2024-11-16 04:20:46,308 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 04:20:46,308 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 04:20:46,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-16 04:20:46,309 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 04:20:46,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 04:20:46,309 INFO L85 PathProgramCache]: Analyzing trace with hash -1538426383, now seen corresponding path program 1 times [2024-11-16 04:20:46,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 04:20:46,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748300635] [2024-11-16 04:20:46,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 04:20:46,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 04:20:46,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 04:20:47,571 INFO L134 CoverageAnalysis]: Checked inductivity of 901 backedges. 575 proven. 244 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2024-11-16 04:20:47,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 04:20:47,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748300635] [2024-11-16 04:20:47,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748300635] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 04:20:47,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1823287192] [2024-11-16 04:20:47,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 04:20:47,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 04:20:47,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 04:20:47,574 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 04:20:47,576 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-16 04:20:47,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 04:20:47,875 INFO L255 TraceCheckSpWp]: Trace formula consists of 1033 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-16 04:20:47,888 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 04:20:48,740 INFO L134 CoverageAnalysis]: Checked inductivity of 901 backedges. 575 proven. 244 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2024-11-16 04:20:48,740 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 04:20:50,857 INFO L134 CoverageAnalysis]: Checked inductivity of 901 backedges. 575 proven. 244 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2024-11-16 04:20:50,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1823287192] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 04:20:50,857 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 04:20:50,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2024-11-16 04:20:50,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191950506] [2024-11-16 04:20:50,858 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 04:20:50,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 04:20:50,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 04:20:50,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 04:20:50,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-16 04:20:50,862 INFO L87 Difference]: Start difference. First operand 45319 states and 48683 transitions. Second operand has 6 states, 6 states have (on average 240.83333333333334) internal successors, (1445), 6 states have internal predecessors, (1445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 04:20:54,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 04:20:54,062 INFO L93 Difference]: Finished difference Result 97879 states and 105351 transitions. [2024-11-16 04:20:54,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 04:20:54,062 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 240.83333333333334) internal successors, (1445), 6 states have internal predecessors, (1445), 0 states have call successors, (0), 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 878 [2024-11-16 04:20:54,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 04:20:54,126 INFO L225 Difference]: With dead ends: 97879 [2024-11-16 04:20:54,126 INFO L226 Difference]: Without dead ends: 52136 [2024-11-16 04:20:54,157 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1758 GetRequests, 1753 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-16 04:20:54,158 INFO L432 NwaCegarLoop]: 652 mSDtfsCounter, 441 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 4532 mSolverCounterSat, 208 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 441 SdHoareTripleChecker+Valid, 855 SdHoareTripleChecker+Invalid, 4740 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 208 IncrementalHoareTripleChecker+Valid, 4532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-11-16 04:20:54,159 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [441 Valid, 855 Invalid, 4740 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [208 Valid, 4532 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-11-16 04:20:54,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52136 states. [2024-11-16 04:20:54,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52136 to 45726. [2024-11-16 04:20:54,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45726 states, 45725 states have (on average 1.0704428649535265) internal successors, (48946), 45725 states have internal predecessors, (48946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 04:20:54,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45726 states to 45726 states and 48946 transitions. [2024-11-16 04:20:54,751 INFO L78 Accepts]: Start accepts. Automaton has 45726 states and 48946 transitions. Word has length 878 [2024-11-16 04:20:54,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 04:20:54,752 INFO L471 AbstractCegarLoop]: Abstraction has 45726 states and 48946 transitions. [2024-11-16 04:20:54,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 240.83333333333334) internal successors, (1445), 6 states have internal predecessors, (1445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 04:20:54,753 INFO L276 IsEmpty]: Start isEmpty. Operand 45726 states and 48946 transitions. [2024-11-16 04:20:54,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 935 [2024-11-16 04:20:54,782 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 04:20:54,782 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-16 04:20:54,795 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-16 04:20:54,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-16 04:20:54,983 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 04:20:54,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 04:20:54,984 INFO L85 PathProgramCache]: Analyzing trace with hash 2024232341, now seen corresponding path program 1 times [2024-11-16 04:20:54,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 04:20:54,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105140185] [2024-11-16 04:20:54,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 04:20:54,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 04:20:55,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 04:20:55,656 INFO L134 CoverageAnalysis]: Checked inductivity of 1454 backedges. 1121 proven. 0 refuted. 0 times theorem prover too weak. 333 trivial. 0 not checked. [2024-11-16 04:20:55,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 04:20:55,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105140185] [2024-11-16 04:20:55,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105140185] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 04:20:55,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 04:20:55,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 04:20:55,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867597569] [2024-11-16 04:20:55,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 04:20:55,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 04:20:55,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 04:20:55,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 04:20:55,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 04:20:55,659 INFO L87 Difference]: Start difference. First operand 45726 states and 48946 transitions. Second operand has 3 states, 3 states have (on average 221.66666666666666) internal successors, (665), 3 states have internal predecessors, (665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 04:20:57,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 04:20:57,101 INFO L93 Difference]: Finished difference Result 99567 states and 106917 transitions. [2024-11-16 04:20:57,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 04:20:57,102 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 221.66666666666666) internal successors, (665), 3 states have internal predecessors, (665), 0 states have call successors, (0), 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 934 [2024-11-16 04:20:57,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 04:20:57,160 INFO L225 Difference]: With dead ends: 99567 [2024-11-16 04:20:57,160 INFO L226 Difference]: Without dead ends: 53417 [2024-11-16 04:20:57,191 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 04:20:57,191 INFO L432 NwaCegarLoop]: 582 mSDtfsCounter, 195 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 1156 mSolverCounterSat, 187 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 619 SdHoareTripleChecker+Invalid, 1343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 187 IncrementalHoareTripleChecker+Valid, 1156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-16 04:20:57,191 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 619 Invalid, 1343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [187 Valid, 1156 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-16 04:20:57,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53417 states. [2024-11-16 04:20:57,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53417 to 52981. [2024-11-16 04:20:57,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52981 states, 52980 states have (on average 1.0739901849754625) internal successors, (56900), 52980 states have internal predecessors, (56900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 04:20:57,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52981 states to 52981 states and 56900 transitions. [2024-11-16 04:20:57,917 INFO L78 Accepts]: Start accepts. Automaton has 52981 states and 56900 transitions. Word has length 934 [2024-11-16 04:20:57,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 04:20:57,917 INFO L471 AbstractCegarLoop]: Abstraction has 52981 states and 56900 transitions. [2024-11-16 04:20:57,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 221.66666666666666) internal successors, (665), 3 states have internal predecessors, (665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 04:20:57,918 INFO L276 IsEmpty]: Start isEmpty. Operand 52981 states and 56900 transitions. [2024-11-16 04:20:57,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 944 [2024-11-16 04:20:57,966 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 04:20:57,966 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 04:20:57,966 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-16 04:20:57,967 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 04:20:57,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 04:20:57,967 INFO L85 PathProgramCache]: Analyzing trace with hash 854309976, now seen corresponding path program 1 times [2024-11-16 04:20:57,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 04:20:57,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234929874] [2024-11-16 04:20:57,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 04:20:57,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 04:20:58,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 04:20:58,859 INFO L134 CoverageAnalysis]: Checked inductivity of 1097 backedges. 244 proven. 0 refuted. 0 times theorem prover too weak. 853 trivial. 0 not checked. [2024-11-16 04:20:58,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 04:20:58,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234929874] [2024-11-16 04:20:58,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234929874] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 04:20:58,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 04:20:58,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 04:20:58,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984527942] [2024-11-16 04:20:58,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 04:20:58,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 04:20:58,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 04:20:58,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 04:20:58,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 04:20:58,864 INFO L87 Difference]: Start difference. First operand 52981 states and 56900 transitions. Second operand has 3 states, 3 states have (on average 134.33333333333334) internal successors, (403), 2 states have internal predecessors, (403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 04:20:59,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 04:20:59,719 INFO L93 Difference]: Finished difference Result 100395 states and 107792 transitions. [2024-11-16 04:20:59,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 04:20:59,720 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 134.33333333333334) internal successors, (403), 2 states have internal predecessors, (403), 0 states have call successors, (0), 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 943 [2024-11-16 04:20:59,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 04:20:59,768 INFO L225 Difference]: With dead ends: 100395 [2024-11-16 04:20:59,768 INFO L226 Difference]: Without dead ends: 47415 [2024-11-16 04:20:59,796 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-11-16 04:20:59,797 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 351 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 615 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 351 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 621 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 615 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-16 04:20:59,797 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [351 Valid, 73 Invalid, 621 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 615 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-16 04:20:59,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47415 states. [2024-11-16 04:21:00,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47415 to 47406. [2024-11-16 04:21:00,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47406 states, 47405 states have (on average 1.072945891783567) internal successors, (50863), 47405 states have internal predecessors, (50863), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 04:21:00,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47406 states to 47406 states and 50863 transitions. [2024-11-16 04:21:00,402 INFO L78 Accepts]: Start accepts. Automaton has 47406 states and 50863 transitions. Word has length 943 [2024-11-16 04:21:00,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 04:21:00,402 INFO L471 AbstractCegarLoop]: Abstraction has 47406 states and 50863 transitions. [2024-11-16 04:21:00,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 134.33333333333334) internal successors, (403), 2 states have internal predecessors, (403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 04:21:00,403 INFO L276 IsEmpty]: Start isEmpty. Operand 47406 states and 50863 transitions. [2024-11-16 04:21:00,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 956 [2024-11-16 04:21:00,435 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 04:21:00,435 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-16 04:21:00,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-16 04:21:00,436 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 04:21:00,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 04:21:00,436 INFO L85 PathProgramCache]: Analyzing trace with hash -1055822401, now seen corresponding path program 1 times [2024-11-16 04:21:00,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 04:21:00,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592363230] [2024-11-16 04:21:00,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 04:21:00,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 04:21:00,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 04:21:01,542 INFO L134 CoverageAnalysis]: Checked inductivity of 1484 backedges. 1141 proven. 0 refuted. 0 times theorem prover too weak. 343 trivial. 0 not checked. [2024-11-16 04:21:01,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 04:21:01,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592363230] [2024-11-16 04:21:01,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592363230] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 04:21:01,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 04:21:01,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 04:21:01,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900870444] [2024-11-16 04:21:01,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 04:21:01,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 04:21:01,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 04:21:01,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 04:21:01,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 04:21:01,547 INFO L87 Difference]: Start difference. First operand 47406 states and 50863 transitions. Second operand has 3 states, 3 states have (on average 232.66666666666666) internal successors, (698), 3 states have internal predecessors, (698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 04:21:03,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 04:21:03,158 INFO L93 Difference]: Finished difference Result 105912 states and 113849 transitions. [2024-11-16 04:21:03,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 04:21:03,158 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 232.66666666666666) internal successors, (698), 3 states have internal predecessors, (698), 0 states have call successors, (0), 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 955 [2024-11-16 04:21:03,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 04:21:03,238 INFO L225 Difference]: With dead ends: 105912 [2024-11-16 04:21:03,238 INFO L226 Difference]: Without dead ends: 58080 [2024-11-16 04:21:03,276 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 04:21:03,277 INFO L432 NwaCegarLoop]: 618 mSDtfsCounter, 343 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 1182 mSolverCounterSat, 150 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 343 SdHoareTripleChecker+Valid, 648 SdHoareTripleChecker+Invalid, 1332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 150 IncrementalHoareTripleChecker+Valid, 1182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-16 04:21:03,277 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [343 Valid, 648 Invalid, 1332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [150 Valid, 1182 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-16 04:21:03,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58080 states. [2024-11-16 04:21:03,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58080 to 48682. [2024-11-16 04:21:03,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48682 states, 48681 states have (on average 1.0723074710872824) internal successors, (52201), 48681 states have internal predecessors, (52201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 04:21:04,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48682 states to 48682 states and 52201 transitions. [2024-11-16 04:21:04,125 INFO L78 Accepts]: Start accepts. Automaton has 48682 states and 52201 transitions. Word has length 955 [2024-11-16 04:21:04,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 04:21:04,125 INFO L471 AbstractCegarLoop]: Abstraction has 48682 states and 52201 transitions. [2024-11-16 04:21:04,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 232.66666666666666) internal successors, (698), 3 states have internal predecessors, (698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 04:21:04,125 INFO L276 IsEmpty]: Start isEmpty. Operand 48682 states and 52201 transitions. [2024-11-16 04:21:04,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 991 [2024-11-16 04:21:04,159 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 04:21:04,160 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-16 04:21:04,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-16 04:21:04,160 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 04:21:04,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 04:21:04,160 INFO L85 PathProgramCache]: Analyzing trace with hash -17879533, now seen corresponding path program 1 times [2024-11-16 04:21:04,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 04:21:04,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460425069] [2024-11-16 04:21:04,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 04:21:04,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 04:21:04,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 04:21:05,155 INFO L134 CoverageAnalysis]: Checked inductivity of 1584 backedges. 818 proven. 83 refuted. 0 times theorem prover too weak. 683 trivial. 0 not checked. [2024-11-16 04:21:05,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 04:21:05,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460425069] [2024-11-16 04:21:05,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460425069] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 04:21:05,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1263097959] [2024-11-16 04:21:05,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 04:21:05,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 04:21:05,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 04:21:05,158 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 04:21:05,160 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-16 04:21:05,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 04:21:05,526 INFO L255 TraceCheckSpWp]: Trace formula consists of 1168 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-16 04:21:05,537 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 04:21:05,854 INFO L134 CoverageAnalysis]: Checked inductivity of 1584 backedges. 818 proven. 83 refuted. 0 times theorem prover too weak. 683 trivial. 0 not checked. [2024-11-16 04:21:05,855 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 04:21:06,171 INFO L134 CoverageAnalysis]: Checked inductivity of 1584 backedges. 901 proven. 0 refuted. 0 times theorem prover too weak. 683 trivial. 0 not checked. [2024-11-16 04:21:06,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1263097959] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-16 04:21:06,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-16 04:21:06,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 7 [2024-11-16 04:21:06,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11650801] [2024-11-16 04:21:06,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 04:21:06,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 04:21:06,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 04:21:06,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 04:21:06,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-16 04:21:06,175 INFO L87 Difference]: Start difference. First operand 48682 states and 52201 transitions. Second operand has 4 states, 4 states have (on average 140.0) internal successors, (560), 3 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)