./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.8.ufo.UNBOUNDED.pals+Problem12_label01.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pals_lcr.8.ufo.UNBOUNDED.pals+Problem12_label01.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 25b17d9846be3bf6d57cc6f8838ab7429415f7d55e2316a61257e7b64e148fac --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 22:51:42,503 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 22:51:42,562 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-11 22:51:42,565 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 22:51:42,567 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 22:51:42,595 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 22:51:42,596 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 22:51:42,596 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 22:51:42,597 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-11 22:51:42,598 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-11 22:51:42,598 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 22:51:42,598 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 22:51:42,599 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 22:51:42,601 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 22:51:42,601 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 22:51:42,601 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 22:51:42,602 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 22:51:42,602 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-11 22:51:42,602 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-11 22:51:42,602 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-11 22:51:42,603 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 22:51:42,606 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 22:51:42,606 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 22:51:42,606 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 22:51:42,606 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 22:51:42,607 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-11 22:51:42,607 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 22:51:42,607 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 22:51:42,607 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 22:51:42,607 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 22:51:42,608 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 22:51:42,608 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 22:51:42,608 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 22:51:42,608 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 22:51:42,608 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 22:51:42,608 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 22:51:42,608 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-11 22:51:42,609 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-11 22:51:42,609 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 22:51:42,609 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-11 22:51:42,609 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-11 22:51:42,612 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-11 22:51:42,612 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 25b17d9846be3bf6d57cc6f8838ab7429415f7d55e2316a61257e7b64e148fac [2024-11-11 22:51:42,809 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 22:51:42,829 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 22:51:42,831 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 22:51:42,832 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 22:51:42,832 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 22:51:42,833 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.8.ufo.UNBOUNDED.pals+Problem12_label01.c [2024-11-11 22:51:44,275 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 22:51:44,705 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 22:51:44,706 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.8.ufo.UNBOUNDED.pals+Problem12_label01.c [2024-11-11 22:51:44,739 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b51fd7ac/790aaed5a8644d8cb96ae34bd2ed290d/FLAGee22f7b29 [2024-11-11 22:51:44,752 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b51fd7ac/790aaed5a8644d8cb96ae34bd2ed290d [2024-11-11 22:51:44,754 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 22:51:44,755 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 22:51:44,756 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 22:51:44,756 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 22:51:44,762 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 22:51:44,762 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 10:51:44" (1/1) ... [2024-11-11 22:51:44,763 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7220c902 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:51:44, skipping insertion in model container [2024-11-11 22:51:44,763 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 10:51:44" (1/1) ... [2024-11-11 22:51:44,843 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 22:51:45,459 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.8.ufo.UNBOUNDED.pals+Problem12_label01.c[26888,26901] [2024-11-11 22:51:45,507 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.8.ufo.UNBOUNDED.pals+Problem12_label01.c[32443,32456] [2024-11-11 22:51:46,321 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 22:51:46,338 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 22:51:46,382 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.8.ufo.UNBOUNDED.pals+Problem12_label01.c[26888,26901] [2024-11-11 22:51:46,395 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.8.ufo.UNBOUNDED.pals+Problem12_label01.c[32443,32456] [2024-11-11 22:51:46,963 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 22:51:46,991 INFO L204 MainTranslator]: Completed translation [2024-11-11 22:51:46,992 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:51:46 WrapperNode [2024-11-11 22:51:46,992 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 22:51:46,993 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 22:51:46,993 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 22:51:46,993 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 22:51:47,021 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:51:46" (1/1) ... [2024-11-11 22:51:47,073 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:51:46" (1/1) ... [2024-11-11 22:51:47,331 INFO L138 Inliner]: procedures = 40, calls = 25, calls flagged for inlining = 20, calls inlined = 20, statements flattened = 5291 [2024-11-11 22:51:47,331 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 22:51:47,333 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 22:51:47,333 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 22:51:47,333 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 22:51:47,347 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:51:46" (1/1) ... [2024-11-11 22:51:47,347 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:51:46" (1/1) ... [2024-11-11 22:51:47,384 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:51:46" (1/1) ... [2024-11-11 22:51:47,575 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-11 22:51:47,575 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:51:46" (1/1) ... [2024-11-11 22:51:47,575 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:51:46" (1/1) ... [2024-11-11 22:51:47,696 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:51:46" (1/1) ... [2024-11-11 22:51:47,723 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:51:46" (1/1) ... [2024-11-11 22:51:47,746 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:51:46" (1/1) ... [2024-11-11 22:51:47,763 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:51:46" (1/1) ... [2024-11-11 22:51:47,815 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 22:51:47,816 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 22:51:47,817 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 22:51:47,817 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 22:51:47,818 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:51:46" (1/1) ... [2024-11-11 22:51:47,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 22:51:47,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 22:51:47,849 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-11 22:51:47,852 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-11 22:51:47,893 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 22:51:47,893 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-11 22:51:47,894 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 22:51:47,894 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 22:51:48,034 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 22:51:48,036 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 22:51:51,507 INFO L? ?]: Removed 759 outVars from TransFormulas that were not future-live. [2024-11-11 22:51:51,508 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 22:51:51,542 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 22:51:51,544 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-11 22:51:51,544 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 10:51:51 BoogieIcfgContainer [2024-11-11 22:51:51,545 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 22:51:51,546 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 22:51:51,546 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 22:51:51,549 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 22:51:51,550 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 10:51:44" (1/3) ... [2024-11-11 22:51:51,550 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a9a4d2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 10:51:51, skipping insertion in model container [2024-11-11 22:51:51,550 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:51:46" (2/3) ... [2024-11-11 22:51:51,551 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a9a4d2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 10:51:51, skipping insertion in model container [2024-11-11 22:51:51,551 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 10:51:51" (3/3) ... [2024-11-11 22:51:51,552 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.8.ufo.UNBOUNDED.pals+Problem12_label01.c [2024-11-11 22:51:51,564 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 22:51:51,565 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-11 22:51:51,642 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-11 22:51:51,648 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;@231eadd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 22:51:51,648 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-11 22:51:51,662 INFO L276 IsEmpty]: Start isEmpty. Operand has 949 states, 946 states have (on average 1.9027484143763214) internal successors, (1800), 948 states have internal predecessors, (1800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:51:51,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-11 22:51:51,671 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:51:51,672 INFO L218 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] [2024-11-11 22:51:51,672 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:51:51,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:51:51,677 INFO L85 PathProgramCache]: Analyzing trace with hash -1967767115, now seen corresponding path program 1 times [2024-11-11 22:51:51,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:51:51,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404822507] [2024-11-11 22:51:51,684 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:51:51,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:51:51,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:51:51,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:51:51,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:51:51,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404822507] [2024-11-11 22:51:51,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404822507] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:51:51,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:51:51,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 22:51:51,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328778789] [2024-11-11 22:51:51,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:51:51,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-11 22:51:51,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:51:51,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-11 22:51:52,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-11 22:51:52,003 INFO L87 Difference]: Start difference. First operand has 949 states, 946 states have (on average 1.9027484143763214) internal successors, (1800), 948 states have internal predecessors, (1800), 0 states have call successors, (0), 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 15.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:51:52,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:51:52,081 INFO L93 Difference]: Finished difference Result 1829 states and 3468 transitions. [2024-11-11 22:51:52,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 22:51:52,083 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 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 30 [2024-11-11 22:51:52,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:51:52,109 INFO L225 Difference]: With dead ends: 1829 [2024-11-11 22:51:52,110 INFO L226 Difference]: Without dead ends: 883 [2024-11-11 22:51:52,117 INFO L434 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-11-11 22:51:52,122 INFO L435 NwaCegarLoop]: 1731 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1731 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 22:51:52,123 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1731 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 22:51:52,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 883 states. [2024-11-11 22:51:52,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 883 to 883. [2024-11-11 22:51:52,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 883 states, 881 states have (on average 1.8921679909194098) internal successors, (1667), 882 states have internal predecessors, (1667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:51:52,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 883 states to 883 states and 1667 transitions. [2024-11-11 22:51:52,216 INFO L78 Accepts]: Start accepts. Automaton has 883 states and 1667 transitions. Word has length 30 [2024-11-11 22:51:52,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:51:52,217 INFO L471 AbstractCegarLoop]: Abstraction has 883 states and 1667 transitions. [2024-11-11 22:51:52,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:51:52,217 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 1667 transitions. [2024-11-11 22:51:52,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-11 22:51:52,220 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:51:52,220 INFO L218 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] [2024-11-11 22:51:52,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-11 22:51:52,221 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:51:52,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:51:52,222 INFO L85 PathProgramCache]: Analyzing trace with hash -2101780621, now seen corresponding path program 1 times [2024-11-11 22:51:52,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:51:52,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715172044] [2024-11-11 22:51:52,222 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:51:52,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:51:52,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:51:52,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:51:52,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:51:52,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715172044] [2024-11-11 22:51:52,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715172044] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:51:52,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:51:52,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 22:51:52,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274455570] [2024-11-11 22:51:52,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:51:52,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 22:51:52,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:51:52,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 22:51:52,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 22:51:52,509 INFO L87 Difference]: Start difference. First operand 883 states and 1667 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:51:52,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:51:52,650 INFO L93 Difference]: Finished difference Result 949 states and 1771 transitions. [2024-11-11 22:51:52,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 22:51:52,650 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 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 30 [2024-11-11 22:51:52,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:51:52,653 INFO L225 Difference]: With dead ends: 949 [2024-11-11 22:51:52,653 INFO L226 Difference]: Without dead ends: 883 [2024-11-11 22:51:52,654 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 22:51:52,655 INFO L435 NwaCegarLoop]: 1665 mSDtfsCounter, 0 mSDsluCounter, 4929 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6594 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 22:51:52,655 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6594 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 22:51:52,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 883 states. [2024-11-11 22:51:52,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 883 to 883. [2024-11-11 22:51:52,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 883 states, 881 states have (on average 1.8229284903518728) internal successors, (1606), 882 states have internal predecessors, (1606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:51:52,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 883 states to 883 states and 1606 transitions. [2024-11-11 22:51:52,668 INFO L78 Accepts]: Start accepts. Automaton has 883 states and 1606 transitions. Word has length 30 [2024-11-11 22:51:52,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:51:52,668 INFO L471 AbstractCegarLoop]: Abstraction has 883 states and 1606 transitions. [2024-11-11 22:51:52,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:51:52,669 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 1606 transitions. [2024-11-11 22:51:52,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-11 22:51:52,670 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:51:52,670 INFO L218 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] [2024-11-11 22:51:52,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-11 22:51:52,670 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:51:52,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:51:52,671 INFO L85 PathProgramCache]: Analyzing trace with hash 1488328053, now seen corresponding path program 1 times [2024-11-11 22:51:52,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:51:52,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409623695] [2024-11-11 22:51:52,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:51:52,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:51:52,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:51:52,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:51:52,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:51:52,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409623695] [2024-11-11 22:51:52,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409623695] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:51:52,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:51:52,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 22:51:52,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617265627] [2024-11-11 22:51:52,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:51:52,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 22:51:52,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:51:52,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 22:51:52,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 22:51:52,739 INFO L87 Difference]: Start difference. First operand 883 states and 1606 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 2 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:51:55,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:51:55,613 INFO L93 Difference]: Finished difference Result 2387 states and 4479 transitions. [2024-11-11 22:51:55,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 22:51:55,613 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 2 states have internal predecessors, (48), 0 states have call successors, (0), 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 48 [2024-11-11 22:51:55,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:51:55,619 INFO L225 Difference]: With dead ends: 2387 [2024-11-11 22:51:55,619 INFO L226 Difference]: Without dead ends: 1634 [2024-11-11 22:51:55,620 INFO L434 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-11-11 22:51:55,621 INFO L435 NwaCegarLoop]: 588 mSDtfsCounter, 937 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2274 mSolverCounterSat, 591 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 937 SdHoareTripleChecker+Valid, 595 SdHoareTripleChecker+Invalid, 2865 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 591 IncrementalHoareTripleChecker+Valid, 2274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-11-11 22:51:55,622 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [937 Valid, 595 Invalid, 2865 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [591 Valid, 2274 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-11-11 22:51:55,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1634 states. [2024-11-11 22:51:55,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1634 to 1634. [2024-11-11 22:51:55,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1634 states, 1632 states have (on average 1.6133578431372548) internal successors, (2633), 1633 states have internal predecessors, (2633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:51:55,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1634 states to 1634 states and 2633 transitions. [2024-11-11 22:51:55,646 INFO L78 Accepts]: Start accepts. Automaton has 1634 states and 2633 transitions. Word has length 48 [2024-11-11 22:51:55,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:51:55,647 INFO L471 AbstractCegarLoop]: Abstraction has 1634 states and 2633 transitions. [2024-11-11 22:51:55,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 2 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:51:55,647 INFO L276 IsEmpty]: Start isEmpty. Operand 1634 states and 2633 transitions. [2024-11-11 22:51:55,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-11 22:51:55,649 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:51:55,649 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:51:55,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-11 22:51:55,650 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:51:55,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:51:55,650 INFO L85 PathProgramCache]: Analyzing trace with hash -1651582301, now seen corresponding path program 1 times [2024-11-11 22:51:55,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:51:55,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141233805] [2024-11-11 22:51:55,651 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:51:55,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:51:55,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:51:55,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:51:55,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:51:55,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141233805] [2024-11-11 22:51:55,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141233805] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:51:55,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:51:55,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-11 22:51:55,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608825207] [2024-11-11 22:51:55,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:51:55,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-11 22:51:55,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:51:55,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-11 22:51:55,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-11 22:51:55,903 INFO L87 Difference]: Start difference. First operand 1634 states and 2633 transitions. Second operand has 10 states, 10 states have (on average 9.0) internal successors, (90), 10 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:51:56,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:51:56,424 INFO L93 Difference]: Finished difference Result 2626 states and 4233 transitions. [2024-11-11 22:51:56,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-11 22:51:56,425 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.0) internal successors, (90), 10 states have internal predecessors, (90), 0 states have call successors, (0), 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 90 [2024-11-11 22:51:56,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:51:56,432 INFO L225 Difference]: With dead ends: 2626 [2024-11-11 22:51:56,433 INFO L226 Difference]: Without dead ends: 2564 [2024-11-11 22:51:56,434 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=162, Invalid=344, Unknown=0, NotChecked=0, Total=506 [2024-11-11 22:51:56,434 INFO L435 NwaCegarLoop]: 1600 mSDtfsCounter, 13578 mSDsluCounter, 3975 mSDsCounter, 0 mSdLazyCounter, 301 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13578 SdHoareTripleChecker+Valid, 5575 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-11 22:51:56,435 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13578 Valid, 5575 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 301 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-11 22:51:56,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2564 states. [2024-11-11 22:51:56,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2564 to 1694. [2024-11-11 22:51:56,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1694 states, 1692 states have (on average 1.6134751773049645) internal successors, (2730), 1693 states have internal predecessors, (2730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:51:56,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1694 states to 1694 states and 2730 transitions. [2024-11-11 22:51:56,541 INFO L78 Accepts]: Start accepts. Automaton has 1694 states and 2730 transitions. Word has length 90 [2024-11-11 22:51:56,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:51:56,543 INFO L471 AbstractCegarLoop]: Abstraction has 1694 states and 2730 transitions. [2024-11-11 22:51:56,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.0) internal successors, (90), 10 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:51:56,544 INFO L276 IsEmpty]: Start isEmpty. Operand 1694 states and 2730 transitions. [2024-11-11 22:51:56,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-11 22:51:56,548 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:51:56,548 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:51:56,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-11 22:51:56,549 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:51:56,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:51:56,550 INFO L85 PathProgramCache]: Analyzing trace with hash 551619955, now seen corresponding path program 1 times [2024-11-11 22:51:56,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:51:56,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589127158] [2024-11-11 22:51:56,550 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:51:56,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:51:56,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:51:56,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:51:56,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:51:56,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589127158] [2024-11-11 22:51:56,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589127158] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:51:56,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:51:56,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 22:51:56,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757744932] [2024-11-11 22:51:56,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:51:56,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 22:51:56,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:51:56,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 22:51:56,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 22:51:56,755 INFO L87 Difference]: Start difference. First operand 1694 states and 2730 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:51:56,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:51:56,821 INFO L93 Difference]: Finished difference Result 1927 states and 3105 transitions. [2024-11-11 22:51:56,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 22:51:56,821 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 92 [2024-11-11 22:51:56,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:51:56,836 INFO L225 Difference]: With dead ends: 1927 [2024-11-11 22:51:56,836 INFO L226 Difference]: Without dead ends: 1805 [2024-11-11 22:51:56,837 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 22:51:56,838 INFO L435 NwaCegarLoop]: 1602 mSDtfsCounter, 1508 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1508 SdHoareTripleChecker+Valid, 1695 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 22:51:56,838 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1508 Valid, 1695 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 22:51:56,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1805 states. [2024-11-11 22:51:56,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1805 to 1801. [2024-11-11 22:51:56,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1801 states, 1799 states have (on average 1.6120066703724292) internal successors, (2900), 1800 states have internal predecessors, (2900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:51:56,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1801 states to 1801 states and 2900 transitions. [2024-11-11 22:51:56,916 INFO L78 Accepts]: Start accepts. Automaton has 1801 states and 2900 transitions. Word has length 92 [2024-11-11 22:51:56,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:51:56,917 INFO L471 AbstractCegarLoop]: Abstraction has 1801 states and 2900 transitions. [2024-11-11 22:51:56,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:51:56,917 INFO L276 IsEmpty]: Start isEmpty. Operand 1801 states and 2900 transitions. [2024-11-11 22:51:56,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-11 22:51:56,918 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:51:56,918 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:51:56,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-11 22:51:56,919 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:51:56,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:51:56,919 INFO L85 PathProgramCache]: Analyzing trace with hash 618113467, now seen corresponding path program 1 times [2024-11-11 22:51:56,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:51:56,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842556895] [2024-11-11 22:51:56,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:51:56,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:51:56,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:51:57,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:51:57,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:51:57,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842556895] [2024-11-11 22:51:57,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842556895] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:51:57,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:51:57,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-11 22:51:57,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169435309] [2024-11-11 22:51:57,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:51:57,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-11 22:51:57,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:51:57,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-11 22:51:57,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-11-11 22:51:57,544 INFO L87 Difference]: Start difference. First operand 1801 states and 2900 transitions. Second operand has 10 states, 10 states have (on average 9.2) internal successors, (92), 10 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:51:57,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:51:57,939 INFO L93 Difference]: Finished difference Result 2032 states and 3268 transitions. [2024-11-11 22:51:57,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-11 22:51:57,940 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.2) internal successors, (92), 10 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 92 [2024-11-11 22:51:57,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:51:57,945 INFO L225 Difference]: With dead ends: 2032 [2024-11-11 22:51:57,945 INFO L226 Difference]: Without dead ends: 1803 [2024-11-11 22:51:57,946 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2024-11-11 22:51:57,947 INFO L435 NwaCegarLoop]: 1596 mSDtfsCounter, 10647 mSDsluCounter, 682 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10647 SdHoareTripleChecker+Valid, 2278 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 22:51:57,947 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10647 Valid, 2278 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 22:51:57,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1803 states. [2024-11-11 22:51:57,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1803 to 1801. [2024-11-11 22:51:57,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1801 states, 1799 states have (on average 1.6108949416342413) internal successors, (2898), 1800 states have internal predecessors, (2898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:51:57,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1801 states to 1801 states and 2898 transitions. [2024-11-11 22:51:57,969 INFO L78 Accepts]: Start accepts. Automaton has 1801 states and 2898 transitions. Word has length 92 [2024-11-11 22:51:57,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:51:57,970 INFO L471 AbstractCegarLoop]: Abstraction has 1801 states and 2898 transitions. [2024-11-11 22:51:57,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.2) internal successors, (92), 10 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:51:57,970 INFO L276 IsEmpty]: Start isEmpty. Operand 1801 states and 2898 transitions. [2024-11-11 22:51:57,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-11 22:51:57,971 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:51:57,971 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:51:57,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-11 22:51:57,971 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:51:57,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:51:57,972 INFO L85 PathProgramCache]: Analyzing trace with hash 1566925479, now seen corresponding path program 1 times [2024-11-11 22:51:57,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:51:57,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699328671] [2024-11-11 22:51:57,972 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:51:57,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:51:58,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:51:58,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:51:58,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:51:58,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699328671] [2024-11-11 22:51:58,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699328671] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:51:58,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:51:58,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 22:51:58,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8141673] [2024-11-11 22:51:58,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:51:58,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 22:51:58,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:51:58,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 22:51:58,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 22:51:58,253 INFO L87 Difference]: Start difference. First operand 1801 states and 2898 transitions. Second operand has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:51:58,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:51:58,281 INFO L93 Difference]: Finished difference Result 1809 states and 2907 transitions. [2024-11-11 22:51:58,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 22:51:58,281 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2024-11-11 22:51:58,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:51:58,286 INFO L225 Difference]: With dead ends: 1809 [2024-11-11 22:51:58,286 INFO L226 Difference]: Without dead ends: 1807 [2024-11-11 22:51:58,286 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 22:51:58,287 INFO L435 NwaCegarLoop]: 1603 mSDtfsCounter, 0 mSDsluCounter, 4800 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6403 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 22:51:58,287 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6403 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 22:51:58,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1807 states. [2024-11-11 22:51:58,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1807 to 1807. [2024-11-11 22:51:58,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1807 states, 1805 states have (on average 1.6083102493074792) internal successors, (2903), 1806 states have internal predecessors, (2903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:51:58,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1807 states to 1807 states and 2903 transitions. [2024-11-11 22:51:58,311 INFO L78 Accepts]: Start accepts. Automaton has 1807 states and 2903 transitions. Word has length 93 [2024-11-11 22:51:58,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:51:58,312 INFO L471 AbstractCegarLoop]: Abstraction has 1807 states and 2903 transitions. [2024-11-11 22:51:58,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:51:58,312 INFO L276 IsEmpty]: Start isEmpty. Operand 1807 states and 2903 transitions. [2024-11-11 22:51:58,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-11 22:51:58,313 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:51:58,313 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:51:58,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-11 22:51:58,313 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:51:58,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:51:58,314 INFO L85 PathProgramCache]: Analyzing trace with hash -401487589, now seen corresponding path program 1 times [2024-11-11 22:51:58,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:51:58,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947447919] [2024-11-11 22:51:58,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:51:58,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:51:58,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:51:58,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:51:58,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:51:58,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947447919] [2024-11-11 22:51:58,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947447919] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:51:58,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:51:58,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 22:51:58,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376280346] [2024-11-11 22:51:58,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:51:58,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 22:51:58,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:51:58,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 22:51:58,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 22:51:58,375 INFO L87 Difference]: Start difference. First operand 1807 states and 2903 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:51:58,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:51:58,398 INFO L93 Difference]: Finished difference Result 2261 states and 3615 transitions. [2024-11-11 22:51:58,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 22:51:58,399 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2024-11-11 22:51:58,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:51:58,404 INFO L225 Difference]: With dead ends: 2261 [2024-11-11 22:51:58,404 INFO L226 Difference]: Without dead ends: 2026 [2024-11-11 22:51:58,404 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 22:51:58,405 INFO L435 NwaCegarLoop]: 1683 mSDtfsCounter, 1527 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1527 SdHoareTripleChecker+Valid, 1788 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 22:51:58,405 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1527 Valid, 1788 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 22:51:58,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2026 states. [2024-11-11 22:51:58,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2026 to 2024. [2024-11-11 22:51:58,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2024 states, 2022 states have (on average 1.6023738872403561) internal successors, (3240), 2023 states have internal predecessors, (3240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:51:58,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2024 states to 2024 states and 3240 transitions. [2024-11-11 22:51:58,431 INFO L78 Accepts]: Start accepts. Automaton has 2024 states and 3240 transitions. Word has length 94 [2024-11-11 22:51:58,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:51:58,431 INFO L471 AbstractCegarLoop]: Abstraction has 2024 states and 3240 transitions. [2024-11-11 22:51:58,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:51:58,431 INFO L276 IsEmpty]: Start isEmpty. Operand 2024 states and 3240 transitions. [2024-11-11 22:51:58,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-11 22:51:58,432 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:51:58,432 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:51:58,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-11 22:51:58,432 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:51:58,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:51:58,433 INFO L85 PathProgramCache]: Analyzing trace with hash 1540581915, now seen corresponding path program 1 times [2024-11-11 22:51:58,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:51:58,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780860377] [2024-11-11 22:51:58,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:51:58,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:51:58,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:51:58,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:51:58,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:51:58,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780860377] [2024-11-11 22:51:58,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780860377] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:51:58,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:51:58,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 22:51:58,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934659954] [2024-11-11 22:51:58,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:51:58,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 22:51:58,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:51:58,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 22:51:58,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 22:51:58,494 INFO L87 Difference]: Start difference. First operand 2024 states and 3240 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:51:58,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:51:58,554 INFO L93 Difference]: Finished difference Result 2896 states and 4598 transitions. [2024-11-11 22:51:58,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 22:51:58,555 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2024-11-11 22:51:58,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:51:58,566 INFO L225 Difference]: With dead ends: 2896 [2024-11-11 22:51:58,567 INFO L226 Difference]: Without dead ends: 2444 [2024-11-11 22:51:58,568 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 22:51:58,570 INFO L435 NwaCegarLoop]: 1681 mSDtfsCounter, 1525 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1525 SdHoareTripleChecker+Valid, 1790 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 22:51:58,570 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1525 Valid, 1790 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 22:51:58,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2444 states. [2024-11-11 22:51:58,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2444 to 2442. [2024-11-11 22:51:58,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2442 states, 2440 states have (on average 1.590983606557377) internal successors, (3882), 2441 states have internal predecessors, (3882), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:51:58,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2442 states to 2442 states and 3882 transitions. [2024-11-11 22:51:58,609 INFO L78 Accepts]: Start accepts. Automaton has 2442 states and 3882 transitions. Word has length 94 [2024-11-11 22:51:58,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:51:58,609 INFO L471 AbstractCegarLoop]: Abstraction has 2442 states and 3882 transitions. [2024-11-11 22:51:58,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:51:58,609 INFO L276 IsEmpty]: Start isEmpty. Operand 2442 states and 3882 transitions. [2024-11-11 22:51:58,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-11 22:51:58,610 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:51:58,610 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:51:58,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-11 22:51:58,610 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:51:58,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:51:58,611 INFO L85 PathProgramCache]: Analyzing trace with hash 1967352859, now seen corresponding path program 1 times [2024-11-11 22:51:58,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:51:58,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916067378] [2024-11-11 22:51:58,611 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:51:58,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:51:58,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:51:58,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:51:58,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:51:58,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916067378] [2024-11-11 22:51:58,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916067378] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:51:58,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:51:58,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 22:51:58,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348524244] [2024-11-11 22:51:58,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:51:58,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 22:51:58,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:51:58,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 22:51:58,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 22:51:58,688 INFO L87 Difference]: Start difference. First operand 2442 states and 3882 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:51:58,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:51:58,731 INFO L93 Difference]: Finished difference Result 4118 states and 6468 transitions. [2024-11-11 22:51:58,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 22:51:58,731 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2024-11-11 22:51:58,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:51:58,740 INFO L225 Difference]: With dead ends: 4118 [2024-11-11 22:51:58,740 INFO L226 Difference]: Without dead ends: 3248 [2024-11-11 22:51:58,743 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 22:51:58,743 INFO L435 NwaCegarLoop]: 1669 mSDtfsCounter, 1521 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1521 SdHoareTripleChecker+Valid, 1786 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 22:51:58,744 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1521 Valid, 1786 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 22:51:58,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3248 states. [2024-11-11 22:51:58,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3248 to 3246. [2024-11-11 22:51:58,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3246 states, 3244 states have (on average 1.5727496917385944) internal successors, (5102), 3245 states have internal predecessors, (5102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:51:58,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3246 states to 3246 states and 5102 transitions. [2024-11-11 22:51:58,802 INFO L78 Accepts]: Start accepts. Automaton has 3246 states and 5102 transitions. Word has length 94 [2024-11-11 22:51:58,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:51:58,802 INFO L471 AbstractCegarLoop]: Abstraction has 3246 states and 5102 transitions. [2024-11-11 22:51:58,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:51:58,803 INFO L276 IsEmpty]: Start isEmpty. Operand 3246 states and 5102 transitions. [2024-11-11 22:51:58,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-11 22:51:58,805 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:51:58,805 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:51:58,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-11 22:51:58,806 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:51:58,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:51:58,806 INFO L85 PathProgramCache]: Analyzing trace with hash -1089352421, now seen corresponding path program 1 times [2024-11-11 22:51:58,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:51:58,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911249591] [2024-11-11 22:51:58,807 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:51:58,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:51:58,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:51:58,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:51:58,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:51:58,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911249591] [2024-11-11 22:51:58,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911249591] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:51:58,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:51:58,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 22:51:58,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314599373] [2024-11-11 22:51:58,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:51:58,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 22:51:58,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:51:58,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 22:51:58,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 22:51:58,902 INFO L87 Difference]: Start difference. First operand 3246 states and 5102 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:51:58,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:51:58,972 INFO L93 Difference]: Finished difference Result 6466 states and 10016 transitions. [2024-11-11 22:51:58,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 22:51:58,973 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2024-11-11 22:51:58,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:51:58,986 INFO L225 Difference]: With dead ends: 6466 [2024-11-11 22:51:58,986 INFO L226 Difference]: Without dead ends: 4792 [2024-11-11 22:51:58,990 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 22:51:58,991 INFO L435 NwaCegarLoop]: 1667 mSDtfsCounter, 1519 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1519 SdHoareTripleChecker+Valid, 1788 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 22:51:58,991 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1519 Valid, 1788 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 22:51:58,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4792 states. [2024-11-11 22:51:59,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4792 to 4790. [2024-11-11 22:51:59,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4790 states, 4788 states have (on average 1.5484544695071012) internal successors, (7414), 4789 states have internal predecessors, (7414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:51:59,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4790 states to 4790 states and 7414 transitions. [2024-11-11 22:51:59,084 INFO L78 Accepts]: Start accepts. Automaton has 4790 states and 7414 transitions. Word has length 94 [2024-11-11 22:51:59,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:51:59,084 INFO L471 AbstractCegarLoop]: Abstraction has 4790 states and 7414 transitions. [2024-11-11 22:51:59,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:51:59,084 INFO L276 IsEmpty]: Start isEmpty. Operand 4790 states and 7414 transitions. [2024-11-11 22:51:59,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-11 22:51:59,085 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:51:59,085 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:51:59,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-11 22:51:59,086 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:51:59,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:51:59,086 INFO L85 PathProgramCache]: Analyzing trace with hash -1523888357, now seen corresponding path program 1 times [2024-11-11 22:51:59,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:51:59,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383059275] [2024-11-11 22:51:59,086 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:51:59,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:51:59,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:51:59,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:51:59,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:51:59,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383059275] [2024-11-11 22:51:59,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383059275] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:51:59,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:51:59,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 22:51:59,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837371056] [2024-11-11 22:51:59,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:51:59,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 22:51:59,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:51:59,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 22:51:59,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 22:51:59,244 INFO L87 Difference]: Start difference. First operand 4790 states and 7414 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:51:59,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:51:59,328 INFO L93 Difference]: Finished difference Result 10970 states and 16728 transitions. [2024-11-11 22:51:59,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 22:51:59,329 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2024-11-11 22:51:59,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:51:59,353 INFO L225 Difference]: With dead ends: 10970 [2024-11-11 22:51:59,353 INFO L226 Difference]: Without dead ends: 7752 [2024-11-11 22:51:59,362 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 22:51:59,363 INFO L435 NwaCegarLoop]: 1655 mSDtfsCounter, 1515 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1515 SdHoareTripleChecker+Valid, 1784 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 22:51:59,363 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1515 Valid, 1784 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 22:51:59,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7752 states. [2024-11-11 22:51:59,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7752 to 7750. [2024-11-11 22:51:59,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7750 states, 7748 states have (on average 1.5206504904491482) internal successors, (11782), 7749 states have internal predecessors, (11782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:51:59,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7750 states to 7750 states and 11782 transitions. [2024-11-11 22:51:59,674 INFO L78 Accepts]: Start accepts. Automaton has 7750 states and 11782 transitions. Word has length 94 [2024-11-11 22:51:59,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:51:59,674 INFO L471 AbstractCegarLoop]: Abstraction has 7750 states and 11782 transitions. [2024-11-11 22:51:59,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:51:59,675 INFO L276 IsEmpty]: Start isEmpty. Operand 7750 states and 11782 transitions. [2024-11-11 22:51:59,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-11 22:51:59,675 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:51:59,676 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:51:59,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-11 22:51:59,676 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:51:59,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:51:59,679 INFO L85 PathProgramCache]: Analyzing trace with hash 990146075, now seen corresponding path program 1 times [2024-11-11 22:51:59,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:51:59,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626840704] [2024-11-11 22:51:59,679 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:51:59,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:51:59,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:51:59,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:51:59,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:51:59,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626840704] [2024-11-11 22:51:59,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626840704] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:51:59,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:51:59,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 22:51:59,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663833670] [2024-11-11 22:51:59,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:51:59,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 22:51:59,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:51:59,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 22:51:59,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 22:51:59,787 INFO L87 Difference]: Start difference. First operand 7750 states and 11782 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:52:00,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:52:00,083 INFO L93 Difference]: Finished difference Result 19594 states and 29384 transitions. [2024-11-11 22:52:00,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 22:52:00,088 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2024-11-11 22:52:00,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:52:00,132 INFO L225 Difference]: With dead ends: 19594 [2024-11-11 22:52:00,132 INFO L226 Difference]: Without dead ends: 13416 [2024-11-11 22:52:00,154 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 22:52:00,154 INFO L435 NwaCegarLoop]: 1665 mSDtfsCounter, 1517 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1517 SdHoareTripleChecker+Valid, 1790 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 22:52:00,154 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1517 Valid, 1790 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 22:52:00,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13416 states. [2024-11-11 22:52:00,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13416 to 13414. [2024-11-11 22:52:00,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13414 states, 13412 states have (on average 1.4916492693110648) internal successors, (20006), 13413 states have internal predecessors, (20006), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:52:00,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13414 states to 13414 states and 20006 transitions. [2024-11-11 22:52:00,831 INFO L78 Accepts]: Start accepts. Automaton has 13414 states and 20006 transitions. Word has length 94 [2024-11-11 22:52:00,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:52:00,831 INFO L471 AbstractCegarLoop]: Abstraction has 13414 states and 20006 transitions. [2024-11-11 22:52:00,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:52:00,832 INFO L276 IsEmpty]: Start isEmpty. Operand 13414 states and 20006 transitions. [2024-11-11 22:52:00,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-11 22:52:00,833 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:52:00,833 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:52:00,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-11 22:52:00,833 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:52:00,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:52:00,834 INFO L85 PathProgramCache]: Analyzing trace with hash 1703496475, now seen corresponding path program 1 times [2024-11-11 22:52:00,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:52:00,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219450086] [2024-11-11 22:52:00,834 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:52:00,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:52:00,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:52:00,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:52:00,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:52:00,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219450086] [2024-11-11 22:52:00,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219450086] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:52:00,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:52:00,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 22:52:00,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028019290] [2024-11-11 22:52:00,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:52:00,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 22:52:00,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:52:00,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 22:52:00,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 22:52:00,901 INFO L87 Difference]: Start difference. First operand 13414 states and 20006 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:52:01,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:52:01,157 INFO L93 Difference]: Finished difference Result 36074 states and 53160 transitions. [2024-11-11 22:52:01,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 22:52:01,157 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2024-11-11 22:52:01,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:52:01,201 INFO L225 Difference]: With dead ends: 36074 [2024-11-11 22:52:01,201 INFO L226 Difference]: Without dead ends: 24232 [2024-11-11 22:52:01,222 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 22:52:01,223 INFO L435 NwaCegarLoop]: 1679 mSDtfsCounter, 1523 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1523 SdHoareTripleChecker+Valid, 1792 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 22:52:01,223 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1523 Valid, 1792 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 22:52:01,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24232 states. [2024-11-11 22:52:01,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24232 to 24230. [2024-11-11 22:52:01,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24230 states, 24228 states have (on average 1.4623576027736502) internal successors, (35430), 24229 states have internal predecessors, (35430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:52:01,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24230 states to 24230 states and 35430 transitions. [2024-11-11 22:52:01,989 INFO L78 Accepts]: Start accepts. Automaton has 24230 states and 35430 transitions. Word has length 94 [2024-11-11 22:52:01,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:52:01,989 INFO L471 AbstractCegarLoop]: Abstraction has 24230 states and 35430 transitions. [2024-11-11 22:52:01,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:52:01,989 INFO L276 IsEmpty]: Start isEmpty. Operand 24230 states and 35430 transitions. [2024-11-11 22:52:01,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-11 22:52:01,990 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:52:01,991 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:52:01,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-11 22:52:01,991 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:52:01,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:52:01,992 INFO L85 PathProgramCache]: Analyzing trace with hash -1087415530, now seen corresponding path program 1 times [2024-11-11 22:52:01,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:52:01,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281510913] [2024-11-11 22:52:01,992 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:52:01,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:52:02,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:52:02,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:52:02,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:52:02,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281510913] [2024-11-11 22:52:02,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281510913] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:52:02,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:52:02,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 22:52:02,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145940540] [2024-11-11 22:52:02,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:52:02,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 22:52:02,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:52:02,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 22:52:02,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 22:52:02,081 INFO L87 Difference]: Start difference. First operand 24230 states and 35430 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:52:02,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:52:02,602 INFO L93 Difference]: Finished difference Result 47789 states and 69996 transitions. [2024-11-11 22:52:02,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 22:52:02,602 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 96 [2024-11-11 22:52:02,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:52:02,758 INFO L225 Difference]: With dead ends: 47789 [2024-11-11 22:52:02,758 INFO L226 Difference]: Without dead ends: 35242 [2024-11-11 22:52:02,771 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 22:52:02,772 INFO L435 NwaCegarLoop]: 1688 mSDtfsCounter, 1526 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1526 SdHoareTripleChecker+Valid, 1789 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 22:52:02,772 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1526 Valid, 1789 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 22:52:02,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35242 states. [2024-11-11 22:52:03,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35242 to 35240. [2024-11-11 22:52:03,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35240 states, 35238 states have (on average 1.4522958170157216) internal successors, (51176), 35239 states have internal predecessors, (51176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:52:03,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35240 states to 35240 states and 51176 transitions. [2024-11-11 22:52:03,493 INFO L78 Accepts]: Start accepts. Automaton has 35240 states and 51176 transitions. Word has length 96 [2024-11-11 22:52:03,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:52:03,493 INFO L471 AbstractCegarLoop]: Abstraction has 35240 states and 51176 transitions. [2024-11-11 22:52:03,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:52:03,494 INFO L276 IsEmpty]: Start isEmpty. Operand 35240 states and 51176 transitions. [2024-11-11 22:52:03,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-11 22:52:03,500 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:52:03,500 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:52:03,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-11 22:52:03,500 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:52:03,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:52:03,501 INFO L85 PathProgramCache]: Analyzing trace with hash 54573310, now seen corresponding path program 1 times [2024-11-11 22:52:03,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:52:03,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408534180] [2024-11-11 22:52:03,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:52:03,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:52:03,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:52:03,740 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-11 22:52:03,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:52:03,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408534180] [2024-11-11 22:52:03,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408534180] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:52:03,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:52:03,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-11 22:52:03,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944006090] [2024-11-11 22:52:03,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:52:03,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-11 22:52:03,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:52:03,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-11 22:52:03,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-11 22:52:03,742 INFO L87 Difference]: Start difference. First operand 35240 states and 51176 transitions. Second operand has 10 states, 10 states have (on average 11.6) internal successors, (116), 10 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:52:07,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:52:07,723 INFO L93 Difference]: Finished difference Result 311354 states and 449777 transitions. [2024-11-11 22:52:07,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-11 22:52:07,724 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.6) internal successors, (116), 10 states have internal predecessors, (116), 0 states have call successors, (0), 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 119 [2024-11-11 22:52:07,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:52:08,587 INFO L225 Difference]: With dead ends: 311354 [2024-11-11 22:52:08,588 INFO L226 Difference]: Without dead ends: 277688 [2024-11-11 22:52:08,683 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2024-11-11 22:52:08,683 INFO L435 NwaCegarLoop]: 1706 mSDtfsCounter, 11840 mSDsluCounter, 3267 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11840 SdHoareTripleChecker+Valid, 4973 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 22:52:08,684 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11840 Valid, 4973 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 22:52:08,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277688 states. [2024-11-11 22:52:12,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277688 to 68904. [2024-11-11 22:52:12,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68904 states, 68902 states have (on average 1.4430930887347246) internal successors, (99432), 68903 states have internal predecessors, (99432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:52:12,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68904 states to 68904 states and 99432 transitions. [2024-11-11 22:52:12,513 INFO L78 Accepts]: Start accepts. Automaton has 68904 states and 99432 transitions. Word has length 119 [2024-11-11 22:52:12,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:52:12,513 INFO L471 AbstractCegarLoop]: Abstraction has 68904 states and 99432 transitions. [2024-11-11 22:52:12,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.6) internal successors, (116), 10 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:52:12,513 INFO L276 IsEmpty]: Start isEmpty. Operand 68904 states and 99432 transitions. [2024-11-11 22:52:12,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-11 22:52:12,520 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:52:12,520 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:52:12,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-11 22:52:12,520 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:52:12,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:52:12,521 INFO L85 PathProgramCache]: Analyzing trace with hash 1996642814, now seen corresponding path program 1 times [2024-11-11 22:52:12,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:52:12,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402476556] [2024-11-11 22:52:12,521 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:52:12,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:52:12,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:52:12,741 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-11 22:52:12,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:52:12,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402476556] [2024-11-11 22:52:12,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402476556] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:52:12,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:52:12,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-11 22:52:12,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052583030] [2024-11-11 22:52:12,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:52:12,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-11 22:52:12,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:52:12,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-11 22:52:12,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-11 22:52:12,743 INFO L87 Difference]: Start difference. First operand 68904 states and 99432 transitions. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:52:17,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:52:17,974 INFO L93 Difference]: Finished difference Result 345018 states and 498033 transitions. [2024-11-11 22:52:17,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-11 22:52:17,975 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 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 119 [2024-11-11 22:52:17,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:52:18,787 INFO L225 Difference]: With dead ends: 345018 [2024-11-11 22:52:18,788 INFO L226 Difference]: Without dead ends: 311352 [2024-11-11 22:52:18,840 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2024-11-11 22:52:18,841 INFO L435 NwaCegarLoop]: 1703 mSDtfsCounter, 11882 mSDsluCounter, 3136 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11882 SdHoareTripleChecker+Valid, 4839 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-11 22:52:18,841 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11882 Valid, 4839 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-11 22:52:18,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311352 states. [2024-11-11 22:52:23,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311352 to 119464. [2024-11-11 22:52:24,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119464 states, 119462 states have (on average 1.4355694697895565) internal successors, (171496), 119463 states have internal predecessors, (171496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:52:24,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119464 states to 119464 states and 171496 transitions. [2024-11-11 22:52:24,267 INFO L78 Accepts]: Start accepts. Automaton has 119464 states and 171496 transitions. Word has length 119 [2024-11-11 22:52:24,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:52:24,267 INFO L471 AbstractCegarLoop]: Abstraction has 119464 states and 171496 transitions. [2024-11-11 22:52:24,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:52:24,268 INFO L276 IsEmpty]: Start isEmpty. Operand 119464 states and 171496 transitions. [2024-11-11 22:52:24,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-11 22:52:24,277 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:52:24,277 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:52:24,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-11 22:52:24,277 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:52:24,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:52:24,278 INFO L85 PathProgramCache]: Analyzing trace with hash -1871553538, now seen corresponding path program 1 times [2024-11-11 22:52:24,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:52:24,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859930189] [2024-11-11 22:52:24,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:52:24,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:52:24,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:52:24,474 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-11 22:52:24,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:52:24,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859930189] [2024-11-11 22:52:24,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859930189] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:52:24,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:52:24,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-11 22:52:24,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806765486] [2024-11-11 22:52:24,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:52:24,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-11 22:52:24,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:52:24,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-11 22:52:24,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-11 22:52:24,476 INFO L87 Difference]: Start difference. First operand 119464 states and 171496 transitions. Second operand has 10 states, 10 states have (on average 11.0) internal successors, (110), 10 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:52:31,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:52:31,677 INFO L93 Difference]: Finished difference Result 378682 states and 546289 transitions. [2024-11-11 22:52:31,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-11 22:52:31,678 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.0) internal successors, (110), 10 states have internal predecessors, (110), 0 states have call successors, (0), 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 119 [2024-11-11 22:52:31,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:52:32,309 INFO L225 Difference]: With dead ends: 378682 [2024-11-11 22:52:32,310 INFO L226 Difference]: Without dead ends: 345016 [2024-11-11 22:52:32,396 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2024-11-11 22:52:32,397 INFO L435 NwaCegarLoop]: 1700 mSDtfsCounter, 11959 mSDsluCounter, 3100 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11959 SdHoareTripleChecker+Valid, 4800 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 22:52:32,397 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11959 Valid, 4800 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 22:52:32,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345016 states. [2024-11-11 22:52:37,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345016 to 153128. [2024-11-11 22:52:38,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153128 states, 153126 states have (on average 1.4351057299217638) internal successors, (219752), 153127 states have internal predecessors, (219752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:52:38,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153128 states to 153128 states and 219752 transitions. [2024-11-11 22:52:38,540 INFO L78 Accepts]: Start accepts. Automaton has 153128 states and 219752 transitions. Word has length 119 [2024-11-11 22:52:38,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:52:38,540 INFO L471 AbstractCegarLoop]: Abstraction has 153128 states and 219752 transitions. [2024-11-11 22:52:38,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.0) internal successors, (110), 10 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:52:38,541 INFO L276 IsEmpty]: Start isEmpty. Operand 153128 states and 219752 transitions. [2024-11-11 22:52:38,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-11 22:52:38,558 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:52:38,558 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:52:38,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-11 22:52:38,558 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:52:38,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:52:38,558 INFO L85 PathProgramCache]: Analyzing trace with hash -633291522, now seen corresponding path program 1 times [2024-11-11 22:52:38,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:52:38,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348074250] [2024-11-11 22:52:38,559 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:52:38,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:52:38,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:52:38,931 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-11 22:52:38,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:52:38,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348074250] [2024-11-11 22:52:38,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348074250] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:52:38,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:52:38,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-11 22:52:38,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094655021] [2024-11-11 22:52:38,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:52:38,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-11 22:52:38,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:52:38,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-11 22:52:38,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-11 22:52:38,937 INFO L87 Difference]: Start difference. First operand 153128 states and 219752 transitions. Second operand has 10 states, 10 states have (on average 10.8) internal successors, (108), 10 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)