./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.6.1.ufo.BOUNDED-12.pals.c.v+nlh-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.1.ufo.BOUNDED-12.pals.c.v+nlh-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1a1d1149f676bf63a3b420effefd0eff28b85036d8f2ab9f39599a7a739fe76d --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 15:58:24,189 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 15:58:24,274 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 15:58:24,280 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 15:58:24,282 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 15:58:24,316 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 15:58:24,316 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 15:58:24,317 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 15:58:24,317 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 15:58:24,318 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 15:58:24,319 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 15:58:24,319 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 15:58:24,320 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 15:58:24,323 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 15:58:24,323 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 15:58:24,324 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 15:58:24,324 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 15:58:24,324 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 15:58:24,325 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 15:58:24,325 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 15:58:24,328 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 15:58:24,329 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 15:58:24,329 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 15:58:24,329 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 15:58:24,330 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 15:58:24,330 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 15:58:24,330 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 15:58:24,331 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 15:58:24,331 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 15:58:24,331 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 15:58:24,331 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 15:58:24,332 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 15:58:24,332 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 15:58:24,332 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 15:58:24,333 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 15:58:24,333 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 15:58:24,333 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 15:58:24,334 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 15:58:24,335 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 15:58:24,335 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 15:58:24,343 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 15:58:24,344 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 15:58:24,344 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 -> 1a1d1149f676bf63a3b420effefd0eff28b85036d8f2ab9f39599a7a739fe76d [2024-11-08 15:58:24,594 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 15:58:24,621 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 15:58:24,625 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 15:58:24,626 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 15:58:24,626 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 15:58:24,627 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.1.ufo.BOUNDED-12.pals.c.v+nlh-reducer.c [2024-11-08 15:58:26,141 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 15:58:26,393 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 15:58:26,394 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.6.1.ufo.BOUNDED-12.pals.c.v+nlh-reducer.c [2024-11-08 15:58:26,414 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/96526a213/9488f33fa534464d83ecf55ff50e1ebb/FLAGf1131d4fe [2024-11-08 15:58:26,432 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/96526a213/9488f33fa534464d83ecf55ff50e1ebb [2024-11-08 15:58:26,435 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 15:58:26,437 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 15:58:26,440 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 15:58:26,441 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 15:58:26,446 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 15:58:26,447 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 03:58:26" (1/1) ... [2024-11-08 15:58:26,448 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39acff2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:58:26, skipping insertion in model container [2024-11-08 15:58:26,448 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 03:58:26" (1/1) ... [2024-11-08 15:58:26,505 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 15:58:26,855 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.1.ufo.BOUNDED-12.pals.c.v+nlh-reducer.c[10021,10034] [2024-11-08 15:58:26,968 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 15:58:26,987 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 15:58:27,062 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.1.ufo.BOUNDED-12.pals.c.v+nlh-reducer.c[10021,10034] [2024-11-08 15:58:27,122 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 15:58:27,146 INFO L204 MainTranslator]: Completed translation [2024-11-08 15:58:27,147 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:58:27 WrapperNode [2024-11-08 15:58:27,147 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 15:58:27,148 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 15:58:27,148 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 15:58:27,148 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 15:58:27,157 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:58:27" (1/1) ... [2024-11-08 15:58:27,171 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:58:27" (1/1) ... [2024-11-08 15:58:27,231 INFO L138 Inliner]: procedures = 25, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1049 [2024-11-08 15:58:27,232 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 15:58:27,233 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 15:58:27,233 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 15:58:27,233 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 15:58:27,245 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:58:27" (1/1) ... [2024-11-08 15:58:27,245 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:58:27" (1/1) ... [2024-11-08 15:58:27,250 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:58:27" (1/1) ... [2024-11-08 15:58:27,271 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:58:27,272 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:58:27" (1/1) ... [2024-11-08 15:58:27,272 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:58:27" (1/1) ... [2024-11-08 15:58:27,286 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:58:27" (1/1) ... [2024-11-08 15:58:27,299 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:58:27" (1/1) ... [2024-11-08 15:58:27,303 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:58:27" (1/1) ... [2024-11-08 15:58:27,307 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:58:27" (1/1) ... [2024-11-08 15:58:27,312 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 15:58:27,313 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 15:58:27,313 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 15:58:27,314 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 15:58:27,314 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:58:27" (1/1) ... [2024-11-08 15:58:27,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 15:58:27,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:58:27,367 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:58:27,374 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:58:27,421 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 15:58:27,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 15:58:27,422 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 15:58:27,422 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 15:58:27,582 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 15:58:27,584 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 15:58:28,576 INFO L? ?]: Removed 117 outVars from TransFormulas that were not future-live. [2024-11-08 15:58:28,577 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 15:58:28,606 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 15:58:28,606 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-08 15:58:28,606 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 03:58:28 BoogieIcfgContainer [2024-11-08 15:58:28,607 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 15:58:28,609 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 15:58:28,609 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 15:58:28,613 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 15:58:28,614 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 03:58:26" (1/3) ... [2024-11-08 15:58:28,614 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e86909c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 03:58:28, skipping insertion in model container [2024-11-08 15:58:28,615 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:58:27" (2/3) ... [2024-11-08 15:58:28,616 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e86909c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 03:58:28, skipping insertion in model container [2024-11-08 15:58:28,616 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 03:58:28" (3/3) ... [2024-11-08 15:58:28,617 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.6.1.ufo.BOUNDED-12.pals.c.v+nlh-reducer.c [2024-11-08 15:58:28,636 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 15:58:28,636 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 15:58:28,707 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 15:58:28,713 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;@35667286, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 15:58:28,713 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 15:58:28,721 INFO L276 IsEmpty]: Start isEmpty. Operand has 259 states, 257 states have (on average 1.7237354085603114) internal successors, (443), 258 states have internal predecessors, (443), 0 states have call successors, (0), 0 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:58:28,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-08 15:58:28,735 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:58:28,739 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:58:28,739 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:58:28,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:58:28,747 INFO L85 PathProgramCache]: Analyzing trace with hash 891906329, now seen corresponding path program 1 times [2024-11-08 15:58:28,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:58:28,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756469673] [2024-11-08 15:58:28,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:58:28,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:58:29,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:58:29,656 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:58:29,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:58:29,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756469673] [2024-11-08 15:58:29,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756469673] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:58:29,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:58:29,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-08 15:58:29,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99693824] [2024-11-08 15:58:29,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:58:29,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 15:58:29,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:58:29,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 15:58:29,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-08 15:58:29,702 INFO L87 Difference]: Start difference. First operand has 259 states, 257 states have (on average 1.7237354085603114) internal successors, (443), 258 states have internal predecessors, (443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 8 states, 8 states have (on average 12.125) internal successors, (97), 8 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:58:30,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:58:30,142 INFO L93 Difference]: Finished difference Result 1164 states and 1888 transitions. [2024-11-08 15:58:30,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 15:58:30,145 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.125) internal successors, (97), 8 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2024-11-08 15:58:30,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:58:30,173 INFO L225 Difference]: With dead ends: 1164 [2024-11-08 15:58:30,173 INFO L226 Difference]: Without dead ends: 1023 [2024-11-08 15:58:30,178 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:58:30,182 INFO L432 NwaCegarLoop]: 450 mSDtfsCounter, 3889 mSDsluCounter, 3535 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3889 SdHoareTripleChecker+Valid, 3985 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 15:58:30,185 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3889 Valid, 3985 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 15:58:30,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1023 states. [2024-11-08 15:58:30,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1023 to 396. [2024-11-08 15:58:30,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 395 states have (on average 1.5012658227848101) internal successors, (593), 395 states have internal predecessors, (593), 0 states have call successors, (0), 0 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:58:30,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 593 transitions. [2024-11-08 15:58:30,272 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 593 transitions. Word has length 97 [2024-11-08 15:58:30,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:58:30,273 INFO L471 AbstractCegarLoop]: Abstraction has 396 states and 593 transitions. [2024-11-08 15:58:30,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.125) internal successors, (97), 8 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:58:30,274 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 593 transitions. [2024-11-08 15:58:30,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-08 15:58:30,278 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:58:30,278 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:58:30,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 15:58:30,279 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:58:30,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:58:30,280 INFO L85 PathProgramCache]: Analyzing trace with hash 1536603989, now seen corresponding path program 1 times [2024-11-08 15:58:30,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:58:30,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134648938] [2024-11-08 15:58:30,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:58:30,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:58:30,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:58:30,733 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:58:30,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:58:30,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134648938] [2024-11-08 15:58:30,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134648938] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:58:30,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:58:30,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-08 15:58:30,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953928068] [2024-11-08 15:58:30,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:58:30,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 15:58:30,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:58:30,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 15:58:30,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2024-11-08 15:58:30,737 INFO L87 Difference]: Start difference. First operand 396 states and 593 transitions. Second operand has 8 states, 8 states have (on average 12.25) internal successors, (98), 8 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:58:31,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:58:31,065 INFO L93 Difference]: Finished difference Result 1973 states and 3057 transitions. [2024-11-08 15:58:31,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 15:58:31,065 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.25) internal successors, (98), 8 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2024-11-08 15:58:31,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:58:31,072 INFO L225 Difference]: With dead ends: 1973 [2024-11-08 15:58:31,073 INFO L226 Difference]: Without dead ends: 1677 [2024-11-08 15:58:31,075 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:58:31,076 INFO L432 NwaCegarLoop]: 755 mSDtfsCounter, 2070 mSDsluCounter, 1372 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2070 SdHoareTripleChecker+Valid, 2127 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 15:58:31,076 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2070 Valid, 2127 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 15:58:31,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1677 states. [2024-11-08 15:58:31,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1677 to 1667. [2024-11-08 15:58:31,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1667 states, 1666 states have (on average 1.546218487394958) internal successors, (2576), 1666 states have internal predecessors, (2576), 0 states have call successors, (0), 0 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:58:31,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1667 states to 1667 states and 2576 transitions. [2024-11-08 15:58:31,134 INFO L78 Accepts]: Start accepts. Automaton has 1667 states and 2576 transitions. Word has length 98 [2024-11-08 15:58:31,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:58:31,135 INFO L471 AbstractCegarLoop]: Abstraction has 1667 states and 2576 transitions. [2024-11-08 15:58:31,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.25) internal successors, (98), 8 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:58:31,136 INFO L276 IsEmpty]: Start isEmpty. Operand 1667 states and 2576 transitions. [2024-11-08 15:58:31,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-08 15:58:31,144 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:58:31,144 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:58:31,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 15:58:31,145 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:58:31,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:58:31,148 INFO L85 PathProgramCache]: Analyzing trace with hash 520748387, now seen corresponding path program 1 times [2024-11-08 15:58:31,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:58:31,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404962056] [2024-11-08 15:58:31,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:58:31,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:58:31,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:58:31,375 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:58:31,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:58:31,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404962056] [2024-11-08 15:58:31,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404962056] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:58:31,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:58:31,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 15:58:31,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174856981] [2024-11-08 15:58:31,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:58:31,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 15:58:31,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:58:31,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 15:58:31,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 15:58:31,378 INFO L87 Difference]: Start difference. First operand 1667 states and 2576 transitions. Second operand has 5 states, 5 states have (on average 19.8) internal successors, (99), 4 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:58:31,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:58:31,702 INFO L93 Difference]: Finished difference Result 4413 states and 6892 transitions. [2024-11-08 15:58:31,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 15:58:31,703 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 4 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2024-11-08 15:58:31,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:58:31,713 INFO L225 Difference]: With dead ends: 4413 [2024-11-08 15:58:31,714 INFO L226 Difference]: Without dead ends: 2867 [2024-11-08 15:58:31,717 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:58:31,718 INFO L432 NwaCegarLoop]: 214 mSDtfsCounter, 1392 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1392 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 15:58:31,718 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1392 Valid, 357 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 15:58:31,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2867 states. [2024-11-08 15:58:31,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2867 to 2865. [2024-11-08 15:58:31,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2865 states, 2864 states have (on average 1.5534217877094971) internal successors, (4449), 2864 states have internal predecessors, (4449), 0 states have call successors, (0), 0 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:58:31,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2865 states to 2865 states and 4449 transitions. [2024-11-08 15:58:31,773 INFO L78 Accepts]: Start accepts. Automaton has 2865 states and 4449 transitions. Word has length 99 [2024-11-08 15:58:31,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:58:31,773 INFO L471 AbstractCegarLoop]: Abstraction has 2865 states and 4449 transitions. [2024-11-08 15:58:31,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 4 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:58:31,774 INFO L276 IsEmpty]: Start isEmpty. Operand 2865 states and 4449 transitions. [2024-11-08 15:58:31,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-08 15:58:31,776 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:58:31,776 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:58:31,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 15:58:31,777 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:58:31,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:58:31,777 INFO L85 PathProgramCache]: Analyzing trace with hash 1043155442, now seen corresponding path program 1 times [2024-11-08 15:58:31,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:58:31,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508116680] [2024-11-08 15:58:31,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:58:31,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:58:31,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:58:31,947 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:58:31,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:58:31,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508116680] [2024-11-08 15:58:31,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508116680] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:58:31,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:58:31,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 15:58:31,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956632716] [2024-11-08 15:58:31,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:58:31,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 15:58:31,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:58:31,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 15:58:31,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 15:58:31,949 INFO L87 Difference]: Start difference. First operand 2865 states and 4449 transitions. Second operand has 5 states, 5 states have (on average 19.8) internal successors, (99), 4 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:58:32,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:58:32,280 INFO L93 Difference]: Finished difference Result 7872 states and 12314 transitions. [2024-11-08 15:58:32,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 15:58:32,280 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 4 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2024-11-08 15:58:32,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:58:32,301 INFO L225 Difference]: With dead ends: 7872 [2024-11-08 15:58:32,302 INFO L226 Difference]: Without dead ends: 5165 [2024-11-08 15:58:32,308 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:58:32,312 INFO L432 NwaCegarLoop]: 216 mSDtfsCounter, 1350 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1350 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 15:58:32,313 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1350 Valid, 361 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 15:58:32,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5165 states. [2024-11-08 15:58:32,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5165 to 5163. [2024-11-08 15:58:32,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5163 states, 5162 states have (on average 1.5561797752808988) internal successors, (8033), 5162 states have internal predecessors, (8033), 0 states have call successors, (0), 0 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:58:32,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5163 states to 5163 states and 8033 transitions. [2024-11-08 15:58:32,481 INFO L78 Accepts]: Start accepts. Automaton has 5163 states and 8033 transitions. Word has length 99 [2024-11-08 15:58:32,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:58:32,483 INFO L471 AbstractCegarLoop]: Abstraction has 5163 states and 8033 transitions. [2024-11-08 15:58:32,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 4 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:58:32,484 INFO L276 IsEmpty]: Start isEmpty. Operand 5163 states and 8033 transitions. [2024-11-08 15:58:32,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-08 15:58:32,487 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:58:32,487 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:58:32,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 15:58:32,488 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:58:32,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:58:32,489 INFO L85 PathProgramCache]: Analyzing trace with hash -1397069631, now seen corresponding path program 1 times [2024-11-08 15:58:32,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:58:32,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248603625] [2024-11-08 15:58:32,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:58:32,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:58:32,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:58:32,655 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:58:32,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:58:32,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248603625] [2024-11-08 15:58:32,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248603625] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:58:32,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:58:32,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 15:58:32,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027511836] [2024-11-08 15:58:32,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:58:32,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 15:58:32,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:58:32,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 15:58:32,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 15:58:32,658 INFO L87 Difference]: Start difference. First operand 5163 states and 8033 transitions. Second operand has 5 states, 5 states have (on average 19.8) internal successors, (99), 4 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:58:33,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:58:33,005 INFO L93 Difference]: Finished difference Result 14689 states and 22985 transitions. [2024-11-08 15:58:33,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 15:58:33,006 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 4 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2024-11-08 15:58:33,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:58:33,038 INFO L225 Difference]: With dead ends: 14689 [2024-11-08 15:58:33,039 INFO L226 Difference]: Without dead ends: 9725 [2024-11-08 15:58:33,049 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:58:33,052 INFO L432 NwaCegarLoop]: 218 mSDtfsCounter, 1336 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1336 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 15:58:33,053 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1336 Valid, 370 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 15:58:33,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9725 states. [2024-11-08 15:58:33,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9725 to 9723. [2024-11-08 15:58:33,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9723 states, 9722 states have (on average 1.5584241925529727) internal successors, (15151), 9722 states have internal predecessors, (15151), 0 states have call successors, (0), 0 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:58:33,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9723 states to 9723 states and 15151 transitions. [2024-11-08 15:58:33,301 INFO L78 Accepts]: Start accepts. Automaton has 9723 states and 15151 transitions. Word has length 99 [2024-11-08 15:58:33,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:58:33,302 INFO L471 AbstractCegarLoop]: Abstraction has 9723 states and 15151 transitions. [2024-11-08 15:58:33,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 4 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:58:33,302 INFO L276 IsEmpty]: Start isEmpty. Operand 9723 states and 15151 transitions. [2024-11-08 15:58:33,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-08 15:58:33,305 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:58:33,306 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:58:33,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 15:58:33,306 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:58:33,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:58:33,307 INFO L85 PathProgramCache]: Analyzing trace with hash 2146829076, now seen corresponding path program 1 times [2024-11-08 15:58:33,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:58:33,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732104308] [2024-11-08 15:58:33,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:58:33,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:58:33,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:58:33,464 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:58:33,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:58:33,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732104308] [2024-11-08 15:58:33,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732104308] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:58:33,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:58:33,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 15:58:33,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198863560] [2024-11-08 15:58:33,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:58:33,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 15:58:33,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:58:33,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 15:58:33,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 15:58:33,467 INFO L87 Difference]: Start difference. First operand 9723 states and 15151 transitions. Second operand has 5 states, 5 states have (on average 19.8) internal successors, (99), 4 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:58:33,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:58:33,856 INFO L93 Difference]: Finished difference Result 28649 states and 44743 transitions. [2024-11-08 15:58:33,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 15:58:33,856 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 4 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2024-11-08 15:58:33,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:58:33,907 INFO L225 Difference]: With dead ends: 28649 [2024-11-08 15:58:33,908 INFO L226 Difference]: Without dead ends: 19017 [2024-11-08 15:58:33,925 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:58:33,926 INFO L432 NwaCegarLoop]: 214 mSDtfsCounter, 1406 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1406 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 15:58:33,927 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1406 Valid, 355 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 15:58:33,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19017 states. [2024-11-08 15:58:34,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19017 to 19015. [2024-11-08 15:58:34,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19015 states, 19014 states have (on average 1.554380982433996) internal successors, (29555), 19014 states have internal predecessors, (29555), 0 states have call successors, (0), 0 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:58:34,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19015 states to 19015 states and 29555 transitions. [2024-11-08 15:58:34,327 INFO L78 Accepts]: Start accepts. Automaton has 19015 states and 29555 transitions. Word has length 99 [2024-11-08 15:58:34,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:58:34,328 INFO L471 AbstractCegarLoop]: Abstraction has 19015 states and 29555 transitions. [2024-11-08 15:58:34,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 4 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:58:34,329 INFO L276 IsEmpty]: Start isEmpty. Operand 19015 states and 29555 transitions. [2024-11-08 15:58:34,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-08 15:58:34,335 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:58:34,335 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:58:34,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 15:58:34,336 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:58:34,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:58:34,336 INFO L85 PathProgramCache]: Analyzing trace with hash -1517888763, now seen corresponding path program 1 times [2024-11-08 15:58:34,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:58:34,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555200724] [2024-11-08 15:58:34,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:58:34,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:58:34,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:58:34,469 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:58:34,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:58:34,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555200724] [2024-11-08 15:58:34,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555200724] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:58:34,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:58:34,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 15:58:34,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967653965] [2024-11-08 15:58:34,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:58:34,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 15:58:34,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:58:34,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 15:58:34,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 15:58:34,472 INFO L87 Difference]: Start difference. First operand 19015 states and 29555 transitions. Second operand has 5 states, 5 states have (on average 19.8) internal successors, (99), 4 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:58:35,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:58:35,023 INFO L93 Difference]: Finished difference Result 56572 states and 88040 transitions. [2024-11-08 15:58:35,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 15:58:35,023 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 4 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2024-11-08 15:58:35,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:58:35,217 INFO L225 Difference]: With dead ends: 56572 [2024-11-08 15:58:35,217 INFO L226 Difference]: Without dead ends: 37625 [2024-11-08 15:58:35,254 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:58:35,258 INFO L432 NwaCegarLoop]: 216 mSDtfsCounter, 1428 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1428 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 15:58:35,259 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1428 Valid, 355 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 15:58:35,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37625 states. [2024-11-08 15:58:35,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37625 to 37623. [2024-11-08 15:58:35,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37623 states, 37622 states have (on average 1.548030407740152) internal successors, (58240), 37622 states have internal predecessors, (58240), 0 states have call successors, (0), 0 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:58:36,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37623 states to 37623 states and 58240 transitions. [2024-11-08 15:58:36,192 INFO L78 Accepts]: Start accepts. Automaton has 37623 states and 58240 transitions. Word has length 99 [2024-11-08 15:58:36,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:58:36,196 INFO L471 AbstractCegarLoop]: Abstraction has 37623 states and 58240 transitions. [2024-11-08 15:58:36,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 4 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:58:36,197 INFO L276 IsEmpty]: Start isEmpty. Operand 37623 states and 58240 transitions. [2024-11-08 15:58:36,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-08 15:58:36,211 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:58:36,212 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:58:36,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 15:58:36,212 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:58:36,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:58:36,212 INFO L85 PathProgramCache]: Analyzing trace with hash -1740503754, now seen corresponding path program 1 times [2024-11-08 15:58:36,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:58:36,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465248407] [2024-11-08 15:58:36,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:58:36,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:58:36,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:58:36,477 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:58:36,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:58:36,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465248407] [2024-11-08 15:58:36,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465248407] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:58:36,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:58:36,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 15:58:36,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40542983] [2024-11-08 15:58:36,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:58:36,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 15:58:36,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:58:36,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 15:58:36,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 15:58:36,480 INFO L87 Difference]: Start difference. First operand 37623 states and 58240 transitions. Second operand has 5 states, 5 states have (on average 19.8) internal successors, (99), 4 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:58:37,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:58:37,142 INFO L93 Difference]: Finished difference Result 112391 states and 174086 transitions. [2024-11-08 15:58:37,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 15:58:37,143 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 4 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2024-11-08 15:58:37,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:58:37,324 INFO L225 Difference]: With dead ends: 112391 [2024-11-08 15:58:37,324 INFO L226 Difference]: Without dead ends: 74820 [2024-11-08 15:58:37,387 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:58:37,388 INFO L432 NwaCegarLoop]: 216 mSDtfsCounter, 1452 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1452 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 15:58:37,389 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1452 Valid, 353 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 15:58:37,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74820 states. [2024-11-08 15:58:38,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74820 to 74818. [2024-11-08 15:58:38,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74818 states, 74817 states have (on average 1.5396901773661067) internal successors, (115195), 74817 states have internal predecessors, (115195), 0 states have call successors, (0), 0 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:58:39,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74818 states to 74818 states and 115195 transitions. [2024-11-08 15:58:39,123 INFO L78 Accepts]: Start accepts. Automaton has 74818 states and 115195 transitions. Word has length 99 [2024-11-08 15:58:39,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:58:39,124 INFO L471 AbstractCegarLoop]: Abstraction has 74818 states and 115195 transitions. [2024-11-08 15:58:39,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 4 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:58:39,124 INFO L276 IsEmpty]: Start isEmpty. Operand 74818 states and 115195 transitions. [2024-11-08 15:58:39,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-08 15:58:39,326 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:58:39,326 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:58:39,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 15:58:39,327 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:58:39,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:58:39,327 INFO L85 PathProgramCache]: Analyzing trace with hash 1377652457, now seen corresponding path program 1 times [2024-11-08 15:58:39,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:58:39,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488851442] [2024-11-08 15:58:39,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:58:39,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:58:39,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:58:39,814 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:58:39,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:58:39,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488851442] [2024-11-08 15:58:39,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488851442] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:58:39,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:58:39,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 15:58:39,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698412490] [2024-11-08 15:58:39,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:58:39,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 15:58:39,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:58:39,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 15:58:39,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 15:58:39,816 INFO L87 Difference]: Start difference. First operand 74818 states and 115195 transitions. Second operand has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:58:40,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:58:40,044 INFO L93 Difference]: Finished difference Result 76356 states and 117500 transitions. [2024-11-08 15:58:40,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 15:58:40,045 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2024-11-08 15:58:40,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:58:40,358 INFO L225 Difference]: With dead ends: 76356 [2024-11-08 15:58:40,359 INFO L226 Difference]: Without dead ends: 76354 [2024-11-08 15:58:40,390 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:58:40,396 INFO L432 NwaCegarLoop]: 354 mSDtfsCounter, 0 mSDsluCounter, 1048 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1402 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:58:40,397 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1402 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:58:40,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76354 states. [2024-11-08 15:58:41,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76354 to 76354. [2024-11-08 15:58:41,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76354 states, 76353 states have (on average 1.5288331827171167) internal successors, (116731), 76353 states have internal predecessors, (116731), 0 states have call successors, (0), 0 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:58:42,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76354 states to 76354 states and 116731 transitions. [2024-11-08 15:58:42,003 INFO L78 Accepts]: Start accepts. Automaton has 76354 states and 116731 transitions. Word has length 100 [2024-11-08 15:58:42,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:58:42,004 INFO L471 AbstractCegarLoop]: Abstraction has 76354 states and 116731 transitions. [2024-11-08 15:58:42,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:58:42,004 INFO L276 IsEmpty]: Start isEmpty. Operand 76354 states and 116731 transitions. [2024-11-08 15:58:42,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-08 15:58:42,042 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:58:42,042 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:58:42,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 15:58:42,043 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:58:42,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:58:42,043 INFO L85 PathProgramCache]: Analyzing trace with hash 101785651, now seen corresponding path program 1 times [2024-11-08 15:58:42,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:58:42,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303809889] [2024-11-08 15:58:42,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:58:42,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:58:42,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:58:42,386 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:58:42,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:58:42,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303809889] [2024-11-08 15:58:42,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303809889] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:58:42,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:58:42,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 15:58:42,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432495643] [2024-11-08 15:58:42,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:58:42,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 15:58:42,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:58:42,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 15:58:42,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 15:58:42,389 INFO L87 Difference]: Start difference. First operand 76354 states and 116731 transitions. Second operand has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:58:43,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:58:43,322 INFO L93 Difference]: Finished difference Result 217542 states and 331789 transitions. [2024-11-08 15:58:43,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 15:58:43,325 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 101 [2024-11-08 15:58:43,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:58:43,548 INFO L225 Difference]: With dead ends: 217542 [2024-11-08 15:58:43,549 INFO L226 Difference]: Without dead ends: 143044 [2024-11-08 15:58:43,580 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 15:58:43,581 INFO L432 NwaCegarLoop]: 472 mSDtfsCounter, 248 mSDsluCounter, 534 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 1006 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:58:43,581 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 1006 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:58:43,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143044 states. [2024-11-08 15:58:45,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143044 to 143042. [2024-11-08 15:58:45,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143042 states, 143041 states have (on average 1.517515956963388) internal successors, (217067), 143041 states have internal predecessors, (217067), 0 states have call successors, (0), 0 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:58:45,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143042 states to 143042 states and 217067 transitions. [2024-11-08 15:58:45,620 INFO L78 Accepts]: Start accepts. Automaton has 143042 states and 217067 transitions. Word has length 101 [2024-11-08 15:58:45,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:58:45,621 INFO L471 AbstractCegarLoop]: Abstraction has 143042 states and 217067 transitions. [2024-11-08 15:58:45,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:58:45,621 INFO L276 IsEmpty]: Start isEmpty. Operand 143042 states and 217067 transitions. [2024-11-08 15:58:45,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-08 15:58:45,635 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:58:45,636 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:58:45,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-08 15:58:45,636 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:58:45,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:58:45,637 INFO L85 PathProgramCache]: Analyzing trace with hash -849075754, now seen corresponding path program 1 times [2024-11-08 15:58:45,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:58:45,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233820423] [2024-11-08 15:58:45,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:58:45,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:58:45,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:58:45,752 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:58:45,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:58:45,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233820423] [2024-11-08 15:58:45,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233820423] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:58:45,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:58:45,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 15:58:45,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249175587] [2024-11-08 15:58:45,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:58:45,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 15:58:45,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:58:45,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 15:58:45,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:58:45,755 INFO L87 Difference]: Start difference. First operand 143042 states and 217067 transitions. Second operand has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:58:47,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:58:47,689 INFO L93 Difference]: Finished difference Result 380062 states and 577397 transitions. [2024-11-08 15:58:47,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 15:58:47,690 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 102 [2024-11-08 15:58:47,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:58:48,077 INFO L225 Difference]: With dead ends: 380062 [2024-11-08 15:58:48,077 INFO L226 Difference]: Without dead ends: 255167 [2024-11-08 15:58:48,167 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:58:48,168 INFO L432 NwaCegarLoop]: 354 mSDtfsCounter, 259 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 687 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:58:48,168 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 687 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:58:48,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255167 states. [2024-11-08 15:58:51,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255167 to 254845. [2024-11-08 15:58:51,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254845 states, 254844 states have (on average 1.5122310119131703) internal successors, (385383), 254844 states have internal predecessors, (385383), 0 states have call successors, (0), 0 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:58:52,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254845 states to 254845 states and 385383 transitions. [2024-11-08 15:58:52,239 INFO L78 Accepts]: Start accepts. Automaton has 254845 states and 385383 transitions. Word has length 102 [2024-11-08 15:58:52,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:58:52,240 INFO L471 AbstractCegarLoop]: Abstraction has 254845 states and 385383 transitions. [2024-11-08 15:58:52,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:58:52,240 INFO L276 IsEmpty]: Start isEmpty. Operand 254845 states and 385383 transitions. [2024-11-08 15:58:52,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-08 15:58:52,259 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:58:52,260 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:58:52,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-08 15:58:52,260 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:58:52,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:58:52,260 INFO L85 PathProgramCache]: Analyzing trace with hash -124631273, now seen corresponding path program 1 times [2024-11-08 15:58:52,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:58:52,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367188955] [2024-11-08 15:58:52,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:58:52,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:58:52,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:58:52,363 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:58:52,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:58:52,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367188955] [2024-11-08 15:58:52,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367188955] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:58:52,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:58:52,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 15:58:52,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887917162] [2024-11-08 15:58:52,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:58:52,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 15:58:52,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:58:52,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 15:58:52,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:58:52,365 INFO L87 Difference]: Start difference. First operand 254845 states and 385383 transitions. Second operand has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:58:54,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:58:54,641 INFO L93 Difference]: Finished difference Result 566672 states and 855636 transitions. [2024-11-08 15:58:54,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 15:58:54,642 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 102 [2024-11-08 15:58:54,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:58:56,043 INFO L225 Difference]: With dead ends: 566672 [2024-11-08 15:58:56,044 INFO L226 Difference]: Without dead ends: 331302 [2024-11-08 15:58:56,206 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:58:56,207 INFO L432 NwaCegarLoop]: 353 mSDtfsCounter, 248 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 685 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:58:56,207 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 685 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:58:56,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331302 states. [2024-11-08 15:59:00,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331302 to 329715. [2024-11-08 15:59:00,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329715 states, 329714 states have (on average 1.4950563215392734) internal successors, (492941), 329714 states have internal predecessors, (492941), 0 states have call successors, (0), 0 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:01,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329715 states to 329715 states and 492941 transitions. [2024-11-08 15:59:01,553 INFO L78 Accepts]: Start accepts. Automaton has 329715 states and 492941 transitions. Word has length 102 [2024-11-08 15:59:01,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:59:01,553 INFO L471 AbstractCegarLoop]: Abstraction has 329715 states and 492941 transitions. [2024-11-08 15:59:01,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:59:01,554 INFO L276 IsEmpty]: Start isEmpty. Operand 329715 states and 492941 transitions. [2024-11-08 15:59:01,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-08 15:59:01,582 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:59:01,582 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:59:01,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-08 15:59:01,583 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:59:01,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:59:01,584 INFO L85 PathProgramCache]: Analyzing trace with hash 1461679126, now seen corresponding path program 1 times [2024-11-08 15:59:01,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:59:01,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629593762] [2024-11-08 15:59:01,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:59:01,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:59:01,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:59:01,670 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:01,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:59:01,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629593762] [2024-11-08 15:59:01,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629593762] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:59:01,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:59:01,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 15:59:01,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342435392] [2024-11-08 15:59:01,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:59:01,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 15:59:01,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:59:01,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 15:59:01,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:59:01,672 INFO L87 Difference]: Start difference. First operand 329715 states and 492941 transitions. Second operand has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:59:04,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:59:04,006 INFO L93 Difference]: Finished difference Result 536925 states and 802232 transitions. [2024-11-08 15:59:04,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 15:59:04,007 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 102 [2024-11-08 15:59:04,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:59:04,696 INFO L225 Difference]: With dead ends: 536925 [2024-11-08 15:59:04,696 INFO L226 Difference]: Without dead ends: 391411 [2024-11-08 15:59:05,726 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:59:05,727 INFO L432 NwaCegarLoop]: 352 mSDtfsCounter, 216 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 683 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:59:05,727 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 683 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:59:06,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391411 states. [2024-11-08 15:59:10,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391411 to 388327. [2024-11-08 15:59:10,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 388327 states, 388326 states have (on average 1.476851923383961) internal successors, (573500), 388326 states have internal predecessors, (573500), 0 states have call successors, (0), 0 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,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388327 states to 388327 states and 573500 transitions. [2024-11-08 15:59:11,679 INFO L78 Accepts]: Start accepts. Automaton has 388327 states and 573500 transitions. Word has length 102 [2024-11-08 15:59:11,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:59:11,679 INFO L471 AbstractCegarLoop]: Abstraction has 388327 states and 573500 transitions. [2024-11-08 15:59:11,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:59:11,679 INFO L276 IsEmpty]: Start isEmpty. Operand 388327 states and 573500 transitions. [2024-11-08 15:59:11,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-08 15:59:11,702 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:59:11,702 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:59:11,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-08 15:59:11,703 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:59:11,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:59:11,703 INFO L85 PathProgramCache]: Analyzing trace with hash -1530130303, now seen corresponding path program 1 times [2024-11-08 15:59:11,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:59:11,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045137268] [2024-11-08 15:59:11,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:59:11,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:59:11,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:59:11,780 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:11,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:59:11,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045137268] [2024-11-08 15:59:11,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045137268] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:59:11,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:59:11,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 15:59:11,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115560722] [2024-11-08 15:59:11,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:59:11,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 15:59:11,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:59:11,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 15:59:11,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:59:11,782 INFO L87 Difference]: Start difference. First operand 388327 states and 573500 transitions. Second operand has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:59:14,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:59:14,075 INFO L93 Difference]: Finished difference Result 505511 states and 744746 transitions. [2024-11-08 15:59:14,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 15:59:14,076 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 102 [2024-11-08 15:59:14,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:59:15,806 INFO L225 Difference]: With dead ends: 505511 [2024-11-08 15:59:15,806 INFO L226 Difference]: Without dead ends: 398709 [2024-11-08 15:59:16,004 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:16,006 INFO L432 NwaCegarLoop]: 352 mSDtfsCounter, 208 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 684 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:59:16,006 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 684 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:59:16,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398709 states.