./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-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 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.6.1.ufo.BOUNDED-12.pals.c.v+nlh-reducer.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1a1d1149f676bf63a3b420effefd0eff28b85036d8f2ab9f39599a7a739fe76d --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 03:44:06,470 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 03:44:06,546 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 03:44:06,553 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 03:44:06,553 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 03:44:06,583 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 03:44:06,584 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 03:44:06,584 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 03:44:06,585 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 03:44:06,585 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 03:44:06,586 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 03:44:06,586 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 03:44:06,587 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 03:44:06,589 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 03:44:06,589 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 03:44:06,589 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 03:44:06,589 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 03:44:06,590 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 03:44:06,590 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 03:44:06,594 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 03:44:06,594 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 03:44:06,595 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 03:44:06,595 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 03:44:06,595 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 03:44:06,595 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 03:44:06,596 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 03:44:06,596 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 03:44:06,596 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 03:44:06,597 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 03:44:06,597 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 03:44:06,597 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 03:44:06,597 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 03:44:06,597 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 03:44:06,598 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 03:44:06,598 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 03:44:06,598 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 03:44:06,598 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 03:44:06,599 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 03:44:06,599 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 03:44:06,599 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 03:44:06,599 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 03:44:06,601 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 03:44:06,601 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1a1d1149f676bf63a3b420effefd0eff28b85036d8f2ab9f39599a7a739fe76d [2024-10-11 03:44:06,875 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 03:44:06,904 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 03:44:06,907 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 03:44:06,909 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 03:44:06,909 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 03:44:06,910 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /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-10-11 03:44:08,489 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 03:44:08,754 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 03:44:08,755 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-10-11 03:44:08,769 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/a75f0aaa8/9a7fe5fcb88a44bdaf758953e314b051/FLAG775a3b9e2 [2024-10-11 03:44:08,782 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/a75f0aaa8/9a7fe5fcb88a44bdaf758953e314b051 [2024-10-11 03:44:08,784 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 03:44:08,785 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 03:44:08,787 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 03:44:08,787 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 03:44:08,793 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 03:44:08,794 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 03:44:08" (1/1) ... [2024-10-11 03:44:08,795 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4eef371a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:44:08, skipping insertion in model container [2024-10-11 03:44:08,798 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 03:44:08" (1/1) ... [2024-10-11 03:44:08,850 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 03:44:09,198 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.6.1.ufo.BOUNDED-12.pals.c.v+nlh-reducer.c[10021,10034] [2024-10-11 03:44:09,312 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 03:44:09,332 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 03:44:09,401 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.6.1.ufo.BOUNDED-12.pals.c.v+nlh-reducer.c[10021,10034] [2024-10-11 03:44:09,461 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 03:44:09,494 INFO L204 MainTranslator]: Completed translation [2024-10-11 03:44:09,494 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:44:09 WrapperNode [2024-10-11 03:44:09,495 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 03:44:09,496 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 03:44:09,497 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 03:44:09,497 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 03:44:09,504 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:44:09" (1/1) ... [2024-10-11 03:44:09,523 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:44:09" (1/1) ... [2024-10-11 03:44:09,582 INFO L138 Inliner]: procedures = 25, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1049 [2024-10-11 03:44:09,583 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 03:44:09,583 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 03:44:09,583 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 03:44:09,583 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 03:44:09,595 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:44:09" (1/1) ... [2024-10-11 03:44:09,596 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:44:09" (1/1) ... [2024-10-11 03:44:09,600 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:44:09" (1/1) ... [2024-10-11 03:44:09,630 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 03:44:09,631 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:44:09" (1/1) ... [2024-10-11 03:44:09,631 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:44:09" (1/1) ... [2024-10-11 03:44:09,644 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:44:09" (1/1) ... [2024-10-11 03:44:09,651 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:44:09" (1/1) ... [2024-10-11 03:44:09,655 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:44:09" (1/1) ... [2024-10-11 03:44:09,659 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:44:09" (1/1) ... [2024-10-11 03:44:09,665 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 03:44:09,666 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 03:44:09,666 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 03:44:09,666 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 03:44:09,669 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:44:09" (1/1) ... [2024-10-11 03:44:09,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 03:44:09,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:44:09,707 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 03:44:09,716 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 03:44:09,760 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 03:44:09,761 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 03:44:09,761 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 03:44:09,761 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 03:44:09,898 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 03:44:09,900 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 03:44:10,888 INFO L? ?]: Removed 117 outVars from TransFormulas that were not future-live. [2024-10-11 03:44:10,889 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 03:44:10,950 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 03:44:10,950 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-11 03:44:10,951 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:44:10 BoogieIcfgContainer [2024-10-11 03:44:10,951 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 03:44:10,953 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 03:44:10,953 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 03:44:10,956 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 03:44:10,956 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 03:44:08" (1/3) ... [2024-10-11 03:44:10,957 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32980ec9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 03:44:10, skipping insertion in model container [2024-10-11 03:44:10,957 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:44:09" (2/3) ... [2024-10-11 03:44:10,958 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32980ec9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 03:44:10, skipping insertion in model container [2024-10-11 03:44:10,958 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:44:10" (3/3) ... [2024-10-11 03:44:10,960 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.6.1.ufo.BOUNDED-12.pals.c.v+nlh-reducer.c [2024-10-11 03:44:10,976 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 03:44:10,976 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 03:44:11,044 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 03:44:11,051 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;@62d507fe, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 03:44:11,051 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 03:44:11,058 INFO L276 IsEmpty]: Start isEmpty. Operand has 257 states, 255 states have (on average 1.7294117647058824) internal successors, (441), 256 states have internal predecessors, (441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:44:11,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-11 03:44:11,068 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:44:11,069 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:44:11,069 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:44:11,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:44:11,074 INFO L85 PathProgramCache]: Analyzing trace with hash -1717973070, now seen corresponding path program 1 times [2024-10-11 03:44:11,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:44:11,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33042524] [2024-10-11 03:44:11,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:44:11,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:44:11,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:44:11,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:44:11,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:44:11,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33042524] [2024-10-11 03:44:11,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33042524] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:44:11,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:44:11,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 03:44:11,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308958683] [2024-10-11 03:44:11,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:44:11,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:44:11,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:44:11,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:44:11,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:44:11,996 INFO L87 Difference]: Start difference. First operand has 257 states, 255 states have (on average 1.7294117647058824) internal successors, (441), 256 states have internal predecessors, (441), 0 states have call successors, (0), 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.0) internal successors, (96), 8 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:44:12,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:44:12,443 INFO L93 Difference]: Finished difference Result 1155 states and 1879 transitions. [2024-10-11 03:44:12,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 03:44:12,446 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.0) internal successors, (96), 8 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 96 [2024-10-11 03:44:12,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:44:12,494 INFO L225 Difference]: With dead ends: 1155 [2024-10-11 03:44:12,495 INFO L226 Difference]: Without dead ends: 1022 [2024-10-11 03:44:12,500 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2024-10-11 03:44:12,505 INFO L432 NwaCegarLoop]: 434 mSDtfsCounter, 3883 mSDsluCounter, 3493 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3883 SdHoareTripleChecker+Valid, 3927 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 03:44:12,507 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3883 Valid, 3927 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 03:44:12,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1022 states. [2024-10-11 03:44:12,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1022 to 395. [2024-10-11 03:44:12,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 395 states, 394 states have (on average 1.50253807106599) internal successors, (592), 394 states have internal predecessors, (592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:44:12,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 592 transitions. [2024-10-11 03:44:12,599 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 592 transitions. Word has length 96 [2024-10-11 03:44:12,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:44:12,600 INFO L471 AbstractCegarLoop]: Abstraction has 395 states and 592 transitions. [2024-10-11 03:44:12,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.0) internal successors, (96), 8 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:44:12,600 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 592 transitions. [2024-10-11 03:44:12,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-10-11 03:44:12,604 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:44:12,605 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:44:12,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 03:44:12,606 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:44:12,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:44:12,607 INFO L85 PathProgramCache]: Analyzing trace with hash -2060246052, now seen corresponding path program 1 times [2024-10-11 03:44:12,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:44:12,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675268674] [2024-10-11 03:44:12,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:44:12,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:44:12,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:44:13,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:44:13,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:44:13,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675268674] [2024-10-11 03:44:13,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675268674] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:44:13,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:44:13,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 03:44:13,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606427641] [2024-10-11 03:44:13,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:44:13,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:44:13,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:44:13,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:44:13,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:44:13,171 INFO L87 Difference]: Start difference. First operand 395 states and 592 transitions. 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-10-11 03:44:13,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:44:13,530 INFO L93 Difference]: Finished difference Result 1972 states and 3056 transitions. [2024-10-11 03:44:13,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 03:44:13,531 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-10-11 03:44:13,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:44:13,540 INFO L225 Difference]: With dead ends: 1972 [2024-10-11 03:44:13,540 INFO L226 Difference]: Without dead ends: 1676 [2024-10-11 03:44:13,545 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-10-11 03:44:13,546 INFO L432 NwaCegarLoop]: 753 mSDtfsCounter, 1581 mSDsluCounter, 1302 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1581 SdHoareTripleChecker+Valid, 2055 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 03:44:13,547 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1581 Valid, 2055 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 03:44:13,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1676 states. [2024-10-11 03:44:13,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1676 to 1666. [2024-10-11 03:44:13,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1666 states, 1665 states have (on average 1.5465465465465464) internal successors, (2575), 1665 states have internal predecessors, (2575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:44:13,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1666 states to 1666 states and 2575 transitions. [2024-10-11 03:44:13,598 INFO L78 Accepts]: Start accepts. Automaton has 1666 states and 2575 transitions. Word has length 97 [2024-10-11 03:44:13,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:44:13,599 INFO L471 AbstractCegarLoop]: Abstraction has 1666 states and 2575 transitions. [2024-10-11 03:44:13,599 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-10-11 03:44:13,599 INFO L276 IsEmpty]: Start isEmpty. Operand 1666 states and 2575 transitions. [2024-10-11 03:44:13,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-11 03:44:13,605 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:44:13,605 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:44:13,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 03:44:13,605 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:44:13,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:44:13,606 INFO L85 PathProgramCache]: Analyzing trace with hash 687546812, now seen corresponding path program 1 times [2024-10-11 03:44:13,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:44:13,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901802116] [2024-10-11 03:44:13,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:44:13,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:44:13,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:44:13,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-10-11 03:44:13,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:44:13,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901802116] [2024-10-11 03:44:13,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901802116] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:44:13,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:44:13,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:44:13,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316368912] [2024-10-11 03:44:13,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:44:13,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:44:13,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:44:13,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:44:13,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:44:13,783 INFO L87 Difference]: Start difference. First operand 1666 states and 2575 transitions. Second operand has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:44:14,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:44:14,125 INFO L93 Difference]: Finished difference Result 4412 states and 6891 transitions. [2024-10-11 03:44:14,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:44:14,126 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2024-10-11 03:44:14,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:44:14,137 INFO L225 Difference]: With dead ends: 4412 [2024-10-11 03:44:14,138 INFO L226 Difference]: Without dead ends: 2866 [2024-10-11 03:44:14,141 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:44:14,143 INFO L432 NwaCegarLoop]: 212 mSDtfsCounter, 1392 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1392 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 03:44:14,143 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1392 Valid, 355 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 03:44:14,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2866 states. [2024-10-11 03:44:14,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2866 to 2864. [2024-10-11 03:44:14,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2864 states, 2863 states have (on average 1.5536150890674119) internal successors, (4448), 2863 states have internal predecessors, (4448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:44:14,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2864 states to 2864 states and 4448 transitions. [2024-10-11 03:44:14,238 INFO L78 Accepts]: Start accepts. Automaton has 2864 states and 4448 transitions. Word has length 98 [2024-10-11 03:44:14,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:44:14,239 INFO L471 AbstractCegarLoop]: Abstraction has 2864 states and 4448 transitions. [2024-10-11 03:44:14,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:44:14,239 INFO L276 IsEmpty]: Start isEmpty. Operand 2864 states and 4448 transitions. [2024-10-11 03:44:14,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-11 03:44:14,242 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:44:14,242 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:44:14,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 03:44:14,243 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:44:14,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:44:14,244 INFO L85 PathProgramCache]: Analyzing trace with hash 1209953867, now seen corresponding path program 1 times [2024-10-11 03:44:14,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:44:14,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167069391] [2024-10-11 03:44:14,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:44:14,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:44:14,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:44:14,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:44:14,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:44:14,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167069391] [2024-10-11 03:44:14,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167069391] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:44:14,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:44:14,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:44:14,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968649913] [2024-10-11 03:44:14,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:44:14,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:44:14,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:44:14,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:44:14,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:44:14,401 INFO L87 Difference]: Start difference. First operand 2864 states and 4448 transitions. Second operand has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:44:14,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:44:14,729 INFO L93 Difference]: Finished difference Result 7871 states and 12313 transitions. [2024-10-11 03:44:14,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:44:14,729 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2024-10-11 03:44:14,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:44:14,749 INFO L225 Difference]: With dead ends: 7871 [2024-10-11 03:44:14,749 INFO L226 Difference]: Without dead ends: 5164 [2024-10-11 03:44:14,756 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:44:14,759 INFO L432 NwaCegarLoop]: 214 mSDtfsCounter, 1350 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1350 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 03:44:14,761 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1350 Valid, 359 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 03:44:14,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5164 states. [2024-10-11 03:44:14,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5164 to 5162. [2024-10-11 03:44:14,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5162 states, 5161 states have (on average 1.556287541174191) internal successors, (8032), 5161 states have internal predecessors, (8032), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:44:14,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5162 states to 5162 states and 8032 transitions. [2024-10-11 03:44:14,929 INFO L78 Accepts]: Start accepts. Automaton has 5162 states and 8032 transitions. Word has length 98 [2024-10-11 03:44:14,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:44:14,930 INFO L471 AbstractCegarLoop]: Abstraction has 5162 states and 8032 transitions. [2024-10-11 03:44:14,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:44:14,930 INFO L276 IsEmpty]: Start isEmpty. Operand 5162 states and 8032 transitions. [2024-10-11 03:44:14,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-11 03:44:14,933 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:44:14,933 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:44:14,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 03:44:14,934 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:44:14,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:44:14,935 INFO L85 PathProgramCache]: Analyzing trace with hash -1230271206, now seen corresponding path program 1 times [2024-10-11 03:44:14,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:44:14,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109340429] [2024-10-11 03:44:14,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:44:14,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:44:14,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:44:15,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:44:15,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:44:15,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109340429] [2024-10-11 03:44:15,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109340429] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:44:15,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:44:15,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:44:15,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802324402] [2024-10-11 03:44:15,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:44:15,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:44:15,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:44:15,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:44:15,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:44:15,090 INFO L87 Difference]: Start difference. First operand 5162 states and 8032 transitions. Second operand has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:44:15,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:44:15,408 INFO L93 Difference]: Finished difference Result 14688 states and 22984 transitions. [2024-10-11 03:44:15,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:44:15,409 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2024-10-11 03:44:15,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:44:15,445 INFO L225 Difference]: With dead ends: 14688 [2024-10-11 03:44:15,446 INFO L226 Difference]: Without dead ends: 9724 [2024-10-11 03:44:15,456 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:44:15,457 INFO L432 NwaCegarLoop]: 216 mSDtfsCounter, 1336 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1336 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 03:44:15,458 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1336 Valid, 368 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 03:44:15,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9724 states. [2024-10-11 03:44:15,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9724 to 9722. [2024-10-11 03:44:15,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9722 states, 9721 states have (on average 1.5584816376915955) internal successors, (15150), 9721 states have internal predecessors, (15150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:44:15,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9722 states to 9722 states and 15150 transitions. [2024-10-11 03:44:15,723 INFO L78 Accepts]: Start accepts. Automaton has 9722 states and 15150 transitions. Word has length 98 [2024-10-11 03:44:15,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:44:15,724 INFO L471 AbstractCegarLoop]: Abstraction has 9722 states and 15150 transitions. [2024-10-11 03:44:15,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:44:15,725 INFO L276 IsEmpty]: Start isEmpty. Operand 9722 states and 15150 transitions. [2024-10-11 03:44:15,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-11 03:44:15,728 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:44:15,729 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:44:15,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 03:44:15,730 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:44:15,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:44:15,730 INFO L85 PathProgramCache]: Analyzing trace with hash -1981339795, now seen corresponding path program 1 times [2024-10-11 03:44:15,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:44:15,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396249976] [2024-10-11 03:44:15,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:44:15,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:44:15,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:44:15,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:44:15,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:44:15,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396249976] [2024-10-11 03:44:15,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396249976] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:44:15,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:44:15,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:44:15,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511663151] [2024-10-11 03:44:15,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:44:15,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:44:15,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:44:15,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:44:15,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:44:15,899 INFO L87 Difference]: Start difference. First operand 9722 states and 15150 transitions. Second operand has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:44:16,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:44:16,339 INFO L93 Difference]: Finished difference Result 28648 states and 44742 transitions. [2024-10-11 03:44:16,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:44:16,340 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2024-10-11 03:44:16,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:44:16,396 INFO L225 Difference]: With dead ends: 28648 [2024-10-11 03:44:16,396 INFO L226 Difference]: Without dead ends: 19016 [2024-10-11 03:44:16,416 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:44:16,417 INFO L432 NwaCegarLoop]: 212 mSDtfsCounter, 1406 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1406 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 03:44:16,417 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1406 Valid, 353 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 03:44:16,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19016 states. [2024-10-11 03:44:16,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19016 to 19014. [2024-10-11 03:44:16,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19014 states, 19013 states have (on average 1.554410140430232) internal successors, (29554), 19013 states have internal predecessors, (29554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:44:16,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19014 states to 19014 states and 29554 transitions. [2024-10-11 03:44:16,891 INFO L78 Accepts]: Start accepts. Automaton has 19014 states and 29554 transitions. Word has length 98 [2024-10-11 03:44:16,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:44:16,891 INFO L471 AbstractCegarLoop]: Abstraction has 19014 states and 29554 transitions. [2024-10-11 03:44:16,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:44:16,892 INFO L276 IsEmpty]: Start isEmpty. Operand 19014 states and 29554 transitions. [2024-10-11 03:44:16,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-11 03:44:16,896 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:44:16,896 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:44:16,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 03:44:16,897 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:44:16,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:44:16,897 INFO L85 PathProgramCache]: Analyzing trace with hash -1351090338, now seen corresponding path program 1 times [2024-10-11 03:44:16,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:44:16,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382468517] [2024-10-11 03:44:16,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:44:16,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:44:16,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:44:17,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:44:17,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:44:17,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382468517] [2024-10-11 03:44:17,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382468517] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:44:17,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:44:17,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:44:17,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128847727] [2024-10-11 03:44:17,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:44:17,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:44:17,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:44:17,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:44:17,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:44:17,031 INFO L87 Difference]: Start difference. First operand 19014 states and 29554 transitions. Second operand has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:44:17,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:44:17,548 INFO L93 Difference]: Finished difference Result 56571 states and 88039 transitions. [2024-10-11 03:44:17,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:44:17,549 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2024-10-11 03:44:17,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:44:17,639 INFO L225 Difference]: With dead ends: 56571 [2024-10-11 03:44:17,639 INFO L226 Difference]: Without dead ends: 37624 [2024-10-11 03:44:17,678 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:44:17,681 INFO L432 NwaCegarLoop]: 214 mSDtfsCounter, 1428 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1428 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 03:44:17,681 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1428 Valid, 353 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 03:44:17,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37624 states. [2024-10-11 03:44:18,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37624 to 37622. [2024-10-11 03:44:18,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37622 states, 37621 states have (on average 1.5480449748810505) internal successors, (58239), 37621 states have internal predecessors, (58239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:44:18,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37622 states to 37622 states and 58239 transitions. [2024-10-11 03:44:18,980 INFO L78 Accepts]: Start accepts. Automaton has 37622 states and 58239 transitions. Word has length 98 [2024-10-11 03:44:18,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:44:18,981 INFO L471 AbstractCegarLoop]: Abstraction has 37622 states and 58239 transitions. [2024-10-11 03:44:18,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:44:18,982 INFO L276 IsEmpty]: Start isEmpty. Operand 37622 states and 58239 transitions. [2024-10-11 03:44:18,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-11 03:44:18,990 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:44:18,990 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:44:18,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 03:44:18,990 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:44:18,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:44:18,991 INFO L85 PathProgramCache]: Analyzing trace with hash -1573705329, now seen corresponding path program 1 times [2024-10-11 03:44:18,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:44:18,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808772805] [2024-10-11 03:44:18,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:44:18,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:44:19,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:44:19,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:44:19,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:44:19,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808772805] [2024-10-11 03:44:19,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808772805] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:44:19,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:44:19,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:44:19,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411175634] [2024-10-11 03:44:19,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:44:19,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:44:19,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:44:19,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:44:19,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:44:19,141 INFO L87 Difference]: Start difference. First operand 37622 states and 58239 transitions. Second operand has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:44:20,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:44:20,074 INFO L93 Difference]: Finished difference Result 112390 states and 174085 transitions. [2024-10-11 03:44:20,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:44:20,075 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2024-10-11 03:44:20,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:44:20,317 INFO L225 Difference]: With dead ends: 112390 [2024-10-11 03:44:20,317 INFO L226 Difference]: Without dead ends: 74819 [2024-10-11 03:44:20,390 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:44:20,390 INFO L432 NwaCegarLoop]: 214 mSDtfsCounter, 1452 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1452 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 03:44:20,391 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1452 Valid, 351 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 03:44:20,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74819 states. [2024-10-11 03:44:21,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74819 to 74817. [2024-10-11 03:44:22,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74817 states, 74816 states have (on average 1.539697390932421) internal successors, (115194), 74816 states have internal predecessors, (115194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:44:22,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74817 states to 74817 states and 115194 transitions. [2024-10-11 03:44:22,332 INFO L78 Accepts]: Start accepts. Automaton has 74817 states and 115194 transitions. Word has length 98 [2024-10-11 03:44:22,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:44:22,332 INFO L471 AbstractCegarLoop]: Abstraction has 74817 states and 115194 transitions. [2024-10-11 03:44:22,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:44:22,332 INFO L276 IsEmpty]: Start isEmpty. Operand 74817 states and 115194 transitions. [2024-10-11 03:44:22,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-11 03:44:22,348 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:44:22,348 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:44:22,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 03:44:22,348 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:44:22,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:44:22,349 INFO L85 PathProgramCache]: Analyzing trace with hash -2041530960, now seen corresponding path program 1 times [2024-10-11 03:44:22,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:44:22,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214845084] [2024-10-11 03:44:22,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:44:22,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:44:22,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:44:22,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:44:22,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:44:22,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214845084] [2024-10-11 03:44:22,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214845084] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:44:22,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:44:22,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 03:44:22,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337423305] [2024-10-11 03:44:22,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:44:22,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:44:22,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:44:22,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:44:22,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:44:22,963 INFO L87 Difference]: Start difference. First operand 74817 states and 115194 transitions. Second operand has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:44:23,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:44:23,320 INFO L93 Difference]: Finished difference Result 76355 states and 117499 transitions. [2024-10-11 03:44:23,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:44:23,322 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2024-10-11 03:44:23,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:44:23,472 INFO L225 Difference]: With dead ends: 76355 [2024-10-11 03:44:23,472 INFO L226 Difference]: Without dead ends: 76353 [2024-10-11 03:44:23,503 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:44:23,505 INFO L432 NwaCegarLoop]: 352 mSDtfsCounter, 0 mSDsluCounter, 1045 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1397 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:44:23,505 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1397 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:44:23,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76353 states. [2024-10-11 03:44:24,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76353 to 76353. [2024-10-11 03:44:24,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76353 states, 76352 states have (on average 1.5288401089689858) internal successors, (116730), 76352 states have internal predecessors, (116730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:44:25,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76353 states to 76353 states and 116730 transitions. [2024-10-11 03:44:25,010 INFO L78 Accepts]: Start accepts. Automaton has 76353 states and 116730 transitions. Word has length 99 [2024-10-11 03:44:25,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:44:25,010 INFO L471 AbstractCegarLoop]: Abstraction has 76353 states and 116730 transitions. [2024-10-11 03:44:25,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:44:25,011 INFO L276 IsEmpty]: Start isEmpty. Operand 76353 states and 116730 transitions. [2024-10-11 03:44:25,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-11 03:44:25,029 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:44:25,030 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:44:25,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 03:44:25,030 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:44:25,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:44:25,031 INFO L85 PathProgramCache]: Analyzing trace with hash 1481282124, now seen corresponding path program 1 times [2024-10-11 03:44:25,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:44:25,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387188604] [2024-10-11 03:44:25,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:44:25,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:44:25,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:44:25,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:44:25,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:44:25,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387188604] [2024-10-11 03:44:25,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387188604] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:44:25,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:44:25,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:44:25,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237202856] [2024-10-11 03:44:25,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:44:25,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 03:44:25,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:44:25,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 03:44:25,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:44:25,639 INFO L87 Difference]: Start difference. First operand 76353 states and 116730 transitions. Second operand has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:44:26,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:44:26,247 INFO L93 Difference]: Finished difference Result 217541 states and 331788 transitions. [2024-10-11 03:44:26,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 03:44:26,247 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2024-10-11 03:44:26,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:44:26,578 INFO L225 Difference]: With dead ends: 217541 [2024-10-11 03:44:26,579 INFO L226 Difference]: Without dead ends: 143043 [2024-10-11 03:44:26,691 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:44:26,692 INFO L432 NwaCegarLoop]: 470 mSDtfsCounter, 248 mSDsluCounter, 534 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 1004 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:44:26,693 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 1004 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:44:26,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143043 states. [2024-10-11 03:44:28,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143043 to 143041. [2024-10-11 03:44:29,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143041 states, 143040 states have (on average 1.5175195749440715) internal successors, (217066), 143040 states have internal predecessors, (217066), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:44:29,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143041 states to 143041 states and 217066 transitions. [2024-10-11 03:44:29,643 INFO L78 Accepts]: Start accepts. Automaton has 143041 states and 217066 transitions. Word has length 100 [2024-10-11 03:44:29,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:44:29,644 INFO L471 AbstractCegarLoop]: Abstraction has 143041 states and 217066 transitions. [2024-10-11 03:44:29,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:44:29,644 INFO L276 IsEmpty]: Start isEmpty. Operand 143041 states and 217066 transitions. [2024-10-11 03:44:29,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-11 03:44:29,660 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:44:29,661 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:44:29,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 03:44:29,661 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:44:29,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:44:29,662 INFO L85 PathProgramCache]: Analyzing trace with hash -1034358051, now seen corresponding path program 1 times [2024-10-11 03:44:29,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:44:29,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251523952] [2024-10-11 03:44:29,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:44:29,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:44:29,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:44:29,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:44:29,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:44:29,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251523952] [2024-10-11 03:44:29,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251523952] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:44:29,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:44:29,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:44:29,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325017409] [2024-10-11 03:44:29,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:44:29,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:44:29,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:44:29,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:44:29,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:44:29,767 INFO L87 Difference]: Start difference. First operand 143041 states and 217066 transitions. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:44:31,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:44:31,662 INFO L93 Difference]: Finished difference Result 380061 states and 577396 transitions. [2024-10-11 03:44:31,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:44:31,663 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 101 [2024-10-11 03:44:31,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:44:32,104 INFO L225 Difference]: With dead ends: 380061 [2024-10-11 03:44:32,104 INFO L226 Difference]: Without dead ends: 255166 [2024-10-11 03:44:32,213 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:44:32,213 INFO L432 NwaCegarLoop]: 352 mSDtfsCounter, 259 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 685 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:44:32,214 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 685 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:44:32,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255166 states. [2024-10-11 03:44:35,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255166 to 254844. [2024-10-11 03:44:35,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254844 states, 254843 states have (on average 1.512233021899758) internal successors, (385382), 254843 states have internal predecessors, (385382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:44:36,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254844 states to 254844 states and 385382 transitions. [2024-10-11 03:44:36,598 INFO L78 Accepts]: Start accepts. Automaton has 254844 states and 385382 transitions. Word has length 101 [2024-10-11 03:44:36,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:44:36,599 INFO L471 AbstractCegarLoop]: Abstraction has 254844 states and 385382 transitions. [2024-10-11 03:44:36,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:44:36,599 INFO L276 IsEmpty]: Start isEmpty. Operand 254844 states and 385382 transitions. [2024-10-11 03:44:36,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-11 03:44:36,623 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:44:36,623 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:44:36,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 03:44:36,623 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:44:36,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:44:36,624 INFO L85 PathProgramCache]: Analyzing trace with hash -309913570, now seen corresponding path program 1 times [2024-10-11 03:44:36,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:44:36,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945816531] [2024-10-11 03:44:36,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:44:36,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:44:36,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:44:36,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:44:36,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:44:36,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945816531] [2024-10-11 03:44:36,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945816531] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:44:36,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:44:36,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:44:36,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634319920] [2024-10-11 03:44:36,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:44:36,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:44:36,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:44:36,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:44:36,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:44:36,722 INFO L87 Difference]: Start difference. First operand 254844 states and 385382 transitions. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:44:39,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:44:39,251 INFO L93 Difference]: Finished difference Result 566671 states and 855635 transitions. [2024-10-11 03:44:39,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:44:39,251 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 101 [2024-10-11 03:44:39,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:44:39,964 INFO L225 Difference]: With dead ends: 566671 [2024-10-11 03:44:39,964 INFO L226 Difference]: Without dead ends: 331301 [2024-10-11 03:44:40,170 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:44:40,171 INFO L432 NwaCegarLoop]: 351 mSDtfsCounter, 248 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 683 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:44:40,171 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 683 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:44:40,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331301 states. [2024-10-11 03:44:44,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331301 to 329714. [2024-10-11 03:44:44,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329714 states, 329713 states have (on average 1.4950578230157743) internal successors, (492940), 329713 states have internal predecessors, (492940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:44:46,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329714 states to 329714 states and 492940 transitions. [2024-10-11 03:44:46,806 INFO L78 Accepts]: Start accepts. Automaton has 329714 states and 492940 transitions. Word has length 101 [2024-10-11 03:44:46,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:44:46,806 INFO L471 AbstractCegarLoop]: Abstraction has 329714 states and 492940 transitions. [2024-10-11 03:44:46,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:44:46,807 INFO L276 IsEmpty]: Start isEmpty. Operand 329714 states and 492940 transitions. [2024-10-11 03:44:46,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-11 03:44:46,832 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:44:46,832 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:44:46,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 03:44:46,832 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:44:46,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:44:46,833 INFO L85 PathProgramCache]: Analyzing trace with hash 1276396829, now seen corresponding path program 1 times [2024-10-11 03:44:46,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:44:46,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021765556] [2024-10-11 03:44:46,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:44:46,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:44:46,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:44:46,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:44:46,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:44:46,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021765556] [2024-10-11 03:44:46,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021765556] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:44:46,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:44:46,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:44:46,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898446043] [2024-10-11 03:44:46,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:44:46,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:44:46,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:44:46,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:44:46,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:44:46,924 INFO L87 Difference]: Start difference. First operand 329714 states and 492940 transitions. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:44:49,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:44:49,464 INFO L93 Difference]: Finished difference Result 536924 states and 802231 transitions. [2024-10-11 03:44:49,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:44:49,464 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 101 [2024-10-11 03:44:49,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:44:50,276 INFO L225 Difference]: With dead ends: 536924 [2024-10-11 03:44:50,276 INFO L226 Difference]: Without dead ends: 391410 [2024-10-11 03:44:50,429 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:44:50,430 INFO L432 NwaCegarLoop]: 350 mSDtfsCounter, 216 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 681 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:44:50,430 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 681 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:44:50,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391410 states. [2024-10-11 03:44:55,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391410 to 388326. [2024-10-11 03:44:56,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 388326 states, 388325 states have (on average 1.4768531513551793) internal successors, (573499), 388325 states have internal predecessors, (573499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:44:57,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388326 states to 388326 states and 573499 transitions. [2024-10-11 03:44:57,688 INFO L78 Accepts]: Start accepts. Automaton has 388326 states and 573499 transitions. Word has length 101 [2024-10-11 03:44:57,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:44:57,689 INFO L471 AbstractCegarLoop]: Abstraction has 388326 states and 573499 transitions. [2024-10-11 03:44:57,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:44:57,689 INFO L276 IsEmpty]: Start isEmpty. Operand 388326 states and 573499 transitions. [2024-10-11 03:44:57,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-11 03:44:57,715 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:44:57,715 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:44:57,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 03:44:57,715 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:44:57,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:44:57,716 INFO L85 PathProgramCache]: Analyzing trace with hash -1715412600, now seen corresponding path program 1 times [2024-10-11 03:44:57,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:44:57,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168003688] [2024-10-11 03:44:57,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:44:57,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:44:57,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:44:57,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:44:57,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:44:57,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168003688] [2024-10-11 03:44:57,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168003688] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:44:57,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:44:57,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:44:57,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949344780] [2024-10-11 03:44:57,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:44:57,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:44:57,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:44:57,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:44:57,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:44:57,792 INFO L87 Difference]: Start difference. First operand 388326 states and 573499 transitions. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:45:00,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:45:00,469 INFO L93 Difference]: Finished difference Result 505510 states and 744745 transitions. [2024-10-11 03:45:00,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:45:00,470 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 101 [2024-10-11 03:45:00,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:45:01,394 INFO L225 Difference]: With dead ends: 505510 [2024-10-11 03:45:01,394 INFO L226 Difference]: Without dead ends: 398708 [2024-10-11 03:45:01,566 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:45:01,566 INFO L432 NwaCegarLoop]: 350 mSDtfsCounter, 208 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 682 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:45:01,566 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 682 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:45:01,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398708 states.