./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label15.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label15.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c74a9fc611cd640e8aacda017f0a1ef6db7219ef212e2ffc5499141a277c3acd --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-10 23:21:41,672 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-10 23:21:41,729 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-10 23:21:41,733 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-10 23:21:41,734 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-10 23:21:41,761 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-10 23:21:41,762 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-10 23:21:41,762 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-10 23:21:41,762 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-10 23:21:41,762 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-10 23:21:41,763 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-10 23:21:41,763 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-10 23:21:41,763 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-10 23:21:41,763 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-10 23:21:41,763 INFO L153 SettingsManager]: * Use SBE=true [2024-10-10 23:21:41,764 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-10 23:21:41,764 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-10 23:21:41,764 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-10 23:21:41,764 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-10 23:21:41,765 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-10 23:21:41,765 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-10 23:21:41,765 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-10 23:21:41,765 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-10 23:21:41,765 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-10 23:21:41,766 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-10 23:21:41,766 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-10 23:21:41,766 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-10 23:21:41,766 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-10 23:21:41,766 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-10 23:21:41,767 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-10 23:21:41,767 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-10 23:21:41,767 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-10 23:21:41,767 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 23:21:41,767 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-10 23:21:41,768 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-10 23:21:41,768 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-10 23:21:41,768 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-10 23:21:41,768 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-10 23:21:41,768 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-10 23:21:41,768 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-10 23:21:41,769 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-10 23:21:41,769 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-10 23:21:41,769 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c74a9fc611cd640e8aacda017f0a1ef6db7219ef212e2ffc5499141a277c3acd [2024-10-10 23:21:41,948 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-10 23:21:41,969 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-10 23:21:41,971 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-10 23:21:41,972 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-10 23:21:41,973 INFO L274 PluginConnector]: CDTParser initialized [2024-10-10 23:21:41,973 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label15.c [2024-10-10 23:21:43,174 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-10 23:21:43,495 INFO L384 CDTParser]: Found 1 translation units. [2024-10-10 23:21:43,496 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label15.c [2024-10-10 23:21:43,521 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/ccbf25686/a8355292062a4f7b8f63dee8e290fc9c/FLAG4ab512d22 [2024-10-10 23:21:43,543 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/ccbf25686/a8355292062a4f7b8f63dee8e290fc9c [2024-10-10 23:21:43,545 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-10 23:21:43,547 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-10 23:21:43,548 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-10 23:21:43,548 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-10 23:21:43,552 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-10 23:21:43,553 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 11:21:43" (1/1) ... [2024-10-10 23:21:43,554 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d575b6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:21:43, skipping insertion in model container [2024-10-10 23:21:43,554 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 11:21:43" (1/1) ... [2024-10-10 23:21:43,640 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-10 23:21:43,862 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/eca-rers2012/Problem12_label15.c[6730,6743] [2024-10-10 23:21:44,408 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 23:21:44,418 INFO L200 MainTranslator]: Completed pre-run [2024-10-10 23:21:44,438 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/eca-rers2012/Problem12_label15.c[6730,6743] [2024-10-10 23:21:44,759 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 23:21:44,776 INFO L204 MainTranslator]: Completed translation [2024-10-10 23:21:44,777 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:21:44 WrapperNode [2024-10-10 23:21:44,777 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-10 23:21:44,778 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-10 23:21:44,778 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-10 23:21:44,778 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-10 23:21:44,783 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:21:44" (1/1) ... [2024-10-10 23:21:44,819 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:21:44" (1/1) ... [2024-10-10 23:21:45,008 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 4761 [2024-10-10 23:21:45,008 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-10 23:21:45,009 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-10 23:21:45,009 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-10 23:21:45,009 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-10 23:21:45,017 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:21:44" (1/1) ... [2024-10-10 23:21:45,018 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:21:44" (1/1) ... [2024-10-10 23:21:45,053 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:21:44" (1/1) ... [2024-10-10 23:21:45,278 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-10 23:21:45,278 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:21:44" (1/1) ... [2024-10-10 23:21:45,279 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:21:44" (1/1) ... [2024-10-10 23:21:45,366 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:21:44" (1/1) ... [2024-10-10 23:21:45,390 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:21:44" (1/1) ... [2024-10-10 23:21:45,408 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:21:44" (1/1) ... [2024-10-10 23:21:45,425 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:21:44" (1/1) ... [2024-10-10 23:21:45,483 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-10 23:21:45,485 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-10 23:21:45,485 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-10 23:21:45,485 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-10 23:21:45,486 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:21:44" (1/1) ... [2024-10-10 23:21:45,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 23:21:45,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:21:45,516 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-10 23:21:45,571 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-10 23:21:45,608 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-10 23:21:45,608 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-10 23:21:45,609 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-10 23:21:45,609 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-10 23:21:45,667 INFO L238 CfgBuilder]: Building ICFG [2024-10-10 23:21:45,669 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-10 23:21:48,851 INFO L? ?]: Removed 702 outVars from TransFormulas that were not future-live. [2024-10-10 23:21:48,851 INFO L287 CfgBuilder]: Performing block encoding [2024-10-10 23:21:48,933 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-10 23:21:48,933 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-10 23:21:48,934 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:21:48 BoogieIcfgContainer [2024-10-10 23:21:48,934 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-10 23:21:48,935 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-10 23:21:48,935 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-10 23:21:48,939 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-10 23:21:48,940 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.10 11:21:43" (1/3) ... [2024-10-10 23:21:48,940 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4500b19a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 11:21:48, skipping insertion in model container [2024-10-10 23:21:48,940 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:21:44" (2/3) ... [2024-10-10 23:21:48,941 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4500b19a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 11:21:48, skipping insertion in model container [2024-10-10 23:21:48,941 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:21:48" (3/3) ... [2024-10-10 23:21:48,942 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem12_label15.c [2024-10-10 23:21:48,955 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-10 23:21:48,956 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-10 23:21:49,026 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-10 23:21:49,031 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;@245d5ab9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-10 23:21:49,032 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-10 23:21:49,037 INFO L276 IsEmpty]: Start isEmpty. Operand has 756 states, 754 states have (on average 1.993368700265252) internal successors, (1503), 755 states have internal predecessors, (1503), 0 states have call successors, (0), 0 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-10 23:21:49,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-10 23:21:49,043 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:21:49,043 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:21:49,044 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:21:49,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:21:49,048 INFO L85 PathProgramCache]: Analyzing trace with hash 396474787, now seen corresponding path program 1 times [2024-10-10 23:21:49,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:21:49,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980336878] [2024-10-10 23:21:49,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:21:49,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:21:49,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:21:49,204 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-10 23:21:49,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:21:49,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980336878] [2024-10-10 23:21:49,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980336878] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:21:49,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:21:49,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:21:49,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007694242] [2024-10-10 23:21:49,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:21:49,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-10 23:21:49,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:21:49,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-10 23:21:49,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-10 23:21:49,236 INFO L87 Difference]: Start difference. First operand has 756 states, 754 states have (on average 1.993368700265252) internal successors, (1503), 755 states have internal predecessors, (1503), 0 states have call successors, (0), 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 26.5) internal successors, (53), 2 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:21:49,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:21:49,310 INFO L93 Difference]: Finished difference Result 1511 states and 3005 transitions. [2024-10-10 23:21:49,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-10 23:21:49,313 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2024-10-10 23:21:49,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:21:49,334 INFO L225 Difference]: With dead ends: 1511 [2024-10-10 23:21:49,334 INFO L226 Difference]: Without dead ends: 754 [2024-10-10 23:21:49,341 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-10 23:21:49,344 INFO L432 NwaCegarLoop]: 1438 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1438 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 23:21:49,346 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1438 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 23:21:49,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states. [2024-10-10 23:21:49,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 754. [2024-10-10 23:21:49,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 754 states, 753 states have (on average 1.9096945551128819) internal successors, (1438), 753 states have internal predecessors, (1438), 0 states have call successors, (0), 0 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-10 23:21:49,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 1438 transitions. [2024-10-10 23:21:49,423 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 1438 transitions. Word has length 53 [2024-10-10 23:21:49,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:21:49,423 INFO L471 AbstractCegarLoop]: Abstraction has 754 states and 1438 transitions. [2024-10-10 23:21:49,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:21:49,424 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 1438 transitions. [2024-10-10 23:21:49,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-10 23:21:49,425 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:21:49,425 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:21:49,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-10 23:21:49,426 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:21:49,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:21:49,427 INFO L85 PathProgramCache]: Analyzing trace with hash 962943177, now seen corresponding path program 1 times [2024-10-10 23:21:49,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:21:49,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218162143] [2024-10-10 23:21:49,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:21:49,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:21:49,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:21:49,685 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-10 23:21:49,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:21:49,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218162143] [2024-10-10 23:21:49,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218162143] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:21:49,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:21:49,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:21:49,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945638113] [2024-10-10 23:21:49,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:21:49,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:21:49,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:21:49,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:21:49,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:21:49,689 INFO L87 Difference]: Start difference. First operand 754 states and 1438 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:21:53,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:21:53,845 INFO L93 Difference]: Finished difference Result 3017 states and 5755 transitions. [2024-10-10 23:21:53,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-10 23:21:53,846 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2024-10-10 23:21:53,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:21:53,854 INFO L225 Difference]: With dead ends: 3017 [2024-10-10 23:21:53,854 INFO L226 Difference]: Without dead ends: 2264 [2024-10-10 23:21:53,855 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-10 23:21:53,856 INFO L432 NwaCegarLoop]: 180 mSDtfsCounter, 2335 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 3613 mSolverCounterSat, 1596 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2335 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 5209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1596 IncrementalHoareTripleChecker+Valid, 3613 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2024-10-10 23:21:53,856 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2335 Valid, 197 Invalid, 5209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1596 Valid, 3613 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2024-10-10 23:21:53,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2264 states. [2024-10-10 23:21:53,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2264 to 2256. [2024-10-10 23:21:53,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2256 states, 2255 states have (on average 1.5352549889135254) internal successors, (3462), 2255 states have internal predecessors, (3462), 0 states have call successors, (0), 0 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-10 23:21:53,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2256 states to 2256 states and 3462 transitions. [2024-10-10 23:21:53,889 INFO L78 Accepts]: Start accepts. Automaton has 2256 states and 3462 transitions. Word has length 53 [2024-10-10 23:21:53,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:21:53,890 INFO L471 AbstractCegarLoop]: Abstraction has 2256 states and 3462 transitions. [2024-10-10 23:21:53,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:21:53,890 INFO L276 IsEmpty]: Start isEmpty. Operand 2256 states and 3462 transitions. [2024-10-10 23:21:53,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2024-10-10 23:21:53,896 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:21:53,896 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-10-10 23:21:53,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-10 23:21:53,896 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:21:53,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:21:53,897 INFO L85 PathProgramCache]: Analyzing trace with hash -2074403986, now seen corresponding path program 1 times [2024-10-10 23:21:53,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:21:53,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386133763] [2024-10-10 23:21:53,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:21:53,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:21:53,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:21:54,389 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 153 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-10 23:21:54,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:21:54,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386133763] [2024-10-10 23:21:54,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386133763] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:21:54,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:21:54,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:21:54,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668193588] [2024-10-10 23:21:54,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:21:54,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:21:54,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:21:54,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:21:54,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:21:54,395 INFO L87 Difference]: Start difference. First operand 2256 states and 3462 transitions. Second operand has 4 states, 4 states have (on average 44.0) internal successors, (176), 3 states have internal predecessors, (176), 0 states have call successors, (0), 0 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-10 23:21:57,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:21:57,477 INFO L93 Difference]: Finished difference Result 6050 states and 9663 transitions. [2024-10-10 23:21:57,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:21:57,477 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 44.0) internal successors, (176), 3 states have internal predecessors, (176), 0 states have call successors, (0), 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 193 [2024-10-10 23:21:57,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:21:57,517 INFO L225 Difference]: With dead ends: 6050 [2024-10-10 23:21:57,517 INFO L226 Difference]: Without dead ends: 3758 [2024-10-10 23:21:57,520 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:21:57,521 INFO L432 NwaCegarLoop]: 692 mSDtfsCounter, 702 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 3108 mSolverCounterSat, 729 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 702 SdHoareTripleChecker+Valid, 705 SdHoareTripleChecker+Invalid, 3837 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 729 IncrementalHoareTripleChecker+Valid, 3108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-10-10 23:21:57,523 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [702 Valid, 705 Invalid, 3837 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [729 Valid, 3108 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-10-10 23:21:57,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3758 states. [2024-10-10 23:21:57,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3758 to 3758. [2024-10-10 23:21:57,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3758 states, 3757 states have (on average 1.340963534735161) internal successors, (5038), 3757 states have internal predecessors, (5038), 0 states have call successors, (0), 0 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-10 23:21:57,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3758 states to 3758 states and 5038 transitions. [2024-10-10 23:21:57,582 INFO L78 Accepts]: Start accepts. Automaton has 3758 states and 5038 transitions. Word has length 193 [2024-10-10 23:21:57,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:21:57,582 INFO L471 AbstractCegarLoop]: Abstraction has 3758 states and 5038 transitions. [2024-10-10 23:21:57,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 44.0) internal successors, (176), 3 states have internal predecessors, (176), 0 states have call successors, (0), 0 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-10 23:21:57,582 INFO L276 IsEmpty]: Start isEmpty. Operand 3758 states and 5038 transitions. [2024-10-10 23:21:57,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2024-10-10 23:21:57,585 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:21:57,585 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:21:57,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-10 23:21:57,586 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:21:57,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:21:57,588 INFO L85 PathProgramCache]: Analyzing trace with hash -867901763, now seen corresponding path program 1 times [2024-10-10 23:21:57,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:21:57,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533082377] [2024-10-10 23:21:57,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:21:57,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:21:57,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:21:57,798 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-10-10 23:21:57,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:21:57,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533082377] [2024-10-10 23:21:57,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533082377] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:21:57,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:21:57,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:21:57,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080155777] [2024-10-10 23:21:57,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:21:57,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:21:57,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:21:57,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:21:57,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:21:57,801 INFO L87 Difference]: Start difference. First operand 3758 states and 5038 transitions. Second operand has 3 states, 3 states have (on average 65.33333333333333) internal successors, (196), 2 states have internal predecessors, (196), 0 states have call successors, (0), 0 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-10 23:21:59,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:21:59,817 INFO L93 Difference]: Finished difference Result 10519 states and 14355 transitions. [2024-10-10 23:21:59,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:21:59,818 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 65.33333333333333) internal successors, (196), 2 states have internal predecessors, (196), 0 states have call successors, (0), 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 263 [2024-10-10 23:21:59,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:21:59,836 INFO L225 Difference]: With dead ends: 10519 [2024-10-10 23:21:59,836 INFO L226 Difference]: Without dead ends: 6762 [2024-10-10 23:21:59,842 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-10 23:21:59,843 INFO L432 NwaCegarLoop]: 478 mSDtfsCounter, 669 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1990 mSolverCounterSat, 845 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 669 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 2835 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 845 IncrementalHoareTripleChecker+Valid, 1990 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-10 23:21:59,844 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [669 Valid, 484 Invalid, 2835 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [845 Valid, 1990 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-10 23:21:59,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6762 states. [2024-10-10 23:21:59,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6762 to 6011. [2024-10-10 23:21:59,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6011 states, 6010 states have (on average 1.2815307820299502) internal successors, (7702), 6010 states have internal predecessors, (7702), 0 states have call successors, (0), 0 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-10 23:21:59,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6011 states to 6011 states and 7702 transitions. [2024-10-10 23:21:59,924 INFO L78 Accepts]: Start accepts. Automaton has 6011 states and 7702 transitions. Word has length 263 [2024-10-10 23:21:59,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:21:59,925 INFO L471 AbstractCegarLoop]: Abstraction has 6011 states and 7702 transitions. [2024-10-10 23:21:59,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 65.33333333333333) internal successors, (196), 2 states have internal predecessors, (196), 0 states have call successors, (0), 0 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-10 23:21:59,926 INFO L276 IsEmpty]: Start isEmpty. Operand 6011 states and 7702 transitions. [2024-10-10 23:21:59,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2024-10-10 23:21:59,930 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:21:59,930 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:21:59,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-10 23:21:59,930 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:21:59,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:21:59,931 INFO L85 PathProgramCache]: Analyzing trace with hash -671716134, now seen corresponding path program 1 times [2024-10-10 23:21:59,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:21:59,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13168292] [2024-10-10 23:21:59,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:21:59,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:22:00,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:22:00,277 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 103 proven. 54 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-10-10 23:22:00,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:22:00,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13168292] [2024-10-10 23:22:00,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13168292] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:22:00,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [329118580] [2024-10-10 23:22:00,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:22:00,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:22:00,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:22:00,280 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 23:22:00,281 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-10 23:22:00,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:22:00,371 INFO L255 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-10 23:22:00,379 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:22:00,506 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 184 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:22:00,506 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 23:22:00,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [329118580] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:22:00,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 23:22:00,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-10-10 23:22:00,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741490650] [2024-10-10 23:22:00,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:22:00,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:22:00,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:22:00,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:22:00,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-10 23:22:00,510 INFO L87 Difference]: Start difference. First operand 6011 states and 7702 transitions. Second operand has 3 states, 3 states have (on average 92.0) internal successors, (276), 3 states have internal predecessors, (276), 0 states have call successors, (0), 0 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-10 23:22:02,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:22:02,666 INFO L93 Difference]: Finished difference Result 15025 states and 19933 transitions. [2024-10-10 23:22:02,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:22:02,667 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 92.0) internal successors, (276), 3 states have internal predecessors, (276), 0 states have call successors, (0), 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 276 [2024-10-10 23:22:02,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:22:02,687 INFO L225 Difference]: With dead ends: 15025 [2024-10-10 23:22:02,688 INFO L226 Difference]: Without dead ends: 9015 [2024-10-10 23:22:02,692 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 275 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-10 23:22:02,693 INFO L432 NwaCegarLoop]: 301 mSDtfsCounter, 907 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2073 mSolverCounterSat, 703 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 907 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 2776 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 703 IncrementalHoareTripleChecker+Valid, 2073 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-10 23:22:02,693 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [907 Valid, 307 Invalid, 2776 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [703 Valid, 2073 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-10 23:22:02,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9015 states. [2024-10-10 23:22:02,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9015 to 9015. [2024-10-10 23:22:02,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9015 states, 9014 states have (on average 1.265808741956956) internal successors, (11410), 9014 states have internal predecessors, (11410), 0 states have call successors, (0), 0 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-10 23:22:02,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9015 states to 9015 states and 11410 transitions. [2024-10-10 23:22:02,805 INFO L78 Accepts]: Start accepts. Automaton has 9015 states and 11410 transitions. Word has length 276 [2024-10-10 23:22:02,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:22:02,806 INFO L471 AbstractCegarLoop]: Abstraction has 9015 states and 11410 transitions. [2024-10-10 23:22:02,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 92.0) internal successors, (276), 3 states have internal predecessors, (276), 0 states have call successors, (0), 0 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-10 23:22:02,806 INFO L276 IsEmpty]: Start isEmpty. Operand 9015 states and 11410 transitions. [2024-10-10 23:22:02,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2024-10-10 23:22:02,809 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:22:02,809 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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] [2024-10-10 23:22:02,823 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-10 23:22:03,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:22:03,010 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:22:03,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:22:03,011 INFO L85 PathProgramCache]: Analyzing trace with hash -1966034446, now seen corresponding path program 1 times [2024-10-10 23:22:03,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:22:03,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503594005] [2024-10-10 23:22:03,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:22:03,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:22:03,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:22:03,161 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2024-10-10 23:22:03,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:22:03,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503594005] [2024-10-10 23:22:03,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503594005] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:22:03,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:22:03,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:22:03,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962994772] [2024-10-10 23:22:03,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:22:03,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:22:03,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:22:03,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:22:03,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:22:03,163 INFO L87 Difference]: Start difference. First operand 9015 states and 11410 transitions. Second operand has 3 states, 3 states have (on average 65.33333333333333) internal successors, (196), 3 states have internal predecessors, (196), 0 states have call successors, (0), 0 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-10 23:22:05,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:22:05,611 INFO L93 Difference]: Finished difference Result 25539 states and 32712 transitions. [2024-10-10 23:22:05,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:22:05,615 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 65.33333333333333) internal successors, (196), 3 states have internal predecessors, (196), 0 states have call successors, (0), 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 293 [2024-10-10 23:22:05,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:22:05,647 INFO L225 Difference]: With dead ends: 25539 [2024-10-10 23:22:05,648 INFO L226 Difference]: Without dead ends: 16525 [2024-10-10 23:22:05,656 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-10 23:22:05,658 INFO L432 NwaCegarLoop]: 1315 mSDtfsCounter, 704 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2687 mSolverCounterSat, 373 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 704 SdHoareTripleChecker+Valid, 1322 SdHoareTripleChecker+Invalid, 3060 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 373 IncrementalHoareTripleChecker+Valid, 2687 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-10 23:22:05,659 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [704 Valid, 1322 Invalid, 3060 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [373 Valid, 2687 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-10 23:22:05,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16525 states. [2024-10-10 23:22:05,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16525 to 15774. [2024-10-10 23:22:05,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15774 states, 15773 states have (on average 1.252393330374691) internal successors, (19754), 15773 states have internal predecessors, (19754), 0 states have call successors, (0), 0 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-10 23:22:05,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15774 states to 15774 states and 19754 transitions. [2024-10-10 23:22:05,895 INFO L78 Accepts]: Start accepts. Automaton has 15774 states and 19754 transitions. Word has length 293 [2024-10-10 23:22:05,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:22:05,896 INFO L471 AbstractCegarLoop]: Abstraction has 15774 states and 19754 transitions. [2024-10-10 23:22:05,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 65.33333333333333) internal successors, (196), 3 states have internal predecessors, (196), 0 states have call successors, (0), 0 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-10 23:22:05,897 INFO L276 IsEmpty]: Start isEmpty. Operand 15774 states and 19754 transitions. [2024-10-10 23:22:05,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2024-10-10 23:22:05,900 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:22:05,900 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-10-10 23:22:05,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-10 23:22:05,900 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:22:05,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:22:05,901 INFO L85 PathProgramCache]: Analyzing trace with hash 1051547492, now seen corresponding path program 1 times [2024-10-10 23:22:05,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:22:05,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716686310] [2024-10-10 23:22:05,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:22:05,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:22:05,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:22:06,276 INFO L134 CoverageAnalysis]: Checked inductivity of 370 backedges. 292 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2024-10-10 23:22:06,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:22:06,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716686310] [2024-10-10 23:22:06,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716686310] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:22:06,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:22:06,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:22:06,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766118099] [2024-10-10 23:22:06,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:22:06,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:22:06,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:22:06,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:22:06,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:22:06,278 INFO L87 Difference]: Start difference. First operand 15774 states and 19754 transitions. Second operand has 3 states, 3 states have (on average 88.33333333333333) internal successors, (265), 3 states have internal predecessors, (265), 0 states have call successors, (0), 0 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-10 23:22:08,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:22:08,453 INFO L93 Difference]: Finished difference Result 38306 states and 48287 transitions. [2024-10-10 23:22:08,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:22:08,453 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 88.33333333333333) internal successors, (265), 3 states have internal predecessors, (265), 0 states have call successors, (0), 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 342 [2024-10-10 23:22:08,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:22:08,486 INFO L225 Difference]: With dead ends: 38306 [2024-10-10 23:22:08,486 INFO L226 Difference]: Without dead ends: 22533 [2024-10-10 23:22:08,499 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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-10 23:22:08,500 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 828 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2038 mSolverCounterSat, 1009 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 828 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 3047 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1009 IncrementalHoareTripleChecker+Valid, 2038 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-10 23:22:08,501 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [828 Valid, 140 Invalid, 3047 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1009 Valid, 2038 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-10 23:22:08,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22533 states. [2024-10-10 23:22:08,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22533 to 22533. [2024-10-10 23:22:08,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22533 states, 22532 states have (on average 1.2340671045624) internal successors, (27806), 22532 states have internal predecessors, (27806), 0 states have call successors, (0), 0 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-10 23:22:08,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22533 states to 22533 states and 27806 transitions. [2024-10-10 23:22:08,728 INFO L78 Accepts]: Start accepts. Automaton has 22533 states and 27806 transitions. Word has length 342 [2024-10-10 23:22:08,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:22:08,729 INFO L471 AbstractCegarLoop]: Abstraction has 22533 states and 27806 transitions. [2024-10-10 23:22:08,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 88.33333333333333) internal successors, (265), 3 states have internal predecessors, (265), 0 states have call successors, (0), 0 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-10 23:22:08,730 INFO L276 IsEmpty]: Start isEmpty. Operand 22533 states and 27806 transitions. [2024-10-10 23:22:08,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 348 [2024-10-10 23:22:08,735 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:22:08,736 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:22:08,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-10 23:22:08,737 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:22:08,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:22:08,737 INFO L85 PathProgramCache]: Analyzing trace with hash -2095581145, now seen corresponding path program 1 times [2024-10-10 23:22:08,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:22:08,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847727318] [2024-10-10 23:22:08,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:22:08,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:22:08,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:22:08,892 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 302 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2024-10-10 23:22:08,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:22:08,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847727318] [2024-10-10 23:22:08,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847727318] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:22:08,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:22:08,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:22:08,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075044835] [2024-10-10 23:22:08,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:22:08,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:22:08,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:22:08,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:22:08,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:22:08,894 INFO L87 Difference]: Start difference. First operand 22533 states and 27806 transitions. Second operand has 3 states, 3 states have (on average 90.0) internal successors, (270), 3 states have internal predecessors, (270), 0 states have call successors, (0), 0 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-10 23:22:11,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:22:11,132 INFO L93 Difference]: Finished difference Result 45065 states and 55611 transitions. [2024-10-10 23:22:11,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:22:11,132 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 90.0) internal successors, (270), 3 states have internal predecessors, (270), 0 states have call successors, (0), 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 347 [2024-10-10 23:22:11,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:22:11,165 INFO L225 Difference]: With dead ends: 45065 [2024-10-10 23:22:11,165 INFO L226 Difference]: Without dead ends: 22533 [2024-10-10 23:22:11,185 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-10 23:22:11,186 INFO L432 NwaCegarLoop]: 179 mSDtfsCounter, 736 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2265 mSolverCounterSat, 681 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 736 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 2946 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 681 IncrementalHoareTripleChecker+Valid, 2265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-10 23:22:11,187 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [736 Valid, 185 Invalid, 2946 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [681 Valid, 2265 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-10 23:22:11,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22533 states. [2024-10-10 23:22:11,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22533 to 22533. [2024-10-10 23:22:11,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22533 states, 22532 states have (on average 1.221018995206817) internal successors, (27512), 22532 states have internal predecessors, (27512), 0 states have call successors, (0), 0 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-10 23:22:11,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22533 states to 22533 states and 27512 transitions. [2024-10-10 23:22:11,388 INFO L78 Accepts]: Start accepts. Automaton has 22533 states and 27512 transitions. Word has length 347 [2024-10-10 23:22:11,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:22:11,389 INFO L471 AbstractCegarLoop]: Abstraction has 22533 states and 27512 transitions. [2024-10-10 23:22:11,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 90.0) internal successors, (270), 3 states have internal predecessors, (270), 0 states have call successors, (0), 0 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-10 23:22:11,389 INFO L276 IsEmpty]: Start isEmpty. Operand 22533 states and 27512 transitions. [2024-10-10 23:22:11,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 359 [2024-10-10 23:22:11,393 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:22:11,393 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-10-10 23:22:11,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-10 23:22:11,394 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:22:11,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:22:11,394 INFO L85 PathProgramCache]: Analyzing trace with hash -314837239, now seen corresponding path program 1 times [2024-10-10 23:22:11,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:22:11,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713512860] [2024-10-10 23:22:11,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:22:11,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:22:11,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:22:11,535 INFO L134 CoverageAnalysis]: Checked inductivity of 387 backedges. 302 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2024-10-10 23:22:11,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:22:11,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713512860] [2024-10-10 23:22:11,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713512860] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:22:11,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:22:11,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:22:11,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873086062] [2024-10-10 23:22:11,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:22:11,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:22:11,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:22:11,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:22:11,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:22:11,539 INFO L87 Difference]: Start difference. First operand 22533 states and 27512 transitions. Second operand has 3 states, 3 states have (on average 91.33333333333333) internal successors, (274), 3 states have internal predecessors, (274), 0 states have call successors, (0), 0 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-10 23:22:13,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:22:13,841 INFO L93 Difference]: Finished difference Result 60836 states and 75394 transitions. [2024-10-10 23:22:13,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:22:13,842 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 91.33333333333333) internal successors, (274), 3 states have internal predecessors, (274), 0 states have call successors, (0), 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 358 [2024-10-10 23:22:13,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:22:13,879 INFO L225 Difference]: With dead ends: 60836 [2024-10-10 23:22:13,879 INFO L226 Difference]: Without dead ends: 38304 [2024-10-10 23:22:13,898 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-10 23:22:13,899 INFO L432 NwaCegarLoop]: 416 mSDtfsCounter, 721 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2244 mSolverCounterSat, 691 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 721 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 2935 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 691 IncrementalHoareTripleChecker+Valid, 2244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-10 23:22:13,899 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [721 Valid, 422 Invalid, 2935 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [691 Valid, 2244 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-10 23:22:13,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38304 states. [2024-10-10 23:22:14,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38304 to 38304. [2024-10-10 23:22:14,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38304 states, 38303 states have (on average 1.2043704148500118) internal successors, (46131), 38303 states have internal predecessors, (46131), 0 states have call successors, (0), 0 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-10 23:22:14,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38304 states to 38304 states and 46131 transitions. [2024-10-10 23:22:14,190 INFO L78 Accepts]: Start accepts. Automaton has 38304 states and 46131 transitions. Word has length 358 [2024-10-10 23:22:14,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:22:14,192 INFO L471 AbstractCegarLoop]: Abstraction has 38304 states and 46131 transitions. [2024-10-10 23:22:14,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 91.33333333333333) internal successors, (274), 3 states have internal predecessors, (274), 0 states have call successors, (0), 0 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-10 23:22:14,192 INFO L276 IsEmpty]: Start isEmpty. Operand 38304 states and 46131 transitions. [2024-10-10 23:22:14,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 385 [2024-10-10 23:22:14,197 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:22:14,197 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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] [2024-10-10 23:22:14,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-10 23:22:14,198 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:22:14,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:22:14,198 INFO L85 PathProgramCache]: Analyzing trace with hash -836524199, now seen corresponding path program 1 times [2024-10-10 23:22:14,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:22:14,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389741787] [2024-10-10 23:22:14,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:22:14,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:22:14,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:22:15,001 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 339 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:22:15,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:22:15,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389741787] [2024-10-10 23:22:15,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389741787] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:22:15,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [636241845] [2024-10-10 23:22:15,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:22:15,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:22:15,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:22:15,003 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 23:22:15,005 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-10 23:22:15,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:22:15,116 INFO L255 TraceCheckSpWp]: Trace formula consists of 514 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-10 23:22:15,124 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:22:15,535 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 155 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2024-10-10 23:22:15,535 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 23:22:15,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [636241845] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:22:15,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 23:22:15,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2024-10-10 23:22:15,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614701896] [2024-10-10 23:22:15,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:22:15,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:22:15,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:22:15,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:22:15,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-10 23:22:15,537 INFO L87 Difference]: Start difference. First operand 38304 states and 46131 transitions. Second operand has 4 states, 4 states have (on average 50.25) internal successors, (201), 3 states have internal predecessors, (201), 0 states have call successors, (0), 0 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-10 23:22:19,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:22:19,429 INFO L93 Difference]: Finished difference Result 109653 states and 133185 transitions. [2024-10-10 23:22:19,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:22:19,430 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 50.25) internal successors, (201), 3 states have internal predecessors, (201), 0 states have call successors, (0), 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 384 [2024-10-10 23:22:19,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:22:19,520 INFO L225 Difference]: With dead ends: 109653 [2024-10-10 23:22:19,520 INFO L226 Difference]: Without dead ends: 71350 [2024-10-10 23:22:19,559 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 388 GetRequests, 383 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-10 23:22:19,560 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 1785 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 5026 mSolverCounterSat, 600 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1785 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 5626 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 600 IncrementalHoareTripleChecker+Valid, 5026 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2024-10-10 23:22:19,560 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1785 Valid, 27 Invalid, 5626 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [600 Valid, 5026 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2024-10-10 23:22:19,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71350 states. [2024-10-10 23:22:20,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71350 to 71348. [2024-10-10 23:22:20,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71348 states, 71347 states have (on average 1.192089366056036) internal successors, (85052), 71347 states have internal predecessors, (85052), 0 states have call successors, (0), 0 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-10 23:22:20,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71348 states to 71348 states and 85052 transitions. [2024-10-10 23:22:20,231 INFO L78 Accepts]: Start accepts. Automaton has 71348 states and 85052 transitions. Word has length 384 [2024-10-10 23:22:20,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:22:20,232 INFO L471 AbstractCegarLoop]: Abstraction has 71348 states and 85052 transitions. [2024-10-10 23:22:20,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 50.25) internal successors, (201), 3 states have internal predecessors, (201), 0 states have call successors, (0), 0 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-10 23:22:20,232 INFO L276 IsEmpty]: Start isEmpty. Operand 71348 states and 85052 transitions. [2024-10-10 23:22:20,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 386 [2024-10-10 23:22:20,236 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:22:20,236 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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] [2024-10-10 23:22:20,250 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-10 23:22:20,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:22:20,437 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:22:20,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:22:20,437 INFO L85 PathProgramCache]: Analyzing trace with hash -453827364, now seen corresponding path program 1 times [2024-10-10 23:22:20,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:22:20,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549684236] [2024-10-10 23:22:20,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:22:20,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:22:20,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:22:20,580 INFO L134 CoverageAnalysis]: Checked inductivity of 414 backedges. 250 proven. 0 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2024-10-10 23:22:20,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:22:20,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549684236] [2024-10-10 23:22:20,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549684236] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:22:20,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:22:20,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:22:20,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489538084] [2024-10-10 23:22:20,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:22:20,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:22:20,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:22:20,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:22:20,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:22:20,582 INFO L87 Difference]: Start difference. First operand 71348 states and 85052 transitions. Second operand has 3 states, 3 states have (on average 74.33333333333333) internal successors, (223), 3 states have internal predecessors, (223), 0 states have call successors, (0), 0 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-10 23:22:23,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:22:23,424 INFO L93 Difference]: Finished difference Result 165976 states and 199242 transitions. [2024-10-10 23:22:23,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:22:23,425 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 74.33333333333333) internal successors, (223), 3 states have internal predecessors, (223), 0 states have call successors, (0), 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 385 [2024-10-10 23:22:23,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:22:23,537 INFO L225 Difference]: With dead ends: 165976 [2024-10-10 23:22:23,537 INFO L226 Difference]: Without dead ends: 95380 [2024-10-10 23:22:23,583 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-10 23:22:23,584 INFO L432 NwaCegarLoop]: 1258 mSDtfsCounter, 693 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2315 mSolverCounterSat, 522 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 693 SdHoareTripleChecker+Valid, 1265 SdHoareTripleChecker+Invalid, 2837 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 522 IncrementalHoareTripleChecker+Valid, 2315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-10-10 23:22:23,584 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [693 Valid, 1265 Invalid, 2837 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [522 Valid, 2315 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-10-10 23:22:23,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95380 states. [2024-10-10 23:22:24,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95380 to 94629. [2024-10-10 23:22:24,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94629 states, 94628 states have (on average 1.164021219934903) internal successors, (110149), 94628 states have internal predecessors, (110149), 0 states have call successors, (0), 0 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-10 23:22:24,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94629 states to 94629 states and 110149 transitions. [2024-10-10 23:22:24,696 INFO L78 Accepts]: Start accepts. Automaton has 94629 states and 110149 transitions. Word has length 385 [2024-10-10 23:22:24,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:22:24,696 INFO L471 AbstractCegarLoop]: Abstraction has 94629 states and 110149 transitions. [2024-10-10 23:22:24,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 74.33333333333333) internal successors, (223), 3 states have internal predecessors, (223), 0 states have call successors, (0), 0 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-10 23:22:24,696 INFO L276 IsEmpty]: Start isEmpty. Operand 94629 states and 110149 transitions. [2024-10-10 23:22:24,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 451 [2024-10-10 23:22:24,703 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:22:24,703 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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] [2024-10-10 23:22:24,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-10 23:22:24,703 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:22:24,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:22:24,704 INFO L85 PathProgramCache]: Analyzing trace with hash -1122602698, now seen corresponding path program 1 times [2024-10-10 23:22:24,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:22:24,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339370260] [2024-10-10 23:22:24,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:22:24,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:22:24,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:22:25,229 INFO L134 CoverageAnalysis]: Checked inductivity of 660 backedges. 483 proven. 0 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2024-10-10 23:22:25,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:22:25,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339370260] [2024-10-10 23:22:25,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339370260] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:22:25,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:22:25,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:22:25,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362547627] [2024-10-10 23:22:25,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:22:25,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:22:25,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:22:25,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:22:25,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:22:25,231 INFO L87 Difference]: Start difference. First operand 94629 states and 110149 transitions. Second operand has 3 states, 3 states have (on average 91.66666666666667) internal successors, (275), 3 states have internal predecessors, (275), 0 states have call successors, (0), 0 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-10 23:22:27,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:22:27,771 INFO L93 Difference]: Finished difference Result 207281 states and 241009 transitions. [2024-10-10 23:22:27,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:22:27,772 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 91.66666666666667) internal successors, (275), 3 states have internal predecessors, (275), 0 states have call successors, (0), 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 450 [2024-10-10 23:22:27,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:22:27,894 INFO L225 Difference]: With dead ends: 207281 [2024-10-10 23:22:27,895 INFO L226 Difference]: Without dead ends: 113404 [2024-10-10 23:22:27,929 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-10 23:22:27,930 INFO L432 NwaCegarLoop]: 1235 mSDtfsCounter, 696 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2282 mSolverCounterSat, 398 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 696 SdHoareTripleChecker+Valid, 1242 SdHoareTripleChecker+Invalid, 2680 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 398 IncrementalHoareTripleChecker+Valid, 2282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-10 23:22:27,930 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [696 Valid, 1242 Invalid, 2680 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [398 Valid, 2282 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-10 23:22:27,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113404 states. [2024-10-10 23:22:29,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113404 to 113404. [2024-10-10 23:22:29,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113404 states, 113403 states have (on average 1.1214694496618256) internal successors, (127178), 113403 states have internal predecessors, (127178), 0 states have call successors, (0), 0 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-10 23:22:29,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113404 states to 113404 states and 127178 transitions. [2024-10-10 23:22:29,246 INFO L78 Accepts]: Start accepts. Automaton has 113404 states and 127178 transitions. Word has length 450 [2024-10-10 23:22:29,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:22:29,246 INFO L471 AbstractCegarLoop]: Abstraction has 113404 states and 127178 transitions. [2024-10-10 23:22:29,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 91.66666666666667) internal successors, (275), 3 states have internal predecessors, (275), 0 states have call successors, (0), 0 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-10 23:22:29,247 INFO L276 IsEmpty]: Start isEmpty. Operand 113404 states and 127178 transitions. [2024-10-10 23:22:29,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 516 [2024-10-10 23:22:29,259 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:22:29,259 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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] [2024-10-10 23:22:29,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-10 23:22:29,259 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:22:29,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:22:29,260 INFO L85 PathProgramCache]: Analyzing trace with hash 1249002487, now seen corresponding path program 1 times [2024-10-10 23:22:29,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:22:29,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920088806] [2024-10-10 23:22:29,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:22:29,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:22:29,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:22:29,766 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 416 proven. 0 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2024-10-10 23:22:29,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:22:29,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920088806] [2024-10-10 23:22:29,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920088806] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:22:29,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:22:29,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:22:29,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017585267] [2024-10-10 23:22:29,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:22:29,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:22:29,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:22:29,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:22:29,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:22:29,768 INFO L87 Difference]: Start difference. First operand 113404 states and 127178 transitions. Second operand has 3 states, 3 states have (on average 133.33333333333334) internal successors, (400), 3 states have internal predecessors, (400), 0 states have call successors, (0), 0 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-10 23:22:32,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:22:32,358 INFO L93 Difference]: Finished difference Result 226056 states and 253599 transitions. [2024-10-10 23:22:32,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:22:32,359 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 133.33333333333334) internal successors, (400), 3 states have internal predecessors, (400), 0 states have call successors, (0), 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 515 [2024-10-10 23:22:32,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:22:32,495 INFO L225 Difference]: With dead ends: 226056 [2024-10-10 23:22:32,495 INFO L226 Difference]: Without dead ends: 113404 [2024-10-10 23:22:32,560 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-10 23:22:32,561 INFO L432 NwaCegarLoop]: 1268 mSDtfsCounter, 567 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2237 mSolverCounterSat, 435 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 567 SdHoareTripleChecker+Valid, 1275 SdHoareTripleChecker+Invalid, 2672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 435 IncrementalHoareTripleChecker+Valid, 2237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-10 23:22:32,561 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [567 Valid, 1275 Invalid, 2672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [435 Valid, 2237 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-10 23:22:32,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113404 states. [2024-10-10 23:22:33,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113404 to 113404. [2024-10-10 23:22:33,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113404 states, 113403 states have (on average 1.085932470922286) internal successors, (123148), 113403 states have internal predecessors, (123148), 0 states have call successors, (0), 0 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-10 23:22:33,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113404 states to 113404 states and 123148 transitions. [2024-10-10 23:22:33,816 INFO L78 Accepts]: Start accepts. Automaton has 113404 states and 123148 transitions. Word has length 515 [2024-10-10 23:22:33,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:22:33,817 INFO L471 AbstractCegarLoop]: Abstraction has 113404 states and 123148 transitions. [2024-10-10 23:22:33,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 133.33333333333334) internal successors, (400), 3 states have internal predecessors, (400), 0 states have call successors, (0), 0 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-10 23:22:33,817 INFO L276 IsEmpty]: Start isEmpty. Operand 113404 states and 123148 transitions. [2024-10-10 23:22:33,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 521 [2024-10-10 23:22:33,827 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:22:33,827 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-10-10 23:22:33,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-10 23:22:33,827 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:22:33,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:22:33,828 INFO L85 PathProgramCache]: Analyzing trace with hash -1647238133, now seen corresponding path program 1 times [2024-10-10 23:22:33,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:22:33,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387965054] [2024-10-10 23:22:33,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:22:33,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:22:34,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:22:34,408 INFO L134 CoverageAnalysis]: Checked inductivity of 809 backedges. 641 proven. 0 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2024-10-10 23:22:34,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:22:34,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387965054] [2024-10-10 23:22:34,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387965054] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:22:34,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:22:34,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:22:34,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788874945] [2024-10-10 23:22:34,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:22:34,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:22:34,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:22:34,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:22:34,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:22:34,410 INFO L87 Difference]: Start difference. First operand 113404 states and 123148 transitions. Second operand has 3 states, 3 states have (on average 118.0) internal successors, (354), 3 states have internal predecessors, (354), 0 states have call successors, (0), 0 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-10 23:22:37,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:22:37,289 INFO L93 Difference]: Finished difference Result 268863 states and 291866 transitions. [2024-10-10 23:22:37,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:22:37,289 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 118.0) internal successors, (354), 3 states have internal predecessors, (354), 0 states have call successors, (0), 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 520 [2024-10-10 23:22:37,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:22:37,483 INFO L225 Difference]: With dead ends: 268863 [2024-10-10 23:22:37,483 INFO L226 Difference]: Without dead ends: 156211 [2024-10-10 23:22:37,749 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-10 23:22:37,749 INFO L432 NwaCegarLoop]: 1288 mSDtfsCounter, 685 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2154 mSolverCounterSat, 517 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 685 SdHoareTripleChecker+Valid, 1295 SdHoareTripleChecker+Invalid, 2671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 517 IncrementalHoareTripleChecker+Valid, 2154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-10 23:22:37,749 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [685 Valid, 1295 Invalid, 2671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [517 Valid, 2154 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-10 23:22:37,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156211 states. [2024-10-10 23:22:38,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156211 to 149452. [2024-10-10 23:22:39,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149452 states, 149451 states have (on average 1.0751885233287164) internal successors, (160688), 149451 states have internal predecessors, (160688), 0 states have call successors, (0), 0 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-10 23:22:39,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149452 states to 149452 states and 160688 transitions. [2024-10-10 23:22:39,576 INFO L78 Accepts]: Start accepts. Automaton has 149452 states and 160688 transitions. Word has length 520 [2024-10-10 23:22:39,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:22:39,577 INFO L471 AbstractCegarLoop]: Abstraction has 149452 states and 160688 transitions. [2024-10-10 23:22:39,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 118.0) internal successors, (354), 3 states have internal predecessors, (354), 0 states have call successors, (0), 0 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-10 23:22:39,577 INFO L276 IsEmpty]: Start isEmpty. Operand 149452 states and 160688 transitions. [2024-10-10 23:22:39,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 533 [2024-10-10 23:22:39,587 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:22:39,588 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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] [2024-10-10 23:22:39,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-10 23:22:39,588 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:22:39,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:22:39,588 INFO L85 PathProgramCache]: Analyzing trace with hash 255433516, now seen corresponding path program 1 times [2024-10-10 23:22:39,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:22:39,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398850612] [2024-10-10 23:22:39,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:22:39,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:22:39,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:22:40,205 INFO L134 CoverageAnalysis]: Checked inductivity of 1005 backedges. 700 proven. 0 refuted. 0 times theorem prover too weak. 305 trivial. 0 not checked. [2024-10-10 23:22:40,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:22:40,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398850612] [2024-10-10 23:22:40,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398850612] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:22:40,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:22:40,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:22:40,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31859995] [2024-10-10 23:22:40,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:22:40,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:22:40,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:22:40,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:22:40,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:22:40,208 INFO L87 Difference]: Start difference. First operand 149452 states and 160688 transitions. Second operand has 3 states, 3 states have (on average 99.33333333333333) internal successors, (298), 3 states have internal predecessors, (298), 0 states have call successors, (0), 0 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-10 23:22:43,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:22:43,118 INFO L93 Difference]: Finished difference Result 325939 states and 351131 transitions. [2024-10-10 23:22:43,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:22:43,118 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 99.33333333333333) internal successors, (298), 3 states have internal predecessors, (298), 0 states have call successors, (0), 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 532 [2024-10-10 23:22:43,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:22:43,330 INFO L225 Difference]: With dead ends: 325939 [2024-10-10 23:22:43,331 INFO L226 Difference]: Without dead ends: 177239 [2024-10-10 23:22:43,379 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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-10 23:22:43,380 INFO L432 NwaCegarLoop]: 926 mSDtfsCounter, 796 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2147 mSolverCounterSat, 583 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 796 SdHoareTripleChecker+Valid, 932 SdHoareTripleChecker+Invalid, 2730 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 583 IncrementalHoareTripleChecker+Valid, 2147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-10 23:22:43,380 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [796 Valid, 932 Invalid, 2730 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [583 Valid, 2147 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-10 23:22:43,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177239 states. [2024-10-10 23:22:45,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177239 to 168978. [2024-10-10 23:22:45,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168978 states, 168977 states have (on average 1.0715304449718008) internal successors, (181064), 168977 states have internal predecessors, (181064), 0 states have call successors, (0), 0 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-10 23:22:45,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168978 states to 168978 states and 181064 transitions. [2024-10-10 23:22:45,352 INFO L78 Accepts]: Start accepts. Automaton has 168978 states and 181064 transitions. Word has length 532 [2024-10-10 23:22:45,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:22:45,352 INFO L471 AbstractCegarLoop]: Abstraction has 168978 states and 181064 transitions. [2024-10-10 23:22:45,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 99.33333333333333) internal successors, (298), 3 states have internal predecessors, (298), 0 states have call successors, (0), 0 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-10 23:22:45,352 INFO L276 IsEmpty]: Start isEmpty. Operand 168978 states and 181064 transitions. [2024-10-10 23:22:45,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 538 [2024-10-10 23:22:45,361 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:22:45,361 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-10-10 23:22:45,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-10 23:22:45,361 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:22:45,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:22:45,362 INFO L85 PathProgramCache]: Analyzing trace with hash -2100084216, now seen corresponding path program 1 times [2024-10-10 23:22:45,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:22:45,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047875194] [2024-10-10 23:22:45,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:22:45,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:22:45,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:22:45,990 INFO L134 CoverageAnalysis]: Checked inductivity of 865 backedges. 715 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2024-10-10 23:22:45,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:22:45,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047875194] [2024-10-10 23:22:45,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047875194] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:22:45,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:22:45,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:22:45,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207676360] [2024-10-10 23:22:45,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:22:45,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:22:45,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:22:45,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:22:45,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:22:45,993 INFO L87 Difference]: Start difference. First operand 168978 states and 181064 transitions. Second operand has 3 states, 3 states have (on average 129.66666666666666) internal successors, (389), 3 states have internal predecessors, (389), 0 states have call successors, (0), 0 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-10 23:22:48,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:22:48,979 INFO L93 Difference]: Finished difference Result 340208 states and 364396 transitions. [2024-10-10 23:22:48,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:22:48,979 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 129.66666666666666) internal successors, (389), 3 states have internal predecessors, (389), 0 states have call successors, (0), 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 537 [2024-10-10 23:22:48,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:22:49,197 INFO L225 Difference]: With dead ends: 340208 [2024-10-10 23:22:49,197 INFO L226 Difference]: Without dead ends: 171982 [2024-10-10 23:22:49,271 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-10 23:22:49,271 INFO L432 NwaCegarLoop]: 218 mSDtfsCounter, 760 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2233 mSolverCounterSat, 400 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 760 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 2633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 400 IncrementalHoareTripleChecker+Valid, 2233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-10 23:22:49,272 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [760 Valid, 224 Invalid, 2633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [400 Valid, 2233 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-10 23:22:49,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171982 states. [2024-10-10 23:22:51,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171982 to 168978. [2024-10-10 23:22:51,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168978 states, 168977 states have (on average 1.0563627002491462) internal successors, (178501), 168977 states have internal predecessors, (178501), 0 states have call successors, (0), 0 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-10 23:22:51,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168978 states to 168978 states and 178501 transitions. [2024-10-10 23:22:51,415 INFO L78 Accepts]: Start accepts. Automaton has 168978 states and 178501 transitions. Word has length 537 [2024-10-10 23:22:51,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:22:51,415 INFO L471 AbstractCegarLoop]: Abstraction has 168978 states and 178501 transitions. [2024-10-10 23:22:51,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 129.66666666666666) internal successors, (389), 3 states have internal predecessors, (389), 0 states have call successors, (0), 0 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-10 23:22:51,416 INFO L276 IsEmpty]: Start isEmpty. Operand 168978 states and 178501 transitions. [2024-10-10 23:22:51,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 575 [2024-10-10 23:22:51,426 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:22:51,426 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:22:51,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-10 23:22:51,427 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:22:51,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:22:51,427 INFO L85 PathProgramCache]: Analyzing trace with hash 775702601, now seen corresponding path program 1 times [2024-10-10 23:22:51,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:22:51,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811271253] [2024-10-10 23:22:51,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:22:51,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:22:51,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:22:51,702 INFO L134 CoverageAnalysis]: Checked inductivity of 948 backedges. 574 proven. 0 refuted. 0 times theorem prover too weak. 374 trivial. 0 not checked. [2024-10-10 23:22:51,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:22:51,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811271253] [2024-10-10 23:22:51,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811271253] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:22:51,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:22:51,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:22:51,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477344056] [2024-10-10 23:22:51,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:22:51,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:22:51,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:22:51,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:22:51,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:22:51,704 INFO L87 Difference]: Start difference. First operand 168978 states and 178501 transitions. Second operand has 3 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 0 states have call successors, (0), 0 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-10 23:22:55,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:22:55,408 INFO L93 Difference]: Finished difference Result 370999 states and 392352 transitions. [2024-10-10 23:22:55,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:22:55,409 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 0 states have call successors, (0), 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 574 [2024-10-10 23:22:55,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:22:55,696 INFO L225 Difference]: With dead ends: 370999 [2024-10-10 23:22:55,696 INFO L226 Difference]: Without dead ends: 202773 [2024-10-10 23:22:55,777 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-10 23:22:55,778 INFO L432 NwaCegarLoop]: 1232 mSDtfsCounter, 668 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2497 mSolverCounterSat, 380 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 668 SdHoareTripleChecker+Valid, 1239 SdHoareTripleChecker+Invalid, 2877 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 380 IncrementalHoareTripleChecker+Valid, 2497 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-10-10 23:22:55,778 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [668 Valid, 1239 Invalid, 2877 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [380 Valid, 2497 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-10-10 23:22:55,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202773 states. [2024-10-10 23:22:57,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202773 to 199769. [2024-10-10 23:22:57,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199769 states, 199768 states have (on average 1.0550288334467983) internal successors, (210761), 199768 states have internal predecessors, (210761), 0 states have call successors, (0), 0 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-10 23:22:58,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199769 states to 199769 states and 210761 transitions. [2024-10-10 23:22:58,179 INFO L78 Accepts]: Start accepts. Automaton has 199769 states and 210761 transitions. Word has length 574 [2024-10-10 23:22:58,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:22:58,180 INFO L471 AbstractCegarLoop]: Abstraction has 199769 states and 210761 transitions. [2024-10-10 23:22:58,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 0 states have call successors, (0), 0 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-10 23:22:58,180 INFO L276 IsEmpty]: Start isEmpty. Operand 199769 states and 210761 transitions. [2024-10-10 23:22:58,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 591 [2024-10-10 23:22:58,190 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:22:58,191 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:22:58,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-10 23:22:58,191 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:22:58,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:22:58,191 INFO L85 PathProgramCache]: Analyzing trace with hash 806421796, now seen corresponding path program 1 times [2024-10-10 23:22:58,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:22:58,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651989968] [2024-10-10 23:22:58,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:22:58,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:22:58,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:22:58,389 INFO L134 CoverageAnalysis]: Checked inductivity of 931 backedges. 781 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2024-10-10 23:22:58,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:22:58,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651989968] [2024-10-10 23:22:58,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651989968] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:22:58,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:22:58,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:22:58,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636325730] [2024-10-10 23:22:58,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:22:58,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:22:58,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:22:58,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:22:58,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:22:58,391 INFO L87 Difference]: Start difference. First operand 199769 states and 210761 transitions. Second operand has 3 states, 3 states have (on average 147.33333333333334) internal successors, (442), 3 states have internal predecessors, (442), 0 states have call successors, (0), 0 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-10 23:23:01,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:23:01,659 INFO L93 Difference]: Finished difference Result 400288 states and 422138 transitions. [2024-10-10 23:23:01,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:23:01,659 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 147.33333333333334) internal successors, (442), 3 states have internal predecessors, (442), 0 states have call successors, (0), 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 590 [2024-10-10 23:23:01,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:23:02,447 INFO L225 Difference]: With dead ends: 400288 [2024-10-10 23:23:02,447 INFO L226 Difference]: Without dead ends: 200520 [2024-10-10 23:23:02,531 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-10 23:23:02,531 INFO L432 NwaCegarLoop]: 1003 mSDtfsCounter, 761 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2087 mSolverCounterSat, 560 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 761 SdHoareTripleChecker+Valid, 1009 SdHoareTripleChecker+Invalid, 2647 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 560 IncrementalHoareTripleChecker+Valid, 2087 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-10 23:23:02,532 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [761 Valid, 1009 Invalid, 2647 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [560 Valid, 2087 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-10 23:23:02,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200520 states.