./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.5.ufo.UNBOUNDED.pals+Problem12_label06.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/combinations/pals_lcr.5.ufo.UNBOUNDED.pals+Problem12_label06.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 c6b489d901bb99880d9ac9e7e788ba7286ba9b79b059b344dab5b39237cd3d6a --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 04:49:57,702 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 04:49:57,758 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 04:49:57,764 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 04:49:57,764 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 04:49:57,784 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 04:49:57,785 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 04:49:57,785 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 04:49:57,786 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 04:49:57,786 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 04:49:57,786 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 04:49:57,787 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 04:49:57,787 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 04:49:57,789 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 04:49:57,789 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 04:49:57,789 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 04:49:57,791 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 04:49:57,792 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 04:49:57,792 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 04:49:57,792 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 04:49:57,793 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 04:49:57,793 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 04:49:57,793 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 04:49:57,793 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 04:49:57,794 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 04:49:57,794 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 04:49:57,798 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 04:49:57,798 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 04:49:57,798 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 04:49:57,798 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 04:49:57,799 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 04:49:57,799 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 04:49:57,799 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 04:49:57,799 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 04:49:57,799 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 04:49:57,799 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 04:49:57,800 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 04:49:57,800 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 04:49:57,801 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 04:49:57,801 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 04:49:57,801 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 04:49:57,801 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 04:49:57,802 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 -> c6b489d901bb99880d9ac9e7e788ba7286ba9b79b059b344dab5b39237cd3d6a [2024-10-11 04:49:58,025 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 04:49:58,048 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 04:49:58,051 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 04:49:58,052 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 04:49:58,053 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 04:49:58,054 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.5.ufo.UNBOUNDED.pals+Problem12_label06.c [2024-10-11 04:49:59,326 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 04:49:59,659 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 04:49:59,660 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.5.ufo.UNBOUNDED.pals+Problem12_label06.c [2024-10-11 04:49:59,689 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/6c26bccd5/7691147dc5964b2480b20b3fcd704e5c/FLAG99b6c61a4 [2024-10-11 04:49:59,704 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/6c26bccd5/7691147dc5964b2480b20b3fcd704e5c [2024-10-11 04:49:59,706 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 04:49:59,708 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 04:49:59,709 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 04:49:59,709 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 04:49:59,715 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 04:49:59,715 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 04:49:59" (1/1) ... [2024-10-11 04:49:59,716 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@491724b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:49:59, skipping insertion in model container [2024-10-11 04:49:59,718 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 04:49:59" (1/1) ... [2024-10-11 04:49:59,800 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 04:50:00,073 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/combinations/pals_lcr.5.ufo.UNBOUNDED.pals+Problem12_label06.c[11668,11681] [2024-10-11 04:50:00,102 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/combinations/pals_lcr.5.ufo.UNBOUNDED.pals+Problem12_label06.c[14485,14498] [2024-10-11 04:50:00,591 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 04:50:00,608 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 04:50:00,647 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/combinations/pals_lcr.5.ufo.UNBOUNDED.pals+Problem12_label06.c[11668,11681] [2024-10-11 04:50:00,651 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/combinations/pals_lcr.5.ufo.UNBOUNDED.pals+Problem12_label06.c[14485,14498] [2024-10-11 04:50:00,979 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 04:50:01,004 INFO L204 MainTranslator]: Completed translation [2024-10-11 04:50:01,005 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:50:01 WrapperNode [2024-10-11 04:50:01,005 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 04:50:01,006 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 04:50:01,006 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 04:50:01,006 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 04:50:01,013 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:50:01" (1/1) ... [2024-10-11 04:50:01,067 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:50:01" (1/1) ... [2024-10-11 04:50:01,344 INFO L138 Inliner]: procedures = 37, calls = 22, calls flagged for inlining = 17, calls inlined = 17, statements flattened = 5097 [2024-10-11 04:50:01,344 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 04:50:01,346 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 04:50:01,346 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 04:50:01,346 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 04:50:01,358 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:50:01" (1/1) ... [2024-10-11 04:50:01,358 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:50:01" (1/1) ... [2024-10-11 04:50:01,412 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:50:01" (1/1) ... [2024-10-11 04:50:01,602 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 04:50:01,602 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:50:01" (1/1) ... [2024-10-11 04:50:01,603 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:50:01" (1/1) ... [2024-10-11 04:50:01,710 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:50:01" (1/1) ... [2024-10-11 04:50:01,740 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:50:01" (1/1) ... [2024-10-11 04:50:01,762 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:50:01" (1/1) ... [2024-10-11 04:50:01,779 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:50:01" (1/1) ... [2024-10-11 04:50:01,844 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 04:50:01,846 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 04:50:01,846 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 04:50:01,846 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 04:50:01,847 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:50:01" (1/1) ... [2024-10-11 04:50:01,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 04:50:01,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:50:01,877 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 04:50:01,880 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 04:50:01,978 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 04:50:01,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 04:50:01,978 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 04:50:01,978 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 04:50:02,092 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 04:50:02,094 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 04:50:05,615 INFO L? ?]: Removed 744 outVars from TransFormulas that were not future-live. [2024-10-11 04:50:05,615 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 04:50:05,671 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 04:50:05,672 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-11 04:50:05,672 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 04:50:05 BoogieIcfgContainer [2024-10-11 04:50:05,672 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 04:50:05,674 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 04:50:05,674 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 04:50:05,678 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 04:50:05,678 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 04:49:59" (1/3) ... [2024-10-11 04:50:05,679 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58ccfeb2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 04:50:05, skipping insertion in model container [2024-10-11 04:50:05,679 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:50:01" (2/3) ... [2024-10-11 04:50:05,681 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58ccfeb2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 04:50:05, skipping insertion in model container [2024-10-11 04:50:05,681 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 04:50:05" (3/3) ... [2024-10-11 04:50:05,682 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.5.ufo.UNBOUNDED.pals+Problem12_label06.c [2024-10-11 04:50:05,698 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 04:50:05,699 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-11 04:50:05,786 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 04:50:05,794 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;@66161dc7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 04:50:05,794 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-11 04:50:05,805 INFO L276 IsEmpty]: Start isEmpty. Operand has 836 states, 833 states have (on average 1.9747899159663866) internal successors, (1645), 835 states have internal predecessors, (1645), 0 states have call successors, (0), 0 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 04:50:05,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-11 04:50:05,813 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:50:05,813 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] [2024-10-11 04:50:05,814 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:50:05,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:50:05,818 INFO L85 PathProgramCache]: Analyzing trace with hash -1814121400, now seen corresponding path program 1 times [2024-10-11 04:50:05,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:50:05,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016263894] [2024-10-11 04:50:05,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:50:05,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:50:05,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:50:06,132 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 04:50:06,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:50:06,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016263894] [2024-10-11 04:50:06,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016263894] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:50:06,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:50:06,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 04:50:06,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241845049] [2024-10-11 04:50:06,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:50:06,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 04:50:06,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:50:06,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 04:50:06,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 04:50:06,184 INFO L87 Difference]: Start difference. First operand has 836 states, 833 states have (on average 1.9747899159663866) internal successors, (1645), 835 states have internal predecessors, (1645), 0 states have call successors, (0), 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 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 0 states have call successors, (0), 0 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 04:50:06,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:50:06,369 INFO L93 Difference]: Finished difference Result 1636 states and 3221 transitions. [2024-10-11 04:50:06,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 04:50:06,378 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2024-10-11 04:50:06,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:50:06,404 INFO L225 Difference]: With dead ends: 1636 [2024-10-11 04:50:06,405 INFO L226 Difference]: Without dead ends: 832 [2024-10-11 04:50:06,412 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 04:50:06,416 INFO L432 NwaCegarLoop]: 1573 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1573 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 04:50:06,418 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1573 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 04:50:06,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 832 states. [2024-10-11 04:50:06,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 832 to 832. [2024-10-11 04:50:06,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 832 states, 830 states have (on average 1.8963855421686746) internal successors, (1574), 831 states have internal predecessors, (1574), 0 states have call successors, (0), 0 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 04:50:06,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 832 states to 832 states and 1574 transitions. [2024-10-11 04:50:06,499 INFO L78 Accepts]: Start accepts. Automaton has 832 states and 1574 transitions. Word has length 21 [2024-10-11 04:50:06,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:50:06,500 INFO L471 AbstractCegarLoop]: Abstraction has 832 states and 1574 transitions. [2024-10-11 04:50:06,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 0 states have call successors, (0), 0 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 04:50:06,500 INFO L276 IsEmpty]: Start isEmpty. Operand 832 states and 1574 transitions. [2024-10-11 04:50:06,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-11 04:50:06,502 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:50:06,503 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] [2024-10-11 04:50:06,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 04:50:06,503 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:50:06,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:50:06,504 INFO L85 PathProgramCache]: Analyzing trace with hash 892497994, now seen corresponding path program 1 times [2024-10-11 04:50:06,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:50:06,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928201900] [2024-10-11 04:50:06,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:50:06,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:50:06,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:50:06,653 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 04:50:06,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:50:06,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928201900] [2024-10-11 04:50:06,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928201900] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:50:06,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:50:06,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 04:50:06,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847302764] [2024-10-11 04:50:06,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:50:06,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 04:50:06,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:50:06,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 04:50:06,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 04:50:06,659 INFO L87 Difference]: Start difference. First operand 832 states and 1574 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 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 04:50:06,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:50:06,735 INFO L93 Difference]: Finished difference Result 878 states and 1646 transitions. [2024-10-11 04:50:06,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 04:50:06,735 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2024-10-11 04:50:06,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:50:06,738 INFO L225 Difference]: With dead ends: 878 [2024-10-11 04:50:06,738 INFO L226 Difference]: Without dead ends: 832 [2024-10-11 04:50:06,739 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 04:50:06,740 INFO L432 NwaCegarLoop]: 1571 mSDtfsCounter, 0 mSDsluCounter, 3107 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4678 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 04:50:06,740 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4678 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 04:50:06,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 832 states. [2024-10-11 04:50:06,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 832 to 832. [2024-10-11 04:50:06,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 832 states, 830 states have (on average 1.8590361445783132) internal successors, (1543), 831 states have internal predecessors, (1543), 0 states have call successors, (0), 0 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 04:50:06,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 832 states to 832 states and 1543 transitions. [2024-10-11 04:50:06,754 INFO L78 Accepts]: Start accepts. Automaton has 832 states and 1543 transitions. Word has length 21 [2024-10-11 04:50:06,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:50:06,755 INFO L471 AbstractCegarLoop]: Abstraction has 832 states and 1543 transitions. [2024-10-11 04:50:06,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 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 04:50:06,755 INFO L276 IsEmpty]: Start isEmpty. Operand 832 states and 1543 transitions. [2024-10-11 04:50:06,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-11 04:50:06,756 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:50:06,756 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] [2024-10-11 04:50:06,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 04:50:06,757 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:50:06,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:50:06,760 INFO L85 PathProgramCache]: Analyzing trace with hash -941795094, now seen corresponding path program 1 times [2024-10-11 04:50:06,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:50:06,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831236043] [2024-10-11 04:50:06,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:50:06,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:50:06,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:50:06,817 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 04:50:06,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:50:06,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831236043] [2024-10-11 04:50:06,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831236043] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:50:06,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:50:06,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 04:50:06,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511607872] [2024-10-11 04:50:06,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:50:06,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:50:06,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:50:06,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:50:06,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:50:06,820 INFO L87 Difference]: Start difference. First operand 832 states and 1543 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 2 states have internal predecessors, (23), 0 states have call successors, (0), 0 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 04:50:09,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:50:09,748 INFO L93 Difference]: Finished difference Result 2336 states and 4416 transitions. [2024-10-11 04:50:09,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:50:09,749 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 2 states have internal predecessors, (23), 0 states have call successors, (0), 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 23 [2024-10-11 04:50:09,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:50:09,758 INFO L225 Difference]: With dead ends: 2336 [2024-10-11 04:50:09,758 INFO L226 Difference]: Without dead ends: 1583 [2024-10-11 04:50:09,759 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:50:09,761 INFO L432 NwaCegarLoop]: 522 mSDtfsCounter, 899 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2277 mSolverCounterSat, 591 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 899 SdHoareTripleChecker+Valid, 529 SdHoareTripleChecker+Invalid, 2868 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 591 IncrementalHoareTripleChecker+Valid, 2277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-10-11 04:50:09,762 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [899 Valid, 529 Invalid, 2868 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [591 Valid, 2277 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-10-11 04:50:09,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1583 states. [2024-10-11 04:50:09,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1583 to 1583. [2024-10-11 04:50:09,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1583 states, 1581 states have (on average 1.6255534471853257) internal successors, (2570), 1582 states have internal predecessors, (2570), 0 states have call successors, (0), 0 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 04:50:09,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1583 states to 1583 states and 2570 transitions. [2024-10-11 04:50:09,799 INFO L78 Accepts]: Start accepts. Automaton has 1583 states and 2570 transitions. Word has length 23 [2024-10-11 04:50:09,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:50:09,800 INFO L471 AbstractCegarLoop]: Abstraction has 1583 states and 2570 transitions. [2024-10-11 04:50:09,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 2 states have internal predecessors, (23), 0 states have call successors, (0), 0 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 04:50:09,800 INFO L276 IsEmpty]: Start isEmpty. Operand 1583 states and 2570 transitions. [2024-10-11 04:50:09,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-10-11 04:50:09,802 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:50:09,803 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] [2024-10-11 04:50:09,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 04:50:09,803 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:50:09,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:50:09,804 INFO L85 PathProgramCache]: Analyzing trace with hash 1076852577, now seen corresponding path program 1 times [2024-10-11 04:50:09,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:50:09,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410660839] [2024-10-11 04:50:09,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:50:09,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:50:09,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:50:09,999 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 04:50:10,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:50:10,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410660839] [2024-10-11 04:50:10,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410660839] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:50:10,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:50:10,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:50:10,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093343807] [2024-10-11 04:50:10,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:50:10,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:50:10,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:50:10,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:50:10,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:50:10,005 INFO L87 Difference]: Start difference. First operand 1583 states and 2570 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 0 states have call successors, (0), 0 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 04:50:10,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:50:10,244 INFO L93 Difference]: Finished difference Result 2013 states and 3260 transitions. [2024-10-11 04:50:10,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 04:50:10,245 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 0 states have call successors, (0), 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 51 [2024-10-11 04:50:10,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:50:10,251 INFO L225 Difference]: With dead ends: 2013 [2024-10-11 04:50:10,252 INFO L226 Difference]: Without dead ends: 1970 [2024-10-11 04:50:10,253 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2024-10-11 04:50:10,254 INFO L432 NwaCegarLoop]: 1534 mSDtfsCounter, 7959 mSDsluCounter, 1120 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7959 SdHoareTripleChecker+Valid, 2654 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 04:50:10,254 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7959 Valid, 2654 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 04:50:10,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1970 states. [2024-10-11 04:50:10,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1970 to 1624. [2024-10-11 04:50:10,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1624 states, 1622 states have (on average 1.625154130702836) internal successors, (2636), 1623 states have internal predecessors, (2636), 0 states have call successors, (0), 0 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 04:50:10,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1624 states to 1624 states and 2636 transitions. [2024-10-11 04:50:10,291 INFO L78 Accepts]: Start accepts. Automaton has 1624 states and 2636 transitions. Word has length 51 [2024-10-11 04:50:10,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:50:10,291 INFO L471 AbstractCegarLoop]: Abstraction has 1624 states and 2636 transitions. [2024-10-11 04:50:10,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 0 states have call successors, (0), 0 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 04:50:10,292 INFO L276 IsEmpty]: Start isEmpty. Operand 1624 states and 2636 transitions. [2024-10-11 04:50:10,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-11 04:50:10,293 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:50:10,293 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] [2024-10-11 04:50:10,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 04:50:10,293 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:50:10,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:50:10,294 INFO L85 PathProgramCache]: Analyzing trace with hash -377541423, now seen corresponding path program 1 times [2024-10-11 04:50:10,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:50:10,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398755947] [2024-10-11 04:50:10,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:50:10,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:50:10,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:50:10,354 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 04:50:10,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:50:10,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398755947] [2024-10-11 04:50:10,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398755947] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:50:10,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:50:10,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:50:10,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447765266] [2024-10-11 04:50:10,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:50:10,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:50:10,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:50:10,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:50:10,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:50:10,356 INFO L87 Difference]: Start difference. First operand 1624 states and 2636 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 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 04:50:10,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:50:10,391 INFO L93 Difference]: Finished difference Result 1781 states and 2887 transitions. [2024-10-11 04:50:10,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:50:10,391 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 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 53 [2024-10-11 04:50:10,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:50:10,396 INFO L225 Difference]: With dead ends: 1781 [2024-10-11 04:50:10,397 INFO L226 Difference]: Without dead ends: 1697 [2024-10-11 04:50:10,397 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 04:50:10,398 INFO L432 NwaCegarLoop]: 1536 mSDtfsCounter, 1482 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1482 SdHoareTripleChecker+Valid, 1597 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:50:10,398 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1482 Valid, 1597 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:50:10,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1697 states. [2024-10-11 04:50:10,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1697 to 1693. [2024-10-11 04:50:10,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1693 states, 1691 states have (on average 1.6227084565345948) internal successors, (2744), 1692 states have internal predecessors, (2744), 0 states have call successors, (0), 0 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 04:50:10,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1693 states to 1693 states and 2744 transitions. [2024-10-11 04:50:10,424 INFO L78 Accepts]: Start accepts. Automaton has 1693 states and 2744 transitions. Word has length 53 [2024-10-11 04:50:10,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:50:10,424 INFO L471 AbstractCegarLoop]: Abstraction has 1693 states and 2744 transitions. [2024-10-11 04:50:10,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 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 04:50:10,424 INFO L276 IsEmpty]: Start isEmpty. Operand 1693 states and 2744 transitions. [2024-10-11 04:50:10,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-11 04:50:10,425 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:50:10,425 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] [2024-10-11 04:50:10,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 04:50:10,426 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:50:10,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:50:10,426 INFO L85 PathProgramCache]: Analyzing trace with hash -375396471, now seen corresponding path program 1 times [2024-10-11 04:50:10,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:50:10,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083614116] [2024-10-11 04:50:10,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:50:10,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:50:10,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:50:10,696 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 04:50:10,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:50:10,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083614116] [2024-10-11 04:50:10,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083614116] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:50:10,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:50:10,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:50:10,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707060011] [2024-10-11 04:50:10,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:50:10,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:50:10,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:50:10,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:50:10,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:50:10,698 INFO L87 Difference]: Start difference. First operand 1693 states and 2744 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 0 states have call successors, (0), 0 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 04:50:10,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:50:10,885 INFO L93 Difference]: Finished difference Result 1848 states and 2988 transitions. [2024-10-11 04:50:10,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 04:50:10,887 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 0 states have call successors, (0), 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 53 [2024-10-11 04:50:10,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:50:10,897 INFO L225 Difference]: With dead ends: 1848 [2024-10-11 04:50:10,897 INFO L226 Difference]: Without dead ends: 1695 [2024-10-11 04:50:10,899 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2024-10-11 04:50:10,901 INFO L432 NwaCegarLoop]: 1533 mSDtfsCounter, 4482 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4482 SdHoareTripleChecker+Valid, 1796 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 04:50:10,902 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4482 Valid, 1796 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 04:50:10,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1695 states. [2024-10-11 04:50:10,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1695 to 1693. [2024-10-11 04:50:10,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1693 states, 1691 states have (on average 1.621525724423418) internal successors, (2742), 1692 states have internal predecessors, (2742), 0 states have call successors, (0), 0 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 04:50:10,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1693 states to 1693 states and 2742 transitions. [2024-10-11 04:50:10,935 INFO L78 Accepts]: Start accepts. Automaton has 1693 states and 2742 transitions. Word has length 53 [2024-10-11 04:50:10,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:50:10,935 INFO L471 AbstractCegarLoop]: Abstraction has 1693 states and 2742 transitions. [2024-10-11 04:50:10,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 0 states have call successors, (0), 0 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 04:50:10,936 INFO L276 IsEmpty]: Start isEmpty. Operand 1693 states and 2742 transitions. [2024-10-11 04:50:10,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-11 04:50:10,937 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:50:10,937 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] [2024-10-11 04:50:10,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 04:50:10,938 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:50:10,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:50:10,938 INFO L85 PathProgramCache]: Analyzing trace with hash 1118535855, now seen corresponding path program 1 times [2024-10-11 04:50:10,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:50:10,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421253738] [2024-10-11 04:50:10,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:50:10,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:50:10,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:50:11,111 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 04:50:11,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:50:11,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421253738] [2024-10-11 04:50:11,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421253738] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:50:11,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:50:11,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 04:50:11,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373248674] [2024-10-11 04:50:11,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:50:11,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 04:50:11,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:50:11,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 04:50:11,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 04:50:11,113 INFO L87 Difference]: Start difference. First operand 1693 states and 2742 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 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 04:50:11,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:50:11,159 INFO L93 Difference]: Finished difference Result 1699 states and 2749 transitions. [2024-10-11 04:50:11,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 04:50:11,159 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 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 54 [2024-10-11 04:50:11,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:50:11,167 INFO L225 Difference]: With dead ends: 1699 [2024-10-11 04:50:11,167 INFO L226 Difference]: Without dead ends: 1697 [2024-10-11 04:50:11,168 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 04:50:11,168 INFO L432 NwaCegarLoop]: 1539 mSDtfsCounter, 0 mSDsluCounter, 3070 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4609 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:50:11,168 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4609 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:50:11,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1697 states. [2024-10-11 04:50:11,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1697 to 1697. [2024-10-11 04:50:11,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1697 states, 1695 states have (on average 1.6194690265486726) internal successors, (2745), 1696 states have internal predecessors, (2745), 0 states have call successors, (0), 0 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 04:50:11,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1697 states to 1697 states and 2745 transitions. [2024-10-11 04:50:11,195 INFO L78 Accepts]: Start accepts. Automaton has 1697 states and 2745 transitions. Word has length 54 [2024-10-11 04:50:11,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:50:11,195 INFO L471 AbstractCegarLoop]: Abstraction has 1697 states and 2745 transitions. [2024-10-11 04:50:11,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 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 04:50:11,195 INFO L276 IsEmpty]: Start isEmpty. Operand 1697 states and 2745 transitions. [2024-10-11 04:50:11,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-11 04:50:11,196 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:50:11,196 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] [2024-10-11 04:50:11,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 04:50:11,196 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:50:11,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:50:11,197 INFO L85 PathProgramCache]: Analyzing trace with hash -1027191959, now seen corresponding path program 1 times [2024-10-11 04:50:11,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:50:11,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644579775] [2024-10-11 04:50:11,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:50:11,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:50:11,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:50:11,239 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 04:50:11,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:50:11,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644579775] [2024-10-11 04:50:11,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644579775] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:50:11,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:50:11,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:50:11,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811299413] [2024-10-11 04:50:11,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:50:11,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:50:11,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:50:11,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:50:11,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:50:11,244 INFO L87 Difference]: Start difference. First operand 1697 states and 2745 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 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 04:50:11,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:50:11,272 INFO L93 Difference]: Finished difference Result 1995 states and 3205 transitions. [2024-10-11 04:50:11,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:50:11,273 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 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 55 [2024-10-11 04:50:11,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:50:11,278 INFO L225 Difference]: With dead ends: 1995 [2024-10-11 04:50:11,278 INFO L226 Difference]: Without dead ends: 1838 [2024-10-11 04:50:11,279 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 04:50:11,279 INFO L432 NwaCegarLoop]: 1585 mSDtfsCounter, 1495 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1495 SdHoareTripleChecker+Valid, 1658 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:50:11,279 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1495 Valid, 1658 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:50:11,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1838 states. [2024-10-11 04:50:11,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1838 to 1836. [2024-10-11 04:50:11,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1836 states, 1834 states have (on average 1.6117775354416575) internal successors, (2956), 1835 states have internal predecessors, (2956), 0 states have call successors, (0), 0 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 04:50:11,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1836 states to 1836 states and 2956 transitions. [2024-10-11 04:50:11,322 INFO L78 Accepts]: Start accepts. Automaton has 1836 states and 2956 transitions. Word has length 55 [2024-10-11 04:50:11,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:50:11,322 INFO L471 AbstractCegarLoop]: Abstraction has 1836 states and 2956 transitions. [2024-10-11 04:50:11,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 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 04:50:11,323 INFO L276 IsEmpty]: Start isEmpty. Operand 1836 states and 2956 transitions. [2024-10-11 04:50:11,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-11 04:50:11,323 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:50:11,323 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] [2024-10-11 04:50:11,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 04:50:11,324 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:50:11,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:50:11,324 INFO L85 PathProgramCache]: Analyzing trace with hash -987248023, now seen corresponding path program 1 times [2024-10-11 04:50:11,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:50:11,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188894609] [2024-10-11 04:50:11,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:50:11,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:50:11,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:50:11,378 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 04:50:11,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:50:11,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188894609] [2024-10-11 04:50:11,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188894609] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:50:11,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:50:11,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:50:11,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835154846] [2024-10-11 04:50:11,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:50:11,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:50:11,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:50:11,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:50:11,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:50:11,380 INFO L87 Difference]: Start difference. First operand 1836 states and 2956 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 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 04:50:11,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:50:11,419 INFO L93 Difference]: Finished difference Result 2396 states and 3810 transitions. [2024-10-11 04:50:11,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:50:11,420 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 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 55 [2024-10-11 04:50:11,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:50:11,427 INFO L225 Difference]: With dead ends: 2396 [2024-10-11 04:50:11,427 INFO L226 Difference]: Without dead ends: 2100 [2024-10-11 04:50:11,431 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 04:50:11,433 INFO L432 NwaCegarLoop]: 1583 mSDtfsCounter, 1493 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1493 SdHoareTripleChecker+Valid, 1660 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:50:11,434 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1493 Valid, 1660 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:50:11,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2100 states. [2024-10-11 04:50:11,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2100 to 2098. [2024-10-11 04:50:11,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2098 states, 2096 states have (on average 1.5963740458015268) internal successors, (3346), 2097 states have internal predecessors, (3346), 0 states have call successors, (0), 0 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 04:50:11,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2098 states to 2098 states and 3346 transitions. [2024-10-11 04:50:11,472 INFO L78 Accepts]: Start accepts. Automaton has 2098 states and 3346 transitions. Word has length 55 [2024-10-11 04:50:11,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:50:11,472 INFO L471 AbstractCegarLoop]: Abstraction has 2098 states and 3346 transitions. [2024-10-11 04:50:11,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 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 04:50:11,473 INFO L276 IsEmpty]: Start isEmpty. Operand 2098 states and 3346 transitions. [2024-10-11 04:50:11,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-11 04:50:11,473 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:50:11,473 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] [2024-10-11 04:50:11,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 04:50:11,474 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:50:11,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:50:11,477 INFO L85 PathProgramCache]: Analyzing trace with hash -1612904087, now seen corresponding path program 1 times [2024-10-11 04:50:11,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:50:11,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344077469] [2024-10-11 04:50:11,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:50:11,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:50:11,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:50:11,521 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 04:50:11,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:50:11,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344077469] [2024-10-11 04:50:11,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344077469] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:50:11,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:50:11,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:50:11,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102697981] [2024-10-11 04:50:11,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:50:11,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:50:11,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:50:11,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:50:11,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:50:11,524 INFO L87 Difference]: Start difference. First operand 2098 states and 3346 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 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 04:50:11,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:50:11,561 INFO L93 Difference]: Finished difference Result 3150 states and 4924 transitions. [2024-10-11 04:50:11,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:50:11,562 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 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 55 [2024-10-11 04:50:11,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:50:11,569 INFO L225 Difference]: With dead ends: 3150 [2024-10-11 04:50:11,569 INFO L226 Difference]: Without dead ends: 2592 [2024-10-11 04:50:11,571 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 04:50:11,571 INFO L432 NwaCegarLoop]: 1581 mSDtfsCounter, 1491 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1491 SdHoareTripleChecker+Valid, 1662 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:50:11,572 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1491 Valid, 1662 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:50:11,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2592 states. [2024-10-11 04:50:11,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2592 to 2590. [2024-10-11 04:50:11,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2590 states, 2588 states have (on average 1.5695517774343122) internal successors, (4062), 2589 states have internal predecessors, (4062), 0 states have call successors, (0), 0 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 04:50:11,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2590 states to 2590 states and 4062 transitions. [2024-10-11 04:50:11,622 INFO L78 Accepts]: Start accepts. Automaton has 2590 states and 4062 transitions. Word has length 55 [2024-10-11 04:50:11,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:50:11,623 INFO L471 AbstractCegarLoop]: Abstraction has 2590 states and 4062 transitions. [2024-10-11 04:50:11,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 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 04:50:11,623 INFO L276 IsEmpty]: Start isEmpty. Operand 2590 states and 4062 transitions. [2024-10-11 04:50:11,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-11 04:50:11,623 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:50:11,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] [2024-10-11 04:50:11,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 04:50:11,624 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:50:11,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:50:11,625 INFO L85 PathProgramCache]: Analyzing trace with hash -724170647, now seen corresponding path program 1 times [2024-10-11 04:50:11,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:50:11,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267192516] [2024-10-11 04:50:11,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:50:11,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:50:11,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:50:11,667 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 04:50:11,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:50:11,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267192516] [2024-10-11 04:50:11,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267192516] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:50:11,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:50:11,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:50:11,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958949922] [2024-10-11 04:50:11,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:50:11,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:50:11,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:50:11,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:50:11,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:50:11,669 INFO L87 Difference]: Start difference. First operand 2590 states and 4062 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 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 04:50:11,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:50:11,720 INFO L93 Difference]: Finished difference Result 4562 states and 6960 transitions. [2024-10-11 04:50:11,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:50:11,720 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 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 55 [2024-10-11 04:50:11,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:50:11,730 INFO L225 Difference]: With dead ends: 4562 [2024-10-11 04:50:11,730 INFO L226 Difference]: Without dead ends: 3512 [2024-10-11 04:50:11,732 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 04:50:11,733 INFO L432 NwaCegarLoop]: 1579 mSDtfsCounter, 1489 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1489 SdHoareTripleChecker+Valid, 1664 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:50:11,733 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1489 Valid, 1664 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:50:11,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3512 states. [2024-10-11 04:50:11,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3512 to 3510. [2024-10-11 04:50:11,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3510 states, 3508 states have (on average 1.5296465222348916) internal successors, (5366), 3509 states have internal predecessors, (5366), 0 states have call successors, (0), 0 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 04:50:11,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3510 states to 3510 states and 5366 transitions. [2024-10-11 04:50:11,801 INFO L78 Accepts]: Start accepts. Automaton has 3510 states and 5366 transitions. Word has length 55 [2024-10-11 04:50:11,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:50:11,801 INFO L471 AbstractCegarLoop]: Abstraction has 3510 states and 5366 transitions. [2024-10-11 04:50:11,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 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 04:50:11,802 INFO L276 IsEmpty]: Start isEmpty. Operand 3510 states and 5366 transitions. [2024-10-11 04:50:11,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-11 04:50:11,802 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:50:11,802 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] [2024-10-11 04:50:11,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 04:50:11,802 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:50:11,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:50:11,803 INFO L85 PathProgramCache]: Analyzing trace with hash -2038301810, now seen corresponding path program 1 times [2024-10-11 04:50:11,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:50:11,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446716877] [2024-10-11 04:50:11,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:50:11,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:50:11,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:50:11,871 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 04:50:11,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:50:11,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446716877] [2024-10-11 04:50:11,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446716877] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:50:11,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:50:11,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:50:11,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089704603] [2024-10-11 04:50:11,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:50:11,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:50:11,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:50:11,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:50:11,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:50:11,873 INFO L87 Difference]: Start difference. First operand 3510 states and 5366 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 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 04:50:11,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:50:11,934 INFO L93 Difference]: Finished difference Result 5565 states and 8412 transitions. [2024-10-11 04:50:11,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:50:11,934 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 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 57 [2024-10-11 04:50:11,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:50:11,946 INFO L225 Difference]: With dead ends: 5565 [2024-10-11 04:50:11,946 INFO L226 Difference]: Without dead ends: 4442 [2024-10-11 04:50:11,949 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 04:50:11,949 INFO L432 NwaCegarLoop]: 1590 mSDtfsCounter, 1494 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1494 SdHoareTripleChecker+Valid, 1659 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:50:11,949 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1494 Valid, 1659 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:50:11,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4442 states. [2024-10-11 04:50:12,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4442 to 4440. [2024-10-11 04:50:12,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4440 states, 4438 states have (on average 1.5087877422262281) internal successors, (6696), 4439 states have internal predecessors, (6696), 0 states have call successors, (0), 0 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 04:50:12,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4440 states to 4440 states and 6696 transitions. [2024-10-11 04:50:12,032 INFO L78 Accepts]: Start accepts. Automaton has 4440 states and 6696 transitions. Word has length 57 [2024-10-11 04:50:12,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:50:12,032 INFO L471 AbstractCegarLoop]: Abstraction has 4440 states and 6696 transitions. [2024-10-11 04:50:12,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 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 04:50:12,033 INFO L276 IsEmpty]: Start isEmpty. Operand 4440 states and 6696 transitions. [2024-10-11 04:50:12,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-10-11 04:50:12,034 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:50:12,034 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:50:12,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 04:50:12,034 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:50:12,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:50:12,034 INFO L85 PathProgramCache]: Analyzing trace with hash -1695522485, now seen corresponding path program 1 times [2024-10-11 04:50:12,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:50:12,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998842165] [2024-10-11 04:50:12,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:50:12,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:50:12,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:50:12,162 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 04:50:12,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:50:12,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998842165] [2024-10-11 04:50:12,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998842165] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:50:12,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:50:12,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:50:12,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566748395] [2024-10-11 04:50:12,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:50:12,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:50:12,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:50:12,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:50:12,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:50:12,165 INFO L87 Difference]: Start difference. First operand 4440 states and 6696 transitions. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 0 states have call successors, (0), 0 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 04:50:12,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:50:12,501 INFO L93 Difference]: Finished difference Result 19540 states and 28510 transitions. [2024-10-11 04:50:12,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 04:50:12,502 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 0 states have call successors, (0), 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 73 [2024-10-11 04:50:12,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:50:12,533 INFO L225 Difference]: With dead ends: 19540 [2024-10-11 04:50:12,534 INFO L226 Difference]: Without dead ends: 16642 [2024-10-11 04:50:12,543 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-10-11 04:50:12,544 INFO L432 NwaCegarLoop]: 1605 mSDtfsCounter, 6318 mSDsluCounter, 2004 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6318 SdHoareTripleChecker+Valid, 3609 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 04:50:12,544 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6318 Valid, 3609 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 04:50:12,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16642 states. [2024-10-11 04:50:12,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16642 to 7336. [2024-10-11 04:50:12,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7336 states, 7334 states have (on average 1.478047450231797) internal successors, (10840), 7335 states have internal predecessors, (10840), 0 states have call successors, (0), 0 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 04:50:12,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7336 states to 7336 states and 10840 transitions. [2024-10-11 04:50:12,844 INFO L78 Accepts]: Start accepts. Automaton has 7336 states and 10840 transitions. Word has length 73 [2024-10-11 04:50:12,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:50:12,844 INFO L471 AbstractCegarLoop]: Abstraction has 7336 states and 10840 transitions. [2024-10-11 04:50:12,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 0 states have call successors, (0), 0 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 04:50:12,844 INFO L276 IsEmpty]: Start isEmpty. Operand 7336 states and 10840 transitions. [2024-10-11 04:50:12,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-10-11 04:50:12,847 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:50:12,847 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:50:12,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 04:50:12,848 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:50:12,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:50:12,848 INFO L85 PathProgramCache]: Analyzing trace with hash -1655578549, now seen corresponding path program 1 times [2024-10-11 04:50:12,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:50:12,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902354783] [2024-10-11 04:50:12,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:50:12,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:50:12,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:50:12,966 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-11 04:50:12,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:50:12,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902354783] [2024-10-11 04:50:12,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902354783] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:50:12,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:50:12,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:50:12,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511119449] [2024-10-11 04:50:12,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:50:12,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:50:12,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:50:12,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:50:12,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:50:12,968 INFO L87 Difference]: Start difference. First operand 7336 states and 10840 transitions. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 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 04:50:13,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:50:13,352 INFO L93 Difference]: Finished difference Result 22436 states and 32654 transitions. [2024-10-11 04:50:13,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 04:50:13,353 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 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 73 [2024-10-11 04:50:13,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:50:13,385 INFO L225 Difference]: With dead ends: 22436 [2024-10-11 04:50:13,385 INFO L226 Difference]: Without dead ends: 19538 [2024-10-11 04:50:13,396 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-10-11 04:50:13,396 INFO L432 NwaCegarLoop]: 1602 mSDtfsCounter, 6338 mSDsluCounter, 1955 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6338 SdHoareTripleChecker+Valid, 3557 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 04:50:13,396 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6338 Valid, 3557 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 04:50:13,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19538 states. [2024-10-11 04:50:13,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19538 to 11688. [2024-10-11 04:50:13,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11688 states, 11686 states have (on average 1.4561013178161903) internal successors, (17016), 11687 states have internal predecessors, (17016), 0 states have call successors, (0), 0 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 04:50:13,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11688 states to 11688 states and 17016 transitions. [2024-10-11 04:50:13,901 INFO L78 Accepts]: Start accepts. Automaton has 11688 states and 17016 transitions. Word has length 73 [2024-10-11 04:50:13,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:50:13,901 INFO L471 AbstractCegarLoop]: Abstraction has 11688 states and 17016 transitions. [2024-10-11 04:50:13,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 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 04:50:13,902 INFO L276 IsEmpty]: Start isEmpty. Operand 11688 states and 17016 transitions. [2024-10-11 04:50:13,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-10-11 04:50:13,904 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:50:13,904 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:50:13,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 04:50:13,905 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:50:13,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:50:13,905 INFO L85 PathProgramCache]: Analyzing trace with hash 2013732683, now seen corresponding path program 1 times [2024-10-11 04:50:13,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:50:13,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223940385] [2024-10-11 04:50:13,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:50:13,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:50:13,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:50:14,067 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-11 04:50:14,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:50:14,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223940385] [2024-10-11 04:50:14,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223940385] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:50:14,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:50:14,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:50:14,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300629911] [2024-10-11 04:50:14,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:50:14,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:50:14,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:50:14,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:50:14,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:50:14,069 INFO L87 Difference]: Start difference. First operand 11688 states and 17016 transitions. Second operand has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 0 states have call successors, (0), 0 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 04:50:14,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:50:14,573 INFO L93 Difference]: Finished difference Result 25332 states and 36798 transitions. [2024-10-11 04:50:14,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 04:50:14,574 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 0 states have call successors, (0), 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 73 [2024-10-11 04:50:14,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:50:14,614 INFO L225 Difference]: With dead ends: 25332 [2024-10-11 04:50:14,615 INFO L226 Difference]: Without dead ends: 22434 [2024-10-11 04:50:14,627 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-10-11 04:50:14,628 INFO L432 NwaCegarLoop]: 1599 mSDtfsCounter, 6382 mSDsluCounter, 1921 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6382 SdHoareTripleChecker+Valid, 3520 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 04:50:14,628 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6382 Valid, 3520 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 04:50:14,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22434 states. [2024-10-11 04:50:15,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22434 to 14584. [2024-10-11 04:50:15,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14584 states, 14582 states have (on average 1.4511041009463723) internal successors, (21160), 14583 states have internal predecessors, (21160), 0 states have call successors, (0), 0 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 04:50:15,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14584 states to 14584 states and 21160 transitions. [2024-10-11 04:50:15,135 INFO L78 Accepts]: Start accepts. Automaton has 14584 states and 21160 transitions. Word has length 73 [2024-10-11 04:50:15,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:50:15,135 INFO L471 AbstractCegarLoop]: Abstraction has 14584 states and 21160 transitions. [2024-10-11 04:50:15,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 0 states have call successors, (0), 0 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 04:50:15,136 INFO L276 IsEmpty]: Start isEmpty. Operand 14584 states and 21160 transitions. [2024-10-11 04:50:15,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-10-11 04:50:15,137 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:50:15,138 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:50:15,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 04:50:15,138 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:50:15,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:50:15,139 INFO L85 PathProgramCache]: Analyzing trace with hash -1392501173, now seen corresponding path program 1 times [2024-10-11 04:50:15,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:50:15,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908848248] [2024-10-11 04:50:15,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:50:15,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:50:15,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:50:15,269 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-11 04:50:15,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:50:15,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908848248] [2024-10-11 04:50:15,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908848248] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:50:15,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:50:15,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:50:15,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935030529] [2024-10-11 04:50:15,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:50:15,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:50:15,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:50:15,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:50:15,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:50:15,271 INFO L87 Difference]: Start difference. First operand 14584 states and 21160 transitions. Second operand has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:50:15,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:50:15,715 INFO L93 Difference]: Finished difference Result 28228 states and 40942 transitions. [2024-10-11 04:50:15,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 04:50:15,716 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2024-10-11 04:50:15,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:50:15,763 INFO L225 Difference]: With dead ends: 28228 [2024-10-11 04:50:15,763 INFO L226 Difference]: Without dead ends: 25330 [2024-10-11 04:50:15,775 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-10-11 04:50:15,776 INFO L432 NwaCegarLoop]: 1603 mSDtfsCounter, 6333 mSDsluCounter, 1965 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6333 SdHoareTripleChecker+Valid, 3568 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 04:50:15,776 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6333 Valid, 3568 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 04:50:15,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25330 states. [2024-10-11 04:50:16,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25330 to 17480. [2024-10-11 04:50:16,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17480 states, 17478 states have (on average 1.4477629019338598) internal successors, (25304), 17479 states have internal predecessors, (25304), 0 states have call successors, (0), 0 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 04:50:16,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17480 states to 17480 states and 25304 transitions. [2024-10-11 04:50:16,287 INFO L78 Accepts]: Start accepts. Automaton has 17480 states and 25304 transitions. Word has length 73 [2024-10-11 04:50:16,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:50:16,287 INFO L471 AbstractCegarLoop]: Abstraction has 17480 states and 25304 transitions. [2024-10-11 04:50:16,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:50:16,288 INFO L276 IsEmpty]: Start isEmpty. Operand 17480 states and 25304 transitions. [2024-10-11 04:50:16,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-10-11 04:50:16,290 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:50:16,290 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:50:16,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 04:50:16,290 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:50:16,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:50:16,291 INFO L85 PathProgramCache]: Analyzing trace with hash -1748107533, now seen corresponding path program 1 times [2024-10-11 04:50:16,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:50:16,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038256673] [2024-10-11 04:50:16,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:50:16,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:50:16,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:50:16,372 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:50:16,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:50:16,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038256673] [2024-10-11 04:50:16,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038256673] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:50:16,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:50:16,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:50:16,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972210311] [2024-10-11 04:50:16,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:50:16,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:50:16,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:50:16,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:50:16,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:50:16,374 INFO L87 Difference]: Start difference. First operand 17480 states and 25304 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:50:16,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:50:16,569 INFO L93 Difference]: Finished difference Result 28767 states and 41694 transitions. [2024-10-11 04:50:16,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:50:16,569 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2024-10-11 04:50:16,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:50:16,590 INFO L225 Difference]: With dead ends: 28767 [2024-10-11 04:50:16,590 INFO L226 Difference]: Without dead ends: 12829 [2024-10-11 04:50:16,605 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 04:50:16,606 INFO L432 NwaCegarLoop]: 1580 mSDtfsCounter, 50 mSDsluCounter, 1526 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 3106 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:50:16,606 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 3106 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:50:16,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12829 states. [2024-10-11 04:50:16,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12829 to 12827. [2024-10-11 04:50:16,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12827 states, 12825 states have (on average 1.4592592592592593) internal successors, (18715), 12826 states have internal predecessors, (18715), 0 states have call successors, (0), 0 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 04:50:16,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12827 states to 12827 states and 18715 transitions. [2024-10-11 04:50:16,948 INFO L78 Accepts]: Start accepts. Automaton has 12827 states and 18715 transitions. Word has length 75 [2024-10-11 04:50:16,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:50:16,949 INFO L471 AbstractCegarLoop]: Abstraction has 12827 states and 18715 transitions. [2024-10-11 04:50:16,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:50:16,949 INFO L276 IsEmpty]: Start isEmpty. Operand 12827 states and 18715 transitions. [2024-10-11 04:50:16,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-10-11 04:50:16,951 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:50:16,951 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:50:16,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 04:50:16,951 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:50:16,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:50:16,952 INFO L85 PathProgramCache]: Analyzing trace with hash -58842896, now seen corresponding path program 1 times [2024-10-11 04:50:16,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:50:16,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252501599] [2024-10-11 04:50:16,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:50:16,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:50:16,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:50:17,061 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 04:50:17,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:50:17,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252501599] [2024-10-11 04:50:17,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252501599] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:50:17,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:50:17,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:50:17,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500233410] [2024-10-11 04:50:17,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:50:17,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:50:17,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:50:17,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:50:17,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:50:17,063 INFO L87 Difference]: Start difference. First operand 12827 states and 18715 transitions. Second operand has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:50:17,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:50:17,428 INFO L93 Difference]: Finished difference Result 23079 states and 33601 transitions. [2024-10-11 04:50:17,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 04:50:17,429 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2024-10-11 04:50:17,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:50:17,458 INFO L225 Difference]: With dead ends: 23079 [2024-10-11 04:50:17,458 INFO L226 Difference]: Without dead ends: 21029 [2024-10-11 04:50:17,467 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-10-11 04:50:17,467 INFO L432 NwaCegarLoop]: 1597 mSDtfsCounter, 6321 mSDsluCounter, 2095 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6321 SdHoareTripleChecker+Valid, 3692 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 04:50:17,468 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6321 Valid, 3692 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 04:50:17,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21029 states. [2024-10-11 04:50:17,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21029 to 14875. [2024-10-11 04:50:17,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14875 states, 14873 states have (on average 1.4562630269616084) internal successors, (21659), 14874 states have internal predecessors, (21659), 0 states have call successors, (0), 0 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 04:50:17,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14875 states to 14875 states and 21659 transitions. [2024-10-11 04:50:17,967 INFO L78 Accepts]: Start accepts. Automaton has 14875 states and 21659 transitions. Word has length 75 [2024-10-11 04:50:17,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:50:17,968 INFO L471 AbstractCegarLoop]: Abstraction has 14875 states and 21659 transitions. [2024-10-11 04:50:17,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:50:17,968 INFO L276 IsEmpty]: Start isEmpty. Operand 14875 states and 21659 transitions. [2024-10-11 04:50:17,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-11 04:50:17,970 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:50:17,970 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:50:17,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-11 04:50:17,971 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:50:17,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:50:17,972 INFO L85 PathProgramCache]: Analyzing trace with hash -660146665, now seen corresponding path program 1 times [2024-10-11 04:50:17,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:50:17,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988890229] [2024-10-11 04:50:17,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:50:17,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:50:17,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:50:18,075 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:50:18,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:50:18,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988890229] [2024-10-11 04:50:18,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988890229] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:50:18,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:50:18,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:50:18,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586508418] [2024-10-11 04:50:18,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:50:18,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:50:18,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:50:18,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:50:18,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:50:18,078 INFO L87 Difference]: Start difference. First operand 14875 states and 21659 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:50:18,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:50:18,277 INFO L93 Difference]: Finished difference Result 21535 states and 31229 transitions. [2024-10-11 04:50:18,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:50:18,278 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2024-10-11 04:50:18,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:50:18,288 INFO L225 Difference]: With dead ends: 21535 [2024-10-11 04:50:18,288 INFO L226 Difference]: Without dead ends: 8221 [2024-10-11 04:50:18,300 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 04:50:18,301 INFO L432 NwaCegarLoop]: 1573 mSDtfsCounter, 45 mSDsluCounter, 1518 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 3091 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:50:18,301 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 3091 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:50:18,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8221 states. [2024-10-11 04:50:18,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8221 to 8219. [2024-10-11 04:50:18,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8219 states, 8217 states have (on average 1.458804916636242) internal successors, (11987), 8218 states have internal predecessors, (11987), 0 states have call successors, (0), 0 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 04:50:18,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8219 states to 8219 states and 11987 transitions. [2024-10-11 04:50:18,542 INFO L78 Accepts]: Start accepts. Automaton has 8219 states and 11987 transitions. Word has length 76 [2024-10-11 04:50:18,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:50:18,543 INFO L471 AbstractCegarLoop]: Abstraction has 8219 states and 11987 transitions. [2024-10-11 04:50:18,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:50:18,543 INFO L276 IsEmpty]: Start isEmpty. Operand 8219 states and 11987 transitions. [2024-10-11 04:50:18,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-11 04:50:18,544 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:50:18,544 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:50:18,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-11 04:50:18,545 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:50:18,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:50:18,545 INFO L85 PathProgramCache]: Analyzing trace with hash 1472275461, now seen corresponding path program 1 times [2024-10-11 04:50:18,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:50:18,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217821739] [2024-10-11 04:50:18,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:50:18,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:50:18,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:50:18,647 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:50:18,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:50:18,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217821739] [2024-10-11 04:50:18,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217821739] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:50:18,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:50:18,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:50:18,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277999164] [2024-10-11 04:50:18,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:50:18,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:50:18,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:50:18,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:50:18,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:50:18,653 INFO L87 Difference]: Start difference. First operand 8219 states and 11987 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:50:18,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:50:18,768 INFO L93 Difference]: Finished difference Result 11551 states and 16721 transitions. [2024-10-11 04:50:18,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:50:18,769 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2024-10-11 04:50:18,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:50:18,775 INFO L225 Difference]: With dead ends: 11551 [2024-10-11 04:50:18,775 INFO L226 Difference]: Without dead ends: 4893 [2024-10-11 04:50:18,781 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 04:50:18,781 INFO L432 NwaCegarLoop]: 1566 mSDtfsCounter, 42 mSDsluCounter, 1510 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 3076 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:50:18,782 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 3076 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:50:18,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4893 states. [2024-10-11 04:50:18,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4893 to 4891. [2024-10-11 04:50:18,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4891 states, 4889 states have (on average 1.4733074248312539) internal successors, (7203), 4890 states have internal predecessors, (7203), 0 states have call successors, (0), 0 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 04:50:18,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4891 states to 4891 states and 7203 transitions. [2024-10-11 04:50:18,916 INFO L78 Accepts]: Start accepts. Automaton has 4891 states and 7203 transitions. Word has length 78 [2024-10-11 04:50:18,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:50:18,917 INFO L471 AbstractCegarLoop]: Abstraction has 4891 states and 7203 transitions. [2024-10-11 04:50:18,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:50:18,917 INFO L276 IsEmpty]: Start isEmpty. Operand 4891 states and 7203 transitions. [2024-10-11 04:50:18,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-11 04:50:18,918 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:50:18,918 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:50:18,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-11 04:50:18,918 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:50:18,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:50:18,919 INFO L85 PathProgramCache]: Analyzing trace with hash -1500171405, now seen corresponding path program 1 times [2024-10-11 04:50:18,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:50:18,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934306920] [2024-10-11 04:50:18,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:50:18,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:50:18,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:50:19,020 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:50:19,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:50:19,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934306920] [2024-10-11 04:50:19,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934306920] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:50:19,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:50:19,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:50:19,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294772743] [2024-10-11 04:50:19,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:50:19,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:50:19,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:50:19,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:50:19,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:50:19,022 INFO L87 Difference]: Start difference. First operand 4891 states and 7203 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:50:19,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:50:19,088 INFO L93 Difference]: Finished difference Result 6559 states and 9545 transitions. [2024-10-11 04:50:19,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:50:19,089 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2024-10-11 04:50:19,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:50:19,094 INFO L225 Difference]: With dead ends: 6559 [2024-10-11 04:50:19,094 INFO L226 Difference]: Without dead ends: 3229 [2024-10-11 04:50:19,097 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 04:50:19,098 INFO L432 NwaCegarLoop]: 1559 mSDtfsCounter, 39 mSDsluCounter, 1502 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 3061 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:50:19,098 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 3061 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:50:19,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3229 states. [2024-10-11 04:50:19,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3229 to 3227. [2024-10-11 04:50:19,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3227 states, 3225 states have (on average 1.49984496124031) internal successors, (4837), 3226 states have internal predecessors, (4837), 0 states have call successors, (0), 0 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 04:50:19,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3227 states to 3227 states and 4837 transitions. [2024-10-11 04:50:19,172 INFO L78 Accepts]: Start accepts. Automaton has 3227 states and 4837 transitions. Word has length 80 [2024-10-11 04:50:19,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:50:19,174 INFO L471 AbstractCegarLoop]: Abstraction has 3227 states and 4837 transitions. [2024-10-11 04:50:19,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:50:19,175 INFO L276 IsEmpty]: Start isEmpty. Operand 3227 states and 4837 transitions. [2024-10-11 04:50:19,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-10-11 04:50:19,176 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:50:19,176 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:50:19,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-11 04:50:19,176 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:50:19,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:50:19,177 INFO L85 PathProgramCache]: Analyzing trace with hash -1621752735, now seen corresponding path program 1 times [2024-10-11 04:50:19,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:50:19,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561564894] [2024-10-11 04:50:19,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:50:19,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:50:19,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:50:19,258 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:50:19,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:50:19,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561564894] [2024-10-11 04:50:19,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561564894] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:50:19,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:50:19,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:50:19,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029052461] [2024-10-11 04:50:19,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:50:19,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:50:19,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:50:19,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:50:19,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:50:19,261 INFO L87 Difference]: Start difference. First operand 3227 states and 4837 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:50:19,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:50:19,307 INFO L93 Difference]: Finished difference Result 4063 states and 5996 transitions. [2024-10-11 04:50:19,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:50:19,308 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2024-10-11 04:50:19,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:50:19,312 INFO L225 Difference]: With dead ends: 4063 [2024-10-11 04:50:19,312 INFO L226 Difference]: Without dead ends: 2397 [2024-10-11 04:50:19,314 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 04:50:19,315 INFO L432 NwaCegarLoop]: 1552 mSDtfsCounter, 36 mSDsluCounter, 1494 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 3046 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:50:19,315 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 3046 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:50:19,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2397 states. [2024-10-11 04:50:19,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2397 to 2395. [2024-10-11 04:50:19,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2395 states, 2393 states have (on average 1.532386126201421) internal successors, (3667), 2394 states have internal predecessors, (3667), 0 states have call successors, (0), 0 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 04:50:19,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2395 states to 2395 states and 3667 transitions. [2024-10-11 04:50:19,365 INFO L78 Accepts]: Start accepts. Automaton has 2395 states and 3667 transitions. Word has length 82 [2024-10-11 04:50:19,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:50:19,366 INFO L471 AbstractCegarLoop]: Abstraction has 2395 states and 3667 transitions. [2024-10-11 04:50:19,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:50:19,366 INFO L276 IsEmpty]: Start isEmpty. Operand 2395 states and 3667 transitions. [2024-10-11 04:50:19,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-10-11 04:50:19,367 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:50:19,367 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:50:19,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-11 04:50:19,367 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:50:19,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:50:19,368 INFO L85 PathProgramCache]: Analyzing trace with hash -481397041, now seen corresponding path program 1 times [2024-10-11 04:50:19,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:50:19,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501047533] [2024-10-11 04:50:19,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:50:19,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:50:19,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:50:20,436 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:50:20,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:50:20,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501047533] [2024-10-11 04:50:20,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501047533] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 04:50:20,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1943302003] [2024-10-11 04:50:20,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:50:20,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:50:20,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:50:20,438 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 04:50:20,439 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 04:50:20,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:50:20,556 INFO L255 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-11 04:50:20,565 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 04:50:20,767 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 04:50:20,767 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 04:50:20,947 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 04:50:20,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1943302003] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 04:50:20,948 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 04:50:20,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 5, 4] total 18 [2024-10-11 04:50:20,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270417880] [2024-10-11 04:50:20,948 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 04:50:20,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-11 04:50:20,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:50:20,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-11 04:50:20,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2024-10-11 04:50:20,950 INFO L87 Difference]: Start difference. First operand 2395 states and 3667 transitions. Second operand has 18 states, 18 states have (on average 13.222222222222221) internal successors, (238), 18 states have internal predecessors, (238), 0 states have call successors, (0), 0 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 04:50:23,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:50:23,187 INFO L93 Difference]: Finished difference Result 7990 states and 11205 transitions. [2024-10-11 04:50:23,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2024-10-11 04:50:23,188 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 13.222222222222221) internal successors, (238), 18 states have internal predecessors, (238), 0 states have call successors, (0), 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 84 [2024-10-11 04:50:23,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:50:23,196 INFO L225 Difference]: With dead ends: 7990 [2024-10-11 04:50:23,196 INFO L226 Difference]: Without dead ends: 7156 [2024-10-11 04:50:23,201 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1047 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=714, Invalid=2946, Unknown=0, NotChecked=0, Total=3660 [2024-10-11 04:50:23,201 INFO L432 NwaCegarLoop]: 1518 mSDtfsCounter, 17879 mSDsluCounter, 6390 mSDsCounter, 0 mSdLazyCounter, 840 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17879 SdHoareTripleChecker+Valid, 7908 SdHoareTripleChecker+Invalid, 892 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 840 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 04:50:23,202 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17879 Valid, 7908 Invalid, 892 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 840 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 04:50:23,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7156 states. [2024-10-11 04:50:23,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7156 to 7108. [2024-10-11 04:50:23,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7108 states, 7106 states have (on average 1.3627920067548551) internal successors, (9684), 7107 states have internal predecessors, (9684), 0 states have call successors, (0), 0 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 04:50:23,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7108 states to 7108 states and 9684 transitions. [2024-10-11 04:50:23,348 INFO L78 Accepts]: Start accepts. Automaton has 7108 states and 9684 transitions. Word has length 84 [2024-10-11 04:50:23,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:50:23,348 INFO L471 AbstractCegarLoop]: Abstraction has 7108 states and 9684 transitions. [2024-10-11 04:50:23,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 13.222222222222221) internal successors, (238), 18 states have internal predecessors, (238), 0 states have call successors, (0), 0 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 04:50:23,349 INFO L276 IsEmpty]: Start isEmpty. Operand 7108 states and 9684 transitions. [2024-10-11 04:50:23,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-10-11 04:50:23,349 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:50:23,349 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:50:23,362 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 04:50:23,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2024-10-11 04:50:23,550 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:50:23,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:50:23,551 INFO L85 PathProgramCache]: Analyzing trace with hash 560441504, now seen corresponding path program 1 times [2024-10-11 04:50:23,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:50:23,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207392880] [2024-10-11 04:50:23,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:50:23,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:50:23,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:50:24,248 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:50:24,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:50:24,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207392880] [2024-10-11 04:50:24,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207392880] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 04:50:24,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [347252306] [2024-10-11 04:50:24,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:50:24,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:50:24,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:50:24,250 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 04:50:24,252 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 04:50:24,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:50:24,339 INFO L255 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-10-11 04:50:24,341 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 04:50:24,856 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:50:24,856 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 04:50:25,729 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:50:25,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [347252306] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 04:50:25,730 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 04:50:25,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 13] total 35 [2024-10-11 04:50:25,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999562025] [2024-10-11 04:50:25,730 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 04:50:25,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-10-11 04:50:25,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:50:25,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-10-11 04:50:25,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=1039, Unknown=0, NotChecked=0, Total=1190 [2024-10-11 04:50:25,732 INFO L87 Difference]: Start difference. First operand 7108 states and 9684 transitions. Second operand has 35 states, 35 states have (on average 6.485714285714286) internal successors, (227), 35 states have internal predecessors, (227), 0 states have call successors, (0), 0 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 04:50:28,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:50:28,511 INFO L93 Difference]: Finished difference Result 25403 states and 33841 transitions. [2024-10-11 04:50:28,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2024-10-11 04:50:28,512 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 6.485714285714286) internal successors, (227), 35 states have internal predecessors, (227), 0 states have call successors, (0), 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 85 [2024-10-11 04:50:28,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:50:28,532 INFO L225 Difference]: With dead ends: 25403 [2024-10-11 04:50:28,533 INFO L226 Difference]: Without dead ends: 20003 [2024-10-11 04:50:28,537 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1461 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1158, Invalid=5004, Unknown=0, NotChecked=0, Total=6162 [2024-10-11 04:50:28,538 INFO L432 NwaCegarLoop]: 1512 mSDtfsCounter, 22165 mSDsluCounter, 11050 mSDsCounter, 0 mSdLazyCounter, 1266 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22165 SdHoareTripleChecker+Valid, 12562 SdHoareTripleChecker+Invalid, 1326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 1266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 04:50:28,538 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22165 Valid, 12562 Invalid, 1326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 1266 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 04:50:28,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20003 states. [2024-10-11 04:50:28,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20003 to 19845. [2024-10-11 04:50:28,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19845 states, 19843 states have (on average 1.3113944464042735) internal successors, (26022), 19844 states have internal predecessors, (26022), 0 states have call successors, (0), 0 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 04:50:28,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19845 states to 19845 states and 26022 transitions. [2024-10-11 04:50:28,992 INFO L78 Accepts]: Start accepts. Automaton has 19845 states and 26022 transitions. Word has length 85 [2024-10-11 04:50:28,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:50:28,992 INFO L471 AbstractCegarLoop]: Abstraction has 19845 states and 26022 transitions. [2024-10-11 04:50:28,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 6.485714285714286) internal successors, (227), 35 states have internal predecessors, (227), 0 states have call successors, (0), 0 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 04:50:28,992 INFO L276 IsEmpty]: Start isEmpty. Operand 19845 states and 26022 transitions. [2024-10-11 04:50:28,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-10-11 04:50:28,993 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:50:28,994 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:50:29,008 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 04:50:29,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:50:29,194 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:50:29,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:50:29,195 INFO L85 PathProgramCache]: Analyzing trace with hash 1904800494, now seen corresponding path program 1 times [2024-10-11 04:50:29,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:50:29,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025807972] [2024-10-11 04:50:29,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:50:29,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:50:29,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:50:30,365 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:50:30,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:50:30,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025807972] [2024-10-11 04:50:30,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025807972] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 04:50:30,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1614592355] [2024-10-11 04:50:30,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:50:30,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:50:30,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:50:30,367 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 04:50:30,368 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 04:50:30,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:50:30,477 INFO L255 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-11 04:50:30,479 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 04:50:30,813 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:50:30,813 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 04:50:31,471 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:50:31,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1614592355] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 04:50:31,472 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 04:50:31,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 27 [2024-10-11 04:50:31,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400728456] [2024-10-11 04:50:31,472 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 04:50:31,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-10-11 04:50:31,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:50:31,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-10-11 04:50:31,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=666, Unknown=0, NotChecked=0, Total=756 [2024-10-11 04:50:31,474 INFO L87 Difference]: Start difference. First operand 19845 states and 26022 transitions. Second operand has 28 states, 28 states have (on average 8.142857142857142) internal successors, (228), 27 states have internal predecessors, (228), 0 states have call successors, (0), 0 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 04:50:33,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:50:33,997 INFO L93 Difference]: Finished difference Result 60463 states and 78403 transitions. [2024-10-11 04:50:33,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2024-10-11 04:50:33,997 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 8.142857142857142) internal successors, (228), 27 states have internal predecessors, (228), 0 states have call successors, (0), 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 85 [2024-10-11 04:50:33,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:50:34,047 INFO L225 Difference]: With dead ends: 60463 [2024-10-11 04:50:34,047 INFO L226 Difference]: Without dead ends: 44160 [2024-10-11 04:50:34,060 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 819 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=684, Invalid=2976, Unknown=0, NotChecked=0, Total=3660 [2024-10-11 04:50:34,061 INFO L432 NwaCegarLoop]: 1529 mSDtfsCounter, 21172 mSDsluCounter, 9732 mSDsCounter, 0 mSdLazyCounter, 1335 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21172 SdHoareTripleChecker+Valid, 11261 SdHoareTripleChecker+Invalid, 1371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 1335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 04:50:34,061 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21172 Valid, 11261 Invalid, 1371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 1335 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 04:50:34,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44160 states. [2024-10-11 04:50:34,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44160 to 40863. [2024-10-11 04:50:35,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40863 states, 40861 states have (on average 1.286189765301877) internal successors, (52555), 40862 states have internal predecessors, (52555), 0 states have call successors, (0), 0 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 04:50:35,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40863 states to 40863 states and 52555 transitions. [2024-10-11 04:50:35,068 INFO L78 Accepts]: Start accepts. Automaton has 40863 states and 52555 transitions. Word has length 85 [2024-10-11 04:50:35,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:50:35,069 INFO L471 AbstractCegarLoop]: Abstraction has 40863 states and 52555 transitions. [2024-10-11 04:50:35,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 8.142857142857142) internal successors, (228), 27 states have internal predecessors, (228), 0 states have call successors, (0), 0 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 04:50:35,069 INFO L276 IsEmpty]: Start isEmpty. Operand 40863 states and 52555 transitions. [2024-10-11 04:50:35,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-10-11 04:50:35,071 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:50:35,071 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:50:35,084 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 04:50:35,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:50:35,272 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:50:35,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:50:35,272 INFO L85 PathProgramCache]: Analyzing trace with hash -611567267, now seen corresponding path program 1 times [2024-10-11 04:50:35,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:50:35,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136650785] [2024-10-11 04:50:35,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:50:35,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:50:35,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:50:35,568 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:50:35,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:50:35,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136650785] [2024-10-11 04:50:35,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136650785] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 04:50:35,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1426669189] [2024-10-11 04:50:35,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:50:35,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:50:35,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:50:35,573 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 04:50:35,575 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 04:50:35,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:50:35,682 INFO L255 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-10-11 04:50:35,687 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 04:50:36,189 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:50:36,189 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 04:50:37,219 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:50:37,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1426669189] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 04:50:37,219 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 04:50:37,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 13] total 31 [2024-10-11 04:50:37,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438266965] [2024-10-11 04:50:37,219 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 04:50:37,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-10-11 04:50:37,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:50:37,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-10-11 04:50:37,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=802, Unknown=0, NotChecked=0, Total=930 [2024-10-11 04:50:37,221 INFO L87 Difference]: Start difference. First operand 40863 states and 52555 transitions. Second operand has 31 states, 31 states have (on average 7.903225806451613) internal successors, (245), 31 states have internal predecessors, (245), 0 states have call successors, (0), 0 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 04:50:40,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:50:40,062 INFO L93 Difference]: Finished difference Result 88170 states and 113063 transitions. [2024-10-11 04:50:40,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-10-11 04:50:40,063 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 7.903225806451613) internal successors, (245), 31 states have internal predecessors, (245), 0 states have call successors, (0), 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 86 [2024-10-11 04:50:40,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:50:40,127 INFO L225 Difference]: With dead ends: 88170 [2024-10-11 04:50:40,127 INFO L226 Difference]: Without dead ends: 49531 [2024-10-11 04:50:40,151 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 813 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=734, Invalid=2926, Unknown=0, NotChecked=0, Total=3660 [2024-10-11 04:50:40,152 INFO L432 NwaCegarLoop]: 1508 mSDtfsCounter, 18650 mSDsluCounter, 6587 mSDsCounter, 0 mSdLazyCounter, 800 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18650 SdHoareTripleChecker+Valid, 8095 SdHoareTripleChecker+Invalid, 847 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 800 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 04:50:40,152 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18650 Valid, 8095 Invalid, 847 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 800 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 04:50:40,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49531 states. [2024-10-11 04:50:41,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49531 to 47157. [2024-10-11 04:50:42,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47157 states, 47155 states have (on average 1.268370268264235) internal successors, (59810), 47156 states have internal predecessors, (59810), 0 states have call successors, (0), 0 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 04:50:42,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47157 states to 47157 states and 59810 transitions. [2024-10-11 04:50:42,102 INFO L78 Accepts]: Start accepts. Automaton has 47157 states and 59810 transitions. Word has length 86 [2024-10-11 04:50:42,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:50:42,102 INFO L471 AbstractCegarLoop]: Abstraction has 47157 states and 59810 transitions. [2024-10-11 04:50:42,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 7.903225806451613) internal successors, (245), 31 states have internal predecessors, (245), 0 states have call successors, (0), 0 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 04:50:42,102 INFO L276 IsEmpty]: Start isEmpty. Operand 47157 states and 59810 transitions. [2024-10-11 04:50:42,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-10-11 04:50:42,104 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:50:42,104 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:50:42,117 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-11 04:50:42,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2024-10-11 04:50:42,305 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:50:42,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:50:42,306 INFO L85 PathProgramCache]: Analyzing trace with hash 1591476830, now seen corresponding path program 1 times [2024-10-11 04:50:42,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:50:42,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953578938] [2024-10-11 04:50:42,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:50:42,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:50:42,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:50:42,605 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:50:42,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:50:42,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953578938] [2024-10-11 04:50:42,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953578938] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 04:50:42,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [131552778] [2024-10-11 04:50:42,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:50:42,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:50:42,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:50:42,608 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 04:50:42,609 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-11 04:50:42,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:50:42,706 INFO L255 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-11 04:50:42,707 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 04:50:42,998 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:50:42,998 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 04:50:43,581 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:50:43,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [131552778] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 04:50:43,581 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 04:50:43,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 21 [2024-10-11 04:50:43,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229432770] [2024-10-11 04:50:43,581 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 04:50:43,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-10-11 04:50:43,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:50:43,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-10-11 04:50:43,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=377, Unknown=0, NotChecked=0, Total=462 [2024-10-11 04:50:43,582 INFO L87 Difference]: Start difference. First operand 47157 states and 59810 transitions. Second operand has 22 states, 22 states have (on average 9.227272727272727) internal successors, (203), 21 states have internal predecessors, (203), 0 states have call successors, (0), 0 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 04:50:46,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:50:46,101 INFO L93 Difference]: Finished difference Result 124144 states and 157178 transitions. [2024-10-11 04:50:46,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 04:50:46,101 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 9.227272727272727) internal successors, (203), 21 states have internal predecessors, (203), 0 states have call successors, (0), 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 87 [2024-10-11 04:50:46,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:50:46,217 INFO L225 Difference]: With dead ends: 124144 [2024-10-11 04:50:46,217 INFO L226 Difference]: Without dead ends: 83002 [2024-10-11 04:50:46,240 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=245, Invalid=747, Unknown=0, NotChecked=0, Total=992 [2024-10-11 04:50:46,241 INFO L432 NwaCegarLoop]: 1523 mSDtfsCounter, 7854 mSDsluCounter, 4795 mSDsCounter, 0 mSdLazyCounter, 452 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7854 SdHoareTripleChecker+Valid, 6318 SdHoareTripleChecker+Invalid, 460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 04:50:46,241 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7854 Valid, 6318 Invalid, 460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 452 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 04:50:46,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83002 states. [2024-10-11 04:50:49,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83002 to 78642. [2024-10-11 04:50:49,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78642 states, 78640 states have (on average 1.250851983723296) internal successors, (98367), 78641 states have internal predecessors, (98367), 0 states have call successors, (0), 0 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 04:50:49,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78642 states to 78642 states and 98367 transitions. [2024-10-11 04:50:49,491 INFO L78 Accepts]: Start accepts. Automaton has 78642 states and 98367 transitions. Word has length 87 [2024-10-11 04:50:49,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:50:49,492 INFO L471 AbstractCegarLoop]: Abstraction has 78642 states and 98367 transitions. [2024-10-11 04:50:49,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 9.227272727272727) internal successors, (203), 21 states have internal predecessors, (203), 0 states have call successors, (0), 0 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 04:50:49,492 INFO L276 IsEmpty]: Start isEmpty. Operand 78642 states and 98367 transitions. [2024-10-11 04:50:49,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-10-11 04:50:49,494 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:50:49,494 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:50:49,512 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-11 04:50:49,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-10-11 04:50:49,695 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:50:49,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:50:49,696 INFO L85 PathProgramCache]: Analyzing trace with hash -1876865667, now seen corresponding path program 1 times [2024-10-11 04:50:49,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:50:49,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825202587] [2024-10-11 04:50:49,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:50:49,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:50:49,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:50:52,790 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:50:52,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:50:52,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825202587] [2024-10-11 04:50:52,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825202587] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 04:50:52,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1975255392] [2024-10-11 04:50:52,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:50:52,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:50:52,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:50:52,792 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 04:50:52,793 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-11 04:50:52,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:50:52,899 INFO L255 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 63 conjuncts are in the unsatisfiable core [2024-10-11 04:50:52,901 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 04:50:57,905 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:50:57,905 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 04:51:04,628 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:51:04,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1975255392] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 04:51:04,628 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 04:51:04,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 33, 26] total 86 [2024-10-11 04:51:04,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563819022] [2024-10-11 04:51:04,629 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 04:51:04,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 86 states [2024-10-11 04:51:04,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:51:04,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2024-10-11 04:51:04,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=731, Invalid=6579, Unknown=0, NotChecked=0, Total=7310 [2024-10-11 04:51:04,631 INFO L87 Difference]: Start difference. First operand 78642 states and 98367 transitions. Second operand has 86 states, 86 states have (on average 2.9069767441860463) internal successors, (250), 86 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)