./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c.v+cfa-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 e806b2de9400f1b211ac03466f80bb324cfea44da3c1d913127efd4a407821e8 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 15:59:08,207 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 15:59:08,245 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 15:59:08,248 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 15:59:08,248 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 15:59:08,263 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 15:59:08,264 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 15:59:08,264 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 15:59:08,265 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 15:59:08,265 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 15:59:08,265 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 15:59:08,265 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 15:59:08,266 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 15:59:08,266 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 15:59:08,266 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 15:59:08,266 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 15:59:08,267 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 15:59:08,267 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 15:59:08,267 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 15:59:08,268 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 15:59:08,268 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 15:59:08,268 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 15:59:08,269 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 15:59:08,269 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 15:59:08,269 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 15:59:08,269 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 15:59:08,270 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 15:59:08,270 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 15:59:08,270 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 15:59:08,270 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 15:59:08,270 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 15:59:08,271 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 15:59:08,271 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 15:59:08,271 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 15:59:08,271 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 15:59:08,272 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 15:59:08,272 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 15:59:08,272 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 15:59:08,272 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 15:59:08,273 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 15:59:08,273 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 15:59:08,273 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 15:59:08,273 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 -> e806b2de9400f1b211ac03466f80bb324cfea44da3c1d913127efd4a407821e8 [2024-11-08 15:59:08,472 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 15:59:08,496 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 15:59:08,498 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 15:59:08,500 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 15:59:08,500 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 15:59:08,501 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2024-11-08 15:59:09,860 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 15:59:10,061 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 15:59:10,061 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2024-11-08 15:59:10,071 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/103ace3b5/dcf3eb0400d04dacb75d06340c06b56a/FLAG0e71d520a [2024-11-08 15:59:10,083 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/103ace3b5/dcf3eb0400d04dacb75d06340c06b56a [2024-11-08 15:59:10,085 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 15:59:10,087 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 15:59:10,089 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 15:59:10,089 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 15:59:10,093 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 15:59:10,094 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 03:59:10" (1/1) ... [2024-11-08 15:59:10,094 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1dbfedbb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:59:10, skipping insertion in model container [2024-11-08 15:59:10,095 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 03:59:10" (1/1) ... [2024-11-08 15:59:10,137 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 15:59:10,396 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[7399,7412] [2024-11-08 15:59:10,455 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 15:59:10,471 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 15:59:10,505 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[7399,7412] [2024-11-08 15:59:10,520 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 15:59:10,545 INFO L204 MainTranslator]: Completed translation [2024-11-08 15:59:10,545 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:59:10 WrapperNode [2024-11-08 15:59:10,546 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 15:59:10,546 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 15:59:10,547 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 15:59:10,547 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 15:59:10,553 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:59:10" (1/1) ... [2024-11-08 15:59:10,568 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:59:10" (1/1) ... [2024-11-08 15:59:10,604 INFO L138 Inliner]: procedures = 26, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 682 [2024-11-08 15:59:10,605 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 15:59:10,605 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 15:59:10,606 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 15:59:10,606 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 15:59:10,614 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:59:10" (1/1) ... [2024-11-08 15:59:10,615 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:59:10" (1/1) ... [2024-11-08 15:59:10,618 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:59:10" (1/1) ... [2024-11-08 15:59:10,632 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 15:59:10,632 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:59:10" (1/1) ... [2024-11-08 15:59:10,633 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:59:10" (1/1) ... [2024-11-08 15:59:10,640 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:59:10" (1/1) ... [2024-11-08 15:59:10,646 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:59:10" (1/1) ... [2024-11-08 15:59:10,652 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:59:10" (1/1) ... [2024-11-08 15:59:10,655 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:59:10" (1/1) ... [2024-11-08 15:59:10,660 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 15:59:10,667 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 15:59:10,667 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 15:59:10,667 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 15:59:10,668 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:59:10" (1/1) ... [2024-11-08 15:59:10,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 15:59:10,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:59:10,702 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 15:59:10,716 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 15:59:10,789 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 15:59:10,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 15:59:10,789 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 15:59:10,789 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 15:59:10,889 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 15:59:10,892 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 15:59:11,486 INFO L? ?]: Removed 59 outVars from TransFormulas that were not future-live. [2024-11-08 15:59:11,486 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 15:59:11,510 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 15:59:11,510 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-08 15:59:11,510 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 03:59:11 BoogieIcfgContainer [2024-11-08 15:59:11,510 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 15:59:11,515 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 15:59:11,516 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 15:59:11,519 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 15:59:11,519 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 03:59:10" (1/3) ... [2024-11-08 15:59:11,520 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ef51630 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 03:59:11, skipping insertion in model container [2024-11-08 15:59:11,520 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:59:10" (2/3) ... [2024-11-08 15:59:11,521 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ef51630 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 03:59:11, skipping insertion in model container [2024-11-08 15:59:11,522 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 03:59:11" (3/3) ... [2024-11-08 15:59:11,523 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2024-11-08 15:59:11,537 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 15:59:11,537 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 15:59:11,599 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 15:59:11,606 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;@65963400, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 15:59:11,606 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 15:59:11,612 INFO L276 IsEmpty]: Start isEmpty. Operand has 165 states, 163 states have (on average 1.6993865030674846) internal successors, (277), 164 states have internal predecessors, (277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:59:11,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-08 15:59:11,631 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:59:11,633 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] [2024-11-08 15:59:11,633 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:59:11,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:59:11,639 INFO L85 PathProgramCache]: Analyzing trace with hash 2011282842, now seen corresponding path program 1 times [2024-11-08 15:59:11,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:59:11,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941235588] [2024-11-08 15:59:11,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:59:11,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:59:11,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:59:12,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:59:12,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:59:12,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941235588] [2024-11-08 15:59:12,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941235588] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:59:12,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:59:12,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 15:59:12,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84173648] [2024-11-08 15:59:12,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:59:12,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 15:59:12,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:59:12,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 15:59:12,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:59:12,124 INFO L87 Difference]: Start difference. First operand has 165 states, 163 states have (on average 1.6993865030674846) internal successors, (277), 164 states have internal predecessors, (277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:59:12,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:59:12,241 INFO L93 Difference]: Finished difference Result 391 states and 633 transitions. [2024-11-08 15:59:12,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 15:59:12,243 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 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 74 [2024-11-08 15:59:12,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:59:12,251 INFO L225 Difference]: With dead ends: 391 [2024-11-08 15:59:12,252 INFO L226 Difference]: Without dead ends: 264 [2024-11-08 15:59:12,254 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:59:12,256 INFO L432 NwaCegarLoop]: 404 mSDtfsCounter, 205 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 592 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 15:59:12,258 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 592 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 15:59:12,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2024-11-08 15:59:12,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 262. [2024-11-08 15:59:12,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 261 states have (on average 1.5019157088122606) internal successors, (392), 261 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:59:12,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 392 transitions. [2024-11-08 15:59:12,305 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 392 transitions. Word has length 74 [2024-11-08 15:59:12,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:59:12,306 INFO L471 AbstractCegarLoop]: Abstraction has 262 states and 392 transitions. [2024-11-08 15:59:12,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:59:12,307 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 392 transitions. [2024-11-08 15:59:12,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-08 15:59:12,309 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:59:12,309 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] [2024-11-08 15:59:12,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 15:59:12,309 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:59:12,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:59:12,310 INFO L85 PathProgramCache]: Analyzing trace with hash -141824057, now seen corresponding path program 1 times [2024-11-08 15:59:12,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:59:12,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737038413] [2024-11-08 15:59:12,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:59:12,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:59:12,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:59:12,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:59:12,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:59:12,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737038413] [2024-11-08 15:59:12,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737038413] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:59:12,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:59:12,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 15:59:12,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332181173] [2024-11-08 15:59:12,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:59:12,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 15:59:12,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:59:12,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 15:59:12,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:59:12,458 INFO L87 Difference]: Start difference. First operand 262 states and 392 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:59:12,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:59:12,496 INFO L93 Difference]: Finished difference Result 666 states and 1036 transitions. [2024-11-08 15:59:12,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 15:59:12,497 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 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 75 [2024-11-08 15:59:12,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:59:12,499 INFO L225 Difference]: With dead ends: 666 [2024-11-08 15:59:12,499 INFO L226 Difference]: Without dead ends: 448 [2024-11-08 15:59:12,500 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:59:12,501 INFO L432 NwaCegarLoop]: 339 mSDtfsCounter, 166 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 520 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:59:12,501 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 520 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:59:12,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2024-11-08 15:59:12,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 446. [2024-11-08 15:59:12,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 446 states, 445 states have (on average 1.5393258426966292) internal successors, (685), 445 states have internal predecessors, (685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:59:12,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 685 transitions. [2024-11-08 15:59:12,522 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 685 transitions. Word has length 75 [2024-11-08 15:59:12,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:59:12,523 INFO L471 AbstractCegarLoop]: Abstraction has 446 states and 685 transitions. [2024-11-08 15:59:12,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:59:12,523 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 685 transitions. [2024-11-08 15:59:12,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-08 15:59:12,525 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:59:12,525 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] [2024-11-08 15:59:12,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 15:59:12,525 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:59:12,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:59:12,526 INFO L85 PathProgramCache]: Analyzing trace with hash 890430339, now seen corresponding path program 1 times [2024-11-08 15:59:12,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:59:12,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459864661] [2024-11-08 15:59:12,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:59:12,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:59:12,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:59:12,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-11-08 15:59:12,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:59:12,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459864661] [2024-11-08 15:59:12,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459864661] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:59:12,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:59:12,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 15:59:12,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412802788] [2024-11-08 15:59:12,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:59:12,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 15:59:12,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:59:12,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 15:59:12,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:59:12,627 INFO L87 Difference]: Start difference. First operand 446 states and 685 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:59:12,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:59:12,654 INFO L93 Difference]: Finished difference Result 1186 states and 1863 transitions. [2024-11-08 15:59:12,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 15:59:12,654 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 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 76 [2024-11-08 15:59:12,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:59:12,657 INFO L225 Difference]: With dead ends: 1186 [2024-11-08 15:59:12,657 INFO L226 Difference]: Without dead ends: 784 [2024-11-08 15:59:12,660 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:59:12,661 INFO L432 NwaCegarLoop]: 320 mSDtfsCounter, 161 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:59:12,661 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 505 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:59:12,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 784 states. [2024-11-08 15:59:12,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 784 to 782. [2024-11-08 15:59:12,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 782 states, 781 states have (on average 1.558258642765685) internal successors, (1217), 781 states have internal predecessors, (1217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:59:12,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 1217 transitions. [2024-11-08 15:59:12,694 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 1217 transitions. Word has length 76 [2024-11-08 15:59:12,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:59:12,694 INFO L471 AbstractCegarLoop]: Abstraction has 782 states and 1217 transitions. [2024-11-08 15:59:12,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:59:12,695 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 1217 transitions. [2024-11-08 15:59:12,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-08 15:59:12,696 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:59:12,696 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] [2024-11-08 15:59:12,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 15:59:12,696 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:59:12,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:59:12,697 INFO L85 PathProgramCache]: Analyzing trace with hash -806203398, now seen corresponding path program 1 times [2024-11-08 15:59:12,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:59:12,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826667030] [2024-11-08 15:59:12,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:59:12,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:59:12,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:59:12,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:59:12,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:59:12,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826667030] [2024-11-08 15:59:12,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826667030] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:59:12,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:59:12,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 15:59:12,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980450726] [2024-11-08 15:59:12,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:59:12,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 15:59:12,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:59:12,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 15:59:12,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:59:12,788 INFO L87 Difference]: Start difference. First operand 782 states and 1217 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:59:12,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:59:12,817 INFO L93 Difference]: Finished difference Result 2130 states and 3355 transitions. [2024-11-08 15:59:12,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 15:59:12,817 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 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 77 [2024-11-08 15:59:12,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:59:12,823 INFO L225 Difference]: With dead ends: 2130 [2024-11-08 15:59:12,823 INFO L226 Difference]: Without dead ends: 1392 [2024-11-08 15:59:12,826 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:59:12,828 INFO L432 NwaCegarLoop]: 301 mSDtfsCounter, 156 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:59:12,830 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 490 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:59:12,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1392 states. [2024-11-08 15:59:12,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1392 to 1390. [2024-11-08 15:59:12,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1390 states, 1389 states have (on average 1.564434845212383) internal successors, (2173), 1389 states have internal predecessors, (2173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:59:12,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1390 states to 1390 states and 2173 transitions. [2024-11-08 15:59:12,907 INFO L78 Accepts]: Start accepts. Automaton has 1390 states and 2173 transitions. Word has length 77 [2024-11-08 15:59:12,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:59:12,907 INFO L471 AbstractCegarLoop]: Abstraction has 1390 states and 2173 transitions. [2024-11-08 15:59:12,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:59:12,908 INFO L276 IsEmpty]: Start isEmpty. Operand 1390 states and 2173 transitions. [2024-11-08 15:59:12,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-08 15:59:12,912 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:59:12,912 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] [2024-11-08 15:59:12,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 15:59:12,913 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:59:12,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:59:12,913 INFO L85 PathProgramCache]: Analyzing trace with hash -904090240, now seen corresponding path program 1 times [2024-11-08 15:59:12,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:59:12,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619149445] [2024-11-08 15:59:12,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:59:12,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:59:12,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:59:13,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:59:13,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:59:13,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619149445] [2024-11-08 15:59:13,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619149445] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:59:13,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:59:13,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 15:59:13,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419308307] [2024-11-08 15:59:13,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:59:13,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 15:59:13,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:59:13,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 15:59:13,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:59:13,051 INFO L87 Difference]: Start difference. First operand 1390 states and 2173 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:59:13,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:59:13,079 INFO L93 Difference]: Finished difference Result 3826 states and 6015 transitions. [2024-11-08 15:59:13,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 15:59:13,079 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 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 78 [2024-11-08 15:59:13,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:59:13,088 INFO L225 Difference]: With dead ends: 3826 [2024-11-08 15:59:13,088 INFO L226 Difference]: Without dead ends: 2480 [2024-11-08 15:59:13,090 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:59:13,093 INFO L432 NwaCegarLoop]: 282 mSDtfsCounter, 151 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:59:13,094 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 475 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:59:13,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2480 states. [2024-11-08 15:59:13,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2480 to 2478. [2024-11-08 15:59:13,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2478 states, 2477 states have (on average 1.5619701251513929) internal successors, (3869), 2477 states have internal predecessors, (3869), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:59:13,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2478 states to 2478 states and 3869 transitions. [2024-11-08 15:59:13,137 INFO L78 Accepts]: Start accepts. Automaton has 2478 states and 3869 transitions. Word has length 78 [2024-11-08 15:59:13,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:59:13,138 INFO L471 AbstractCegarLoop]: Abstraction has 2478 states and 3869 transitions. [2024-11-08 15:59:13,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:59:13,138 INFO L276 IsEmpty]: Start isEmpty. Operand 2478 states and 3869 transitions. [2024-11-08 15:59:13,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-08 15:59:13,139 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:59:13,140 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] [2024-11-08 15:59:13,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 15:59:13,140 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:59:13,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:59:13,140 INFO L85 PathProgramCache]: Analyzing trace with hash 1797609537, now seen corresponding path program 1 times [2024-11-08 15:59:13,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:59:13,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464089282] [2024-11-08 15:59:13,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:59:13,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:59:13,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:59:13,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:59:13,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:59:13,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464089282] [2024-11-08 15:59:13,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464089282] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:59:13,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:59:13,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-08 15:59:13,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763131082] [2024-11-08 15:59:13,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:59:13,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 15:59:13,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:59:13,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 15:59:13,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-08 15:59:13,331 INFO L87 Difference]: Start difference. First operand 2478 states and 3869 transitions. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:59:13,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:59:13,599 INFO L93 Difference]: Finished difference Result 19516 states and 30644 transitions. [2024-11-08 15:59:13,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 15:59:13,600 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 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 79 [2024-11-08 15:59:13,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:59:13,654 INFO L225 Difference]: With dead ends: 19516 [2024-11-08 15:59:13,655 INFO L226 Difference]: Without dead ends: 17082 [2024-11-08 15:59:13,665 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2024-11-08 15:59:13,666 INFO L432 NwaCegarLoop]: 230 mSDtfsCounter, 2601 mSDsluCounter, 3042 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2601 SdHoareTripleChecker+Valid, 3272 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 15:59:13,668 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2601 Valid, 3272 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 15:59:13,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17082 states. [2024-11-08 15:59:13,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17082 to 4910. [2024-11-08 15:59:13,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4910 states, 4909 states have (on average 1.5540843348950906) internal successors, (7629), 4909 states have internal predecessors, (7629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:59:13,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4910 states to 4910 states and 7629 transitions. [2024-11-08 15:59:13,847 INFO L78 Accepts]: Start accepts. Automaton has 4910 states and 7629 transitions. Word has length 79 [2024-11-08 15:59:13,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:59:13,849 INFO L471 AbstractCegarLoop]: Abstraction has 4910 states and 7629 transitions. [2024-11-08 15:59:13,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:59:13,849 INFO L276 IsEmpty]: Start isEmpty. Operand 4910 states and 7629 transitions. [2024-11-08 15:59:13,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-08 15:59:13,850 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:59:13,850 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] [2024-11-08 15:59:13,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 15:59:13,850 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:59:13,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:59:13,851 INFO L85 PathProgramCache]: Analyzing trace with hash -128135395, now seen corresponding path program 1 times [2024-11-08 15:59:13,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:59:13,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794702287] [2024-11-08 15:59:13,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:59:13,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:59:13,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:59:14,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:59:14,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:59:14,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794702287] [2024-11-08 15:59:14,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794702287] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:59:14,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:59:14,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-08 15:59:14,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795982474] [2024-11-08 15:59:14,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:59:14,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 15:59:14,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:59:14,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 15:59:14,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2024-11-08 15:59:14,222 INFO L87 Difference]: Start difference. First operand 4910 states and 7629 transitions. Second operand has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:59:14,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:59:14,461 INFO L93 Difference]: Finished difference Result 30106 states and 46547 transitions. [2024-11-08 15:59:14,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 15:59:14,462 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 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 80 [2024-11-08 15:59:14,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:59:14,513 INFO L225 Difference]: With dead ends: 30106 [2024-11-08 15:59:14,513 INFO L226 Difference]: Without dead ends: 25240 [2024-11-08 15:59:14,528 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2024-11-08 15:59:14,530 INFO L432 NwaCegarLoop]: 674 mSDtfsCounter, 1038 mSDsluCounter, 1064 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1038 SdHoareTripleChecker+Valid, 1738 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 15:59:14,531 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1038 Valid, 1738 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 15:59:14,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25240 states. [2024-11-08 15:59:14,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25240 to 25230. [2024-11-08 15:59:14,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25230 states, 25229 states have (on average 1.54159895358516) internal successors, (38893), 25229 states have internal predecessors, (38893), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:59:14,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25230 states to 25230 states and 38893 transitions. [2024-11-08 15:59:14,992 INFO L78 Accepts]: Start accepts. Automaton has 25230 states and 38893 transitions. Word has length 80 [2024-11-08 15:59:14,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:59:14,993 INFO L471 AbstractCegarLoop]: Abstraction has 25230 states and 38893 transitions. [2024-11-08 15:59:14,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:59:14,994 INFO L276 IsEmpty]: Start isEmpty. Operand 25230 states and 38893 transitions. [2024-11-08 15:59:14,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-08 15:59:14,995 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:59:14,995 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] [2024-11-08 15:59:14,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 15:59:14,995 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:59:14,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:59:14,996 INFO L85 PathProgramCache]: Analyzing trace with hash 750877787, now seen corresponding path program 1 times [2024-11-08 15:59:14,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:59:14,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475037731] [2024-11-08 15:59:14,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:59:14,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:59:15,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:59:15,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:59:15,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:59:15,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475037731] [2024-11-08 15:59:15,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475037731] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:59:15,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:59:15,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 15:59:15,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621729988] [2024-11-08 15:59:15,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:59:15,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 15:59:15,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:59:15,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 15:59:15,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:59:15,202 INFO L87 Difference]: Start difference. First operand 25230 states and 38893 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:59:15,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:59:15,434 INFO L93 Difference]: Finished difference Result 69010 states and 105967 transitions. [2024-11-08 15:59:15,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 15:59:15,435 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 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 81 [2024-11-08 15:59:15,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:59:15,693 INFO L225 Difference]: With dead ends: 69010 [2024-11-08 15:59:15,693 INFO L226 Difference]: Without dead ends: 43824 [2024-11-08 15:59:15,714 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:59:15,714 INFO L432 NwaCegarLoop]: 387 mSDtfsCounter, 173 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 560 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:59:15,715 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 560 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:59:15,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43824 states. [2024-11-08 15:59:16,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43824 to 43822. [2024-11-08 15:59:16,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43822 states, 43821 states have (on average 1.5228543392437417) internal successors, (66733), 43821 states have internal predecessors, (66733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:59:16,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43822 states to 43822 states and 66733 transitions. [2024-11-08 15:59:16,767 INFO L78 Accepts]: Start accepts. Automaton has 43822 states and 66733 transitions. Word has length 81 [2024-11-08 15:59:16,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:59:16,767 INFO L471 AbstractCegarLoop]: Abstraction has 43822 states and 66733 transitions. [2024-11-08 15:59:16,767 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:59:16,767 INFO L276 IsEmpty]: Start isEmpty. Operand 43822 states and 66733 transitions. [2024-11-08 15:59:16,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-08 15:59:16,768 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:59:16,768 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] [2024-11-08 15:59:16,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 15:59:16,768 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:59:16,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:59:16,769 INFO L85 PathProgramCache]: Analyzing trace with hash -1315274732, now seen corresponding path program 1 times [2024-11-08 15:59:16,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:59:16,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535115641] [2024-11-08 15:59:16,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:59:16,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:59:16,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:59:16,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:59:16,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:59:16,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535115641] [2024-11-08 15:59:16,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535115641] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:59:16,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:59:16,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 15:59:16,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384388063] [2024-11-08 15:59:16,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:59:16,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 15:59:16,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:59:16,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 15:59:16,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 15:59:16,883 INFO L87 Difference]: Start difference. First operand 43822 states and 66733 transitions. Second operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:59:17,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:59:17,957 INFO L93 Difference]: Finished difference Result 125042 states and 190575 transitions. [2024-11-08 15:59:17,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 15:59:17,958 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 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 82 [2024-11-08 15:59:17,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:59:18,117 INFO L225 Difference]: With dead ends: 125042 [2024-11-08 15:59:18,118 INFO L226 Difference]: Without dead ends: 81264 [2024-11-08 15:59:18,169 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-08 15:59:18,170 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 1007 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1007 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 15:59:18,170 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1007 Valid, 260 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 15:59:18,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81264 states. [2024-11-08 15:59:19,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81264 to 81262. [2024-11-08 15:59:19,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81262 states, 81261 states have (on average 1.515868620863637) internal successors, (123181), 81261 states have internal predecessors, (123181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:59:19,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81262 states to 81262 states and 123181 transitions. [2024-11-08 15:59:19,869 INFO L78 Accepts]: Start accepts. Automaton has 81262 states and 123181 transitions. Word has length 82 [2024-11-08 15:59:19,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:59:19,870 INFO L471 AbstractCegarLoop]: Abstraction has 81262 states and 123181 transitions. [2024-11-08 15:59:19,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:59:19,870 INFO L276 IsEmpty]: Start isEmpty. Operand 81262 states and 123181 transitions. [2024-11-08 15:59:19,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-08 15:59:19,873 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:59:19,873 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] [2024-11-08 15:59:19,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 15:59:19,873 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:59:19,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:59:19,874 INFO L85 PathProgramCache]: Analyzing trace with hash -1885691313, now seen corresponding path program 1 times [2024-11-08 15:59:19,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:59:19,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882926621] [2024-11-08 15:59:19,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:59:19,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:59:19,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:59:20,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:59:20,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:59:20,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882926621] [2024-11-08 15:59:20,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882926621] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:59:20,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:59:20,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 15:59:20,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262823350] [2024-11-08 15:59:20,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:59:20,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 15:59:20,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:59:20,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 15:59:20,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 15:59:20,090 INFO L87 Difference]: Start difference. First operand 81262 states and 123181 transitions. Second operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:59:20,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:59:20,502 INFO L93 Difference]: Finished difference Result 84080 states and 127406 transitions. [2024-11-08 15:59:20,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 15:59:20,503 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 0 states have call successors, (0), 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 82 [2024-11-08 15:59:20,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:59:20,605 INFO L225 Difference]: With dead ends: 84080 [2024-11-08 15:59:20,606 INFO L226 Difference]: Without dead ends: 84078 [2024-11-08 15:59:20,633 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-11-08 15:59:20,633 INFO L432 NwaCegarLoop]: 229 mSDtfsCounter, 0 mSDsluCounter, 677 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 906 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:59:20,634 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 906 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:59:20,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84078 states. [2024-11-08 15:59:22,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84078 to 84078. [2024-11-08 15:59:22,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84078 states, 84077 states have (on average 1.4985905776847415) internal successors, (125997), 84077 states have internal predecessors, (125997), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:59:22,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84078 states to 84078 states and 125997 transitions. [2024-11-08 15:59:22,196 INFO L78 Accepts]: Start accepts. Automaton has 84078 states and 125997 transitions. Word has length 82 [2024-11-08 15:59:22,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:59:22,196 INFO L471 AbstractCegarLoop]: Abstraction has 84078 states and 125997 transitions. [2024-11-08 15:59:22,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:59:22,196 INFO L276 IsEmpty]: Start isEmpty. Operand 84078 states and 125997 transitions. [2024-11-08 15:59:22,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-08 15:59:22,197 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:59:22,197 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] [2024-11-08 15:59:22,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-08 15:59:22,198 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:59:22,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:59:22,198 INFO L85 PathProgramCache]: Analyzing trace with hash 1683684575, now seen corresponding path program 1 times [2024-11-08 15:59:22,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:59:22,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469934828] [2024-11-08 15:59:22,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:59:22,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:59:22,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:59:22,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:59:22,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:59:22,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469934828] [2024-11-08 15:59:22,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469934828] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:59:22,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:59:22,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 15:59:22,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017017879] [2024-11-08 15:59:22,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:59:22,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 15:59:22,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:59:22,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 15:59:22,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:59:22,267 INFO L87 Difference]: Start difference. First operand 84078 states and 125997 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:59:22,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:59:22,616 INFO L93 Difference]: Finished difference Result 189716 states and 283809 transitions. [2024-11-08 15:59:22,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 15:59:22,617 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 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 83 [2024-11-08 15:59:22,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:59:23,082 INFO L225 Difference]: With dead ends: 189716 [2024-11-08 15:59:23,082 INFO L226 Difference]: Without dead ends: 105682 [2024-11-08 15:59:23,180 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:59:23,181 INFO L432 NwaCegarLoop]: 231 mSDtfsCounter, 138 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:59:23,181 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 414 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:59:23,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105682 states. [2024-11-08 15:59:24,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105682 to 105328. [2024-11-08 15:59:24,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105328 states, 105327 states have (on average 1.4886876109639504) internal successors, (156799), 105327 states have internal predecessors, (156799), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:59:24,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105328 states to 105328 states and 156799 transitions. [2024-11-08 15:59:24,581 INFO L78 Accepts]: Start accepts. Automaton has 105328 states and 156799 transitions. Word has length 83 [2024-11-08 15:59:24,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:59:24,581 INFO L471 AbstractCegarLoop]: Abstraction has 105328 states and 156799 transitions. [2024-11-08 15:59:24,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:59:24,581 INFO L276 IsEmpty]: Start isEmpty. Operand 105328 states and 156799 transitions. [2024-11-08 15:59:24,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-08 15:59:24,609 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:59:24,609 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-08 15:59:24,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-08 15:59:24,609 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:59:24,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:59:24,610 INFO L85 PathProgramCache]: Analyzing trace with hash 967908386, now seen corresponding path program 1 times [2024-11-08 15:59:24,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:59:24,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165876419] [2024-11-08 15:59:24,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:59:24,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:59:25,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:59:25,433 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:59:25,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:59:25,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165876419] [2024-11-08 15:59:25,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165876419] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 15:59:25,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1477026174] [2024-11-08 15:59:25,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:59:25,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:59:25,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:59:25,436 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 15:59:25,438 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 15:59:25,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:59:25,587 INFO L255 TraceCheckSpWp]: Trace formula consists of 530 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-08 15:59:25,596 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 15:59:26,580 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:59:26,580 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 15:59:27,354 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:59:27,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1477026174] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 15:59:27,355 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 15:59:27,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 9] total 26 [2024-11-08 15:59:27,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167772969] [2024-11-08 15:59:27,355 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 15:59:27,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-08 15:59:27,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:59:27,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-08 15:59:27,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=517, Unknown=0, NotChecked=0, Total=650 [2024-11-08 15:59:27,357 INFO L87 Difference]: Start difference. First operand 105328 states and 156799 transitions. Second operand has 26 states, 26 states have (on average 12.807692307692308) internal successors, (333), 26 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:59:43,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:59:43,426 INFO L93 Difference]: Finished difference Result 1230884 states and 1823046 transitions. [2024-11-08 15:59:43,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 152 states. [2024-11-08 15:59:43,427 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 12.807692307692308) internal successors, (333), 26 states have internal predecessors, (333), 0 states have call successors, (0), 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 114 [2024-11-08 15:59:43,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:59:45,334 INFO L225 Difference]: With dead ends: 1230884 [2024-11-08 15:59:45,335 INFO L226 Difference]: Without dead ends: 1125602 [2024-11-08 15:59:45,632 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 386 GetRequests, 212 SyntacticMatches, 0 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12523 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=5116, Invalid=25684, Unknown=0, NotChecked=0, Total=30800 [2024-11-08 15:59:45,637 INFO L432 NwaCegarLoop]: 466 mSDtfsCounter, 23557 mSDsluCounter, 6526 mSDsCounter, 0 mSdLazyCounter, 6673 mSolverCounterSat, 183 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23557 SdHoareTripleChecker+Valid, 6992 SdHoareTripleChecker+Invalid, 6856 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 183 IncrementalHoareTripleChecker+Valid, 6673 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2024-11-08 15:59:45,637 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23557 Valid, 6992 Invalid, 6856 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [183 Valid, 6673 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2024-11-08 15:59:46,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1125602 states. [2024-11-08 16:00:00,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1125602 to 837456. [2024-11-08 16:00:01,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 837456 states, 837455 states have (on average 1.4693004400236431) internal successors, (1230473), 837455 states have internal predecessors, (1230473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:00:04,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837456 states to 837456 states and 1230473 transitions. [2024-11-08 16:00:04,358 INFO L78 Accepts]: Start accepts. Automaton has 837456 states and 1230473 transitions. Word has length 114 [2024-11-08 16:00:04,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:00:04,358 INFO L471 AbstractCegarLoop]: Abstraction has 837456 states and 1230473 transitions. [2024-11-08 16:00:04,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 12.807692307692308) internal successors, (333), 26 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:00:04,359 INFO L276 IsEmpty]: Start isEmpty. Operand 837456 states and 1230473 transitions. [2024-11-08 16:00:04,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-08 16:00:04,389 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:00:04,389 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-08 16:00:04,406 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-08 16:00:04,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-11-08 16:00:04,594 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:00:04,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:00:04,595 INFO L85 PathProgramCache]: Analyzing trace with hash 726750180, now seen corresponding path program 1 times [2024-11-08 16:00:04,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:00:04,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054829677] [2024-11-08 16:00:04,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:00:04,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:00:04,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:00:04,677 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:00:04,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:00:04,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054829677] [2024-11-08 16:00:04,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054829677] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:00:04,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:00:04,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 16:00:04,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784340450] [2024-11-08 16:00:04,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:00:04,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 16:00:04,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:00:04,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 16:00:04,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 16:00:04,680 INFO L87 Difference]: Start difference. First operand 837456 states and 1230473 transitions. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)