./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.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 30f0768bbff34913c5dfb0ad37a2819c04e85c489714efe7283dacc3cb1675b9 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 20:31:09,474 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 20:31:09,548 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 20:31:09,552 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 20:31:09,552 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 20:31:09,584 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 20:31:09,585 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 20:31:09,585 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 20:31:09,587 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 20:31:09,588 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 20:31:09,588 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 20:31:09,589 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 20:31:09,589 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 20:31:09,589 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 20:31:09,591 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 20:31:09,592 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 20:31:09,592 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 20:31:09,592 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 20:31:09,592 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 20:31:09,593 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 20:31:09,593 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 20:31:09,594 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 20:31:09,594 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 20:31:09,594 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 20:31:09,594 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 20:31:09,595 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 20:31:09,595 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 20:31:09,595 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 20:31:09,596 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 20:31:09,596 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 20:31:09,596 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 20:31:09,596 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 20:31:09,597 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 20:31:09,597 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 20:31:09,597 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 20:31:09,598 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 20:31:09,598 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 20:31:09,599 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 20:31:09,599 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 20:31:09,600 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 20:31:09,600 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 20:31:09,601 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 20:31:09,601 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 -> 30f0768bbff34913c5dfb0ad37a2819c04e85c489714efe7283dacc3cb1675b9 [2024-10-12 20:31:09,889 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 20:31:09,911 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 20:31:09,914 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 20:31:09,915 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 20:31:09,916 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 20:31:09,917 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2024-10-12 20:31:11,328 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 20:31:11,566 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 20:31:11,566 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2024-10-12 20:31:11,576 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/24a5ea59e/773ab12230e244a49cf1b79c2e1bf2f2/FLAG500d78f87 [2024-10-12 20:31:11,588 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/24a5ea59e/773ab12230e244a49cf1b79c2e1bf2f2 [2024-10-12 20:31:11,590 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 20:31:11,591 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 20:31:11,593 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 20:31:11,593 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 20:31:11,598 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 20:31:11,599 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 08:31:11" (1/1) ... [2024-10-12 20:31:11,600 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5223e05e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:31:11, skipping insertion in model container [2024-10-12 20:31:11,602 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 08:31:11" (1/1) ... [2024-10-12 20:31:11,641 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 20:31:11,896 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c[9094,9107] [2024-10-12 20:31:11,951 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 20:31:11,977 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 20:31:12,052 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c[9094,9107] [2024-10-12 20:31:12,090 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 20:31:12,112 INFO L204 MainTranslator]: Completed translation [2024-10-12 20:31:12,112 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:31:12 WrapperNode [2024-10-12 20:31:12,113 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 20:31:12,113 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 20:31:12,114 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 20:31:12,114 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 20:31:12,119 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:31:12" (1/1) ... [2024-10-12 20:31:12,130 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:31:12" (1/1) ... [2024-10-12 20:31:12,169 INFO L138 Inliner]: procedures = 26, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 796 [2024-10-12 20:31:12,169 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 20:31:12,170 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 20:31:12,170 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 20:31:12,171 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 20:31:12,203 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:31:12" (1/1) ... [2024-10-12 20:31:12,203 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:31:12" (1/1) ... [2024-10-12 20:31:12,214 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:31:12" (1/1) ... [2024-10-12 20:31:12,263 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-12 20:31:12,267 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:31:12" (1/1) ... [2024-10-12 20:31:12,267 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:31:12" (1/1) ... [2024-10-12 20:31:12,284 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:31:12" (1/1) ... [2024-10-12 20:31:12,298 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:31:12" (1/1) ... [2024-10-12 20:31:12,304 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:31:12" (1/1) ... [2024-10-12 20:31:12,311 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:31:12" (1/1) ... [2024-10-12 20:31:12,319 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 20:31:12,321 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 20:31:12,321 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 20:31:12,321 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 20:31:12,322 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:31:12" (1/1) ... [2024-10-12 20:31:12,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 20:31:12,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 20:31:12,356 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-10-12 20:31:12,363 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-10-12 20:31:12,408 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 20:31:12,409 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 20:31:12,410 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 20:31:12,410 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 20:31:12,552 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 20:31:12,554 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 20:31:13,235 INFO L? ?]: Removed 94 outVars from TransFormulas that were not future-live. [2024-10-12 20:31:13,235 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 20:31:13,288 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 20:31:13,289 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-12 20:31:13,289 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 08:31:13 BoogieIcfgContainer [2024-10-12 20:31:13,290 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 20:31:13,292 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 20:31:13,292 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 20:31:13,295 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 20:31:13,296 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 08:31:11" (1/3) ... [2024-10-12 20:31:13,296 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29a0257d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 08:31:13, skipping insertion in model container [2024-10-12 20:31:13,296 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:31:12" (2/3) ... [2024-10-12 20:31:13,297 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29a0257d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 08:31:13, skipping insertion in model container [2024-10-12 20:31:13,297 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 08:31:13" (3/3) ... [2024-10-12 20:31:13,299 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.6.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2024-10-12 20:31:13,315 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 20:31:13,315 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 20:31:13,383 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 20:31:13,389 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;@591881e6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 20:31:13,389 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 20:31:13,396 INFO L276 IsEmpty]: Start isEmpty. Operand has 175 states, 173 states have (on average 1.76878612716763) internal successors, (306), 174 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:31:13,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-10-12 20:31:13,406 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:31:13,407 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:31:13,408 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:31:13,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:31:13,413 INFO L85 PathProgramCache]: Analyzing trace with hash 1750664296, now seen corresponding path program 1 times [2024-10-12 20:31:13,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:31:13,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458212599] [2024-10-12 20:31:13,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:31:13,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:31:13,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:31:14,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:31:14,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:31:14,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458212599] [2024-10-12 20:31:14,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458212599] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:31:14,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:31:14,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-12 20:31:14,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203300725] [2024-10-12 20:31:14,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:31:14,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 20:31:14,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:31:14,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 20:31:14,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:31:14,289 INFO L87 Difference]: Start difference. First operand has 175 states, 173 states have (on average 1.76878612716763) internal successors, (306), 174 states have internal predecessors, (306), 0 states have call successors, (0), 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 8 states, 8 states have (on average 11.125) internal successors, (89), 8 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:31:14,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:31:14,852 INFO L93 Difference]: Finished difference Result 1122 states and 1822 transitions. [2024-10-12 20:31:14,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-12 20:31:14,854 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.125) internal successors, (89), 8 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89 [2024-10-12 20:31:14,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:31:14,878 INFO L225 Difference]: With dead ends: 1122 [2024-10-12 20:31:14,879 INFO L226 Difference]: Without dead ends: 1035 [2024-10-12 20:31:14,883 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=181, Unknown=0, NotChecked=0, Total=272 [2024-10-12 20:31:14,888 INFO L432 NwaCegarLoop]: 599 mSDtfsCounter, 2259 mSDsluCounter, 2443 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2259 SdHoareTripleChecker+Valid, 3042 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-12 20:31:14,890 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2259 Valid, 3042 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 284 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-12 20:31:14,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1035 states. [2024-10-12 20:31:14,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1035 to 268. [2024-10-12 20:31:14,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 267 states have (on average 1.4606741573033708) internal successors, (390), 267 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:31:14,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 390 transitions. [2024-10-12 20:31:14,967 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 390 transitions. Word has length 89 [2024-10-12 20:31:14,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:31:14,968 INFO L471 AbstractCegarLoop]: Abstraction has 268 states and 390 transitions. [2024-10-12 20:31:14,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.125) internal successors, (89), 8 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:31:14,968 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 390 transitions. [2024-10-12 20:31:14,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-12 20:31:14,971 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:31:14,971 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:31:14,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 20:31:14,972 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:31:14,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:31:14,972 INFO L85 PathProgramCache]: Analyzing trace with hash 598542838, now seen corresponding path program 1 times [2024-10-12 20:31:14,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:31:14,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888992401] [2024-10-12 20:31:14,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:31:14,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:31:15,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:31:15,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:31:15,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:31:15,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888992401] [2024-10-12 20:31:15,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888992401] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:31:15,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:31:15,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-12 20:31:15,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272686267] [2024-10-12 20:31:15,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:31:15,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 20:31:15,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:31:15,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 20:31:15,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:31:15,312 INFO L87 Difference]: Start difference. First operand 268 states and 390 transitions. Second operand has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:31:15,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:31:15,545 INFO L93 Difference]: Finished difference Result 1234 states and 1924 transitions. [2024-10-12 20:31:15,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-12 20:31:15,546 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 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 91 [2024-10-12 20:31:15,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:31:15,552 INFO L225 Difference]: With dead ends: 1234 [2024-10-12 20:31:15,553 INFO L226 Difference]: Without dead ends: 1094 [2024-10-12 20:31:15,555 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2024-10-12 20:31:15,557 INFO L432 NwaCegarLoop]: 574 mSDtfsCounter, 1606 mSDsluCounter, 1069 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1606 SdHoareTripleChecker+Valid, 1643 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:31:15,558 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1606 Valid, 1643 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:31:15,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1094 states. [2024-10-12 20:31:15,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1094 to 427. [2024-10-12 20:31:15,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 427 states, 426 states have (on average 1.511737089201878) internal successors, (644), 426 states have internal predecessors, (644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:31:15,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 644 transitions. [2024-10-12 20:31:15,585 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 644 transitions. Word has length 91 [2024-10-12 20:31:15,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:31:15,585 INFO L471 AbstractCegarLoop]: Abstraction has 427 states and 644 transitions. [2024-10-12 20:31:15,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:31:15,586 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 644 transitions. [2024-10-12 20:31:15,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-12 20:31:15,588 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:31:15,589 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:31:15,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 20:31:15,590 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:31:15,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:31:15,590 INFO L85 PathProgramCache]: Analyzing trace with hash 1792374712, now seen corresponding path program 1 times [2024-10-12 20:31:15,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:31:15,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327376764] [2024-10-12 20:31:15,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:31:15,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:31:15,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:31:15,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:31:15,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:31:15,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327376764] [2024-10-12 20:31:15,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327376764] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:31:15,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:31:15,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-12 20:31:15,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443604223] [2024-10-12 20:31:15,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:31:15,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 20:31:15,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:31:15,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 20:31:15,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:31:15,864 INFO L87 Difference]: Start difference. First operand 427 states and 644 transitions. Second operand has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:31:16,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:31:16,090 INFO L93 Difference]: Finished difference Result 1388 states and 2170 transitions. [2024-10-12 20:31:16,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-12 20:31:16,092 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 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 91 [2024-10-12 20:31:16,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:31:16,098 INFO L225 Difference]: With dead ends: 1388 [2024-10-12 20:31:16,098 INFO L226 Difference]: Without dead ends: 1248 [2024-10-12 20:31:16,101 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2024-10-12 20:31:16,102 INFO L432 NwaCegarLoop]: 448 mSDtfsCounter, 1907 mSDsluCounter, 1141 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1907 SdHoareTripleChecker+Valid, 1589 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:31:16,104 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1907 Valid, 1589 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:31:16,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1248 states. [2024-10-12 20:31:16,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1248 to 640. [2024-10-12 20:31:16,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 640 states, 639 states have (on average 1.539906103286385) internal successors, (984), 639 states have internal predecessors, (984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:31:16,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 640 states and 984 transitions. [2024-10-12 20:31:16,126 INFO L78 Accepts]: Start accepts. Automaton has 640 states and 984 transitions. Word has length 91 [2024-10-12 20:31:16,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:31:16,127 INFO L471 AbstractCegarLoop]: Abstraction has 640 states and 984 transitions. [2024-10-12 20:31:16,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:31:16,127 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 984 transitions. [2024-10-12 20:31:16,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-12 20:31:16,128 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:31:16,128 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:31:16,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 20:31:16,129 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:31:16,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:31:16,130 INFO L85 PathProgramCache]: Analyzing trace with hash 1021271886, now seen corresponding path program 1 times [2024-10-12 20:31:16,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:31:16,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85155569] [2024-10-12 20:31:16,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:31:16,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:31:16,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:31:16,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:31:16,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:31:16,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85155569] [2024-10-12 20:31:16,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85155569] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:31:16,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:31:16,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-12 20:31:16,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221262673] [2024-10-12 20:31:16,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:31:16,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 20:31:16,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:31:16,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 20:31:16,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:31:16,350 INFO L87 Difference]: Start difference. First operand 640 states and 984 transitions. Second operand has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:31:16,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:31:16,556 INFO L93 Difference]: Finished difference Result 1527 states and 2392 transitions. [2024-10-12 20:31:16,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-12 20:31:16,556 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 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 91 [2024-10-12 20:31:16,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:31:16,562 INFO L225 Difference]: With dead ends: 1527 [2024-10-12 20:31:16,562 INFO L226 Difference]: Without dead ends: 1387 [2024-10-12 20:31:16,565 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2024-10-12 20:31:16,566 INFO L432 NwaCegarLoop]: 338 mSDtfsCounter, 2020 mSDsluCounter, 1237 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2020 SdHoareTripleChecker+Valid, 1575 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:31:16,568 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2020 Valid, 1575 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:31:16,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1387 states. [2024-10-12 20:31:16,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1387 to 779. [2024-10-12 20:31:16,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 779 states, 778 states have (on average 1.5501285347043703) internal successors, (1206), 778 states have internal predecessors, (1206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:31:16,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 1206 transitions. [2024-10-12 20:31:16,586 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 1206 transitions. Word has length 91 [2024-10-12 20:31:16,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:31:16,587 INFO L471 AbstractCegarLoop]: Abstraction has 779 states and 1206 transitions. [2024-10-12 20:31:16,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:31:16,587 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 1206 transitions. [2024-10-12 20:31:16,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-12 20:31:16,588 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:31:16,589 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:31:16,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 20:31:16,589 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:31:16,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:31:16,590 INFO L85 PathProgramCache]: Analyzing trace with hash -269895154, now seen corresponding path program 1 times [2024-10-12 20:31:16,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:31:16,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451978350] [2024-10-12 20:31:16,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:31:16,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:31:16,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:31:16,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:31:16,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:31:16,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451978350] [2024-10-12 20:31:16,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451978350] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:31:16,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:31:16,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:31:16,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130632599] [2024-10-12 20:31:16,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:31:16,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:31:16,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:31:16,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:31:16,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:31:16,680 INFO L87 Difference]: Start difference. First operand 779 states and 1206 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:31:16,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:31:16,718 INFO L93 Difference]: Finished difference Result 1967 states and 3096 transitions. [2024-10-12 20:31:16,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:31:16,719 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 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 91 [2024-10-12 20:31:16,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:31:16,724 INFO L225 Difference]: With dead ends: 1967 [2024-10-12 20:31:16,724 INFO L226 Difference]: Without dead ends: 1344 [2024-10-12 20:31:16,726 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:31:16,726 INFO L432 NwaCegarLoop]: 332 mSDtfsCounter, 99 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 557 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:31:16,729 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 557 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:31:16,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1344 states. [2024-10-12 20:31:16,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1344 to 1324. [2024-10-12 20:31:16,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1324 states, 1323 states have (on average 1.5525321239606953) internal successors, (2054), 1323 states have internal predecessors, (2054), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:31:16,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1324 states to 1324 states and 2054 transitions. [2024-10-12 20:31:16,755 INFO L78 Accepts]: Start accepts. Automaton has 1324 states and 2054 transitions. Word has length 91 [2024-10-12 20:31:16,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:31:16,756 INFO L471 AbstractCegarLoop]: Abstraction has 1324 states and 2054 transitions. [2024-10-12 20:31:16,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:31:16,756 INFO L276 IsEmpty]: Start isEmpty. Operand 1324 states and 2054 transitions. [2024-10-12 20:31:16,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-12 20:31:16,757 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:31:16,757 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:31:16,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 20:31:16,757 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:31:16,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:31:16,759 INFO L85 PathProgramCache]: Analyzing trace with hash -25817491, now seen corresponding path program 1 times [2024-10-12 20:31:16,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:31:16,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753353185] [2024-10-12 20:31:16,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:31:16,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:31:16,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:31:16,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:31:16,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:31:16,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753353185] [2024-10-12 20:31:16,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753353185] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:31:16,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:31:16,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:31:16,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098799060] [2024-10-12 20:31:16,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:31:16,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:31:16,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:31:16,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:31:16,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:31:16,851 INFO L87 Difference]: Start difference. First operand 1324 states and 2054 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:31:16,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:31:16,904 INFO L93 Difference]: Finished difference Result 2494 states and 3899 transitions. [2024-10-12 20:31:16,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:31:16,905 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 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 91 [2024-10-12 20:31:16,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:31:16,910 INFO L225 Difference]: With dead ends: 2494 [2024-10-12 20:31:16,910 INFO L226 Difference]: Without dead ends: 1326 [2024-10-12 20:31:16,912 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:31:16,913 INFO L432 NwaCegarLoop]: 337 mSDtfsCounter, 125 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 539 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:31:16,913 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 539 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:31:16,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1326 states. [2024-10-12 20:31:16,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1326 to 1324. [2024-10-12 20:31:16,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1324 states, 1323 states have (on average 1.5487528344671202) internal successors, (2049), 1323 states have internal predecessors, (2049), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:31:16,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1324 states to 1324 states and 2049 transitions. [2024-10-12 20:31:16,936 INFO L78 Accepts]: Start accepts. Automaton has 1324 states and 2049 transitions. Word has length 91 [2024-10-12 20:31:16,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:31:16,936 INFO L471 AbstractCegarLoop]: Abstraction has 1324 states and 2049 transitions. [2024-10-12 20:31:16,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:31:16,937 INFO L276 IsEmpty]: Start isEmpty. Operand 1324 states and 2049 transitions. [2024-10-12 20:31:16,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-12 20:31:16,938 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:31:16,938 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:31:16,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 20:31:16,938 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:31:16,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:31:16,939 INFO L85 PathProgramCache]: Analyzing trace with hash 1611133858, now seen corresponding path program 1 times [2024-10-12 20:31:16,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:31:16,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152214673] [2024-10-12 20:31:16,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:31:16,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:31:16,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:31:17,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:31:17,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:31:17,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152214673] [2024-10-12 20:31:17,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152214673] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:31:17,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:31:17,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-12 20:31:17,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596301168] [2024-10-12 20:31:17,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:31:17,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 20:31:17,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:31:17,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 20:31:17,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:31:17,162 INFO L87 Difference]: Start difference. First operand 1324 states and 2049 transitions. Second operand has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:31:17,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:31:17,404 INFO L93 Difference]: Finished difference Result 2942 states and 4593 transitions. [2024-10-12 20:31:17,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-12 20:31:17,404 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 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 91 [2024-10-12 20:31:17,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:31:17,413 INFO L225 Difference]: With dead ends: 2942 [2024-10-12 20:31:17,413 INFO L226 Difference]: Without dead ends: 2681 [2024-10-12 20:31:17,415 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2024-10-12 20:31:17,415 INFO L432 NwaCegarLoop]: 456 mSDtfsCounter, 1553 mSDsluCounter, 1556 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1553 SdHoareTripleChecker+Valid, 2012 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:31:17,416 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1553 Valid, 2012 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:31:17,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2681 states. [2024-10-12 20:31:17,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2681 to 1594. [2024-10-12 20:31:17,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1594 states, 1593 states have (on average 1.5530445699937225) internal successors, (2474), 1593 states have internal predecessors, (2474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:31:17,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1594 states to 1594 states and 2474 transitions. [2024-10-12 20:31:17,454 INFO L78 Accepts]: Start accepts. Automaton has 1594 states and 2474 transitions. Word has length 91 [2024-10-12 20:31:17,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:31:17,454 INFO L471 AbstractCegarLoop]: Abstraction has 1594 states and 2474 transitions. [2024-10-12 20:31:17,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:31:17,455 INFO L276 IsEmpty]: Start isEmpty. Operand 1594 states and 2474 transitions. [2024-10-12 20:31:17,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-12 20:31:17,455 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:31:17,456 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:31:17,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-12 20:31:17,456 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:31:17,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:31:17,457 INFO L85 PathProgramCache]: Analyzing trace with hash 1098078820, now seen corresponding path program 1 times [2024-10-12 20:31:17,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:31:17,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015267572] [2024-10-12 20:31:17,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:31:17,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:31:17,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:31:17,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:31:17,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:31:17,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015267572] [2024-10-12 20:31:17,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015267572] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:31:17,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:31:17,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-12 20:31:17,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711823148] [2024-10-12 20:31:17,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:31:17,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 20:31:17,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:31:17,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 20:31:17,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:31:17,703 INFO L87 Difference]: Start difference. First operand 1594 states and 2474 transitions. Second operand has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:31:17,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:31:17,907 INFO L93 Difference]: Finished difference Result 3212 states and 5018 transitions. [2024-10-12 20:31:17,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-12 20:31:17,908 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 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 91 [2024-10-12 20:31:17,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:31:17,916 INFO L225 Difference]: With dead ends: 3212 [2024-10-12 20:31:17,917 INFO L226 Difference]: Without dead ends: 2951 [2024-10-12 20:31:17,918 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2024-10-12 20:31:17,918 INFO L432 NwaCegarLoop]: 465 mSDtfsCounter, 1751 mSDsluCounter, 1816 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1751 SdHoareTripleChecker+Valid, 2281 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:31:17,919 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1751 Valid, 2281 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:31:17,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2951 states. [2024-10-12 20:31:17,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2951 to 1869. [2024-10-12 20:31:17,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1869 states, 1868 states have (on average 1.5562098501070665) internal successors, (2907), 1868 states have internal predecessors, (2907), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:31:17,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1869 states to 1869 states and 2907 transitions. [2024-10-12 20:31:17,962 INFO L78 Accepts]: Start accepts. Automaton has 1869 states and 2907 transitions. Word has length 91 [2024-10-12 20:31:17,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:31:17,963 INFO L471 AbstractCegarLoop]: Abstraction has 1869 states and 2907 transitions. [2024-10-12 20:31:17,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:31:17,963 INFO L276 IsEmpty]: Start isEmpty. Operand 1869 states and 2907 transitions. [2024-10-12 20:31:17,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-12 20:31:17,964 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:31:17,964 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:31:17,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-12 20:31:17,965 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:31:17,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:31:17,965 INFO L85 PathProgramCache]: Analyzing trace with hash -1705387248, now seen corresponding path program 1 times [2024-10-12 20:31:17,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:31:17,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032687153] [2024-10-12 20:31:17,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:31:17,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:31:17,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:31:18,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:31:18,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:31:18,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032687153] [2024-10-12 20:31:18,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032687153] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:31:18,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:31:18,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-12 20:31:18,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950075389] [2024-10-12 20:31:18,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:31:18,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 20:31:18,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:31:18,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 20:31:18,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:31:18,159 INFO L87 Difference]: Start difference. First operand 1869 states and 2907 transitions. Second operand has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:31:18,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:31:18,367 INFO L93 Difference]: Finished difference Result 3492 states and 5459 transitions. [2024-10-12 20:31:18,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-12 20:31:18,367 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 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 91 [2024-10-12 20:31:18,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:31:18,377 INFO L225 Difference]: With dead ends: 3492 [2024-10-12 20:31:18,378 INFO L226 Difference]: Without dead ends: 3231 [2024-10-12 20:31:18,380 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2024-10-12 20:31:18,380 INFO L432 NwaCegarLoop]: 381 mSDtfsCounter, 2000 mSDsluCounter, 1558 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2000 SdHoareTripleChecker+Valid, 1939 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:31:18,381 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2000 Valid, 1939 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:31:18,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3231 states. [2024-10-12 20:31:18,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3231 to 2149. [2024-10-12 20:31:18,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2149 states, 2148 states have (on average 1.558659217877095) internal successors, (3348), 2148 states have internal predecessors, (3348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:31:18,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2149 states to 2149 states and 3348 transitions. [2024-10-12 20:31:18,442 INFO L78 Accepts]: Start accepts. Automaton has 2149 states and 3348 transitions. Word has length 91 [2024-10-12 20:31:18,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:31:18,442 INFO L471 AbstractCegarLoop]: Abstraction has 2149 states and 3348 transitions. [2024-10-12 20:31:18,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:31:18,442 INFO L276 IsEmpty]: Start isEmpty. Operand 2149 states and 3348 transitions. [2024-10-12 20:31:18,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-12 20:31:18,444 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:31:18,444 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:31:18,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-12 20:31:18,444 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:31:18,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:31:18,445 INFO L85 PathProgramCache]: Analyzing trace with hash 456833028, now seen corresponding path program 1 times [2024-10-12 20:31:18,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:31:18,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633064584] [2024-10-12 20:31:18,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:31:18,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:31:18,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:31:18,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:31:18,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:31:18,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633064584] [2024-10-12 20:31:18,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633064584] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:31:18,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:31:18,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 20:31:18,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290230260] [2024-10-12 20:31:18,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:31:18,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 20:31:18,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:31:18,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 20:31:18,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:31:18,594 INFO L87 Difference]: Start difference. First operand 2149 states and 3348 transitions. Second operand has 5 states, 5 states have (on average 18.4) internal successors, (92), 4 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:31:18,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:31:18,741 INFO L93 Difference]: Finished difference Result 4237 states and 6630 transitions. [2024-10-12 20:31:18,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 20:31:18,742 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.4) internal successors, (92), 4 states have internal predecessors, (92), 0 states have call successors, (0), 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 92 [2024-10-12 20:31:18,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:31:18,748 INFO L225 Difference]: With dead ends: 4237 [2024-10-12 20:31:18,749 INFO L226 Difference]: Without dead ends: 2149 [2024-10-12 20:31:18,751 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:31:18,752 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 616 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 616 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:31:18,752 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [616 Valid, 162 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:31:18,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2149 states. [2024-10-12 20:31:18,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2149 to 2149. [2024-10-12 20:31:18,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2149 states, 2148 states have (on average 1.5442271880819367) internal successors, (3317), 2148 states have internal predecessors, (3317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:31:18,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2149 states to 2149 states and 3317 transitions. [2024-10-12 20:31:18,797 INFO L78 Accepts]: Start accepts. Automaton has 2149 states and 3317 transitions. Word has length 92 [2024-10-12 20:31:18,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:31:18,797 INFO L471 AbstractCegarLoop]: Abstraction has 2149 states and 3317 transitions. [2024-10-12 20:31:18,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.4) internal successors, (92), 4 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:31:18,798 INFO L276 IsEmpty]: Start isEmpty. Operand 2149 states and 3317 transitions. [2024-10-12 20:31:18,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-12 20:31:18,799 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:31:18,799 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:31:18,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-12 20:31:18,799 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:31:18,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:31:18,800 INFO L85 PathProgramCache]: Analyzing trace with hash -1723888695, now seen corresponding path program 1 times [2024-10-12 20:31:18,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:31:18,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47551567] [2024-10-12 20:31:18,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:31:18,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:31:18,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:31:18,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:31:18,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:31:18,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47551567] [2024-10-12 20:31:18,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47551567] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:31:18,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:31:18,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 20:31:18,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246874022] [2024-10-12 20:31:18,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:31:18,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 20:31:18,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:31:18,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 20:31:18,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:31:18,926 INFO L87 Difference]: Start difference. First operand 2149 states and 3317 transitions. Second operand has 5 states, 5 states have (on average 18.6) internal successors, (93), 4 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:31:19,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:31:19,076 INFO L93 Difference]: Finished difference Result 4245 states and 6578 transitions. [2024-10-12 20:31:19,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 20:31:19,076 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 4 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2024-10-12 20:31:19,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:31:19,083 INFO L225 Difference]: With dead ends: 4245 [2024-10-12 20:31:19,084 INFO L226 Difference]: Without dead ends: 2149 [2024-10-12 20:31:19,087 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:31:19,087 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 632 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 632 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:31:19,088 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [632 Valid, 146 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:31:19,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2149 states. [2024-10-12 20:31:19,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2149 to 2149. [2024-10-12 20:31:19,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2149 states, 2148 states have (on average 1.5297951582867784) internal successors, (3286), 2148 states have internal predecessors, (3286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:31:19,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2149 states to 2149 states and 3286 transitions. [2024-10-12 20:31:19,131 INFO L78 Accepts]: Start accepts. Automaton has 2149 states and 3286 transitions. Word has length 93 [2024-10-12 20:31:19,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:31:19,132 INFO L471 AbstractCegarLoop]: Abstraction has 2149 states and 3286 transitions. [2024-10-12 20:31:19,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 4 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:31:19,132 INFO L276 IsEmpty]: Start isEmpty. Operand 2149 states and 3286 transitions. [2024-10-12 20:31:19,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-12 20:31:19,133 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:31:19,133 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:31:19,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-12 20:31:19,134 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:31:19,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:31:19,134 INFO L85 PathProgramCache]: Analyzing trace with hash 1157479588, now seen corresponding path program 1 times [2024-10-12 20:31:19,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:31:19,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200845456] [2024-10-12 20:31:19,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:31:19,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:31:19,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:31:19,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:31:19,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:31:19,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200845456] [2024-10-12 20:31:19,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200845456] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:31:19,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:31:19,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 20:31:19,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836779059] [2024-10-12 20:31:19,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:31:19,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 20:31:19,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:31:19,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 20:31:19,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:31:19,289 INFO L87 Difference]: Start difference. First operand 2149 states and 3286 transitions. Second operand has 5 states, 5 states have (on average 18.8) internal successors, (94), 4 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:31:19,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:31:19,437 INFO L93 Difference]: Finished difference Result 4241 states and 6512 transitions. [2024-10-12 20:31:19,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 20:31:19,438 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 4 states have internal predecessors, (94), 0 states have call successors, (0), 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 94 [2024-10-12 20:31:19,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:31:19,445 INFO L225 Difference]: With dead ends: 4241 [2024-10-12 20:31:19,445 INFO L226 Difference]: Without dead ends: 2149 [2024-10-12 20:31:19,448 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:31:19,449 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 614 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 614 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:31:19,449 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [614 Valid, 154 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:31:19,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2149 states. [2024-10-12 20:31:19,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2149 to 2149. [2024-10-12 20:31:19,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2149 states, 2148 states have (on average 1.51536312849162) internal successors, (3255), 2148 states have internal predecessors, (3255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:31:19,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2149 states to 2149 states and 3255 transitions. [2024-10-12 20:31:19,486 INFO L78 Accepts]: Start accepts. Automaton has 2149 states and 3255 transitions. Word has length 94 [2024-10-12 20:31:19,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:31:19,487 INFO L471 AbstractCegarLoop]: Abstraction has 2149 states and 3255 transitions. [2024-10-12 20:31:19,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 4 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:31:19,487 INFO L276 IsEmpty]: Start isEmpty. Operand 2149 states and 3255 transitions. [2024-10-12 20:31:19,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-12 20:31:19,488 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:31:19,488 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:31:19,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-12 20:31:19,489 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:31:19,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:31:19,489 INFO L85 PathProgramCache]: Analyzing trace with hash 452747421, now seen corresponding path program 1 times [2024-10-12 20:31:19,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:31:19,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837796637] [2024-10-12 20:31:19,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:31:19,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:31:19,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:31:19,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:31:19,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:31:19,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837796637] [2024-10-12 20:31:19,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837796637] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:31:19,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:31:19,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 20:31:19,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031263292] [2024-10-12 20:31:19,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:31:19,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 20:31:19,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:31:19,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 20:31:19,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:31:19,607 INFO L87 Difference]: Start difference. First operand 2149 states and 3255 transitions. Second operand has 5 states, 5 states have (on average 19.0) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:31:19,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:31:19,742 INFO L93 Difference]: Finished difference Result 4249 states and 6459 transitions. [2024-10-12 20:31:19,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 20:31:19,742 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 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 95 [2024-10-12 20:31:19,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:31:19,749 INFO L225 Difference]: With dead ends: 4249 [2024-10-12 20:31:19,749 INFO L226 Difference]: Without dead ends: 2149 [2024-10-12 20:31:19,751 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:31:19,752 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 631 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 631 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:31:19,752 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [631 Valid, 138 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:31:19,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2149 states. [2024-10-12 20:31:19,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2149 to 2149. [2024-10-12 20:31:19,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2149 states, 2148 states have (on average 1.500931098696462) internal successors, (3224), 2148 states have internal predecessors, (3224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:31:19,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2149 states to 2149 states and 3224 transitions. [2024-10-12 20:31:19,787 INFO L78 Accepts]: Start accepts. Automaton has 2149 states and 3224 transitions. Word has length 95 [2024-10-12 20:31:19,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:31:19,787 INFO L471 AbstractCegarLoop]: Abstraction has 2149 states and 3224 transitions. [2024-10-12 20:31:19,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:31:19,788 INFO L276 IsEmpty]: Start isEmpty. Operand 2149 states and 3224 transitions. [2024-10-12 20:31:19,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-12 20:31:19,789 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:31:19,789 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:31:19,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-12 20:31:19,789 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:31:19,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:31:19,790 INFO L85 PathProgramCache]: Analyzing trace with hash -564717780, now seen corresponding path program 1 times [2024-10-12 20:31:19,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:31:19,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247364903] [2024-10-12 20:31:19,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:31:19,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:31:19,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:31:19,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:31:19,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:31:19,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247364903] [2024-10-12 20:31:19,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247364903] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:31:19,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:31:19,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 20:31:19,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414451781] [2024-10-12 20:31:19,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:31:19,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 20:31:19,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:31:19,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 20:31:19,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:31:19,942 INFO L87 Difference]: Start difference. First operand 2149 states and 3224 transitions. Second operand has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:31:20,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:31:20,181 INFO L93 Difference]: Finished difference Result 6295 states and 9496 transitions. [2024-10-12 20:31:20,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 20:31:20,182 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 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 96 [2024-10-12 20:31:20,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:31:20,194 INFO L225 Difference]: With dead ends: 6295 [2024-10-12 20:31:20,195 INFO L226 Difference]: Without dead ends: 4191 [2024-10-12 20:31:20,198 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:31:20,199 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 934 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 934 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 20:31:20,199 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [934 Valid, 211 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 20:31:20,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4191 states. [2024-10-12 20:31:20,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4191 to 4189. [2024-10-12 20:31:20,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4189 states, 4188 states have (on average 1.5009551098376313) internal successors, (6286), 4188 states have internal predecessors, (6286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:31:20,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4189 states to 4189 states and 6286 transitions. [2024-10-12 20:31:20,265 INFO L78 Accepts]: Start accepts. Automaton has 4189 states and 6286 transitions. Word has length 96 [2024-10-12 20:31:20,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:31:20,265 INFO L471 AbstractCegarLoop]: Abstraction has 4189 states and 6286 transitions. [2024-10-12 20:31:20,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:31:20,266 INFO L276 IsEmpty]: Start isEmpty. Operand 4189 states and 6286 transitions. [2024-10-12 20:31:20,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-10-12 20:31:20,267 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:31:20,267 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:31:20,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-12 20:31:20,267 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:31:20,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:31:20,268 INFO L85 PathProgramCache]: Analyzing trace with hash -1738291087, now seen corresponding path program 1 times [2024-10-12 20:31:20,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:31:20,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11711803] [2024-10-12 20:31:20,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:31:20,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:31:20,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:31:20,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:31:20,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:31:20,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11711803] [2024-10-12 20:31:20,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11711803] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:31:20,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:31:20,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 20:31:20,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925361414] [2024-10-12 20:31:20,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:31:20,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 20:31:20,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:31:20,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 20:31:20,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:31:20,413 INFO L87 Difference]: Start difference. First operand 4189 states and 6286 transitions. Second operand has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:31:20,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:31:20,553 INFO L93 Difference]: Finished difference Result 8313 states and 12506 transitions. [2024-10-12 20:31:20,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 20:31:20,554 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2024-10-12 20:31:20,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:31:20,569 INFO L225 Difference]: With dead ends: 8313 [2024-10-12 20:31:20,569 INFO L226 Difference]: Without dead ends: 4189 [2024-10-12 20:31:20,576 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:31:20,577 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 573 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 573 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:31:20,577 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [573 Valid, 170 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:31:20,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4189 states. [2024-10-12 20:31:20,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4189 to 4189. [2024-10-12 20:31:20,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4189 states, 4188 states have (on average 1.4863896848137537) internal successors, (6225), 4188 states have internal predecessors, (6225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:31:20,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4189 states to 4189 states and 6225 transitions. [2024-10-12 20:31:20,662 INFO L78 Accepts]: Start accepts. Automaton has 4189 states and 6225 transitions. Word has length 97 [2024-10-12 20:31:20,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:31:20,662 INFO L471 AbstractCegarLoop]: Abstraction has 4189 states and 6225 transitions. [2024-10-12 20:31:20,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:31:20,662 INFO L276 IsEmpty]: Start isEmpty. Operand 4189 states and 6225 transitions. [2024-10-12 20:31:20,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-12 20:31:20,664 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:31:20,664 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:31:20,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-12 20:31:20,665 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:31:20,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:31:20,665 INFO L85 PathProgramCache]: Analyzing trace with hash 267651336, now seen corresponding path program 1 times [2024-10-12 20:31:20,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:31:20,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494219793] [2024-10-12 20:31:20,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:31:20,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:31:20,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:31:21,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:31:21,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:31:21,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494219793] [2024-10-12 20:31:21,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494219793] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:31:21,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:31:21,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-12 20:31:21,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152386960] [2024-10-12 20:31:21,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:31:21,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-12 20:31:21,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:31:21,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-12 20:31:21,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-10-12 20:31:21,292 INFO L87 Difference]: Start difference. First operand 4189 states and 6225 transitions. Second operand has 12 states, 12 states have (on average 8.166666666666666) internal successors, (98), 11 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:31:22,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:31:22,033 INFO L93 Difference]: Finished difference Result 12266 states and 18209 transitions. [2024-10-12 20:31:22,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-12 20:31:22,033 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 8.166666666666666) internal successors, (98), 11 states have internal predecessors, (98), 0 states have call successors, (0), 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 98 [2024-10-12 20:31:22,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:31:22,049 INFO L225 Difference]: With dead ends: 12266 [2024-10-12 20:31:22,049 INFO L226 Difference]: Without dead ends: 8310 [2024-10-12 20:31:22,057 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=128, Invalid=424, Unknown=0, NotChecked=0, Total=552 [2024-10-12 20:31:22,058 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 953 mSDsluCounter, 714 mSDsCounter, 0 mSdLazyCounter, 801 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 953 SdHoareTripleChecker+Valid, 835 SdHoareTripleChecker+Invalid, 806 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 801 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-12 20:31:22,058 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [953 Valid, 835 Invalid, 806 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 801 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-12 20:31:22,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8310 states. [2024-10-12 20:31:22,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8310 to 4189. [2024-10-12 20:31:22,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4189 states, 4188 states have (on average 1.4837631327602674) internal successors, (6214), 4188 states have internal predecessors, (6214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:31:22,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4189 states to 4189 states and 6214 transitions. [2024-10-12 20:31:22,162 INFO L78 Accepts]: Start accepts. Automaton has 4189 states and 6214 transitions. Word has length 98 [2024-10-12 20:31:22,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:31:22,162 INFO L471 AbstractCegarLoop]: Abstraction has 4189 states and 6214 transitions. [2024-10-12 20:31:22,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.166666666666666) internal successors, (98), 11 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:31:22,163 INFO L276 IsEmpty]: Start isEmpty. Operand 4189 states and 6214 transitions. [2024-10-12 20:31:22,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-12 20:31:22,165 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:31:22,165 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:31:22,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-12 20:31:22,165 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:31:22,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:31:22,166 INFO L85 PathProgramCache]: Analyzing trace with hash 1135550786, now seen corresponding path program 1 times [2024-10-12 20:31:22,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:31:22,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38490289] [2024-10-12 20:31:22,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:31:22,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:31:22,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:31:22,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:31:22,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:31:22,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38490289] [2024-10-12 20:31:22,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38490289] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:31:22,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:31:22,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-12 20:31:22,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418249744] [2024-10-12 20:31:22,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:31:22,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-12 20:31:22,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:31:22,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-12 20:31:22,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-10-12 20:31:22,717 INFO L87 Difference]: Start difference. First operand 4189 states and 6214 transitions. Second operand has 12 states, 12 states have (on average 8.25) internal successors, (99), 11 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:31:23,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:31:23,441 INFO L93 Difference]: Finished difference Result 12341 states and 18300 transitions. [2024-10-12 20:31:23,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-12 20:31:23,442 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 8.25) internal successors, (99), 11 states have internal predecessors, (99), 0 states have call successors, (0), 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 99 [2024-10-12 20:31:23,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:31:23,458 INFO L225 Difference]: With dead ends: 12341 [2024-10-12 20:31:23,459 INFO L226 Difference]: Without dead ends: 8340 [2024-10-12 20:31:23,465 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=128, Invalid=424, Unknown=0, NotChecked=0, Total=552 [2024-10-12 20:31:23,466 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 718 mSDsluCounter, 562 mSDsCounter, 0 mSdLazyCounter, 633 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 718 SdHoareTripleChecker+Valid, 683 SdHoareTripleChecker+Invalid, 640 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 633 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-12 20:31:23,467 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [718 Valid, 683 Invalid, 640 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 633 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-12 20:31:23,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8340 states. [2024-10-12 20:31:23,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8340 to 4189. [2024-10-12 20:31:23,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4189 states, 4188 states have (on average 1.481614135625597) internal successors, (6205), 4188 states have internal predecessors, (6205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:31:23,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4189 states to 4189 states and 6205 transitions. [2024-10-12 20:31:23,562 INFO L78 Accepts]: Start accepts. Automaton has 4189 states and 6205 transitions. Word has length 99 [2024-10-12 20:31:23,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:31:23,562 INFO L471 AbstractCegarLoop]: Abstraction has 4189 states and 6205 transitions. [2024-10-12 20:31:23,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.25) internal successors, (99), 11 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:31:23,563 INFO L276 IsEmpty]: Start isEmpty. Operand 4189 states and 6205 transitions. [2024-10-12 20:31:23,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-12 20:31:23,564 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:31:23,564 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:31:23,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-12 20:31:23,565 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:31:23,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:31:23,565 INFO L85 PathProgramCache]: Analyzing trace with hash -722055186, now seen corresponding path program 1 times [2024-10-12 20:31:23,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:31:23,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186306361] [2024-10-12 20:31:23,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:31:23,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:31:23,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:31:24,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:31:24,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:31:24,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186306361] [2024-10-12 20:31:24,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186306361] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:31:24,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:31:24,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-12 20:31:24,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637350462] [2024-10-12 20:31:24,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:31:24,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-12 20:31:24,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:31:24,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-12 20:31:24,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-10-12 20:31:24,039 INFO L87 Difference]: Start difference. First operand 4189 states and 6205 transitions. Second operand has 12 states, 12 states have (on average 8.25) internal successors, (99), 11 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:31:24,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:31:24,722 INFO L93 Difference]: Finished difference Result 12166 states and 18029 transitions. [2024-10-12 20:31:24,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-12 20:31:24,722 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 8.25) internal successors, (99), 11 states have internal predecessors, (99), 0 states have call successors, (0), 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 99 [2024-10-12 20:31:24,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:31:24,737 INFO L225 Difference]: With dead ends: 12166 [2024-10-12 20:31:24,738 INFO L226 Difference]: Without dead ends: 8265 [2024-10-12 20:31:24,744 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=128, Invalid=424, Unknown=0, NotChecked=0, Total=552 [2024-10-12 20:31:24,745 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 742 mSDsluCounter, 606 mSDsCounter, 0 mSdLazyCounter, 657 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 742 SdHoareTripleChecker+Valid, 737 SdHoareTripleChecker+Invalid, 666 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 657 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 20:31:24,745 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [742 Valid, 737 Invalid, 666 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 657 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 20:31:24,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8265 states. [2024-10-12 20:31:24,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8265 to 4189. [2024-10-12 20:31:24,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4189 states, 4188 states have (on average 1.478510028653295) internal successors, (6192), 4188 states have internal predecessors, (6192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:31:24,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4189 states to 4189 states and 6192 transitions. [2024-10-12 20:31:24,838 INFO L78 Accepts]: Start accepts. Automaton has 4189 states and 6192 transitions. Word has length 99 [2024-10-12 20:31:24,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:31:24,838 INFO L471 AbstractCegarLoop]: Abstraction has 4189 states and 6192 transitions. [2024-10-12 20:31:24,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.25) internal successors, (99), 11 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:31:24,839 INFO L276 IsEmpty]: Start isEmpty. Operand 4189 states and 6192 transitions. [2024-10-12 20:31:24,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-12 20:31:24,840 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:31:24,840 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:31:24,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-12 20:31:24,840 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:31:24,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:31:24,841 INFO L85 PathProgramCache]: Analyzing trace with hash -1466652554, now seen corresponding path program 1 times [2024-10-12 20:31:24,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:31:24,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512378958] [2024-10-12 20:31:24,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:31:24,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:31:24,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:31:25,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:31:25,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:31:25,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512378958] [2024-10-12 20:31:25,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512378958] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:31:25,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:31:25,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-12 20:31:25,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517382927] [2024-10-12 20:31:25,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:31:25,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-12 20:31:25,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:31:25,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-12 20:31:25,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-10-12 20:31:25,345 INFO L87 Difference]: Start difference. First operand 4189 states and 6192 transitions. Second operand has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 11 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:31:25,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:31:25,995 INFO L93 Difference]: Finished difference Result 12386 states and 18316 transitions. [2024-10-12 20:31:25,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-12 20:31:25,996 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 11 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2024-10-12 20:31:25,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:31:26,013 INFO L225 Difference]: With dead ends: 12386 [2024-10-12 20:31:26,013 INFO L226 Difference]: Without dead ends: 8355 [2024-10-12 20:31:26,021 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=128, Invalid=424, Unknown=0, NotChecked=0, Total=552 [2024-10-12 20:31:26,021 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 778 mSDsluCounter, 565 mSDsCounter, 0 mSdLazyCounter, 628 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 778 SdHoareTripleChecker+Valid, 686 SdHoareTripleChecker+Invalid, 637 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 628 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 20:31:26,022 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [778 Valid, 686 Invalid, 637 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 628 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 20:31:26,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8355 states. [2024-10-12 20:31:26,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8355 to 4189. [2024-10-12 20:31:26,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4189 states, 4188 states have (on average 1.4770773638968482) internal successors, (6186), 4188 states have internal predecessors, (6186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:31:26,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4189 states to 4189 states and 6186 transitions. [2024-10-12 20:31:26,132 INFO L78 Accepts]: Start accepts. Automaton has 4189 states and 6186 transitions. Word has length 100 [2024-10-12 20:31:26,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:31:26,132 INFO L471 AbstractCegarLoop]: Abstraction has 4189 states and 6186 transitions. [2024-10-12 20:31:26,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 11 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:31:26,133 INFO L276 IsEmpty]: Start isEmpty. Operand 4189 states and 6186 transitions. [2024-10-12 20:31:26,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-12 20:31:26,134 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:31:26,134 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:31:26,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-12 20:31:26,135 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:31:26,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:31:26,135 INFO L85 PathProgramCache]: Analyzing trace with hash 1039595089, now seen corresponding path program 1 times [2024-10-12 20:31:26,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:31:26,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351836628] [2024-10-12 20:31:26,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:31:26,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:31:26,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:31:26,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:31:26,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:31:26,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351836628] [2024-10-12 20:31:26,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351836628] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:31:26,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:31:26,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-12 20:31:26,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538171305] [2024-10-12 20:31:26,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:31:26,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-12 20:31:26,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:31:26,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-12 20:31:26,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-10-12 20:31:26,629 INFO L87 Difference]: Start difference. First operand 4189 states and 6186 transitions. Second operand has 12 states, 12 states have (on average 8.416666666666666) internal successors, (101), 11 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:31:27,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:31:27,355 INFO L93 Difference]: Finished difference Result 10397 states and 15334 transitions. [2024-10-12 20:31:27,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-12 20:31:27,356 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 8.416666666666666) internal successors, (101), 11 states have internal predecessors, (101), 0 states have call successors, (0), 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 101 [2024-10-12 20:31:27,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:31:27,369 INFO L225 Difference]: With dead ends: 10397 [2024-10-12 20:31:27,369 INFO L226 Difference]: Without dead ends: 6351 [2024-10-12 20:31:27,376 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=128, Invalid=424, Unknown=0, NotChecked=0, Total=552 [2024-10-12 20:31:27,377 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 771 mSDsluCounter, 568 mSDsCounter, 0 mSdLazyCounter, 632 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 771 SdHoareTripleChecker+Valid, 689 SdHoareTripleChecker+Invalid, 643 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 632 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 20:31:27,377 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [771 Valid, 689 Invalid, 643 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 632 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 20:31:27,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6351 states. [2024-10-12 20:31:27,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6351 to 4189. [2024-10-12 20:31:27,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4189 states, 4188 states have (on average 1.4763610315186246) internal successors, (6183), 4188 states have internal predecessors, (6183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:31:27,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4189 states to 4189 states and 6183 transitions. [2024-10-12 20:31:27,479 INFO L78 Accepts]: Start accepts. Automaton has 4189 states and 6183 transitions. Word has length 101 [2024-10-12 20:31:27,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:31:27,480 INFO L471 AbstractCegarLoop]: Abstraction has 4189 states and 6183 transitions. [2024-10-12 20:31:27,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.416666666666666) internal successors, (101), 11 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:31:27,480 INFO L276 IsEmpty]: Start isEmpty. Operand 4189 states and 6183 transitions. [2024-10-12 20:31:27,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-12 20:31:27,481 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:31:27,481 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:31:27,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-12 20:31:27,482 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:31:27,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:31:27,482 INFO L85 PathProgramCache]: Analyzing trace with hash -1855509780, now seen corresponding path program 1 times [2024-10-12 20:31:27,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:31:27,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420116101] [2024-10-12 20:31:27,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:31:27,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:31:27,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:31:28,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:31:28,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:31:28,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420116101] [2024-10-12 20:31:28,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420116101] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:31:28,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:31:28,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-12 20:31:28,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657044610] [2024-10-12 20:31:28,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:31:28,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-12 20:31:28,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:31:28,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-12 20:31:28,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-10-12 20:31:28,067 INFO L87 Difference]: Start difference. First operand 4189 states and 6183 transitions. Second operand has 11 states, 11 states have (on average 9.272727272727273) internal successors, (102), 10 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:31:28,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:31:28,725 INFO L93 Difference]: Finished difference Result 12195 states and 18039 transitions. [2024-10-12 20:31:28,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-12 20:31:28,726 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 9.272727272727273) internal successors, (102), 10 states have internal predecessors, (102), 0 states have call successors, (0), 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 102 [2024-10-12 20:31:28,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:31:28,741 INFO L225 Difference]: With dead ends: 12195 [2024-10-12 20:31:28,741 INFO L226 Difference]: Without dead ends: 8300 [2024-10-12 20:31:28,748 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=138, Invalid=324, Unknown=0, NotChecked=0, Total=462 [2024-10-12 20:31:28,748 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 1243 mSDsluCounter, 658 mSDsCounter, 0 mSdLazyCounter, 565 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1243 SdHoareTripleChecker+Valid, 778 SdHoareTripleChecker+Invalid, 582 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 565 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 20:31:28,749 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1243 Valid, 778 Invalid, 582 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 565 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 20:31:28,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8300 states. [2024-10-12 20:31:28,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8300 to 4279. [2024-10-12 20:31:28,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4279 states, 4278 states have (on average 1.4719495091164094) internal successors, (6297), 4278 states have internal predecessors, (6297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:31:28,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4279 states to 4279 states and 6297 transitions. [2024-10-12 20:31:28,839 INFO L78 Accepts]: Start accepts. Automaton has 4279 states and 6297 transitions. Word has length 102 [2024-10-12 20:31:28,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:31:28,839 INFO L471 AbstractCegarLoop]: Abstraction has 4279 states and 6297 transitions. [2024-10-12 20:31:28,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.272727272727273) internal successors, (102), 10 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:31:28,840 INFO L276 IsEmpty]: Start isEmpty. Operand 4279 states and 6297 transitions. [2024-10-12 20:31:28,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-12 20:31:28,841 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:31:28,841 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:31:28,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-12 20:31:28,841 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:31:28,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:31:28,842 INFO L85 PathProgramCache]: Analyzing trace with hash -1834867680, now seen corresponding path program 1 times [2024-10-12 20:31:28,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:31:28,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353431189] [2024-10-12 20:31:28,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:31:28,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:31:28,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:31:29,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:31:29,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:31:29,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353431189] [2024-10-12 20:31:29,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353431189] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:31:29,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:31:29,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:31:29,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313635312] [2024-10-12 20:31:29,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:31:29,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 20:31:29,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:31:29,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 20:31:29,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:31:29,126 INFO L87 Difference]: Start difference. First operand 4279 states and 6297 transitions. Second operand has 8 states, 8 states have (on average 12.875) internal successors, (103), 7 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:31:29,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:31:29,595 INFO L93 Difference]: Finished difference Result 12074 states and 17906 transitions. [2024-10-12 20:31:29,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-12 20:31:29,596 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.875) internal successors, (103), 7 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 103 [2024-10-12 20:31:29,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:31:29,617 INFO L225 Difference]: With dead ends: 12074 [2024-10-12 20:31:29,617 INFO L226 Difference]: Without dead ends: 8090 [2024-10-12 20:31:29,624 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2024-10-12 20:31:29,625 INFO L432 NwaCegarLoop]: 182 mSDtfsCounter, 594 mSDsluCounter, 611 mSDsCounter, 0 mSdLazyCounter, 636 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 594 SdHoareTripleChecker+Valid, 793 SdHoareTripleChecker+Invalid, 637 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 636 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 20:31:29,625 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [594 Valid, 793 Invalid, 637 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 636 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 20:31:29,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8090 states. [2024-10-12 20:31:29,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8090 to 4189. [2024-10-12 20:31:29,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4189 states, 4188 states have (on average 1.4761222540592167) internal successors, (6182), 4188 states have internal predecessors, (6182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:31:29,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4189 states to 4189 states and 6182 transitions. [2024-10-12 20:31:29,718 INFO L78 Accepts]: Start accepts. Automaton has 4189 states and 6182 transitions. Word has length 103 [2024-10-12 20:31:29,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:31:29,719 INFO L471 AbstractCegarLoop]: Abstraction has 4189 states and 6182 transitions. [2024-10-12 20:31:29,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.875) internal successors, (103), 7 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:31:29,719 INFO L276 IsEmpty]: Start isEmpty. Operand 4189 states and 6182 transitions. [2024-10-12 20:31:29,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-12 20:31:29,720 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:31:29,720 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:31:29,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-12 20:31:29,721 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:31:29,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:31:29,721 INFO L85 PathProgramCache]: Analyzing trace with hash -65314201, now seen corresponding path program 1 times [2024-10-12 20:31:29,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:31:29,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216559996] [2024-10-12 20:31:29,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:31:29,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:31:29,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:31:30,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:31:30,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:31:30,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216559996] [2024-10-12 20:31:30,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216559996] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:31:30,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:31:30,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-12 20:31:30,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895042417] [2024-10-12 20:31:30,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:31:30,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-12 20:31:30,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:31:30,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-12 20:31:30,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2024-10-12 20:31:30,430 INFO L87 Difference]: Start difference. First operand 4189 states and 6182 transitions. Second operand has 13 states, 13 states have (on average 7.923076923076923) internal successors, (103), 12 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:31:31,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:31:31,070 INFO L93 Difference]: Finished difference Result 9253 states and 13714 transitions. [2024-10-12 20:31:31,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-12 20:31:31,071 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 7.923076923076923) internal successors, (103), 12 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 103 [2024-10-12 20:31:31,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:31:31,087 INFO L225 Difference]: With dead ends: 9253 [2024-10-12 20:31:31,087 INFO L226 Difference]: Without dead ends: 8171 [2024-10-12 20:31:31,092 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=142, Invalid=458, Unknown=0, NotChecked=0, Total=600 [2024-10-12 20:31:31,092 INFO L432 NwaCegarLoop]: 300 mSDtfsCounter, 977 mSDsluCounter, 1422 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 977 SdHoareTripleChecker+Valid, 1722 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 20:31:31,092 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [977 Valid, 1722 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 20:31:31,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8171 states. [2024-10-12 20:31:31,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8171 to 4167. [2024-10-12 20:31:31,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4167 states, 4166 states have (on average 1.4745559289486319) internal successors, (6143), 4166 states have internal predecessors, (6143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:31:31,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4167 states to 4167 states and 6143 transitions. [2024-10-12 20:31:31,175 INFO L78 Accepts]: Start accepts. Automaton has 4167 states and 6143 transitions. Word has length 103 [2024-10-12 20:31:31,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:31:31,175 INFO L471 AbstractCegarLoop]: Abstraction has 4167 states and 6143 transitions. [2024-10-12 20:31:31,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 7.923076923076923) internal successors, (103), 12 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:31:31,176 INFO L276 IsEmpty]: Start isEmpty. Operand 4167 states and 6143 transitions. [2024-10-12 20:31:31,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-12 20:31:31,177 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:31:31,177 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:31:31,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-12 20:31:31,177 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:31:31,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:31:31,178 INFO L85 PathProgramCache]: Analyzing trace with hash -2040213978, now seen corresponding path program 1 times [2024-10-12 20:31:31,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:31:31,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178882970] [2024-10-12 20:31:31,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:31:31,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:31:31,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:31:31,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:31:31,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:31:31,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178882970] [2024-10-12 20:31:31,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178882970] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:31:31,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:31:31,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-12 20:31:31,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587944871] [2024-10-12 20:31:31,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:31:31,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-12 20:31:31,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:31:31,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-12 20:31:31,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2024-10-12 20:31:31,994 INFO L87 Difference]: Start difference. First operand 4167 states and 6143 transitions. Second operand has 13 states, 13 states have (on average 7.923076923076923) internal successors, (103), 12 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:31:32,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:31:32,684 INFO L93 Difference]: Finished difference Result 5753 states and 8500 transitions. [2024-10-12 20:31:32,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-12 20:31:32,685 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 7.923076923076923) internal successors, (103), 12 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 103 [2024-10-12 20:31:32,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:31:32,695 INFO L225 Difference]: With dead ends: 5753 [2024-10-12 20:31:32,695 INFO L226 Difference]: Without dead ends: 4636 [2024-10-12 20:31:32,697 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=142, Invalid=458, Unknown=0, NotChecked=0, Total=600 [2024-10-12 20:31:32,698 INFO L432 NwaCegarLoop]: 311 mSDtfsCounter, 822 mSDsluCounter, 1915 mSDsCounter, 0 mSdLazyCounter, 372 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 822 SdHoareTripleChecker+Valid, 2226 SdHoareTripleChecker+Invalid, 372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 20:31:32,698 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [822 Valid, 2226 Invalid, 372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 372 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 20:31:32,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4636 states. [2024-10-12 20:31:32,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4636 to 4110. [2024-10-12 20:31:32,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4110 states, 4109 states have (on average 1.4757848624969578) internal successors, (6064), 4109 states have internal predecessors, (6064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:31:32,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4110 states to 4110 states and 6064 transitions. [2024-10-12 20:31:32,750 INFO L78 Accepts]: Start accepts. Automaton has 4110 states and 6064 transitions. Word has length 103 [2024-10-12 20:31:32,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:31:32,751 INFO L471 AbstractCegarLoop]: Abstraction has 4110 states and 6064 transitions. [2024-10-12 20:31:32,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 7.923076923076923) internal successors, (103), 12 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:31:32,751 INFO L276 IsEmpty]: Start isEmpty. Operand 4110 states and 6064 transitions. [2024-10-12 20:31:32,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-12 20:31:32,752 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:31:32,752 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:31:32,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-12 20:31:32,753 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:31:32,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:31:32,753 INFO L85 PathProgramCache]: Analyzing trace with hash 1787030600, now seen corresponding path program 1 times [2024-10-12 20:31:32,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:31:32,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795868262] [2024-10-12 20:31:32,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:31:32,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:31:32,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:31:33,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:31:33,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:31:33,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795868262] [2024-10-12 20:31:33,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795868262] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:31:33,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:31:33,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-12 20:31:33,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115668981] [2024-10-12 20:31:33,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:31:33,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-12 20:31:33,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:31:33,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-12 20:31:33,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2024-10-12 20:31:33,411 INFO L87 Difference]: Start difference. First operand 4110 states and 6064 transitions. Second operand has 13 states, 13 states have (on average 7.923076923076923) internal successors, (103), 12 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:31:34,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:31:34,015 INFO L93 Difference]: Finished difference Result 9074 states and 13458 transitions. [2024-10-12 20:31:34,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-12 20:31:34,016 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 7.923076923076923) internal successors, (103), 12 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 103 [2024-10-12 20:31:34,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:31:34,026 INFO L225 Difference]: With dead ends: 9074 [2024-10-12 20:31:34,026 INFO L226 Difference]: Without dead ends: 8032 [2024-10-12 20:31:34,031 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=142, Invalid=458, Unknown=0, NotChecked=0, Total=600 [2024-10-12 20:31:34,031 INFO L432 NwaCegarLoop]: 192 mSDtfsCounter, 1123 mSDsluCounter, 1132 mSDsCounter, 0 mSdLazyCounter, 301 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1123 SdHoareTripleChecker+Valid, 1324 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 20:31:34,031 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1123 Valid, 1324 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 301 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 20:31:34,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8032 states. [2024-10-12 20:31:34,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8032 to 4108. [2024-10-12 20:31:34,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4108 states, 4107 states have (on average 1.4738251765278791) internal successors, (6053), 4107 states have internal predecessors, (6053), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:31:34,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4108 states to 4108 states and 6053 transitions. [2024-10-12 20:31:34,124 INFO L78 Accepts]: Start accepts. Automaton has 4108 states and 6053 transitions. Word has length 103 [2024-10-12 20:31:34,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:31:34,124 INFO L471 AbstractCegarLoop]: Abstraction has 4108 states and 6053 transitions. [2024-10-12 20:31:34,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 7.923076923076923) internal successors, (103), 12 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:31:34,124 INFO L276 IsEmpty]: Start isEmpty. Operand 4108 states and 6053 transitions. [2024-10-12 20:31:34,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-12 20:31:34,125 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:31:34,126 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:31:34,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-12 20:31:34,126 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:31:34,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:31:34,127 INFO L85 PathProgramCache]: Analyzing trace with hash 1691904327, now seen corresponding path program 1 times [2024-10-12 20:31:34,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:31:34,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537817587] [2024-10-12 20:31:34,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:31:34,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:31:34,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:31:34,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:31:34,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:31:34,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537817587] [2024-10-12 20:31:34,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537817587] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:31:34,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:31:34,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-12 20:31:34,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392101248] [2024-10-12 20:31:34,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:31:34,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-12 20:31:34,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:31:34,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-12 20:31:34,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2024-10-12 20:31:34,804 INFO L87 Difference]: Start difference. First operand 4108 states and 6053 transitions. Second operand has 13 states, 13 states have (on average 7.923076923076923) internal successors, (103), 12 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:31:35,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:31:35,424 INFO L93 Difference]: Finished difference Result 9121 states and 13506 transitions. [2024-10-12 20:31:35,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-12 20:31:35,425 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 7.923076923076923) internal successors, (103), 12 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 103 [2024-10-12 20:31:35,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:31:35,432 INFO L225 Difference]: With dead ends: 9121 [2024-10-12 20:31:35,432 INFO L226 Difference]: Without dead ends: 8029 [2024-10-12 20:31:35,435 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=142, Invalid=458, Unknown=0, NotChecked=0, Total=600 [2024-10-12 20:31:35,436 INFO L432 NwaCegarLoop]: 303 mSDtfsCounter, 971 mSDsluCounter, 1718 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 971 SdHoareTripleChecker+Valid, 2021 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 20:31:35,436 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [971 Valid, 2021 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 20:31:35,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8029 states. [2024-10-12 20:31:35,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8029 to 4060. [2024-10-12 20:31:35,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4060 states, 4059 states have (on average 1.4757329391475733) internal successors, (5990), 4059 states have internal predecessors, (5990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:31:35,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4060 states to 4060 states and 5990 transitions. [2024-10-12 20:31:35,513 INFO L78 Accepts]: Start accepts. Automaton has 4060 states and 5990 transitions. Word has length 103 [2024-10-12 20:31:35,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:31:35,513 INFO L471 AbstractCegarLoop]: Abstraction has 4060 states and 5990 transitions. [2024-10-12 20:31:35,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 7.923076923076923) internal successors, (103), 12 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:31:35,513 INFO L276 IsEmpty]: Start isEmpty. Operand 4060 states and 5990 transitions. [2024-10-12 20:31:35,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-12 20:31:35,514 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:31:35,514 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:31:35,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-12 20:31:35,515 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:31:35,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:31:35,515 INFO L85 PathProgramCache]: Analyzing trace with hash -906949755, now seen corresponding path program 1 times [2024-10-12 20:31:35,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:31:35,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102338180] [2024-10-12 20:31:35,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:31:35,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:31:35,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:31:36,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:31:36,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:31:36,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102338180] [2024-10-12 20:31:36,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102338180] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:31:36,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:31:36,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-12 20:31:36,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699333021] [2024-10-12 20:31:36,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:31:36,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-12 20:31:36,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:31:36,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-12 20:31:36,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-10-12 20:31:36,075 INFO L87 Difference]: Start difference. First operand 4060 states and 5990 transitions. Second operand has 12 states, 12 states have (on average 8.583333333333334) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:31:36,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:31:36,584 INFO L93 Difference]: Finished difference Result 8990 states and 13338 transitions. [2024-10-12 20:31:36,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 20:31:36,585 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 8.583333333333334) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 103 [2024-10-12 20:31:36,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:31:36,592 INFO L225 Difference]: With dead ends: 8990 [2024-10-12 20:31:36,593 INFO L226 Difference]: Without dead ends: 7920 [2024-10-12 20:31:36,596 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=135, Invalid=327, Unknown=0, NotChecked=0, Total=462 [2024-10-12 20:31:36,597 INFO L432 NwaCegarLoop]: 282 mSDtfsCounter, 749 mSDsluCounter, 1195 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 749 SdHoareTripleChecker+Valid, 1477 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 20:31:36,597 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [749 Valid, 1477 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 20:31:36,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7920 states. [2024-10-12 20:31:36,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7920 to 4028. [2024-10-12 20:31:36,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4028 states, 4027 states have (on average 1.4775266948100323) internal successors, (5950), 4027 states have internal predecessors, (5950), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:31:36,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4028 states to 4028 states and 5950 transitions. [2024-10-12 20:31:36,696 INFO L78 Accepts]: Start accepts. Automaton has 4028 states and 5950 transitions. Word has length 103 [2024-10-12 20:31:36,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:31:36,697 INFO L471 AbstractCegarLoop]: Abstraction has 4028 states and 5950 transitions. [2024-10-12 20:31:36,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.583333333333334) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:31:36,698 INFO L276 IsEmpty]: Start isEmpty. Operand 4028 states and 5950 transitions. [2024-10-12 20:31:36,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-12 20:31:36,699 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:31:36,699 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:31:36,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-10-12 20:31:36,699 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:31:36,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:31:36,700 INFO L85 PathProgramCache]: Analyzing trace with hash 279853703, now seen corresponding path program 1 times [2024-10-12 20:31:36,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:31:36,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94020519] [2024-10-12 20:31:36,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:31:36,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:31:36,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:31:39,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:31:39,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:31:39,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94020519] [2024-10-12 20:31:39,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94020519] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:31:39,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:31:39,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [37] imperfect sequences [] total 37 [2024-10-12 20:31:39,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579309823] [2024-10-12 20:31:39,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:31:39,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2024-10-12 20:31:39,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:31:39,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-10-12 20:31:39,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=1226, Unknown=0, NotChecked=0, Total=1332 [2024-10-12 20:31:39,318 INFO L87 Difference]: Start difference. First operand 4028 states and 5950 transitions. Second operand has 37 states, 37 states have (on average 2.810810810810811) internal successors, (104), 37 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:31:43,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:31:43,125 INFO L93 Difference]: Finished difference Result 7943 states and 11778 transitions. [2024-10-12 20:31:43,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-10-12 20:31:43,126 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 2.810810810810811) internal successors, (104), 37 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 104 [2024-10-12 20:31:43,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:31:43,128 INFO L225 Difference]: With dead ends: 7943 [2024-10-12 20:31:43,129 INFO L226 Difference]: Without dead ends: 4053 [2024-10-12 20:31:43,132 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 754 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=652, Invalid=4040, Unknown=0, NotChecked=0, Total=4692 [2024-10-12 20:31:43,133 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 607 mSDsluCounter, 3343 mSDsCounter, 0 mSdLazyCounter, 2962 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 607 SdHoareTripleChecker+Valid, 3486 SdHoareTripleChecker+Invalid, 2967 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 2962 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-12 20:31:43,133 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [607 Valid, 3486 Invalid, 2967 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 2962 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-12 20:31:43,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4053 states. [2024-10-12 20:31:43,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4053 to 4049. [2024-10-12 20:31:43,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4049 states, 4048 states have (on average 1.4760375494071147) internal successors, (5975), 4048 states have internal predecessors, (5975), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:31:43,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4049 states to 4049 states and 5975 transitions. [2024-10-12 20:31:43,171 INFO L78 Accepts]: Start accepts. Automaton has 4049 states and 5975 transitions. Word has length 104 [2024-10-12 20:31:43,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:31:43,171 INFO L471 AbstractCegarLoop]: Abstraction has 4049 states and 5975 transitions. [2024-10-12 20:31:43,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 2.810810810810811) internal successors, (104), 37 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:31:43,171 INFO L276 IsEmpty]: Start isEmpty. Operand 4049 states and 5975 transitions. [2024-10-12 20:31:43,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-12 20:31:43,172 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:31:43,172 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:31:43,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-10-12 20:31:43,173 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:31:43,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:31:43,173 INFO L85 PathProgramCache]: Analyzing trace with hash -865532183, now seen corresponding path program 1 times [2024-10-12 20:31:43,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:31:43,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294045473] [2024-10-12 20:31:43,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:31:43,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:31:43,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:31:43,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:31:43,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:31:43,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294045473] [2024-10-12 20:31:43,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294045473] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:31:43,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:31:43,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-12 20:31:43,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176968371] [2024-10-12 20:31:43,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:31:43,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-12 20:31:43,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:31:43,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-12 20:31:43,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-10-12 20:31:43,807 INFO L87 Difference]: Start difference. First operand 4049 states and 5975 transitions. Second operand has 13 states, 13 states have (on average 8.076923076923077) internal successors, (105), 12 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:31:44,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:31:44,329 INFO L93 Difference]: Finished difference Result 8997 states and 13347 transitions. [2024-10-12 20:31:44,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-12 20:31:44,330 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 8.076923076923077) internal successors, (105), 12 states have internal predecessors, (105), 0 states have call successors, (0), 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 105 [2024-10-12 20:31:44,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:31:44,336 INFO L225 Difference]: With dead ends: 8997 [2024-10-12 20:31:44,336 INFO L226 Difference]: Without dead ends: 7943 [2024-10-12 20:31:44,338 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=143, Invalid=457, Unknown=0, NotChecked=0, Total=600 [2024-10-12 20:31:44,339 INFO L432 NwaCegarLoop]: 288 mSDtfsCounter, 921 mSDsluCounter, 1609 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 921 SdHoareTripleChecker+Valid, 1897 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 20:31:44,339 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [921 Valid, 1897 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 350 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 20:31:44,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7943 states. [2024-10-12 20:31:44,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7943 to 4032. [2024-10-12 20:31:44,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4032 states, 4031 states have (on average 1.4768047630860828) internal successors, (5953), 4031 states have internal predecessors, (5953), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:31:44,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4032 states to 4032 states and 5953 transitions. [2024-10-12 20:31:44,402 INFO L78 Accepts]: Start accepts. Automaton has 4032 states and 5953 transitions. Word has length 105 [2024-10-12 20:31:44,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:31:44,402 INFO L471 AbstractCegarLoop]: Abstraction has 4032 states and 5953 transitions. [2024-10-12 20:31:44,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 8.076923076923077) internal successors, (105), 12 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:31:44,403 INFO L276 IsEmpty]: Start isEmpty. Operand 4032 states and 5953 transitions. [2024-10-12 20:31:44,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-12 20:31:44,403 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:31:44,403 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:31:44,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-10-12 20:31:44,404 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:31:44,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:31:44,404 INFO L85 PathProgramCache]: Analyzing trace with hash 1810532165, now seen corresponding path program 1 times [2024-10-12 20:31:44,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:31:44,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500848649] [2024-10-12 20:31:44,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:31:44,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:31:44,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:31:44,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:31:44,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:31:44,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500848649] [2024-10-12 20:31:44,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500848649] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:31:44,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:31:44,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 20:31:44,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029757675] [2024-10-12 20:31:44,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:31:44,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 20:31:44,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:31:44,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 20:31:44,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 20:31:44,583 INFO L87 Difference]: Start difference. First operand 4032 states and 5953 transitions. Second operand has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:31:44,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:31:44,636 INFO L93 Difference]: Finished difference Result 9574 states and 14222 transitions. [2024-10-12 20:31:44,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 20:31:44,637 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 0 states have call successors, (0), 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 105 [2024-10-12 20:31:44,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:31:44,643 INFO L225 Difference]: With dead ends: 9574 [2024-10-12 20:31:44,644 INFO L226 Difference]: Without dead ends: 5686 [2024-10-12 20:31:44,649 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 20:31:44,650 INFO L432 NwaCegarLoop]: 208 mSDtfsCounter, 104 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 513 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:31:44,650 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 513 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:31:44,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5686 states. [2024-10-12 20:31:44,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5686 to 5658. [2024-10-12 20:31:44,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5658 states, 5657 states have (on average 1.4732190206823406) internal successors, (8334), 5657 states have internal predecessors, (8334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:31:44,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5658 states to 5658 states and 8334 transitions. [2024-10-12 20:31:44,721 INFO L78 Accepts]: Start accepts. Automaton has 5658 states and 8334 transitions. Word has length 105 [2024-10-12 20:31:44,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:31:44,721 INFO L471 AbstractCegarLoop]: Abstraction has 5658 states and 8334 transitions. [2024-10-12 20:31:44,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:31:44,721 INFO L276 IsEmpty]: Start isEmpty. Operand 5658 states and 8334 transitions. [2024-10-12 20:31:44,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-12 20:31:44,722 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:31:44,722 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:31:44,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-10-12 20:31:44,722 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:31:44,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:31:44,723 INFO L85 PathProgramCache]: Analyzing trace with hash 551447689, now seen corresponding path program 1 times [2024-10-12 20:31:44,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:31:44,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431655611] [2024-10-12 20:31:44,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:31:44,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:31:44,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:31:45,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:31:45,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:31:45,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431655611] [2024-10-12 20:31:45,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431655611] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:31:45,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:31:45,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 20:31:45,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393260540] [2024-10-12 20:31:45,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:31:45,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 20:31:45,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:31:45,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 20:31:45,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:31:45,091 INFO L87 Difference]: Start difference. First operand 5658 states and 8334 transitions. Second operand has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:31:45,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:31:45,125 INFO L93 Difference]: Finished difference Result 5688 states and 8377 transitions. [2024-10-12 20:31:45,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 20:31:45,125 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 0 states have call successors, (0), 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 105 [2024-10-12 20:31:45,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:31:45,128 INFO L225 Difference]: With dead ends: 5688 [2024-10-12 20:31:45,128 INFO L226 Difference]: Without dead ends: 5686 [2024-10-12 20:31:45,129 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:31:45,130 INFO L432 NwaCegarLoop]: 212 mSDtfsCounter, 0 mSDsluCounter, 628 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 840 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:31:45,130 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 840 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:31:45,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5686 states. [2024-10-12 20:31:45,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5686 to 5686. [2024-10-12 20:31:45,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5686 states, 5685 states have (on average 1.4656112576956903) internal successors, (8332), 5685 states have internal predecessors, (8332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:31:45,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5686 states to 5686 states and 8332 transitions. [2024-10-12 20:31:45,175 INFO L78 Accepts]: Start accepts. Automaton has 5686 states and 8332 transitions. Word has length 105 [2024-10-12 20:31:45,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:31:45,175 INFO L471 AbstractCegarLoop]: Abstraction has 5686 states and 8332 transitions. [2024-10-12 20:31:45,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:31:45,175 INFO L276 IsEmpty]: Start isEmpty. Operand 5686 states and 8332 transitions. [2024-10-12 20:31:45,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-10-12 20:31:45,178 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:31:45,180 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 20:31:45,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-10-12 20:31:45,180 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:31:45,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:31:45,181 INFO L85 PathProgramCache]: Analyzing trace with hash -850906055, now seen corresponding path program 1 times [2024-10-12 20:31:45,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:31:45,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717338287] [2024-10-12 20:31:45,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:31:45,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:31:45,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:31:45,336 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:31:45,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:31:45,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717338287] [2024-10-12 20:31:45,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717338287] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:31:45,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:31:45,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 20:31:45,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819423674] [2024-10-12 20:31:45,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:31:45,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 20:31:45,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:31:45,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 20:31:45,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:31:45,339 INFO L87 Difference]: Start difference. First operand 5686 states and 8332 transitions. Second operand has 7 states, 7 states have (on average 19.571428571428573) internal successors, (137), 6 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:31:45,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:31:45,737 INFO L93 Difference]: Finished difference Result 19164 states and 28366 transitions. [2024-10-12 20:31:45,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-12 20:31:45,738 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.571428571428573) internal successors, (137), 6 states have internal predecessors, (137), 0 states have call successors, (0), 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 137 [2024-10-12 20:31:45,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:31:45,755 INFO L225 Difference]: With dead ends: 19164 [2024-10-12 20:31:45,755 INFO L226 Difference]: Without dead ends: 13622 [2024-10-12 20:31:45,768 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2024-10-12 20:31:45,768 INFO L432 NwaCegarLoop]: 160 mSDtfsCounter, 935 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 422 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 935 SdHoareTripleChecker+Valid, 532 SdHoareTripleChecker+Invalid, 431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-12 20:31:45,769 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [935 Valid, 532 Invalid, 431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 422 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-12 20:31:45,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13622 states. [2024-10-12 20:31:45,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13622 to 8496. [2024-10-12 20:31:45,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8496 states, 8495 states have (on average 1.4680400235432607) internal successors, (12471), 8495 states have internal predecessors, (12471), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:31:45,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8496 states to 8496 states and 12471 transitions. [2024-10-12 20:31:45,887 INFO L78 Accepts]: Start accepts. Automaton has 8496 states and 12471 transitions. Word has length 137 [2024-10-12 20:31:45,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:31:45,887 INFO L471 AbstractCegarLoop]: Abstraction has 8496 states and 12471 transitions. [2024-10-12 20:31:45,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.571428571428573) internal successors, (137), 6 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:31:45,887 INFO L276 IsEmpty]: Start isEmpty. Operand 8496 states and 12471 transitions. [2024-10-12 20:31:45,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-10-12 20:31:45,890 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:31:45,890 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 20:31:45,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-10-12 20:31:45,891 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:31:45,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:31:45,891 INFO L85 PathProgramCache]: Analyzing trace with hash 2109927778, now seen corresponding path program 1 times [2024-10-12 20:31:45,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:31:45,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473492328] [2024-10-12 20:31:45,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:31:45,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:31:45,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:31:46,060 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:31:46,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:31:46,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473492328] [2024-10-12 20:31:46,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473492328] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:31:46,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:31:46,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 20:31:46,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273550768] [2024-10-12 20:31:46,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:31:46,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 20:31:46,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:31:46,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 20:31:46,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:31:46,062 INFO L87 Difference]: Start difference. First operand 8496 states and 12471 transitions. Second operand has 7 states, 7 states have (on average 19.571428571428573) internal successors, (137), 6 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:31:46,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:31:46,436 INFO L93 Difference]: Finished difference Result 29768 states and 43967 transitions. [2024-10-12 20:31:46,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-12 20:31:46,436 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.571428571428573) internal successors, (137), 6 states have internal predecessors, (137), 0 states have call successors, (0), 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 137 [2024-10-12 20:31:46,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:31:46,463 INFO L225 Difference]: With dead ends: 29768 [2024-10-12 20:31:46,463 INFO L226 Difference]: Without dead ends: 21452 [2024-10-12 20:31:46,475 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2024-10-12 20:31:46,476 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 1065 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1065 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 20:31:46,476 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1065 Valid, 411 Invalid, 304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 291 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 20:31:46,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21452 states. [2024-10-12 20:31:46,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21452 to 17970. [2024-10-12 20:31:46,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17970 states, 17969 states have (on average 1.4670821971172574) internal successors, (26362), 17969 states have internal predecessors, (26362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:31:46,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17970 states to 17970 states and 26362 transitions. [2024-10-12 20:31:46,699 INFO L78 Accepts]: Start accepts. Automaton has 17970 states and 26362 transitions. Word has length 137 [2024-10-12 20:31:46,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:31:46,699 INFO L471 AbstractCegarLoop]: Abstraction has 17970 states and 26362 transitions. [2024-10-12 20:31:46,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.571428571428573) internal successors, (137), 6 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:31:46,700 INFO L276 IsEmpty]: Start isEmpty. Operand 17970 states and 26362 transitions. [2024-10-12 20:31:46,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-10-12 20:31:46,702 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:31:46,702 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 20:31:46,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-10-12 20:31:46,702 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:31:46,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:31:46,703 INFO L85 PathProgramCache]: Analyzing trace with hash -1676271384, now seen corresponding path program 1 times [2024-10-12 20:31:46,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:31:46,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123156523] [2024-10-12 20:31:46,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:31:46,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:31:46,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:31:46,851 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:31:46,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:31:46,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123156523] [2024-10-12 20:31:46,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123156523] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:31:46,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:31:46,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 20:31:46,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066076206] [2024-10-12 20:31:46,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:31:46,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 20:31:46,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:31:46,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 20:31:46,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:31:46,852 INFO L87 Difference]: Start difference. First operand 17970 states and 26362 transitions. Second operand has 7 states, 7 states have (on average 19.571428571428573) internal successors, (137), 6 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:31:47,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:31:47,159 INFO L93 Difference]: Finished difference Result 58190 states and 85640 transitions. [2024-10-12 20:31:47,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-12 20:31:47,159 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.571428571428573) internal successors, (137), 6 states have internal predecessors, (137), 0 states have call successors, (0), 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 137 [2024-10-12 20:31:47,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:31:47,206 INFO L225 Difference]: With dead ends: 58190 [2024-10-12 20:31:47,206 INFO L226 Difference]: Without dead ends: 40400 [2024-10-12 20:31:47,229 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2024-10-12 20:31:47,230 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 980 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 980 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 20:31:47,230 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [980 Valid, 409 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 284 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 20:31:47,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40400 states. [2024-10-12 20:31:47,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40400 to 38078. [2024-10-12 20:31:47,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38078 states, 38077 states have (on average 1.4646111826036714) internal successors, (55768), 38077 states have internal predecessors, (55768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:31:47,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38078 states to 38078 states and 55768 transitions. [2024-10-12 20:31:47,695 INFO L78 Accepts]: Start accepts. Automaton has 38078 states and 55768 transitions. Word has length 137 [2024-10-12 20:31:47,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:31:47,696 INFO L471 AbstractCegarLoop]: Abstraction has 38078 states and 55768 transitions. [2024-10-12 20:31:47,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.571428571428573) internal successors, (137), 6 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:31:47,696 INFO L276 IsEmpty]: Start isEmpty. Operand 38078 states and 55768 transitions. [2024-10-12 20:31:47,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-10-12 20:31:47,700 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:31:47,700 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 20:31:47,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-10-12 20:31:47,700 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:31:47,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:31:47,701 INFO L85 PathProgramCache]: Analyzing trace with hash 1004996956, now seen corresponding path program 1 times [2024-10-12 20:31:47,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:31:47,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901363203] [2024-10-12 20:31:47,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:31:47,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:31:47,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:31:48,068 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:31:48,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:31:48,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901363203] [2024-10-12 20:31:48,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901363203] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:31:48,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:31:48,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 20:31:48,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953234624] [2024-10-12 20:31:48,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:31:48,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 20:31:48,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:31:48,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 20:31:48,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:31:48,071 INFO L87 Difference]: Start difference. First operand 38078 states and 55768 transitions. Second operand has 7 states, 7 states have (on average 19.571428571428573) internal successors, (137), 6 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:31:48,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:31:48,683 INFO L93 Difference]: Finished difference Result 136610 states and 200770 transitions. [2024-10-12 20:31:48,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-12 20:31:48,684 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.571428571428573) internal successors, (137), 6 states have internal predecessors, (137), 0 states have call successors, (0), 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 137 [2024-10-12 20:31:48,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:31:48,825 INFO L225 Difference]: With dead ends: 136610 [2024-10-12 20:31:48,825 INFO L226 Difference]: Without dead ends: 98712 [2024-10-12 20:31:48,881 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2024-10-12 20:31:48,881 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 1150 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 298 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1150 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 20:31:48,882 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1150 Valid, 413 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 298 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 20:31:48,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98712 states. [2024-10-12 20:31:49,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98712 to 80614. [2024-10-12 20:31:49,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80614 states, 80613 states have (on average 1.4616501060622977) internal successors, (117828), 80613 states have internal predecessors, (117828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:31:50,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80614 states to 80614 states and 117828 transitions. [2024-10-12 20:31:50,250 INFO L78 Accepts]: Start accepts. Automaton has 80614 states and 117828 transitions. Word has length 137 [2024-10-12 20:31:50,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:31:50,251 INFO L471 AbstractCegarLoop]: Abstraction has 80614 states and 117828 transitions. [2024-10-12 20:31:50,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.571428571428573) internal successors, (137), 6 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:31:50,251 INFO L276 IsEmpty]: Start isEmpty. Operand 80614 states and 117828 transitions. [2024-10-12 20:31:50,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-10-12 20:31:50,263 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:31:50,263 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 20:31:50,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-10-12 20:31:50,264 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:31:50,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:31:50,264 INFO L85 PathProgramCache]: Analyzing trace with hash 1064593622, now seen corresponding path program 1 times [2024-10-12 20:31:50,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:31:50,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421820221] [2024-10-12 20:31:50,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:31:50,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:31:50,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:31:50,606 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:31:50,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:31:50,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421820221] [2024-10-12 20:31:50,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421820221] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:31:50,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:31:50,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 20:31:50,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732074019] [2024-10-12 20:31:50,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:31:50,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 20:31:50,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:31:50,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 20:31:50,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:31:50,609 INFO L87 Difference]: Start difference. First operand 80614 states and 117828 transitions. Second operand has 7 states, 7 states have (on average 19.571428571428573) internal successors, (137), 6 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:31:51,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:31:51,648 INFO L93 Difference]: Finished difference Result 300874 states and 441238 transitions. [2024-10-12 20:31:51,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-12 20:31:51,649 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.571428571428573) internal successors, (137), 6 states have internal predecessors, (137), 0 states have call successors, (0), 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 137 [2024-10-12 20:31:51,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:31:52,172 INFO L225 Difference]: With dead ends: 300874 [2024-10-12 20:31:52,172 INFO L226 Difference]: Without dead ends: 220440 [2024-10-12 20:31:52,237 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2024-10-12 20:31:52,240 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 1235 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1235 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 20:31:52,240 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1235 Valid, 415 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 305 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 20:31:52,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220440 states. [2024-10-12 20:31:54,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220440 to 170326. [2024-10-12 20:31:54,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170326 states, 170325 states have (on average 1.4586467048290033) internal successors, (248444), 170325 states have internal predecessors, (248444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:31:55,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170326 states to 170326 states and 248444 transitions. [2024-10-12 20:31:55,161 INFO L78 Accepts]: Start accepts. Automaton has 170326 states and 248444 transitions. Word has length 137 [2024-10-12 20:31:55,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:31:55,161 INFO L471 AbstractCegarLoop]: Abstraction has 170326 states and 248444 transitions. [2024-10-12 20:31:55,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.571428571428573) internal successors, (137), 6 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:31:55,162 INFO L276 IsEmpty]: Start isEmpty. Operand 170326 states and 248444 transitions. [2024-10-12 20:31:55,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-10-12 20:31:55,167 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:31:55,168 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 20:31:55,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-10-12 20:31:55,168 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:31:55,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:31:55,168 INFO L85 PathProgramCache]: Analyzing trace with hash 56413271, now seen corresponding path program 1 times [2024-10-12 20:31:55,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:31:55,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767469895] [2024-10-12 20:31:55,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:31:55,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:31:55,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:31:55,334 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:31:55,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:31:55,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767469895] [2024-10-12 20:31:55,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767469895] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:31:55,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:31:55,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:31:55,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123190046] [2024-10-12 20:31:55,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:31:55,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:31:55,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:31:55,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:31:55,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:31:55,337 INFO L87 Difference]: Start difference. First operand 170326 states and 248444 transitions. Second operand has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:31:56,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:31:56,665 INFO L93 Difference]: Finished difference Result 300858 states and 439006 transitions. [2024-10-12 20:31:56,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:31:56,665 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 0 states have call successors, (0), 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 137 [2024-10-12 20:31:56,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:31:56,873 INFO L225 Difference]: With dead ends: 300858 [2024-10-12 20:31:56,873 INFO L226 Difference]: Without dead ends: 165046 [2024-10-12 20:31:56,937 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:31:56,938 INFO L432 NwaCegarLoop]: 293 mSDtfsCounter, 98 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:31:56,938 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 469 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:31:57,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165046 states. [2024-10-12 20:31:58,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165046 to 165044. [2024-10-12 20:31:58,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165044 states, 165043 states have (on average 1.450046351556867) internal successors, (239320), 165043 states have internal predecessors, (239320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:31:59,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165044 states to 165044 states and 239320 transitions. [2024-10-12 20:31:59,733 INFO L78 Accepts]: Start accepts. Automaton has 165044 states and 239320 transitions. Word has length 137 [2024-10-12 20:31:59,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:31:59,734 INFO L471 AbstractCegarLoop]: Abstraction has 165044 states and 239320 transitions. [2024-10-12 20:31:59,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:31:59,734 INFO L276 IsEmpty]: Start isEmpty. Operand 165044 states and 239320 transitions. [2024-10-12 20:31:59,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-10-12 20:31:59,760 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:31:59,760 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:31:59,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-10-12 20:31:59,761 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:31:59,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:31:59,761 INFO L85 PathProgramCache]: Analyzing trace with hash -641029208, now seen corresponding path program 1 times [2024-10-12 20:31:59,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:31:59,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227180065] [2024-10-12 20:31:59,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:31:59,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:31:59,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:31:59,978 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-12 20:31:59,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:31:59,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227180065] [2024-10-12 20:31:59,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227180065] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:31:59,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:31:59,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:31:59,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073098455] [2024-10-12 20:31:59,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:31:59,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:31:59,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:31:59,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:31:59,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:31:59,982 INFO L87 Difference]: Start difference. First operand 165044 states and 239320 transitions. Second operand has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:01,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:32:01,535 INFO L93 Difference]: Finished difference Result 320120 states and 463530 transitions. [2024-10-12 20:32:01,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:32:01,536 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 168 [2024-10-12 20:32:01,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:32:01,828 INFO L225 Difference]: With dead ends: 320120 [2024-10-12 20:32:01,828 INFO L226 Difference]: Without dead ends: 155248 [2024-10-12 20:32:01,913 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:32:01,915 INFO L432 NwaCegarLoop]: 277 mSDtfsCounter, 95 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:32:01,915 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 459 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:32:02,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155248 states. [2024-10-12 20:32:03,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155248 to 152354. [2024-10-12 20:32:03,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152354 states, 152353 states have (on average 1.4399125714623275) internal successors, (219375), 152353 states have internal predecessors, (219375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:04,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152354 states to 152354 states and 219375 transitions. [2024-10-12 20:32:04,204 INFO L78 Accepts]: Start accepts. Automaton has 152354 states and 219375 transitions. Word has length 168 [2024-10-12 20:32:04,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:32:04,204 INFO L471 AbstractCegarLoop]: Abstraction has 152354 states and 219375 transitions. [2024-10-12 20:32:04,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:04,205 INFO L276 IsEmpty]: Start isEmpty. Operand 152354 states and 219375 transitions. [2024-10-12 20:32:04,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-10-12 20:32:04,238 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:32:04,238 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:32:04,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-10-12 20:32:04,239 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:32:04,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:32:04,239 INFO L85 PathProgramCache]: Analyzing trace with hash 247806058, now seen corresponding path program 1 times [2024-10-12 20:32:04,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:32:04,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070448615] [2024-10-12 20:32:04,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:32:04,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:32:04,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:32:04,575 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-10-12 20:32:04,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:32:04,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070448615] [2024-10-12 20:32:04,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070448615] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:32:04,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:32:04,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:32:04,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955624068] [2024-10-12 20:32:04,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:32:04,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:32:04,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:32:04,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:32:04,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:32:04,576 INFO L87 Difference]: Start difference. First operand 152354 states and 219375 transitions. Second operand has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:05,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:32:05,237 INFO L93 Difference]: Finished difference Result 294806 states and 423729 transitions. [2024-10-12 20:32:05,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:32:05,238 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 0 states have call successors, (0), 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 169 [2024-10-12 20:32:05,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:32:05,415 INFO L225 Difference]: With dead ends: 294806 [2024-10-12 20:32:05,416 INFO L226 Difference]: Without dead ends: 142612 [2024-10-12 20:32:05,516 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:32:05,517 INFO L432 NwaCegarLoop]: 272 mSDtfsCounter, 88 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:32:05,517 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 460 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:32:05,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142612 states. [2024-10-12 20:32:07,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142612 to 139826. [2024-10-12 20:32:07,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139826 states, 139825 states have (on average 1.4295512247452173) internal successors, (199887), 139825 states have internal predecessors, (199887), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:08,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139826 states to 139826 states and 199887 transitions. [2024-10-12 20:32:08,152 INFO L78 Accepts]: Start accepts. Automaton has 139826 states and 199887 transitions. Word has length 169 [2024-10-12 20:32:08,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:32:08,153 INFO L471 AbstractCegarLoop]: Abstraction has 139826 states and 199887 transitions. [2024-10-12 20:32:08,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:08,153 INFO L276 IsEmpty]: Start isEmpty. Operand 139826 states and 199887 transitions. [2024-10-12 20:32:08,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-10-12 20:32:08,170 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:32:08,171 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:32:08,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-10-12 20:32:08,171 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:32:08,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:32:08,171 INFO L85 PathProgramCache]: Analyzing trace with hash 319562413, now seen corresponding path program 1 times [2024-10-12 20:32:08,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:32:08,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707219214] [2024-10-12 20:32:08,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:32:08,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:32:08,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:32:08,305 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-12 20:32:08,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:32:08,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707219214] [2024-10-12 20:32:08,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707219214] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:32:08,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:32:08,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:32:08,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732662347] [2024-10-12 20:32:08,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:32:08,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:32:08,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:32:08,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:32:08,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:32:08,307 INFO L87 Difference]: Start difference. First operand 139826 states and 199887 transitions. Second operand has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:09,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:32:09,644 INFO L93 Difference]: Finished difference Result 269750 states and 384753 transitions. [2024-10-12 20:32:09,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:32:09,644 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 0 states have call successors, (0), 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 170 [2024-10-12 20:32:09,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:32:09,848 INFO L225 Difference]: With dead ends: 269750 [2024-10-12 20:32:09,848 INFO L226 Difference]: Without dead ends: 130084 [2024-10-12 20:32:09,925 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:32:09,925 INFO L432 NwaCegarLoop]: 267 mSDtfsCounter, 81 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:32:09,926 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 461 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:32:10,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130084 states. [2024-10-12 20:32:11,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130084 to 127298. [2024-10-12 20:32:11,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127298 states, 127297 states have (on average 1.4171504434511417) internal successors, (180399), 127297 states have internal predecessors, (180399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:11,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127298 states to 127298 states and 180399 transitions. [2024-10-12 20:32:11,541 INFO L78 Accepts]: Start accepts. Automaton has 127298 states and 180399 transitions. Word has length 170 [2024-10-12 20:32:11,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:32:11,541 INFO L471 AbstractCegarLoop]: Abstraction has 127298 states and 180399 transitions. [2024-10-12 20:32:11,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:11,541 INFO L276 IsEmpty]: Start isEmpty. Operand 127298 states and 180399 transitions. [2024-10-12 20:32:11,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-12 20:32:11,552 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:32:11,552 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:32:11,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-10-12 20:32:11,552 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:32:11,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:32:11,553 INFO L85 PathProgramCache]: Analyzing trace with hash -2074153108, now seen corresponding path program 1 times [2024-10-12 20:32:11,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:32:11,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329744810] [2024-10-12 20:32:11,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:32:11,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:32:11,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:32:11,667 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-12 20:32:11,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:32:11,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329744810] [2024-10-12 20:32:11,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329744810] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:32:11,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:32:11,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:32:11,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598985417] [2024-10-12 20:32:11,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:32:11,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:32:11,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:32:11,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:32:11,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:32:11,669 INFO L87 Difference]: Start difference. First operand 127298 states and 180399 transitions. Second operand has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:13,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:32:13,030 INFO L93 Difference]: Finished difference Result 244694 states and 345777 transitions. [2024-10-12 20:32:13,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:32:13,031 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 171 [2024-10-12 20:32:13,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:32:13,197 INFO L225 Difference]: With dead ends: 244694 [2024-10-12 20:32:13,197 INFO L226 Difference]: Without dead ends: 117556 [2024-10-12 20:32:13,271 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:32:13,271 INFO L432 NwaCegarLoop]: 262 mSDtfsCounter, 74 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:32:13,272 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 462 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:32:13,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117556 states. [2024-10-12 20:32:14,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117556 to 114770. [2024-10-12 20:32:14,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114770 states, 114769 states have (on average 1.4020423633559584) internal successors, (160911), 114769 states have internal predecessors, (160911), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:15,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114770 states to 114770 states and 160911 transitions. [2024-10-12 20:32:15,008 INFO L78 Accepts]: Start accepts. Automaton has 114770 states and 160911 transitions. Word has length 171 [2024-10-12 20:32:15,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:32:15,008 INFO L471 AbstractCegarLoop]: Abstraction has 114770 states and 160911 transitions. [2024-10-12 20:32:15,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:32:15,008 INFO L276 IsEmpty]: Start isEmpty. Operand 114770 states and 160911 transitions. [2024-10-12 20:32:15,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-12 20:32:15,016 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:32:15,016 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 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] [2024-10-12 20:32:15,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-10-12 20:32:15,016 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:32:15,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:32:15,017 INFO L85 PathProgramCache]: Analyzing trace with hash -1282049149, now seen corresponding path program 1 times [2024-10-12 20:32:15,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:32:15,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7751510] [2024-10-12 20:32:15,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:32:15,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:32:15,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:32:15,147 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-12 20:32:15,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:32:15,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7751510] [2024-10-12 20:32:15,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7751510] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:32:15,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:32:15,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:32:15,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76717085] [2024-10-12 20:32:15,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:32:15,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:32:15,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:32:15,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:32:15,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:32:15,149 INFO L87 Difference]: Start difference. First operand 114770 states and 160911 transitions. Second operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)