./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.8.ufo.UNBOUNDED.pals+Problem12_label08.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.8.ufo.UNBOUNDED.pals+Problem12_label08.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 219fae8b2e03d20bcb768458013f321b0dd264dfdc5412ade22b395f9d4baa67 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 05:07:58,319 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 05:07:58,416 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 05:07:58,422 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 05:07:58,423 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 05:07:58,468 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 05:07:58,469 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 05:07:58,469 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 05:07:58,470 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 05:07:58,470 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 05:07:58,470 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 05:07:58,471 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 05:07:58,472 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 05:07:58,472 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 05:07:58,474 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 05:07:58,474 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 05:07:58,474 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 05:07:58,474 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 05:07:58,475 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 05:07:58,475 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 05:07:58,475 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 05:07:58,475 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 05:07:58,476 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 05:07:58,476 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 05:07:58,476 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 05:07:58,476 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 05:07:58,476 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 05:07:58,476 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 05:07:58,477 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 05:07:58,477 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 05:07:58,477 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 05:07:58,477 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 05:07:58,477 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 05:07:58,478 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 05:07:58,478 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 05:07:58,478 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 05:07:58,478 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 05:07:58,478 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 05:07:58,478 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 05:07:58,479 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 05:07:58,479 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 05:07:58,482 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 05:07:58,483 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 -> 219fae8b2e03d20bcb768458013f321b0dd264dfdc5412ade22b395f9d4baa67 [2024-10-14 05:07:58,693 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 05:07:58,725 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 05:07:58,731 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 05:07:58,732 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 05:07:58,736 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 05:07:58,737 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.8.ufo.UNBOUNDED.pals+Problem12_label08.c [2024-10-14 05:08:00,271 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 05:08:00,654 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 05:08:00,656 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.8.ufo.UNBOUNDED.pals+Problem12_label08.c [2024-10-14 05:08:00,688 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/baf84e54e/00ba739ef62241d99ee0b025270b563e/FLAGab8b4117d [2024-10-14 05:08:00,710 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/baf84e54e/00ba739ef62241d99ee0b025270b563e [2024-10-14 05:08:00,713 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 05:08:00,716 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 05:08:00,723 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 05:08:00,723 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 05:08:00,729 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 05:08:00,730 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 05:08:00" (1/1) ... [2024-10-14 05:08:00,730 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3627ef59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:08:00, skipping insertion in model container [2024-10-14 05:08:00,731 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 05:08:00" (1/1) ... [2024-10-14 05:08:00,921 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 05:08:01,679 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.8.ufo.UNBOUNDED.pals+Problem12_label08.c[26888,26901] [2024-10-14 05:08:01,731 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.8.ufo.UNBOUNDED.pals+Problem12_label08.c[30395,30408] [2024-10-14 05:08:02,285 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 05:08:02,300 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 05:08:02,339 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.8.ufo.UNBOUNDED.pals+Problem12_label08.c[26888,26901] [2024-10-14 05:08:02,346 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.8.ufo.UNBOUNDED.pals+Problem12_label08.c[30395,30408] [2024-10-14 05:08:02,680 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 05:08:02,710 INFO L204 MainTranslator]: Completed translation [2024-10-14 05:08:02,711 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:08:02 WrapperNode [2024-10-14 05:08:02,711 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 05:08:02,712 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 05:08:02,712 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 05:08:02,712 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 05:08:02,718 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:08:02" (1/1) ... [2024-10-14 05:08:02,766 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:08:02" (1/1) ... [2024-10-14 05:08:03,082 INFO L138 Inliner]: procedures = 40, calls = 25, calls flagged for inlining = 20, calls inlined = 20, statements flattened = 5291 [2024-10-14 05:08:03,083 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 05:08:03,083 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 05:08:03,083 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 05:08:03,084 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 05:08:03,092 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:08:02" (1/1) ... [2024-10-14 05:08:03,093 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:08:02" (1/1) ... [2024-10-14 05:08:03,124 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:08:02" (1/1) ... [2024-10-14 05:08:03,355 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-14 05:08:03,356 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:08:02" (1/1) ... [2024-10-14 05:08:03,356 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:08:02" (1/1) ... [2024-10-14 05:08:03,486 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:08:02" (1/1) ... [2024-10-14 05:08:03,513 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:08:02" (1/1) ... [2024-10-14 05:08:03,554 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:08:02" (1/1) ... [2024-10-14 05:08:03,570 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:08:02" (1/1) ... [2024-10-14 05:08:03,626 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 05:08:03,627 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 05:08:03,627 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 05:08:03,627 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 05:08:03,628 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:08:02" (1/1) ... [2024-10-14 05:08:03,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 05:08:03,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 05:08:03,658 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-10-14 05:08:03,660 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-10-14 05:08:03,697 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 05:08:03,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 05:08:03,698 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 05:08:03,698 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 05:08:03,849 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 05:08:03,851 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 05:08:07,694 INFO L? ?]: Removed 759 outVars from TransFormulas that were not future-live. [2024-10-14 05:08:07,694 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 05:08:07,756 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 05:08:07,756 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-14 05:08:07,757 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 05:08:07 BoogieIcfgContainer [2024-10-14 05:08:07,757 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 05:08:07,758 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 05:08:07,759 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 05:08:07,761 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 05:08:07,761 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 05:08:00" (1/3) ... [2024-10-14 05:08:07,763 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@761e4d88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 05:08:07, skipping insertion in model container [2024-10-14 05:08:07,763 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:08:02" (2/3) ... [2024-10-14 05:08:07,763 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@761e4d88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 05:08:07, skipping insertion in model container [2024-10-14 05:08:07,764 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 05:08:07" (3/3) ... [2024-10-14 05:08:07,765 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.8.ufo.UNBOUNDED.pals+Problem12_label08.c [2024-10-14 05:08:07,782 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 05:08:07,782 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-14 05:08:07,865 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 05:08:07,870 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;@3c0838f0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 05:08:07,871 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-14 05:08:07,878 INFO L276 IsEmpty]: Start isEmpty. Operand has 884 states, 881 states have (on average 1.9693530079455164) internal successors, (1735), 883 states have internal predecessors, (1735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:08:07,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-14 05:08:07,884 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:08:07,885 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:08:07,885 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:08:07,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:08:07,889 INFO L85 PathProgramCache]: Analyzing trace with hash 1948996339, now seen corresponding path program 1 times [2024-10-14 05:08:07,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:08:07,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605179576] [2024-10-14 05:08:07,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:08:07,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:08:08,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:08:08,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 05:08:08,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:08:08,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605179576] [2024-10-14 05:08:08,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605179576] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:08:08,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:08:08,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 05:08:08,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975751373] [2024-10-14 05:08:08,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:08:08,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 05:08:08,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:08:08,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 05:08:08,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 05:08:08,170 INFO L87 Difference]: Start difference. First operand has 884 states, 881 states have (on average 1.9693530079455164) internal successors, (1735), 883 states have internal predecessors, (1735), 0 states have call successors, (0), 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 13.5) internal successors, (27), 2 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:08:08,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:08:08,243 INFO L93 Difference]: Finished difference Result 1702 states and 3341 transitions. [2024-10-14 05:08:08,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 05:08:08,249 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 0 states have call successors, (0), 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 27 [2024-10-14 05:08:08,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:08:08,277 INFO L225 Difference]: With dead ends: 1702 [2024-10-14 05:08:08,278 INFO L226 Difference]: Without dead ends: 880 [2024-10-14 05:08:08,287 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 05:08:08,294 INFO L432 NwaCegarLoop]: 1663 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1663 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 05:08:08,295 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1663 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 05:08:08,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 880 states. [2024-10-14 05:08:08,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 880 to 880. [2024-10-14 05:08:08,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 880 states, 878 states have (on average 1.8952164009111618) internal successors, (1664), 879 states have internal predecessors, (1664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:08:08,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 880 states to 880 states and 1664 transitions. [2024-10-14 05:08:08,394 INFO L78 Accepts]: Start accepts. Automaton has 880 states and 1664 transitions. Word has length 27 [2024-10-14 05:08:08,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:08:08,395 INFO L471 AbstractCegarLoop]: Abstraction has 880 states and 1664 transitions. [2024-10-14 05:08:08,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:08:08,396 INFO L276 IsEmpty]: Start isEmpty. Operand 880 states and 1664 transitions. [2024-10-14 05:08:08,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-14 05:08:08,398 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:08:08,398 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:08:08,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 05:08:08,399 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:08:08,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:08:08,400 INFO L85 PathProgramCache]: Analyzing trace with hash 143558005, now seen corresponding path program 1 times [2024-10-14 05:08:08,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:08:08,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332166180] [2024-10-14 05:08:08,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:08:08,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:08:08,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:08:08,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 05:08:08,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:08:08,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332166180] [2024-10-14 05:08:08,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332166180] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:08:08,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:08:08,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 05:08:08,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842215183] [2024-10-14 05:08:08,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:08:08,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 05:08:08,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:08:08,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 05:08:08,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 05:08:08,639 INFO L87 Difference]: Start difference. First operand 880 states and 1664 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:08:08,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:08:08,734 INFO L93 Difference]: Finished difference Result 944 states and 1766 transitions. [2024-10-14 05:08:08,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 05:08:08,735 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 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 27 [2024-10-14 05:08:08,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:08:08,739 INFO L225 Difference]: With dead ends: 944 [2024-10-14 05:08:08,739 INFO L226 Difference]: Without dead ends: 880 [2024-10-14 05:08:08,740 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 05:08:08,741 INFO L432 NwaCegarLoop]: 1661 mSDtfsCounter, 0 mSDsluCounter, 3257 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4918 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-10-14 05:08:08,741 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4918 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 05:08:08,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 880 states. [2024-10-14 05:08:08,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 880 to 880. [2024-10-14 05:08:08,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 880 states, 878 states have (on average 1.825740318906606) internal successors, (1603), 879 states have internal predecessors, (1603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:08:08,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 880 states to 880 states and 1603 transitions. [2024-10-14 05:08:08,757 INFO L78 Accepts]: Start accepts. Automaton has 880 states and 1603 transitions. Word has length 27 [2024-10-14 05:08:08,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:08:08,758 INFO L471 AbstractCegarLoop]: Abstraction has 880 states and 1603 transitions. [2024-10-14 05:08:08,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:08:08,758 INFO L276 IsEmpty]: Start isEmpty. Operand 880 states and 1603 transitions. [2024-10-14 05:08:08,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-14 05:08:08,759 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:08:08,759 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:08:08,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 05:08:08,760 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:08:08,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:08:08,760 INFO L85 PathProgramCache]: Analyzing trace with hash 926066756, now seen corresponding path program 1 times [2024-10-14 05:08:08,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:08:08,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498305572] [2024-10-14 05:08:08,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:08:08,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:08:08,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:08:08,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 05:08:08,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:08:08,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498305572] [2024-10-14 05:08:08,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498305572] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:08:08,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:08:08,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 05:08:08,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382103342] [2024-10-14 05:08:08,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:08:08,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 05:08:08,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:08:08,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 05:08:08,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 05:08:08,852 INFO L87 Difference]: Start difference. First operand 880 states and 1603 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 2 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:08:11,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:08:11,916 INFO L93 Difference]: Finished difference Result 2384 states and 4476 transitions. [2024-10-14 05:08:11,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 05:08:11,916 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 2 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2024-10-14 05:08:11,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:08:11,923 INFO L225 Difference]: With dead ends: 2384 [2024-10-14 05:08:11,923 INFO L226 Difference]: Without dead ends: 1631 [2024-10-14 05:08:11,925 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 05:08:11,927 INFO L432 NwaCegarLoop]: 240 mSDtfsCounter, 928 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2443 mSolverCounterSat, 704 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 928 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 3147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 704 IncrementalHoareTripleChecker+Valid, 2443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-10-14 05:08:11,928 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [928 Valid, 247 Invalid, 3147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [704 Valid, 2443 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-10-14 05:08:11,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1631 states. [2024-10-14 05:08:11,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1631 to 1631. [2024-10-14 05:08:11,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1631 states, 1629 states have (on average 1.8244321669736034) internal successors, (2972), 1630 states have internal predecessors, (2972), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:08:11,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1631 states to 1631 states and 2972 transitions. [2024-10-14 05:08:11,966 INFO L78 Accepts]: Start accepts. Automaton has 1631 states and 2972 transitions. Word has length 29 [2024-10-14 05:08:11,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:08:11,966 INFO L471 AbstractCegarLoop]: Abstraction has 1631 states and 2972 transitions. [2024-10-14 05:08:11,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 2 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:08:11,967 INFO L276 IsEmpty]: Start isEmpty. Operand 1631 states and 2972 transitions. [2024-10-14 05:08:11,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-10-14 05:08:11,969 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:08:11,969 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:08:11,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 05:08:11,969 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:08:11,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:08:11,970 INFO L85 PathProgramCache]: Analyzing trace with hash -1723189211, now seen corresponding path program 1 times [2024-10-14 05:08:11,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:08:11,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711796281] [2024-10-14 05:08:11,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:08:11,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:08:12,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:08:12,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 05:08:12,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:08:12,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711796281] [2024-10-14 05:08:12,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711796281] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:08:12,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:08:12,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-14 05:08:12,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755924511] [2024-10-14 05:08:12,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:08:12,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-14 05:08:12,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:08:12,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-14 05:08:12,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-14 05:08:12,406 INFO L87 Difference]: Start difference. First operand 1631 states and 2972 transitions. Second operand has 10 states, 10 states have (on average 8.7) internal successors, (87), 10 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:08:12,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:08:12,895 INFO L93 Difference]: Finished difference Result 2607 states and 4556 transitions. [2024-10-14 05:08:12,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-14 05:08:12,896 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.7) internal successors, (87), 10 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 87 [2024-10-14 05:08:12,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:08:12,905 INFO L225 Difference]: With dead ends: 2607 [2024-10-14 05:08:12,906 INFO L226 Difference]: Without dead ends: 2546 [2024-10-14 05:08:12,908 INFO L431 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-10-14 05:08:12,909 INFO L432 NwaCegarLoop]: 1594 mSDtfsCounter, 13544 mSDsluCounter, 3889 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13544 SdHoareTripleChecker+Valid, 5483 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 05:08:12,910 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13544 Valid, 5483 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 05:08:12,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2546 states. [2024-10-14 05:08:12,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2546 to 1690. [2024-10-14 05:08:12,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1690 states, 1688 states have (on average 1.8175355450236967) internal successors, (3068), 1689 states have internal predecessors, (3068), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:08:12,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1690 states to 1690 states and 3068 transitions. [2024-10-14 05:08:12,946 INFO L78 Accepts]: Start accepts. Automaton has 1690 states and 3068 transitions. Word has length 87 [2024-10-14 05:08:12,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:08:12,947 INFO L471 AbstractCegarLoop]: Abstraction has 1690 states and 3068 transitions. [2024-10-14 05:08:12,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.7) internal successors, (87), 10 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:08:12,948 INFO L276 IsEmpty]: Start isEmpty. Operand 1690 states and 3068 transitions. [2024-10-14 05:08:12,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-10-14 05:08:12,950 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:08:12,950 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:08:12,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 05:08:12,951 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:08:12,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:08:12,951 INFO L85 PathProgramCache]: Analyzing trace with hash 1732338517, now seen corresponding path program 1 times [2024-10-14 05:08:12,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:08:12,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601838784] [2024-10-14 05:08:12,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:08:12,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:08:12,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:08:13,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 05:08:13,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:08:13,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601838784] [2024-10-14 05:08:13,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601838784] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:08:13,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:08:13,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 05:08:13,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125087337] [2024-10-14 05:08:13,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:08:13,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 05:08:13,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:08:13,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 05:08:13,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 05:08:13,108 INFO L87 Difference]: Start difference. First operand 1690 states and 3068 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:08:13,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:08:13,147 INFO L93 Difference]: Finished difference Result 1919 states and 3439 transitions. [2024-10-14 05:08:13,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 05:08:13,147 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 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 89 [2024-10-14 05:08:13,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:08:13,153 INFO L225 Difference]: With dead ends: 1919 [2024-10-14 05:08:13,153 INFO L226 Difference]: Without dead ends: 1799 [2024-10-14 05:08:13,154 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 05:08:13,155 INFO L432 NwaCegarLoop]: 1596 mSDtfsCounter, 1506 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1506 SdHoareTripleChecker+Valid, 1687 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 05:08:13,155 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1506 Valid, 1687 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 05:08:13,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1799 states. [2024-10-14 05:08:13,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1799 to 1795. [2024-10-14 05:08:13,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1795 states, 1793 states have (on average 1.8047964305633017) internal successors, (3236), 1794 states have internal predecessors, (3236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:08:13,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1795 states to 1795 states and 3236 transitions. [2024-10-14 05:08:13,187 INFO L78 Accepts]: Start accepts. Automaton has 1795 states and 3236 transitions. Word has length 89 [2024-10-14 05:08:13,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:08:13,188 INFO L471 AbstractCegarLoop]: Abstraction has 1795 states and 3236 transitions. [2024-10-14 05:08:13,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:08:13,188 INFO L276 IsEmpty]: Start isEmpty. Operand 1795 states and 3236 transitions. [2024-10-14 05:08:13,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-10-14 05:08:13,190 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:08:13,190 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:08:13,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 05:08:13,190 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:08:13,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:08:13,190 INFO L85 PathProgramCache]: Analyzing trace with hash 1734483469, now seen corresponding path program 1 times [2024-10-14 05:08:13,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:08:13,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687632882] [2024-10-14 05:08:13,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:08:13,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:08:13,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:08:13,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 05:08:13,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:08:13,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687632882] [2024-10-14 05:08:13,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687632882] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:08:13,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:08:13,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-14 05:08:13,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382798713] [2024-10-14 05:08:13,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:08:13,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-14 05:08:13,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:08:13,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-14 05:08:13,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-10-14 05:08:13,659 INFO L87 Difference]: Start difference. First operand 1795 states and 3236 transitions. Second operand has 10 states, 10 states have (on average 8.9) internal successors, (89), 10 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:08:14,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:08:14,097 INFO L93 Difference]: Finished difference Result 2022 states and 3600 transitions. [2024-10-14 05:08:14,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 05:08:14,098 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.9) internal successors, (89), 10 states have internal predecessors, (89), 0 states have call successors, (0), 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 89 [2024-10-14 05:08:14,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:08:14,104 INFO L225 Difference]: With dead ends: 2022 [2024-10-14 05:08:14,104 INFO L226 Difference]: Without dead ends: 1797 [2024-10-14 05:08:14,105 INFO L431 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-10-14 05:08:14,105 INFO L432 NwaCegarLoop]: 1590 mSDtfsCounter, 6112 mSDsluCounter, 668 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6112 SdHoareTripleChecker+Valid, 2258 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 05:08:14,106 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6112 Valid, 2258 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 05:08:14,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1797 states. [2024-10-14 05:08:14,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1797 to 1795. [2024-10-14 05:08:14,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1795 states, 1793 states have (on average 1.803680981595092) internal successors, (3234), 1794 states have internal predecessors, (3234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:08:14,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1795 states to 1795 states and 3234 transitions. [2024-10-14 05:08:14,140 INFO L78 Accepts]: Start accepts. Automaton has 1795 states and 3234 transitions. Word has length 89 [2024-10-14 05:08:14,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:08:14,140 INFO L471 AbstractCegarLoop]: Abstraction has 1795 states and 3234 transitions. [2024-10-14 05:08:14,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.9) internal successors, (89), 10 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:08:14,141 INFO L276 IsEmpty]: Start isEmpty. Operand 1795 states and 3234 transitions. [2024-10-14 05:08:14,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-10-14 05:08:14,142 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:08:14,142 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:08:14,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 05:08:14,142 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:08:14,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:08:14,143 INFO L85 PathProgramCache]: Analyzing trace with hash 2100477793, now seen corresponding path program 1 times [2024-10-14 05:08:14,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:08:14,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645100939] [2024-10-14 05:08:14,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:08:14,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:08:14,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:08:14,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 05:08:14,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:08:14,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645100939] [2024-10-14 05:08:14,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645100939] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:08:14,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:08:14,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 05:08:14,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899126711] [2024-10-14 05:08:14,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:08:14,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 05:08:14,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:08:14,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 05:08:14,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 05:08:14,326 INFO L87 Difference]: Start difference. First operand 1795 states and 3234 transitions. Second operand has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 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-10-14 05:08:14,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:08:14,376 INFO L93 Difference]: Finished difference Result 1801 states and 3241 transitions. [2024-10-14 05:08:14,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 05:08:14,377 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 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-10-14 05:08:14,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:08:14,381 INFO L225 Difference]: With dead ends: 1801 [2024-10-14 05:08:14,382 INFO L226 Difference]: Without dead ends: 1799 [2024-10-14 05:08:14,382 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 05:08:14,383 INFO L432 NwaCegarLoop]: 1599 mSDtfsCounter, 0 mSDsluCounter, 3190 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4789 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 05:08:14,383 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4789 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 05:08:14,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1799 states. [2024-10-14 05:08:14,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1799 to 1799. [2024-10-14 05:08:14,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1799 states, 1797 states have (on average 1.8013355592654423) internal successors, (3237), 1798 states have internal predecessors, (3237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:08:14,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1799 states to 1799 states and 3237 transitions. [2024-10-14 05:08:14,412 INFO L78 Accepts]: Start accepts. Automaton has 1799 states and 3237 transitions. Word has length 90 [2024-10-14 05:08:14,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:08:14,413 INFO L471 AbstractCegarLoop]: Abstraction has 1799 states and 3237 transitions. [2024-10-14 05:08:14,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 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-10-14 05:08:14,413 INFO L276 IsEmpty]: Start isEmpty. Operand 1799 states and 3237 transitions. [2024-10-14 05:08:14,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-14 05:08:14,414 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:08:14,414 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:08:14,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 05:08:14,415 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:08:14,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:08:14,415 INFO L85 PathProgramCache]: Analyzing trace with hash -728003923, now seen corresponding path program 1 times [2024-10-14 05:08:14,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:08:14,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500772959] [2024-10-14 05:08:14,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:08:14,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:08:14,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:08:14,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 05:08:14,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:08:14,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500772959] [2024-10-14 05:08:14,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500772959] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:08:14,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:08:14,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 05:08:14,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985002304] [2024-10-14 05:08:14,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:08:14,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 05:08:14,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:08:14,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 05:08:14,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 05:08:14,488 INFO L87 Difference]: Start difference. First operand 1799 states and 3237 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:08:14,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:08:14,527 INFO L93 Difference]: Finished difference Result 2241 states and 3937 transitions. [2024-10-14 05:08:14,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 05:08:14,527 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 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 91 [2024-10-14 05:08:14,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:08:14,533 INFO L225 Difference]: With dead ends: 2241 [2024-10-14 05:08:14,533 INFO L226 Difference]: Without dead ends: 2012 [2024-10-14 05:08:14,534 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 05:08:14,535 INFO L432 NwaCegarLoop]: 1675 mSDtfsCounter, 1525 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1525 SdHoareTripleChecker+Valid, 1778 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 05:08:14,535 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1525 Valid, 1778 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 05:08:14,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2012 states. [2024-10-14 05:08:14,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2012 to 2010. [2024-10-14 05:08:14,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2010 states, 2008 states have (on average 1.7768924302788844) internal successors, (3568), 2009 states have internal predecessors, (3568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:08:14,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2010 states to 2010 states and 3568 transitions. [2024-10-14 05:08:14,571 INFO L78 Accepts]: Start accepts. Automaton has 2010 states and 3568 transitions. Word has length 91 [2024-10-14 05:08:14,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:08:14,572 INFO L471 AbstractCegarLoop]: Abstraction has 2010 states and 3568 transitions. [2024-10-14 05:08:14,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:08:14,572 INFO L276 IsEmpty]: Start isEmpty. Operand 2010 states and 3568 transitions. [2024-10-14 05:08:14,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-14 05:08:14,573 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:08:14,573 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:08:14,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 05:08:14,573 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:08:14,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:08:14,574 INFO L85 PathProgramCache]: Analyzing trace with hash 27380141, now seen corresponding path program 1 times [2024-10-14 05:08:14,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:08:14,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388143828] [2024-10-14 05:08:14,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:08:14,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:08:14,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:08:14,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 05:08:14,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:08:14,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388143828] [2024-10-14 05:08:14,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388143828] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:08:14,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:08:14,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 05:08:14,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079333305] [2024-10-14 05:08:14,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:08:14,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 05:08:14,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:08:14,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 05:08:14,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 05:08:14,643 INFO L87 Difference]: Start difference. First operand 2010 states and 3568 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:08:14,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:08:14,695 INFO L93 Difference]: Finished difference Result 2858 states and 4902 transitions. [2024-10-14 05:08:14,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 05:08:14,696 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 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 91 [2024-10-14 05:08:14,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:08:14,703 INFO L225 Difference]: With dead ends: 2858 [2024-10-14 05:08:14,703 INFO L226 Difference]: Without dead ends: 2418 [2024-10-14 05:08:14,705 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 05:08:14,705 INFO L432 NwaCegarLoop]: 1673 mSDtfsCounter, 1523 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1523 SdHoareTripleChecker+Valid, 1780 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 05:08:14,708 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1523 Valid, 1780 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 05:08:14,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2418 states. [2024-10-14 05:08:14,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2418 to 2416. [2024-10-14 05:08:14,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2416 states, 2414 states have (on average 1.7390223695111848) internal successors, (4198), 2415 states have internal predecessors, (4198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:08:14,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2416 states to 2416 states and 4198 transitions. [2024-10-14 05:08:14,752 INFO L78 Accepts]: Start accepts. Automaton has 2416 states and 4198 transitions. Word has length 91 [2024-10-14 05:08:14,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:08:14,752 INFO L471 AbstractCegarLoop]: Abstraction has 2416 states and 4198 transitions. [2024-10-14 05:08:14,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:08:14,752 INFO L276 IsEmpty]: Start isEmpty. Operand 2416 states and 4198 transitions. [2024-10-14 05:08:14,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-14 05:08:14,753 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:08:14,753 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:08:14,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 05:08:14,753 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:08:14,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:08:14,754 INFO L85 PathProgramCache]: Analyzing trace with hash -651589715, now seen corresponding path program 1 times [2024-10-14 05:08:14,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:08:14,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679310902] [2024-10-14 05:08:14,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:08:14,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:08:14,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:08:14,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 05:08:14,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:08:14,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679310902] [2024-10-14 05:08:14,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679310902] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:08:14,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:08:14,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 05:08:14,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163255334] [2024-10-14 05:08:14,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:08:14,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 05:08:14,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:08:14,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 05:08:14,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 05:08:14,824 INFO L87 Difference]: Start difference. First operand 2416 states and 4198 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:08:14,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:08:14,883 INFO L93 Difference]: Finished difference Result 4044 states and 6736 transitions. [2024-10-14 05:08:14,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 05:08:14,883 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 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 91 [2024-10-14 05:08:14,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:08:14,893 INFO L225 Difference]: With dead ends: 4044 [2024-10-14 05:08:14,893 INFO L226 Difference]: Without dead ends: 3198 [2024-10-14 05:08:14,894 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 05:08:14,895 INFO L432 NwaCegarLoop]: 1661 mSDtfsCounter, 1519 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1519 SdHoareTripleChecker+Valid, 1776 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 05:08:14,895 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1519 Valid, 1776 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 05:08:14,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3198 states. [2024-10-14 05:08:14,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3198 to 3196. [2024-10-14 05:08:14,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3196 states, 3194 states have (on average 1.688791484032561) internal successors, (5394), 3195 states have internal predecessors, (5394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:08:14,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3196 states to 3196 states and 5394 transitions. [2024-10-14 05:08:14,950 INFO L78 Accepts]: Start accepts. Automaton has 3196 states and 5394 transitions. Word has length 91 [2024-10-14 05:08:14,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:08:14,950 INFO L471 AbstractCegarLoop]: Abstraction has 3196 states and 5394 transitions. [2024-10-14 05:08:14,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:08:14,951 INFO L276 IsEmpty]: Start isEmpty. Operand 3196 states and 5394 transitions. [2024-10-14 05:08:14,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-14 05:08:14,951 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:08:14,952 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:08:14,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-14 05:08:14,952 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:08:14,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:08:14,952 INFO L85 PathProgramCache]: Analyzing trace with hash -611645779, now seen corresponding path program 1 times [2024-10-14 05:08:14,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:08:14,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742647367] [2024-10-14 05:08:14,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:08:14,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:08:14,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:08:15,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 05:08:15,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:08:15,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742647367] [2024-10-14 05:08:15,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742647367] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:08:15,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:08:15,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 05:08:15,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303394190] [2024-10-14 05:08:15,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:08:15,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 05:08:15,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:08:15,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 05:08:15,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 05:08:15,015 INFO L87 Difference]: Start difference. First operand 3196 states and 5394 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:08:15,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:08:15,090 INFO L93 Difference]: Finished difference Result 6320 states and 10212 transitions. [2024-10-14 05:08:15,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 05:08:15,090 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 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 91 [2024-10-14 05:08:15,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:08:15,107 INFO L225 Difference]: With dead ends: 6320 [2024-10-14 05:08:15,107 INFO L226 Difference]: Without dead ends: 4694 [2024-10-14 05:08:15,112 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 05:08:15,119 INFO L432 NwaCegarLoop]: 1659 mSDtfsCounter, 1517 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1517 SdHoareTripleChecker+Valid, 1778 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 05:08:15,120 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1517 Valid, 1778 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 05:08:15,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4694 states. [2024-10-14 05:08:15,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4694 to 4692. [2024-10-14 05:08:15,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4692 states, 4690 states have (on average 1.6328358208955225) internal successors, (7658), 4691 states have internal predecessors, (7658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:08:15,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4692 states to 4692 states and 7658 transitions. [2024-10-14 05:08:15,427 INFO L78 Accepts]: Start accepts. Automaton has 4692 states and 7658 transitions. Word has length 91 [2024-10-14 05:08:15,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:08:15,428 INFO L471 AbstractCegarLoop]: Abstraction has 4692 states and 7658 transitions. [2024-10-14 05:08:15,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:08:15,428 INFO L276 IsEmpty]: Start isEmpty. Operand 4692 states and 7658 transitions. [2024-10-14 05:08:15,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-14 05:08:15,432 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:08:15,432 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:08:15,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-14 05:08:15,433 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:08:15,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:08:15,433 INFO L85 PathProgramCache]: Analyzing trace with hash -348568403, now seen corresponding path program 1 times [2024-10-14 05:08:15,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:08:15,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617526150] [2024-10-14 05:08:15,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:08:15,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:08:15,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:08:15,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-10-14 05:08:15,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:08:15,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617526150] [2024-10-14 05:08:15,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617526150] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:08:15,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:08:15,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 05:08:15,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119501239] [2024-10-14 05:08:15,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:08:15,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 05:08:15,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:08:15,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 05:08:15,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 05:08:15,494 INFO L87 Difference]: Start difference. First operand 4692 states and 7658 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:08:15,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:08:15,611 INFO L93 Difference]: Finished difference Result 10680 states and 16780 transitions. [2024-10-14 05:08:15,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 05:08:15,611 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 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 91 [2024-10-14 05:08:15,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:08:15,628 INFO L225 Difference]: With dead ends: 10680 [2024-10-14 05:08:15,628 INFO L226 Difference]: Without dead ends: 7558 [2024-10-14 05:08:15,633 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 05:08:15,634 INFO L432 NwaCegarLoop]: 1647 mSDtfsCounter, 1513 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1513 SdHoareTripleChecker+Valid, 1774 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 05:08:15,634 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1513 Valid, 1774 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 05:08:15,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7558 states. [2024-10-14 05:08:15,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7558 to 7556. [2024-10-14 05:08:15,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7556 states, 7554 states have (on average 1.5792957373576912) internal successors, (11930), 7555 states have internal predecessors, (11930), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:08:15,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7556 states to 7556 states and 11930 transitions. [2024-10-14 05:08:15,803 INFO L78 Accepts]: Start accepts. Automaton has 7556 states and 11930 transitions. Word has length 91 [2024-10-14 05:08:15,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:08:15,803 INFO L471 AbstractCegarLoop]: Abstraction has 7556 states and 11930 transitions. [2024-10-14 05:08:15,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:08:15,804 INFO L276 IsEmpty]: Start isEmpty. Operand 7556 states and 11930 transitions. [2024-10-14 05:08:15,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-14 05:08:15,804 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:08:15,804 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:08:15,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-14 05:08:15,805 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:08:15,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:08:15,805 INFO L85 PathProgramCache]: Analyzing trace with hash -1237301843, now seen corresponding path program 1 times [2024-10-14 05:08:15,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:08:15,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914748739] [2024-10-14 05:08:15,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:08:15,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:08:15,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:08:15,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 05:08:15,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:08:15,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914748739] [2024-10-14 05:08:15,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914748739] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:08:15,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:08:15,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 05:08:15,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924948469] [2024-10-14 05:08:15,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:08:15,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 05:08:15,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:08:15,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 05:08:15,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 05:08:15,900 INFO L87 Difference]: Start difference. First operand 7556 states and 11930 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:08:16,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:08:16,059 INFO L93 Difference]: Finished difference Result 19016 states and 29148 transitions. [2024-10-14 05:08:16,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 05:08:16,059 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 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 91 [2024-10-14 05:08:16,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:08:16,081 INFO L225 Difference]: With dead ends: 19016 [2024-10-14 05:08:16,081 INFO L226 Difference]: Without dead ends: 13030 [2024-10-14 05:08:16,091 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 05:08:16,092 INFO L432 NwaCegarLoop]: 1657 mSDtfsCounter, 1515 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1515 SdHoareTripleChecker+Valid, 1780 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 05:08:16,093 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1515 Valid, 1780 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 05:08:16,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13030 states. [2024-10-14 05:08:16,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13030 to 13028. [2024-10-14 05:08:16,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13028 states, 13026 states have (on average 1.5324735145094426) internal successors, (19962), 13027 states have internal predecessors, (19962), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:08:16,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13028 states to 13028 states and 19962 transitions. [2024-10-14 05:08:16,372 INFO L78 Accepts]: Start accepts. Automaton has 13028 states and 19962 transitions. Word has length 91 [2024-10-14 05:08:16,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:08:16,372 INFO L471 AbstractCegarLoop]: Abstraction has 13028 states and 19962 transitions. [2024-10-14 05:08:16,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:08:16,373 INFO L276 IsEmpty]: Start isEmpty. Operand 13028 states and 19962 transitions. [2024-10-14 05:08:16,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-14 05:08:16,374 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:08:16,374 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:08:16,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-14 05:08:16,374 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:08:16,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:08:16,375 INFO L85 PathProgramCache]: Analyzing trace with hash -383006547, now seen corresponding path program 1 times [2024-10-14 05:08:16,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:08:16,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75479357] [2024-10-14 05:08:16,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:08:16,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:08:16,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:08:16,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 05:08:16,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:08:16,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75479357] [2024-10-14 05:08:16,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75479357] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:08:16,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:08:16,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 05:08:16,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835958671] [2024-10-14 05:08:16,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:08:16,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 05:08:16,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:08:16,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 05:08:16,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 05:08:16,439 INFO L87 Difference]: Start difference. First operand 13028 states and 19962 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:08:16,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:08:16,762 INFO L93 Difference]: Finished difference Result 34920 states and 52348 transitions. [2024-10-14 05:08:16,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 05:08:16,762 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 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 91 [2024-10-14 05:08:16,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:08:16,802 INFO L225 Difference]: With dead ends: 34920 [2024-10-14 05:08:16,802 INFO L226 Difference]: Without dead ends: 23462 [2024-10-14 05:08:16,821 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 05:08:16,822 INFO L432 NwaCegarLoop]: 1671 mSDtfsCounter, 1521 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1521 SdHoareTripleChecker+Valid, 1782 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 05:08:16,822 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1521 Valid, 1782 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 05:08:16,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23462 states. [2024-10-14 05:08:17,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23462 to 23460. [2024-10-14 05:08:17,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23460 states, 23458 states have (on average 1.4921135646687698) internal successors, (35002), 23459 states have internal predecessors, (35002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:08:17,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23460 states to 23460 states and 35002 transitions. [2024-10-14 05:08:17,638 INFO L78 Accepts]: Start accepts. Automaton has 23460 states and 35002 transitions. Word has length 91 [2024-10-14 05:08:17,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:08:17,638 INFO L471 AbstractCegarLoop]: Abstraction has 23460 states and 35002 transitions. [2024-10-14 05:08:17,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:08:17,639 INFO L276 IsEmpty]: Start isEmpty. Operand 23460 states and 35002 transitions. [2024-10-14 05:08:17,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-14 05:08:17,639 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:08:17,640 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:08:17,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-14 05:08:17,640 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:08:17,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:08:17,640 INFO L85 PathProgramCache]: Analyzing trace with hash 1700611410, now seen corresponding path program 1 times [2024-10-14 05:08:17,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:08:17,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534153693] [2024-10-14 05:08:17,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:08:17,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:08:17,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:08:17,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 05:08:17,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:08:17,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534153693] [2024-10-14 05:08:17,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534153693] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:08:17,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:08:17,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 05:08:17,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586754910] [2024-10-14 05:08:17,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:08:17,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 05:08:17,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:08:17,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 05:08:17,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 05:08:17,716 INFO L87 Difference]: Start difference. First operand 23460 states and 35002 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 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-10-14 05:08:18,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:08:18,134 INFO L93 Difference]: Finished difference Result 45995 states and 68544 transitions. [2024-10-14 05:08:18,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 05:08:18,135 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 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-10-14 05:08:18,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:08:18,192 INFO L225 Difference]: With dead ends: 45995 [2024-10-14 05:08:18,193 INFO L226 Difference]: Without dead ends: 33960 [2024-10-14 05:08:18,219 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 05:08:18,219 INFO L432 NwaCegarLoop]: 1680 mSDtfsCounter, 1524 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1524 SdHoareTripleChecker+Valid, 1779 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 05:08:18,219 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1524 Valid, 1779 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 05:08:18,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33960 states. [2024-10-14 05:08:19,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33960 to 33958. [2024-10-14 05:08:19,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33958 states, 33956 states have (on average 1.4794439863352573) internal successors, (50236), 33957 states have internal predecessors, (50236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:08:19,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33958 states to 33958 states and 50236 transitions. [2024-10-14 05:08:19,387 INFO L78 Accepts]: Start accepts. Automaton has 33958 states and 50236 transitions. Word has length 93 [2024-10-14 05:08:19,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:08:19,388 INFO L471 AbstractCegarLoop]: Abstraction has 33958 states and 50236 transitions. [2024-10-14 05:08:19,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 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-10-14 05:08:19,388 INFO L276 IsEmpty]: Start isEmpty. Operand 33958 states and 50236 transitions. [2024-10-14 05:08:19,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-14 05:08:19,389 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:08:19,389 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 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] [2024-10-14 05:08:19,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-14 05:08:19,389 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:08:19,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:08:19,390 INFO L85 PathProgramCache]: Analyzing trace with hash 2092107390, now seen corresponding path program 1 times [2024-10-14 05:08:19,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:08:19,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389901952] [2024-10-14 05:08:19,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:08:19,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:08:19,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:08:19,561 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 05:08:19,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:08:19,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389901952] [2024-10-14 05:08:19,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389901952] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:08:19,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:08:19,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 05:08:19,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615385351] [2024-10-14 05:08:19,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:08:19,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 05:08:19,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:08:19,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 05:08:19,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 05:08:19,566 INFO L87 Difference]: Start difference. First operand 33958 states and 50236 transitions. Second operand has 4 states, 4 states have (on average 23.5) 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-10-14 05:08:24,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:08:24,546 INFO L93 Difference]: Finished difference Result 37723 states and 57224 transitions. [2024-10-14 05:08:24,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 05:08:24,547 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.5) 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-10-14 05:08:24,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:08:24,601 INFO L225 Difference]: With dead ends: 37723 [2024-10-14 05:08:24,602 INFO L226 Difference]: Without dead ends: 36219 [2024-10-14 05:08:24,608 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 05:08:24,609 INFO L432 NwaCegarLoop]: 342 mSDtfsCounter, 2640 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 3615 mSolverCounterSat, 1529 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2640 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 5144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1529 IncrementalHoareTripleChecker+Valid, 3615 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2024-10-14 05:08:24,609 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2640 Valid, 358 Invalid, 5144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1529 Valid, 3615 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2024-10-14 05:08:24,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36219 states. [2024-10-14 05:08:25,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36219 to 36211. [2024-10-14 05:08:25,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36211 states, 36209 states have (on average 1.4764837471346903) internal successors, (53462), 36210 states have internal predecessors, (53462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:08:25,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36211 states to 36211 states and 53462 transitions. [2024-10-14 05:08:25,350 INFO L78 Accepts]: Start accepts. Automaton has 36211 states and 53462 transitions. Word has length 94 [2024-10-14 05:08:25,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:08:25,350 INFO L471 AbstractCegarLoop]: Abstraction has 36211 states and 53462 transitions. [2024-10-14 05:08:25,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.5) 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-10-14 05:08:25,351 INFO L276 IsEmpty]: Start isEmpty. Operand 36211 states and 53462 transitions. [2024-10-14 05:08:25,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-14 05:08:25,352 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:08:25,352 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 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] [2024-10-14 05:08:25,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-14 05:08:25,352 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:08:25,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:08:25,353 INFO L85 PathProgramCache]: Analyzing trace with hash -222631091, now seen corresponding path program 1 times [2024-10-14 05:08:25,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:08:25,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411819711] [2024-10-14 05:08:25,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:08:25,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:08:25,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:08:25,590 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-10-14 05:08:25,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:08:25,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411819711] [2024-10-14 05:08:25,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411819711] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:08:25,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:08:25,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 05:08:25,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802993597] [2024-10-14 05:08:25,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:08:25,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 05:08:25,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:08:25,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 05:08:25,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 05:08:25,593 INFO L87 Difference]: Start difference. First operand 36211 states and 53462 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 2 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:08:29,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:08:29,072 INFO L93 Difference]: Finished difference Result 42972 states and 64768 transitions. [2024-10-14 05:08:29,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 05:08:29,072 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 2 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2024-10-14 05:08:29,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:08:29,127 INFO L225 Difference]: With dead ends: 42972 [2024-10-14 05:08:29,128 INFO L226 Difference]: Without dead ends: 39215 [2024-10-14 05:08:29,141 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 05:08:29,142 INFO L432 NwaCegarLoop]: 676 mSDtfsCounter, 890 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2292 mSolverCounterSat, 643 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 890 SdHoareTripleChecker+Valid, 683 SdHoareTripleChecker+Invalid, 2935 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 643 IncrementalHoareTripleChecker+Valid, 2292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-10-14 05:08:29,142 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [890 Valid, 683 Invalid, 2935 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [643 Valid, 2292 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-10-14 05:08:29,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39215 states. [2024-10-14 05:08:29,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39215 to 39215. [2024-10-14 05:08:29,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39215 states, 39213 states have (on average 1.4595669803381532) internal successors, (57234), 39214 states have internal predecessors, (57234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:08:30,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39215 states to 39215 states and 57234 transitions. [2024-10-14 05:08:30,018 INFO L78 Accepts]: Start accepts. Automaton has 39215 states and 57234 transitions. Word has length 100 [2024-10-14 05:08:30,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:08:30,020 INFO L471 AbstractCegarLoop]: Abstraction has 39215 states and 57234 transitions. [2024-10-14 05:08:30,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 2 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:08:30,020 INFO L276 IsEmpty]: Start isEmpty. Operand 39215 states and 57234 transitions. [2024-10-14 05:08:30,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-14 05:08:30,027 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:08:30,027 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-14 05:08:30,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-14 05:08:30,027 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:08:30,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:08:30,028 INFO L85 PathProgramCache]: Analyzing trace with hash -1717316400, now seen corresponding path program 1 times [2024-10-14 05:08:30,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:08:30,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102617372] [2024-10-14 05:08:30,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:08:30,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:08:30,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:08:30,226 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 05:08:30,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:08:30,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102617372] [2024-10-14 05:08:30,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102617372] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:08:30,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:08:30,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-14 05:08:30,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511479640] [2024-10-14 05:08:30,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:08:30,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-14 05:08:30,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:08:30,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-14 05:08:30,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-10-14 05:08:30,315 INFO L87 Difference]: Start difference. First operand 39215 states and 57234 transitions. Second operand has 10 states, 10 states have (on average 11.2) internal successors, (112), 10 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:08:34,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:08:34,600 INFO L93 Difference]: Finished difference Result 304705 states and 445211 transitions. [2024-10-14 05:08:34,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 05:08:34,601 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.2) internal successors, (112), 10 states have internal predecessors, (112), 0 states have call successors, (0), 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 115 [2024-10-14 05:08:34,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:08:35,272 INFO L225 Difference]: With dead ends: 304705 [2024-10-14 05:08:35,273 INFO L226 Difference]: Without dead ends: 272319 [2024-10-14 05:08:35,325 INFO L431 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-10-14 05:08:35,330 INFO L432 NwaCegarLoop]: 1698 mSDtfsCounter, 11812 mSDsluCounter, 3228 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11812 SdHoareTripleChecker+Valid, 4926 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 05:08:35,330 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11812 Valid, 4926 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 05:08:35,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272319 states. [2024-10-14 05:08:38,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272319 to 71599. [2024-10-14 05:08:38,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71599 states, 71597 states have (on average 1.455507912342696) internal successors, (104210), 71598 states have internal predecessors, (104210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:08:39,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71599 states to 71599 states and 104210 transitions. [2024-10-14 05:08:39,085 INFO L78 Accepts]: Start accepts. Automaton has 71599 states and 104210 transitions. Word has length 115 [2024-10-14 05:08:39,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:08:39,086 INFO L471 AbstractCegarLoop]: Abstraction has 71599 states and 104210 transitions. [2024-10-14 05:08:39,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.2) internal successors, (112), 10 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:08:39,086 INFO L276 IsEmpty]: Start isEmpty. Operand 71599 states and 104210 transitions. [2024-10-14 05:08:39,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-14 05:08:39,093 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:08:39,093 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-14 05:08:39,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-14 05:08:39,093 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:08:39,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:08:39,094 INFO L85 PathProgramCache]: Analyzing trace with hash -961932336, now seen corresponding path program 1 times [2024-10-14 05:08:39,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:08:39,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721348028] [2024-10-14 05:08:39,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:08:39,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:08:39,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:08:39,367 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-14 05:08:39,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:08:39,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721348028] [2024-10-14 05:08:39,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721348028] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:08:39,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:08:39,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-14 05:08:39,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899003006] [2024-10-14 05:08:39,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:08:39,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-14 05:08:39,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:08:39,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-14 05:08:39,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-10-14 05:08:39,370 INFO L87 Difference]: Start difference. First operand 71599 states and 104210 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-10-14 05:08:46,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:08:46,125 INFO L93 Difference]: Finished difference Result 337089 states and 492187 transitions. [2024-10-14 05:08:46,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 05:08:46,130 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 115 [2024-10-14 05:08:46,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:08:46,670 INFO L225 Difference]: With dead ends: 337089 [2024-10-14 05:08:46,671 INFO L226 Difference]: Without dead ends: 304703 [2024-10-14 05:08:46,752 INFO L431 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-10-14 05:08:46,753 INFO L432 NwaCegarLoop]: 1695 mSDtfsCounter, 11856 mSDsluCounter, 3074 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11856 SdHoareTripleChecker+Valid, 4769 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 05:08:46,753 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11856 Valid, 4769 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 05:08:46,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304703 states. [2024-10-14 05:08:51,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304703 to 120239. [2024-10-14 05:08:51,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120239 states, 120237 states have (on average 1.4500860799920157) internal successors, (174354), 120238 states have internal predecessors, (174354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:08:52,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120239 states to 120239 states and 174354 transitions. [2024-10-14 05:08:52,339 INFO L78 Accepts]: Start accepts. Automaton has 120239 states and 174354 transitions. Word has length 115 [2024-10-14 05:08:52,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:08:52,340 INFO L471 AbstractCegarLoop]: Abstraction has 120239 states and 174354 transitions. [2024-10-14 05:08:52,340 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-10-14 05:08:52,340 INFO L276 IsEmpty]: Start isEmpty. Operand 120239 states and 174354 transitions. [2024-10-14 05:08:52,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-14 05:08:52,354 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:08:52,354 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-14 05:08:52,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-14 05:08:52,355 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:08:52,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:08:52,355 INFO L85 PathProgramCache]: Analyzing trace with hash -1640902192, now seen corresponding path program 1 times [2024-10-14 05:08:52,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:08:52,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776149532] [2024-10-14 05:08:52,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:08:52,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:08:52,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:08:52,754 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-14 05:08:52,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:08:52,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776149532] [2024-10-14 05:08:52,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776149532] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:08:52,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:08:52,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-14 05:08:52,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223843097] [2024-10-14 05:08:52,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:08:52,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-14 05:08:52,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:08:52,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-14 05:08:52,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-10-14 05:08:52,756 INFO L87 Difference]: Start difference. First operand 120239 states and 174354 transitions. Second operand has 10 states, 10 states have (on average 10.6) internal successors, (106), 10 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)