./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem12_label06.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem12_label06.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 b8e390e3329fd730c72061af7f4f756de3cffbc4334952b16b06779e5db77927 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-08 23:44:05,300 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-08 23:44:05,364 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-08 23:44:05,368 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-08 23:44:05,369 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-08 23:44:05,388 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-08 23:44:05,389 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-08 23:44:05,389 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-08 23:44:05,389 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-08 23:44:05,389 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-08 23:44:05,389 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-08 23:44:05,389 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-08 23:44:05,390 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-08 23:44:05,390 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-08 23:44:05,390 INFO L153 SettingsManager]: * Use SBE=true [2025-01-08 23:44:05,390 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-08 23:44:05,390 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-08 23:44:05,390 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-08 23:44:05,390 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-08 23:44:05,390 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-08 23:44:05,390 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-08 23:44:05,390 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-08 23:44:05,391 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-08 23:44:05,391 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-08 23:44:05,391 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-08 23:44:05,391 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-08 23:44:05,391 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-08 23:44:05,391 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-08 23:44:05,391 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-08 23:44:05,391 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 23:44:05,391 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 23:44:05,391 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 23:44:05,391 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 23:44:05,391 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-08 23:44:05,392 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 23:44:05,392 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 23:44:05,392 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 23:44:05,392 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 23:44:05,392 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-08 23:44:05,392 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-08 23:44:05,392 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-08 23:44:05,392 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-08 23:44:05,392 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-08 23:44:05,392 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-08 23:44:05,392 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-08 23:44:05,393 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-08 23:44:05,393 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-08 23:44:05,393 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-08 23:44:05,393 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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-jdk21/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 -> b8e390e3329fd730c72061af7f4f756de3cffbc4334952b16b06779e5db77927 [2025-01-08 23:44:05,670 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-08 23:44:05,681 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-08 23:44:05,683 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-08 23:44:05,684 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-08 23:44:05,685 INFO L274 PluginConnector]: CDTParser initialized [2025-01-08 23:44:05,686 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem12_label06.c [2025-01-08 23:44:07,048 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/05a095fc4/5cb5608b21ea4326be544076ffc0fa30/FLAGc9c85175a [2025-01-08 23:44:07,515 INFO L384 CDTParser]: Found 1 translation units. [2025-01-08 23:44:07,516 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label06.c [2025-01-08 23:44:07,557 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/05a095fc4/5cb5608b21ea4326be544076ffc0fa30/FLAGc9c85175a [2025-01-08 23:44:07,623 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/05a095fc4/5cb5608b21ea4326be544076ffc0fa30 [2025-01-08 23:44:07,626 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-08 23:44:07,628 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-08 23:44:07,630 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-08 23:44:07,630 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-08 23:44:07,634 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-08 23:44:07,635 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 11:44:07" (1/1) ... [2025-01-08 23:44:07,636 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16cb066b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:44:07, skipping insertion in model container [2025-01-08 23:44:07,636 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 11:44:07" (1/1) ... [2025-01-08 23:44:07,729 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-08 23:44:07,944 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label06.c[3178,3191] [2025-01-08 23:44:08,673 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 23:44:08,687 INFO L200 MainTranslator]: Completed pre-run [2025-01-08 23:44:08,702 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label06.c[3178,3191] [2025-01-08 23:44:09,027 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 23:44:09,049 INFO L204 MainTranslator]: Completed translation [2025-01-08 23:44:09,052 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:44:09 WrapperNode [2025-01-08 23:44:09,053 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-08 23:44:09,054 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-08 23:44:09,054 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-08 23:44:09,055 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-08 23:44:09,060 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:44:09" (1/1) ... [2025-01-08 23:44:09,124 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:44:09" (1/1) ... [2025-01-08 23:44:09,461 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 4758 [2025-01-08 23:44:09,462 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-08 23:44:09,463 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-08 23:44:09,464 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-08 23:44:09,464 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-08 23:44:09,519 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:44:09" (1/1) ... [2025-01-08 23:44:09,520 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:44:09" (1/1) ... [2025-01-08 23:44:09,573 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:44:09" (1/1) ... [2025-01-08 23:44:09,741 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]. [2025-01-08 23:44:09,741 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:44:09" (1/1) ... [2025-01-08 23:44:09,742 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:44:09" (1/1) ... [2025-01-08 23:44:09,866 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:44:09" (1/1) ... [2025-01-08 23:44:09,884 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:44:09" (1/1) ... [2025-01-08 23:44:09,911 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:44:09" (1/1) ... [2025-01-08 23:44:09,967 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:44:09" (1/1) ... [2025-01-08 23:44:09,988 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:44:09" (1/1) ... [2025-01-08 23:44:10,037 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-08 23:44:10,038 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-08 23:44:10,039 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-08 23:44:10,039 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-08 23:44:10,040 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:44:09" (1/1) ... [2025-01-08 23:44:10,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 23:44:10,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:44:10,073 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-08 23:44:10,077 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-08 23:44:10,098 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-08 23:44:10,098 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-08 23:44:10,098 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-08 23:44:10,098 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-08 23:44:10,160 INFO L234 CfgBuilder]: Building ICFG [2025-01-08 23:44:10,162 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-08 23:44:14,686 INFO L? ?]: Removed 702 outVars from TransFormulas that were not future-live. [2025-01-08 23:44:14,686 INFO L283 CfgBuilder]: Performing block encoding [2025-01-08 23:44:14,724 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-08 23:44:14,724 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-08 23:44:14,725 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 11:44:14 BoogieIcfgContainer [2025-01-08 23:44:14,725 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-08 23:44:14,727 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-08 23:44:14,727 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-08 23:44:14,734 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-08 23:44:14,734 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.01 11:44:07" (1/3) ... [2025-01-08 23:44:14,735 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@403b0f26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 11:44:14, skipping insertion in model container [2025-01-08 23:44:14,735 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:44:09" (2/3) ... [2025-01-08 23:44:14,736 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@403b0f26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 11:44:14, skipping insertion in model container [2025-01-08 23:44:14,737 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 11:44:14" (3/3) ... [2025-01-08 23:44:14,738 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem12_label06.c [2025-01-08 23:44:14,751 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-08 23:44:14,753 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem12_label06.c that has 1 procedures, 818 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-08 23:44:14,829 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-08 23:44:14,840 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;@3cbb1e43, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-08 23:44:14,841 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-08 23:44:14,847 INFO L276 IsEmpty]: Start isEmpty. Operand has 818 states, 816 states have (on average 1.9166666666666667) internal successors, (1564), 817 states have internal predecessors, (1564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:44:14,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-01-08 23:44:14,853 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:44:14,853 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:44:14,854 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:44:14,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:44:14,858 INFO L85 PathProgramCache]: Analyzing trace with hash -1665321012, now seen corresponding path program 1 times [2025-01-08 23:44:14,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:44:14,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6814847] [2025-01-08 23:44:14,865 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:44:14,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:44:14,929 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-08 23:44:14,956 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-08 23:44:14,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:44:14,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:44:15,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:44:15,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:44:15,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6814847] [2025-01-08 23:44:15,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6814847] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:44:15,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:44:15,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:44:15,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974544912] [2025-01-08 23:44:15,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:44:15,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:44:15,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:44:15,141 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:44:15,141 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:44:15,145 INFO L87 Difference]: Start difference. First operand has 818 states, 816 states have (on average 1.9166666666666667) internal successors, (1564), 817 states have internal predecessors, (1564), 0 states have call successors, (0), 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 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 2 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:44:18,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:44:18,305 INFO L93 Difference]: Finished difference Result 2388 states and 4626 transitions. [2025-01-08 23:44:18,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:44:18,308 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 2 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2025-01-08 23:44:18,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:44:18,329 INFO L225 Difference]: With dead ends: 2388 [2025-01-08 23:44:18,329 INFO L226 Difference]: Without dead ends: 1506 [2025-01-08 23:44:18,335 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:44:18,337 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 874 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 2437 mSolverCounterSat, 771 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 874 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 3208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 771 IncrementalHoareTripleChecker+Valid, 2437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2025-01-08 23:44:18,337 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [874 Valid, 156 Invalid, 3208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [771 Valid, 2437 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2025-01-08 23:44:18,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1506 states. [2025-01-08 23:44:18,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1506 to 1506. [2025-01-08 23:44:18,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1506 states, 1505 states have (on average 1.8458471760797341) internal successors, (2778), 1505 states have internal predecessors, (2778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:44:18,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1506 states to 1506 states and 2778 transitions. [2025-01-08 23:44:18,448 INFO L78 Accepts]: Start accepts. Automaton has 1506 states and 2778 transitions. Word has length 23 [2025-01-08 23:44:18,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:44:18,449 INFO L471 AbstractCegarLoop]: Abstraction has 1506 states and 2778 transitions. [2025-01-08 23:44:18,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 2 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:44:18,449 INFO L276 IsEmpty]: Start isEmpty. Operand 1506 states and 2778 transitions. [2025-01-08 23:44:18,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-01-08 23:44:18,453 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:44:18,453 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-08 23:44:18,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-08 23:44:18,454 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:44:18,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:44:18,455 INFO L85 PathProgramCache]: Analyzing trace with hash 998755806, now seen corresponding path program 1 times [2025-01-08 23:44:18,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:44:18,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746545297] [2025-01-08 23:44:18,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:44:18,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:44:18,478 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-01-08 23:44:18,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-01-08 23:44:18,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:44:18,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:44:18,732 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:44:18,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:44:18,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746545297] [2025-01-08 23:44:18,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746545297] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:44:18,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:44:18,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:44:18,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393922278] [2025-01-08 23:44:18,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:44:18,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:44:18,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:44:18,736 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:44:18,736 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:44:18,736 INFO L87 Difference]: Start difference. First operand 1506 states and 2778 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 2 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:44:21,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:44:21,588 INFO L93 Difference]: Finished difference Result 3761 states and 6893 transitions. [2025-01-08 23:44:21,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:44:21,589 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 2 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 92 [2025-01-08 23:44:21,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:44:21,615 INFO L225 Difference]: With dead ends: 3761 [2025-01-08 23:44:21,615 INFO L226 Difference]: Without dead ends: 2257 [2025-01-08 23:44:21,623 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:44:21,623 INFO L435 NwaCegarLoop]: 442 mSDtfsCounter, 780 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1995 mSolverCounterSat, 864 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 780 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 2859 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 864 IncrementalHoareTripleChecker+Valid, 1995 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-01-08 23:44:21,624 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [780 Valid, 448 Invalid, 2859 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [864 Valid, 1995 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-01-08 23:44:21,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2257 states. [2025-01-08 23:44:21,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2257 to 2257. [2025-01-08 23:44:21,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2257 states, 2256 states have (on average 1.4419326241134751) internal successors, (3253), 2256 states have internal predecessors, (3253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:44:21,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2257 states to 2257 states and 3253 transitions. [2025-01-08 23:44:21,696 INFO L78 Accepts]: Start accepts. Automaton has 2257 states and 3253 transitions. Word has length 92 [2025-01-08 23:44:21,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:44:21,696 INFO L471 AbstractCegarLoop]: Abstraction has 2257 states and 3253 transitions. [2025-01-08 23:44:21,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 2 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:44:21,697 INFO L276 IsEmpty]: Start isEmpty. Operand 2257 states and 3253 transitions. [2025-01-08 23:44:21,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-01-08 23:44:21,698 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:44:21,698 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-08 23:44:21,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-08 23:44:21,699 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:44:21,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:44:21,699 INFO L85 PathProgramCache]: Analyzing trace with hash 1021820963, now seen corresponding path program 1 times [2025-01-08 23:44:21,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:44:21,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919684129] [2025-01-08 23:44:21,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:44:21,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:44:21,712 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-01-08 23:44:21,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-01-08 23:44:21,724 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:44:21,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:44:21,870 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-01-08 23:44:21,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:44:21,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919684129] [2025-01-08 23:44:21,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919684129] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:44:21,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:44:21,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:44:21,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005706051] [2025-01-08 23:44:21,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:44:21,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:44:21,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:44:21,872 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:44:21,872 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:44:21,872 INFO L87 Difference]: Start difference. First operand 2257 states and 3253 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 2 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:44:24,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:44:24,533 INFO L93 Difference]: Finished difference Result 6765 states and 9754 transitions. [2025-01-08 23:44:24,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:44:24,534 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 2 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2025-01-08 23:44:24,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:44:24,553 INFO L225 Difference]: With dead ends: 6765 [2025-01-08 23:44:24,553 INFO L226 Difference]: Without dead ends: 4510 [2025-01-08 23:44:24,556 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:44:24,558 INFO L435 NwaCegarLoop]: 611 mSDtfsCounter, 726 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2338 mSolverCounterSat, 630 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 726 SdHoareTripleChecker+Valid, 618 SdHoareTripleChecker+Invalid, 2968 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 630 IncrementalHoareTripleChecker+Valid, 2338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-01-08 23:44:24,558 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [726 Valid, 618 Invalid, 2968 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [630 Valid, 2338 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-01-08 23:44:24,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4510 states. [2025-01-08 23:44:24,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4510 to 4510. [2025-01-08 23:44:24,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4510 states, 4509 states have (on average 1.2929696163229096) internal successors, (5830), 4509 states have internal predecessors, (5830), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:44:24,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4510 states to 4510 states and 5830 transitions. [2025-01-08 23:44:24,637 INFO L78 Accepts]: Start accepts. Automaton has 4510 states and 5830 transitions. Word has length 94 [2025-01-08 23:44:24,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:44:24,638 INFO L471 AbstractCegarLoop]: Abstraction has 4510 states and 5830 transitions. [2025-01-08 23:44:24,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 2 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:44:24,639 INFO L276 IsEmpty]: Start isEmpty. Operand 4510 states and 5830 transitions. [2025-01-08 23:44:24,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-01-08 23:44:24,642 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:44:24,642 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-08 23:44:24,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-08 23:44:24,642 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:44:24,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:44:24,643 INFO L85 PathProgramCache]: Analyzing trace with hash 1916538610, now seen corresponding path program 1 times [2025-01-08 23:44:24,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:44:24,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052801397] [2025-01-08 23:44:24,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:44:24,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:44:24,660 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-01-08 23:44:24,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-01-08 23:44:24,679 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:44:24,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:44:24,928 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:44:24,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:44:24,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052801397] [2025-01-08 23:44:24,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052801397] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:44:24,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:44:24,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:44:24,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602672220] [2025-01-08 23:44:24,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:44:24,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 23:44:24,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:44:24,931 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 23:44:24,931 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:44:24,931 INFO L87 Difference]: Start difference. First operand 4510 states and 5830 transitions. Second operand has 4 states, 4 states have (on average 25.0) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:44:28,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:44:28,779 INFO L93 Difference]: Finished difference Result 14275 states and 18284 transitions. [2025-01-08 23:44:28,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 23:44:28,780 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2025-01-08 23:44:28,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:44:28,811 INFO L225 Difference]: With dead ends: 14275 [2025-01-08 23:44:28,812 INFO L226 Difference]: Without dead ends: 9767 [2025-01-08 23:44:28,817 INFO L434 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 [2025-01-08 23:44:28,819 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 2182 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 4712 mSolverCounterSat, 711 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2182 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 5423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 711 IncrementalHoareTripleChecker+Valid, 4712 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2025-01-08 23:44:28,820 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2182 Valid, 164 Invalid, 5423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [711 Valid, 4712 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2025-01-08 23:44:28,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9767 states. [2025-01-08 23:44:28,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9767 to 9767. [2025-01-08 23:44:28,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9767 states, 9766 states have (on average 1.255785377841491) internal successors, (12264), 9766 states have internal predecessors, (12264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:44:28,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9767 states to 9767 states and 12264 transitions. [2025-01-08 23:44:28,987 INFO L78 Accepts]: Start accepts. Automaton has 9767 states and 12264 transitions. Word has length 100 [2025-01-08 23:44:28,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:44:28,988 INFO L471 AbstractCegarLoop]: Abstraction has 9767 states and 12264 transitions. [2025-01-08 23:44:28,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:44:28,989 INFO L276 IsEmpty]: Start isEmpty. Operand 9767 states and 12264 transitions. [2025-01-08 23:44:28,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-01-08 23:44:28,994 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:44:28,994 INFO L218 NwaCegarLoop]: trace histogram [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, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:44:28,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-08 23:44:28,995 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:44:28,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:44:28,995 INFO L85 PathProgramCache]: Analyzing trace with hash 1763787771, now seen corresponding path program 1 times [2025-01-08 23:44:28,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:44:28,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630971608] [2025-01-08 23:44:28,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:44:28,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:44:29,023 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-01-08 23:44:29,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-01-08 23:44:29,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:44:29,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:44:29,434 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:44:29,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:44:29,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630971608] [2025-01-08 23:44:29,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630971608] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:44:29,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:44:29,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:44:29,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429157114] [2025-01-08 23:44:29,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:44:29,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 23:44:29,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:44:29,437 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 23:44:29,437 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:44:29,438 INFO L87 Difference]: Start difference. First operand 9767 states and 12264 transitions. Second operand has 4 states, 4 states have (on average 42.75) internal successors, (171), 3 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:44:32,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:44:32,099 INFO L93 Difference]: Finished difference Result 21822 states and 27290 transitions. [2025-01-08 23:44:32,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 23:44:32,100 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 42.75) internal successors, (171), 3 states have internal predecessors, (171), 0 states have call successors, (0), 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 171 [2025-01-08 23:44:32,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:44:32,130 INFO L225 Difference]: With dead ends: 21822 [2025-01-08 23:44:32,130 INFO L226 Difference]: Without dead ends: 12771 [2025-01-08 23:44:32,138 INFO L434 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 [2025-01-08 23:44:32,139 INFO L435 NwaCegarLoop]: 598 mSDtfsCounter, 702 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 3049 mSolverCounterSat, 266 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 702 SdHoareTripleChecker+Valid, 612 SdHoareTripleChecker+Invalid, 3315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 266 IncrementalHoareTripleChecker+Valid, 3049 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-01-08 23:44:32,139 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [702 Valid, 612 Invalid, 3315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [266 Valid, 3049 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-01-08 23:44:32,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12771 states. [2025-01-08 23:44:32,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12771 to 12020. [2025-01-08 23:44:32,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12020 states, 12019 states have (on average 1.2085032032615026) internal successors, (14525), 12019 states have internal predecessors, (14525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:44:32,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12020 states to 12020 states and 14525 transitions. [2025-01-08 23:44:32,343 INFO L78 Accepts]: Start accepts. Automaton has 12020 states and 14525 transitions. Word has length 171 [2025-01-08 23:44:32,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:44:32,344 INFO L471 AbstractCegarLoop]: Abstraction has 12020 states and 14525 transitions. [2025-01-08 23:44:32,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 42.75) internal successors, (171), 3 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:44:32,344 INFO L276 IsEmpty]: Start isEmpty. Operand 12020 states and 14525 transitions. [2025-01-08 23:44:32,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2025-01-08 23:44:32,347 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:44:32,348 INFO L218 NwaCegarLoop]: trace histogram [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, 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] [2025-01-08 23:44:32,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-08 23:44:32,348 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:44:32,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:44:32,349 INFO L85 PathProgramCache]: Analyzing trace with hash -904862307, now seen corresponding path program 1 times [2025-01-08 23:44:32,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:44:32,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011867441] [2025-01-08 23:44:32,351 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:44:32,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:44:32,379 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 235 statements into 1 equivalence classes. [2025-01-08 23:44:32,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 235 of 235 statements. [2025-01-08 23:44:32,407 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:44:32,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:44:32,563 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-01-08 23:44:32,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:44:32,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011867441] [2025-01-08 23:44:32,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011867441] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:44:32,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:44:32,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:44:32,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872095726] [2025-01-08 23:44:32,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:44:32,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:44:32,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:44:32,565 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:44:32,565 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:44:32,566 INFO L87 Difference]: Start difference. First operand 12020 states and 14525 transitions. Second operand has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:44:35,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:44:35,308 INFO L93 Difference]: Finished difference Result 27793 states and 34552 transitions. [2025-01-08 23:44:35,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:44:35,308 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 0 states have call successors, (0), 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 235 [2025-01-08 23:44:35,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:44:35,344 INFO L225 Difference]: With dead ends: 27793 [2025-01-08 23:44:35,345 INFO L226 Difference]: Without dead ends: 16526 [2025-01-08 23:44:35,358 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:44:35,359 INFO L435 NwaCegarLoop]: 488 mSDtfsCounter, 763 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2218 mSolverCounterSat, 626 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 763 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 2844 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 626 IncrementalHoareTripleChecker+Valid, 2218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-01-08 23:44:35,359 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [763 Valid, 495 Invalid, 2844 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [626 Valid, 2218 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-01-08 23:44:35,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16526 states. [2025-01-08 23:44:35,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16526 to 12020. [2025-01-08 23:44:35,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12020 states, 12019 states have (on average 1.2085032032615026) internal successors, (14525), 12019 states have internal predecessors, (14525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:44:35,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12020 states to 12020 states and 14525 transitions. [2025-01-08 23:44:35,612 INFO L78 Accepts]: Start accepts. Automaton has 12020 states and 14525 transitions. Word has length 235 [2025-01-08 23:44:35,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:44:35,613 INFO L471 AbstractCegarLoop]: Abstraction has 12020 states and 14525 transitions. [2025-01-08 23:44:35,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:44:35,614 INFO L276 IsEmpty]: Start isEmpty. Operand 12020 states and 14525 transitions. [2025-01-08 23:44:35,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2025-01-08 23:44:35,617 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:44:35,617 INFO L218 NwaCegarLoop]: trace histogram [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, 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] [2025-01-08 23:44:35,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-08 23:44:35,618 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:44:35,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:44:35,618 INFO L85 PathProgramCache]: Analyzing trace with hash -1199248855, now seen corresponding path program 1 times [2025-01-08 23:44:35,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:44:35,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007493136] [2025-01-08 23:44:35,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:44:35,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:44:35,643 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 236 statements into 1 equivalence classes. [2025-01-08 23:44:35,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 236 of 236 statements. [2025-01-08 23:44:35,663 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:44:35,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:44:35,815 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2025-01-08 23:44:35,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:44:35,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007493136] [2025-01-08 23:44:35,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007493136] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:44:35,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:44:35,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:44:35,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38561977] [2025-01-08 23:44:35,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:44:35,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:44:35,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:44:35,817 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:44:35,817 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:44:35,818 INFO L87 Difference]: Start difference. First operand 12020 states and 14525 transitions. Second operand has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 2 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:44:38,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:44:38,372 INFO L93 Difference]: Finished difference Result 31550 states and 38845 transitions. [2025-01-08 23:44:38,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:44:38,373 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 2 states have internal predecessors, (166), 0 states have call successors, (0), 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 236 [2025-01-08 23:44:38,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:44:38,417 INFO L225 Difference]: With dead ends: 31550 [2025-01-08 23:44:38,418 INFO L226 Difference]: Without dead ends: 20283 [2025-01-08 23:44:38,431 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:44:38,432 INFO L435 NwaCegarLoop]: 305 mSDtfsCounter, 848 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2309 mSolverCounterSat, 466 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 848 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 2775 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 466 IncrementalHoareTripleChecker+Valid, 2309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-01-08 23:44:38,432 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [848 Valid, 312 Invalid, 2775 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [466 Valid, 2309 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-01-08 23:44:38,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20283 states. [2025-01-08 23:44:38,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20283 to 18779. [2025-01-08 23:44:38,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18779 states, 18778 states have (on average 1.1888380019171372) internal successors, (22324), 18778 states have internal predecessors, (22324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:44:38,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18779 states to 18779 states and 22324 transitions. [2025-01-08 23:44:38,833 INFO L78 Accepts]: Start accepts. Automaton has 18779 states and 22324 transitions. Word has length 236 [2025-01-08 23:44:38,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:44:38,833 INFO L471 AbstractCegarLoop]: Abstraction has 18779 states and 22324 transitions. [2025-01-08 23:44:38,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 2 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:44:38,834 INFO L276 IsEmpty]: Start isEmpty. Operand 18779 states and 22324 transitions. [2025-01-08 23:44:38,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2025-01-08 23:44:38,849 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:44:38,850 INFO L218 NwaCegarLoop]: trace histogram [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, 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] [2025-01-08 23:44:38,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-08 23:44:38,851 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:44:38,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:44:38,851 INFO L85 PathProgramCache]: Analyzing trace with hash 765070900, now seen corresponding path program 1 times [2025-01-08 23:44:38,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:44:38,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972165403] [2025-01-08 23:44:38,852 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:44:38,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:44:38,935 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 322 statements into 1 equivalence classes. [2025-01-08 23:44:38,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 322 of 322 statements. [2025-01-08 23:44:38,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:44:38,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:44:39,244 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 199 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-01-08 23:44:39,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:44:39,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972165403] [2025-01-08 23:44:39,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972165403] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:44:39,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:44:39,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:44:39,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729838920] [2025-01-08 23:44:39,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:44:39,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:44:39,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:44:39,247 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:44:39,247 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:44:39,247 INFO L87 Difference]: Start difference. First operand 18779 states and 22324 transitions. Second operand has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:44:41,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:44:41,918 INFO L93 Difference]: Finished difference Result 43564 states and 53013 transitions. [2025-01-08 23:44:41,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:44:41,919 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 0 states have call successors, (0), 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 322 [2025-01-08 23:44:41,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:44:41,967 INFO L225 Difference]: With dead ends: 43564 [2025-01-08 23:44:41,967 INFO L226 Difference]: Without dead ends: 25538 [2025-01-08 23:44:41,985 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:44:41,986 INFO L435 NwaCegarLoop]: 1208 mSDtfsCounter, 704 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2254 mSolverCounterSat, 439 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 704 SdHoareTripleChecker+Valid, 1216 SdHoareTripleChecker+Invalid, 2693 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 439 IncrementalHoareTripleChecker+Valid, 2254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-01-08 23:44:41,986 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [704 Valid, 1216 Invalid, 2693 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [439 Valid, 2254 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-01-08 23:44:42,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25538 states. [2025-01-08 23:44:42,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25538 to 24036. [2025-01-08 23:44:42,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24036 states, 24035 states have (on average 1.1785313085084252) internal successors, (28326), 24035 states have internal predecessors, (28326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:44:42,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24036 states to 24036 states and 28326 transitions. [2025-01-08 23:44:42,338 INFO L78 Accepts]: Start accepts. Automaton has 24036 states and 28326 transitions. Word has length 322 [2025-01-08 23:44:42,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:44:42,340 INFO L471 AbstractCegarLoop]: Abstraction has 24036 states and 28326 transitions. [2025-01-08 23:44:42,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:44:42,340 INFO L276 IsEmpty]: Start isEmpty. Operand 24036 states and 28326 transitions. [2025-01-08 23:44:42,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2025-01-08 23:44:42,346 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:44:42,346 INFO L218 NwaCegarLoop]: trace histogram [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, 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] [2025-01-08 23:44:42,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-08 23:44:42,347 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:44:42,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:44:42,348 INFO L85 PathProgramCache]: Analyzing trace with hash 632923098, now seen corresponding path program 1 times [2025-01-08 23:44:42,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:44:42,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296827965] [2025-01-08 23:44:42,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:44:42,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:44:42,379 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 350 statements into 1 equivalence classes. [2025-01-08 23:44:42,403 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 350 of 350 statements. [2025-01-08 23:44:42,403 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:44:42,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:44:42,632 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 294 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-01-08 23:44:42,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:44:42,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296827965] [2025-01-08 23:44:42,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296827965] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:44:42,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:44:42,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:44:42,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531229122] [2025-01-08 23:44:42,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:44:42,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:44:42,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:44:42,635 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:44:42,635 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:44:42,635 INFO L87 Difference]: Start difference. First operand 24036 states and 28326 transitions. Second operand has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:44:45,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:44:45,486 INFO L93 Difference]: Finished difference Result 60837 states and 71503 transitions. [2025-01-08 23:44:45,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:44:45,487 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 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 350 [2025-01-08 23:44:45,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:44:45,539 INFO L225 Difference]: With dead ends: 60837 [2025-01-08 23:44:45,539 INFO L226 Difference]: Without dead ends: 37554 [2025-01-08 23:44:45,553 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:44:45,554 INFO L435 NwaCegarLoop]: 1239 mSDtfsCounter, 635 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2625 mSolverCounterSat, 333 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 635 SdHoareTripleChecker+Valid, 1247 SdHoareTripleChecker+Invalid, 2958 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 333 IncrementalHoareTripleChecker+Valid, 2625 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-01-08 23:44:45,554 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [635 Valid, 1247 Invalid, 2958 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [333 Valid, 2625 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-01-08 23:44:45,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37554 states. [2025-01-08 23:44:45,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37554 to 35301. [2025-01-08 23:44:45,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35301 states, 35300 states have (on average 1.1668555240793201) internal successors, (41190), 35300 states have internal predecessors, (41190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:44:46,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35301 states to 35301 states and 41190 transitions. [2025-01-08 23:44:46,037 INFO L78 Accepts]: Start accepts. Automaton has 35301 states and 41190 transitions. Word has length 350 [2025-01-08 23:44:46,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:44:46,038 INFO L471 AbstractCegarLoop]: Abstraction has 35301 states and 41190 transitions. [2025-01-08 23:44:46,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:44:46,038 INFO L276 IsEmpty]: Start isEmpty. Operand 35301 states and 41190 transitions. [2025-01-08 23:44:46,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 355 [2025-01-08 23:44:46,045 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:44:46,045 INFO L218 NwaCegarLoop]: trace histogram [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, 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] [2025-01-08 23:44:46,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-08 23:44:46,047 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:44:46,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:44:46,051 INFO L85 PathProgramCache]: Analyzing trace with hash 2132999140, now seen corresponding path program 1 times [2025-01-08 23:44:46,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:44:46,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588321341] [2025-01-08 23:44:46,051 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:44:46,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:44:46,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 354 statements into 1 equivalence classes. [2025-01-08 23:44:46,107 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 354 of 354 statements. [2025-01-08 23:44:46,108 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:44:46,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:44:46,301 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2025-01-08 23:44:46,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:44:46,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588321341] [2025-01-08 23:44:46,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588321341] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:44:46,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:44:46,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:44:46,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817653371] [2025-01-08 23:44:46,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:44:46,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:44:46,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:44:46,303 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:44:46,303 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:44:46,304 INFO L87 Difference]: Start difference. First operand 35301 states and 41190 transitions. Second operand has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:44:49,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:44:49,650 INFO L93 Difference]: Finished difference Result 102893 states and 120518 transitions. [2025-01-08 23:44:49,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:44:49,651 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 0 states have call successors, (0), 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 354 [2025-01-08 23:44:49,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:44:49,719 INFO L225 Difference]: With dead ends: 102893 [2025-01-08 23:44:49,719 INFO L226 Difference]: Without dead ends: 63839 [2025-01-08 23:44:49,739 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:44:49,740 INFO L435 NwaCegarLoop]: 1307 mSDtfsCounter, 770 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2234 mSolverCounterSat, 620 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 770 SdHoareTripleChecker+Valid, 1315 SdHoareTripleChecker+Invalid, 2854 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 620 IncrementalHoareTripleChecker+Valid, 2234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2025-01-08 23:44:49,741 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [770 Valid, 1315 Invalid, 2854 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [620 Valid, 2234 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2025-01-08 23:44:49,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63839 states. [2025-01-08 23:44:50,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63839 to 53325. [2025-01-08 23:44:50,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53325 states, 53324 states have (on average 1.1311416997974646) internal successors, (60317), 53324 states have internal predecessors, (60317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:44:50,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53325 states to 53325 states and 60317 transitions. [2025-01-08 23:44:50,486 INFO L78 Accepts]: Start accepts. Automaton has 53325 states and 60317 transitions. Word has length 354 [2025-01-08 23:44:50,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:44:50,487 INFO L471 AbstractCegarLoop]: Abstraction has 53325 states and 60317 transitions. [2025-01-08 23:44:50,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:44:50,487 INFO L276 IsEmpty]: Start isEmpty. Operand 53325 states and 60317 transitions. [2025-01-08 23:44:50,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 362 [2025-01-08 23:44:50,499 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:44:50,500 INFO L218 NwaCegarLoop]: trace histogram [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, 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] [2025-01-08 23:44:50,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-08 23:44:50,500 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:44:50,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:44:50,501 INFO L85 PathProgramCache]: Analyzing trace with hash 1641481063, now seen corresponding path program 1 times [2025-01-08 23:44:50,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:44:50,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859030498] [2025-01-08 23:44:50,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:44:50,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:44:50,557 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 361 statements into 1 equivalence classes. [2025-01-08 23:44:50,582 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 361 of 361 statements. [2025-01-08 23:44:50,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:44:50,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:44:50,799 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 254 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-01-08 23:44:50,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:44:50,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859030498] [2025-01-08 23:44:50,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859030498] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:44:50,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:44:50,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:44:50,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887236376] [2025-01-08 23:44:50,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:44:50,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:44:50,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:44:50,803 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:44:50,803 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:44:50,803 INFO L87 Difference]: Start difference. First operand 53325 states and 60317 transitions. Second operand has 3 states, 3 states have (on average 92.66666666666667) internal successors, (278), 3 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:44:53,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:44:53,788 INFO L93 Difference]: Finished difference Result 135186 states and 154639 transitions. [2025-01-08 23:44:53,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:44:53,789 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 92.66666666666667) internal successors, (278), 3 states have internal predecessors, (278), 0 states have call successors, (0), 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 361 [2025-01-08 23:44:53,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:44:53,972 INFO L225 Difference]: With dead ends: 135186 [2025-01-08 23:44:53,972 INFO L226 Difference]: Without dead ends: 82614 [2025-01-08 23:44:54,002 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:44:54,002 INFO L435 NwaCegarLoop]: 1227 mSDtfsCounter, 722 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2115 mSolverCounterSat, 696 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 722 SdHoareTripleChecker+Valid, 1234 SdHoareTripleChecker+Invalid, 2811 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 696 IncrementalHoareTripleChecker+Valid, 2115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-01-08 23:44:54,003 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [722 Valid, 1234 Invalid, 2811 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [696 Valid, 2115 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-01-08 23:44:54,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82614 states. [2025-01-08 23:44:54,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82614 to 77357. [2025-01-08 23:44:54,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77357 states, 77356 states have (on average 1.1153627385076788) internal successors, (86280), 77356 states have internal predecessors, (86280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:44:54,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77357 states to 77357 states and 86280 transitions. [2025-01-08 23:44:54,784 INFO L78 Accepts]: Start accepts. Automaton has 77357 states and 86280 transitions. Word has length 361 [2025-01-08 23:44:54,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:44:54,784 INFO L471 AbstractCegarLoop]: Abstraction has 77357 states and 86280 transitions. [2025-01-08 23:44:54,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 92.66666666666667) internal successors, (278), 3 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:44:54,784 INFO L276 IsEmpty]: Start isEmpty. Operand 77357 states and 86280 transitions. [2025-01-08 23:44:54,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 383 [2025-01-08 23:44:54,789 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:44:54,789 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:44:54,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-08 23:44:54,790 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:44:54,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:44:54,790 INFO L85 PathProgramCache]: Analyzing trace with hash 1883222698, now seen corresponding path program 1 times [2025-01-08 23:44:54,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:44:54,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220328463] [2025-01-08 23:44:54,790 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:44:54,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:44:54,821 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 382 statements into 1 equivalence classes. [2025-01-08 23:44:54,843 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 382 of 382 statements. [2025-01-08 23:44:54,843 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:44:54,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:44:55,014 INFO L134 CoverageAnalysis]: Checked inductivity of 371 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 309 trivial. 0 not checked. [2025-01-08 23:44:55,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:44:55,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220328463] [2025-01-08 23:44:55,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220328463] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:44:55,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:44:55,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:44:55,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217815003] [2025-01-08 23:44:55,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:44:55,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:44:55,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:44:55,016 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:44:55,016 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:44:55,016 INFO L87 Difference]: Start difference. First operand 77357 states and 86280 transitions. Second operand has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:44:58,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:44:58,202 INFO L93 Difference]: Finished difference Result 165226 states and 183750 transitions. [2025-01-08 23:44:58,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:44:58,202 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 0 states have call successors, (0), 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 382 [2025-01-08 23:44:58,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:44:58,285 INFO L225 Difference]: With dead ends: 165226 [2025-01-08 23:44:58,286 INFO L226 Difference]: Without dead ends: 88622 [2025-01-08 23:44:58,313 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:44:58,314 INFO L435 NwaCegarLoop]: 1240 mSDtfsCounter, 763 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2420 mSolverCounterSat, 485 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 763 SdHoareTripleChecker+Valid, 1248 SdHoareTripleChecker+Invalid, 2905 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 485 IncrementalHoareTripleChecker+Valid, 2420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-01-08 23:44:58,314 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [763 Valid, 1248 Invalid, 2905 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [485 Valid, 2420 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-01-08 23:44:58,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88622 states. [2025-01-08 23:44:58,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88622 to 85618. [2025-01-08 23:44:59,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85618 states, 85617 states have (on average 1.0999684642068748) internal successors, (94176), 85617 states have internal predecessors, (94176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:44:59,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85618 states to 85618 states and 94176 transitions. [2025-01-08 23:44:59,129 INFO L78 Accepts]: Start accepts. Automaton has 85618 states and 94176 transitions. Word has length 382 [2025-01-08 23:44:59,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:44:59,129 INFO L471 AbstractCegarLoop]: Abstraction has 85618 states and 94176 transitions. [2025-01-08 23:44:59,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:44:59,130 INFO L276 IsEmpty]: Start isEmpty. Operand 85618 states and 94176 transitions. [2025-01-08 23:44:59,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 459 [2025-01-08 23:44:59,138 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:44:59,139 INFO L218 NwaCegarLoop]: trace histogram [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, 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] [2025-01-08 23:44:59,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-08 23:44:59,139 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:44:59,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:44:59,140 INFO L85 PathProgramCache]: Analyzing trace with hash -1610376216, now seen corresponding path program 1 times [2025-01-08 23:44:59,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:44:59,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895012475] [2025-01-08 23:44:59,140 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:44:59,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:44:59,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 458 statements into 1 equivalence classes. [2025-01-08 23:44:59,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 458 of 458 statements. [2025-01-08 23:44:59,199 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:44:59,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:44:59,620 INFO L134 CoverageAnalysis]: Checked inductivity of 439 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2025-01-08 23:44:59,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:44:59,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895012475] [2025-01-08 23:44:59,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895012475] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:44:59,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:44:59,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:44:59,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978115341] [2025-01-08 23:44:59,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:44:59,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:44:59,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:44:59,622 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:44:59,622 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:44:59,622 INFO L87 Difference]: Start difference. First operand 85618 states and 94176 transitions. Second operand has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 3 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:45:02,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:45:02,284 INFO L93 Difference]: Finished difference Result 170483 states and 187594 transitions. [2025-01-08 23:45:02,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:45:02,285 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 3 states have internal predecessors, (199), 0 states have call successors, (0), 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 458 [2025-01-08 23:45:02,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:45:02,406 INFO L225 Difference]: With dead ends: 170483 [2025-01-08 23:45:02,406 INFO L226 Difference]: Without dead ends: 85618 [2025-01-08 23:45:02,449 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:45:02,450 INFO L435 NwaCegarLoop]: 401 mSDtfsCounter, 795 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2212 mSolverCounterSat, 496 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 795 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 2708 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 496 IncrementalHoareTripleChecker+Valid, 2212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-01-08 23:45:02,450 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [795 Valid, 408 Invalid, 2708 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [496 Valid, 2212 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-01-08 23:45:02,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85618 states. [2025-01-08 23:45:03,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85618 to 83365. [2025-01-08 23:45:03,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83365 states, 83364 states have (on average 1.0677510676071207) internal successors, (89012), 83364 states have internal predecessors, (89012), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:45:03,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83365 states to 83365 states and 89012 transitions. [2025-01-08 23:45:03,414 INFO L78 Accepts]: Start accepts. Automaton has 83365 states and 89012 transitions. Word has length 458 [2025-01-08 23:45:03,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:45:03,414 INFO L471 AbstractCegarLoop]: Abstraction has 83365 states and 89012 transitions. [2025-01-08 23:45:03,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 3 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:45:03,415 INFO L276 IsEmpty]: Start isEmpty. Operand 83365 states and 89012 transitions. [2025-01-08 23:45:03,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 526 [2025-01-08 23:45:03,423 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:45:03,423 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:45:03,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-08 23:45:03,423 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:45:03,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:45:03,424 INFO L85 PathProgramCache]: Analyzing trace with hash -964697201, now seen corresponding path program 1 times [2025-01-08 23:45:03,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:45:03,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929495516] [2025-01-08 23:45:03,424 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:45:03,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:45:03,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 525 statements into 1 equivalence classes. [2025-01-08 23:45:03,640 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 525 of 525 statements. [2025-01-08 23:45:03,641 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:45:03,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:45:04,414 INFO L134 CoverageAnalysis]: Checked inductivity of 698 backedges. 448 proven. 229 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-01-08 23:45:04,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:45:04,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929495516] [2025-01-08 23:45:04,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929495516] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 23:45:04,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1186158737] [2025-01-08 23:45:04,415 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:45:04,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:45:04,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:45:04,418 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 23:45:04,420 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-08 23:45:04,496 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 525 statements into 1 equivalence classes. [2025-01-08 23:45:04,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 525 of 525 statements. [2025-01-08 23:45:04,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:45:04,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:45:04,589 INFO L256 TraceCheckSpWp]: Trace formula consists of 679 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-08 23:45:04,600 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 23:45:04,778 INFO L134 CoverageAnalysis]: Checked inductivity of 698 backedges. 385 proven. 0 refuted. 0 times theorem prover too weak. 313 trivial. 0 not checked. [2025-01-08 23:45:04,779 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 23:45:04,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1186158737] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:45:04,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 23:45:04,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-01-08 23:45:04,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923824096] [2025-01-08 23:45:04,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:45:04,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:45:04,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:45:04,785 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:45:04,785 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-08 23:45:04,785 INFO L87 Difference]: Start difference. First operand 83365 states and 89012 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) [2025-01-08 23:45:07,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:45:07,516 INFO L93 Difference]: Finished difference Result 187005 states and 201029 transitions. [2025-01-08 23:45:07,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:45:07,516 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 525 [2025-01-08 23:45:07,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:45:07,836 INFO L225 Difference]: With dead ends: 187005 [2025-01-08 23:45:07,836 INFO L226 Difference]: Without dead ends: 104393 [2025-01-08 23:45:07,874 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 529 GetRequests, 524 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-08 23:45:07,874 INFO L435 NwaCegarLoop]: 1383 mSDtfsCounter, 649 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2140 mSolverCounterSat, 589 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 649 SdHoareTripleChecker+Valid, 1391 SdHoareTripleChecker+Invalid, 2729 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 589 IncrementalHoareTripleChecker+Valid, 2140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-01-08 23:45:07,875 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [649 Valid, 1391 Invalid, 2729 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [589 Valid, 2140 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-01-08 23:45:07,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104393 states. [2025-01-08 23:45:08,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104393 to 93128. [2025-01-08 23:45:08,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93128 states, 93127 states have (on average 1.0624738260654805) internal successors, (98945), 93127 states have internal predecessors, (98945), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:45:08,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93128 states to 93128 states and 98945 transitions. [2025-01-08 23:45:08,916 INFO L78 Accepts]: Start accepts. Automaton has 93128 states and 98945 transitions. Word has length 525 [2025-01-08 23:45:08,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:45:08,916 INFO L471 AbstractCegarLoop]: Abstraction has 93128 states and 98945 transitions. [2025-01-08 23:45:08,917 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) [2025-01-08 23:45:08,917 INFO L276 IsEmpty]: Start isEmpty. Operand 93128 states and 98945 transitions. [2025-01-08 23:45:08,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 602 [2025-01-08 23:45:08,938 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:45:08,938 INFO L218 NwaCegarLoop]: trace histogram [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, 4, 4, 4, 4, 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, 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] [2025-01-08 23:45:08,945 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-08 23:45:09,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-01-08 23:45:09,139 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:45:09,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:45:09,139 INFO L85 PathProgramCache]: Analyzing trace with hash -1390478789, now seen corresponding path program 1 times [2025-01-08 23:45:09,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:45:09,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757097865] [2025-01-08 23:45:09,140 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:45:09,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:45:09,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 601 statements into 1 equivalence classes. [2025-01-08 23:45:09,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 601 of 601 statements. [2025-01-08 23:45:09,242 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:45:09,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:45:09,644 INFO L134 CoverageAnalysis]: Checked inductivity of 862 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 779 trivial. 0 not checked. [2025-01-08 23:45:09,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:45:09,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757097865] [2025-01-08 23:45:09,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757097865] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:45:09,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:45:09,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:45:09,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648387330] [2025-01-08 23:45:09,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:45:09,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:45:09,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:45:09,647 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:45:09,647 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:45:09,647 INFO L87 Difference]: Start difference. First operand 93128 states and 98945 transitions. Second operand has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 3 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:45:12,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:45:12,341 INFO L93 Difference]: Finished difference Result 202776 states and 215855 transitions. [2025-01-08 23:45:12,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:45:12,342 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 3 states have internal predecessors, (200), 0 states have call successors, (0), 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 601 [2025-01-08 23:45:12,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:45:12,470 INFO L225 Difference]: With dead ends: 202776 [2025-01-08 23:45:12,470 INFO L226 Difference]: Without dead ends: 110401 [2025-01-08 23:45:12,518 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:45:12,518 INFO L435 NwaCegarLoop]: 1109 mSDtfsCounter, 851 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2182 mSolverCounterSat, 439 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 851 SdHoareTripleChecker+Valid, 1117 SdHoareTripleChecker+Invalid, 2621 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 439 IncrementalHoareTripleChecker+Valid, 2182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-01-08 23:45:12,519 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [851 Valid, 1117 Invalid, 2621 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [439 Valid, 2182 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-01-08 23:45:12,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110401 states. [2025-01-08 23:45:13,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110401 to 108899. [2025-01-08 23:45:13,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108899 states, 108898 states have (on average 1.0576778269573361) internal successors, (115179), 108898 states have internal predecessors, (115179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:45:13,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108899 states to 108899 states and 115179 transitions. [2025-01-08 23:45:13,726 INFO L78 Accepts]: Start accepts. Automaton has 108899 states and 115179 transitions. Word has length 601 [2025-01-08 23:45:13,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:45:13,727 INFO L471 AbstractCegarLoop]: Abstraction has 108899 states and 115179 transitions. [2025-01-08 23:45:13,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 3 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:45:13,727 INFO L276 IsEmpty]: Start isEmpty. Operand 108899 states and 115179 transitions. [2025-01-08 23:45:13,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 928 [2025-01-08 23:45:13,778 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:45:13,779 INFO L218 NwaCegarLoop]: trace histogram [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, 4, 4, 4, 4, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:45:13,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-08 23:45:13,779 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:45:13,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:45:13,780 INFO L85 PathProgramCache]: Analyzing trace with hash -87280985, now seen corresponding path program 1 times [2025-01-08 23:45:13,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:45:13,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709261791] [2025-01-08 23:45:13,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:45:13,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:45:13,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 927 statements into 1 equivalence classes. [2025-01-08 23:45:13,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 927 of 927 statements. [2025-01-08 23:45:13,947 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:45:13,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:45:17,201 INFO L134 CoverageAnalysis]: Checked inductivity of 894 backedges. 811 proven. 83 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:45:17,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:45:17,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709261791] [2025-01-08 23:45:17,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709261791] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 23:45:17,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [847561676] [2025-01-08 23:45:17,202 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:45:17,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:45:17,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:45:17,204 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 23:45:17,207 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-08 23:45:17,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 927 statements into 1 equivalence classes. [2025-01-08 23:45:17,421 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 927 of 927 statements. [2025-01-08 23:45:17,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:45:17,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:45:17,425 INFO L256 TraceCheckSpWp]: Trace formula consists of 1089 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-01-08 23:45:17,438 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 23:45:20,531 INFO L134 CoverageAnalysis]: Checked inductivity of 894 backedges. 605 proven. 173 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2025-01-08 23:45:20,531 INFO L312 TraceCheckSpWp]: Computing backward predicates...