./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.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/seq-mthreaded/pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.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 cea4cc3548129351800c62333a8b3afa818cc0cede5b8fec1c7e8b8079e480c6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 04:23:26,385 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 04:23:26,435 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 04:23:26,442 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 04:23:26,442 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 04:23:26,465 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 04:23:26,467 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 04:23:26,467 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 04:23:26,467 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 04:23:26,467 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 04:23:26,467 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 04:23:26,467 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 04:23:26,467 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 04:23:26,467 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 04:23:26,467 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 04:23:26,467 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 04:23:26,467 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 04:23:26,467 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 04:23:26,468 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 04:23:26,468 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 04:23:26,468 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 04:23:26,468 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 04:23:26,468 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 04:23:26,468 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 04:23:26,468 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 04:23:26,468 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 04:23:26,468 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 04:23:26,468 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 04:23:26,468 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 04:23:26,468 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:23:26,468 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:23:26,468 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:23:26,468 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:23:26,468 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 04:23:26,468 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:23:26,468 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:23:26,468 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:23:26,469 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:23:26,469 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 04:23:26,469 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 04:23:26,469 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 04:23:26,469 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 04:23:26,469 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 04:23:26,469 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 04:23:26,469 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 04:23:26,469 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 04:23:26,469 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 04:23:26,469 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 04:23:26,469 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 -> cea4cc3548129351800c62333a8b3afa818cc0cede5b8fec1c7e8b8079e480c6 [2025-01-09 04:23:26,712 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 04:23:26,720 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 04:23:26,722 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 04:23:26,726 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 04:23:26,726 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 04:23:26,727 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c [2025-01-09 04:23:27,895 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e6324cd2f/ed90cf756a9e43a1aa88bd612a2b91e8/FLAG78206a9fa [2025-01-09 04:23:28,183 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 04:23:28,183 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c [2025-01-09 04:23:28,193 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e6324cd2f/ed90cf756a9e43a1aa88bd612a2b91e8/FLAG78206a9fa [2025-01-09 04:23:28,209 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e6324cd2f/ed90cf756a9e43a1aa88bd612a2b91e8 [2025-01-09 04:23:28,212 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 04:23:28,213 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 04:23:28,215 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 04:23:28,215 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 04:23:28,218 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 04:23:28,219 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:23:28" (1/1) ... [2025-01-09 04:23:28,220 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6401f1f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:23:28, skipping insertion in model container [2025-01-09 04:23:28,221 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:23:28" (1/1) ... [2025-01-09 04:23:28,244 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 04:23:28,426 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/seq-mthreaded/pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c[12639,12652] [2025-01-09 04:23:28,429 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:23:28,440 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 04:23:28,494 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/seq-mthreaded/pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c[12639,12652] [2025-01-09 04:23:28,495 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:23:28,505 INFO L204 MainTranslator]: Completed translation [2025-01-09 04:23:28,507 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:23:28 WrapperNode [2025-01-09 04:23:28,507 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 04:23:28,508 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 04:23:28,508 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 04:23:28,508 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 04:23:28,513 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:23:28" (1/1) ... [2025-01-09 04:23:28,521 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:23:28" (1/1) ... [2025-01-09 04:23:28,558 INFO L138 Inliner]: procedures = 24, calls = 16, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 380 [2025-01-09 04:23:28,560 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 04:23:28,560 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 04:23:28,560 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 04:23:28,560 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 04:23:28,567 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:23:28" (1/1) ... [2025-01-09 04:23:28,567 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:23:28" (1/1) ... [2025-01-09 04:23:28,574 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:23:28" (1/1) ... [2025-01-09 04:23:28,597 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-09 04:23:28,598 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:23:28" (1/1) ... [2025-01-09 04:23:28,598 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:23:28" (1/1) ... [2025-01-09 04:23:28,603 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:23:28" (1/1) ... [2025-01-09 04:23:28,606 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:23:28" (1/1) ... [2025-01-09 04:23:28,609 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:23:28" (1/1) ... [2025-01-09 04:23:28,613 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:23:28" (1/1) ... [2025-01-09 04:23:28,618 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:23:28" (1/1) ... [2025-01-09 04:23:28,622 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 04:23:28,623 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 04:23:28,623 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 04:23:28,623 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 04:23:28,624 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:23:28" (1/1) ... [2025-01-09 04:23:28,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:23:28,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:23:28,651 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-09 04:23:28,655 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-09 04:23:28,672 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 04:23:28,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 04:23:28,673 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 04:23:28,673 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 04:23:28,749 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 04:23:28,750 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 04:23:29,147 INFO L? ?]: Removed 45 outVars from TransFormulas that were not future-live. [2025-01-09 04:23:29,147 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 04:23:29,157 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 04:23:29,158 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 04:23:29,158 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:23:29 BoogieIcfgContainer [2025-01-09 04:23:29,158 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 04:23:29,160 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 04:23:29,160 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 04:23:29,164 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 04:23:29,164 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:23:28" (1/3) ... [2025-01-09 04:23:29,165 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2762de99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:23:29, skipping insertion in model container [2025-01-09 04:23:29,165 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:23:28" (2/3) ... [2025-01-09 04:23:29,166 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2762de99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:23:29, skipping insertion in model container [2025-01-09 04:23:29,166 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:23:29" (3/3) ... [2025-01-09 04:23:29,167 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c [2025-01-09 04:23:29,177 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 04:23:29,179 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c that has 1 procedures, 100 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 04:23:29,228 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 04:23:29,241 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;@3fc99fc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 04:23:29,241 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 04:23:29,244 INFO L276 IsEmpty]: Start isEmpty. Operand has 100 states, 98 states have (on average 1.7448979591836735) internal successors, (171), 99 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-09 04:23:29,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-01-09 04:23:29,251 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:23:29,252 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:23:29,252 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:23:29,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:23:29,257 INFO L85 PathProgramCache]: Analyzing trace with hash -12578412, now seen corresponding path program 1 times [2025-01-09 04:23:29,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:23:29,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286855999] [2025-01-09 04:23:29,265 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:23:29,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:23:29,334 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-01-09 04:23:29,377 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-01-09 04:23:29,381 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:23:29,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:23:29,492 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-09 04:23:29,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:23:29,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286855999] [2025-01-09 04:23:29,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286855999] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:23:29,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:23:29,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 04:23:29,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142266776] [2025-01-09 04:23:29,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:23:29,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 04:23:29,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:23:29,514 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 04:23:29,514 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 04:23:29,516 INFO L87 Difference]: Start difference. First operand has 100 states, 98 states have (on average 1.7448979591836735) internal successors, (171), 99 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) Second operand has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 0 states have call successors, (0), 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-09 04:23:29,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:23:29,530 INFO L93 Difference]: Finished difference Result 163 states and 272 transitions. [2025-01-09 04:23:29,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 04:23:29,532 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 0 states have call successors, (0), 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 33 [2025-01-09 04:23:29,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:23:29,537 INFO L225 Difference]: With dead ends: 163 [2025-01-09 04:23:29,537 INFO L226 Difference]: Without dead ends: 97 [2025-01-09 04:23:29,539 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 04:23:29,541 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:23:29,541 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:23:29,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-01-09 04:23:29,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2025-01-09 04:23:29,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 96 states have (on average 1.7291666666666667) internal successors, (166), 96 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-09 04:23:29,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 166 transitions. [2025-01-09 04:23:29,564 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 166 transitions. Word has length 33 [2025-01-09 04:23:29,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:23:29,564 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 166 transitions. [2025-01-09 04:23:29,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 0 states have call successors, (0), 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-09 04:23:29,565 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 166 transitions. [2025-01-09 04:23:29,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-01-09 04:23:29,566 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:23:29,566 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:23:29,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 04:23:29,566 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:23:29,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:23:29,567 INFO L85 PathProgramCache]: Analyzing trace with hash -522051502, now seen corresponding path program 1 times [2025-01-09 04:23:29,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:23:29,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236868735] [2025-01-09 04:23:29,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:23:29,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:23:29,586 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-01-09 04:23:29,614 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-01-09 04:23:29,614 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:23:29,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:23:29,824 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-09 04:23:29,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:23:29,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236868735] [2025-01-09 04:23:29,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236868735] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:23:29,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:23:29,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:23:29,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843196201] [2025-01-09 04:23:29,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:23:29,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:23:29,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:23:29,828 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:23:29,828 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:23:29,828 INFO L87 Difference]: Start difference. First operand 97 states and 166 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 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-09 04:23:29,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:23:29,911 INFO L93 Difference]: Finished difference Result 160 states and 266 transitions. [2025-01-09 04:23:29,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:23:29,912 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 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 33 [2025-01-09 04:23:29,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:23:29,913 INFO L225 Difference]: With dead ends: 160 [2025-01-09 04:23:29,913 INFO L226 Difference]: Without dead ends: 97 [2025-01-09 04:23:29,913 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:23:29,914 INFO L435 NwaCegarLoop]: 164 mSDtfsCounter, 0 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 619 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:23:29,914 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 619 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:23:29,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-01-09 04:23:29,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2025-01-09 04:23:29,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 96 states have (on average 1.3958333333333333) internal successors, (134), 96 states have internal predecessors, (134), 0 states have call successors, (0), 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-09 04:23:29,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 134 transitions. [2025-01-09 04:23:29,920 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 134 transitions. Word has length 33 [2025-01-09 04:23:29,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:23:29,922 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 134 transitions. [2025-01-09 04:23:29,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 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-09 04:23:29,922 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 134 transitions. [2025-01-09 04:23:29,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-01-09 04:23:29,923 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:23:29,923 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:23:29,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 04:23:29,923 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:23:29,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:23:29,924 INFO L85 PathProgramCache]: Analyzing trace with hash 1868585511, now seen corresponding path program 1 times [2025-01-09 04:23:29,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:23:29,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728535021] [2025-01-09 04:23:29,924 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:23:29,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:23:29,945 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-01-09 04:23:29,975 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-01-09 04:23:29,975 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:23:29,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:23:30,067 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-09 04:23:30,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:23:30,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728535021] [2025-01-09 04:23:30,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728535021] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:23:30,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:23:30,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:23:30,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934600636] [2025-01-09 04:23:30,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:23:30,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:23:30,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:23:30,069 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:23:30,069 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:23:30,069 INFO L87 Difference]: Start difference. First operand 97 states and 134 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:23:30,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:23:30,094 INFO L93 Difference]: Finished difference Result 208 states and 314 transitions. [2025-01-09 04:23:30,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:23:30,094 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2025-01-09 04:23:30,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:23:30,095 INFO L225 Difference]: With dead ends: 208 [2025-01-09 04:23:30,095 INFO L226 Difference]: Without dead ends: 149 [2025-01-09 04:23:30,095 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-09 04:23:30,096 INFO L435 NwaCegarLoop]: 214 mSDtfsCounter, 84 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:23:30,096 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 309 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:23:30,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2025-01-09 04:23:30,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 147. [2025-01-09 04:23:30,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 146 states have (on average 1.4794520547945205) internal successors, (216), 146 states have internal predecessors, (216), 0 states have call successors, (0), 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-09 04:23:30,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 216 transitions. [2025-01-09 04:23:30,104 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 216 transitions. Word has length 64 [2025-01-09 04:23:30,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:23:30,104 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 216 transitions. [2025-01-09 04:23:30,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:23:30,105 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 216 transitions. [2025-01-09 04:23:30,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-01-09 04:23:30,105 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:23:30,106 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:23:30,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 04:23:30,106 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:23:30,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:23:30,106 INFO L85 PathProgramCache]: Analyzing trace with hash 1544648611, now seen corresponding path program 1 times [2025-01-09 04:23:30,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:23:30,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190122492] [2025-01-09 04:23:30,107 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:23:30,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:23:30,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-01-09 04:23:30,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-01-09 04:23:30,149 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:23:30,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:23:30,213 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-09 04:23:30,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:23:30,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190122492] [2025-01-09 04:23:30,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190122492] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:23:30,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:23:30,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:23:30,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810560535] [2025-01-09 04:23:30,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:23:30,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:23:30,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:23:30,215 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:23:30,216 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:23:30,216 INFO L87 Difference]: Start difference. First operand 147 states and 216 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:23:30,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:23:30,263 INFO L93 Difference]: Finished difference Result 349 states and 544 transitions. [2025-01-09 04:23:30,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:23:30,266 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2025-01-09 04:23:30,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:23:30,268 INFO L225 Difference]: With dead ends: 349 [2025-01-09 04:23:30,270 INFO L226 Difference]: Without dead ends: 240 [2025-01-09 04:23:30,270 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-09 04:23:30,271 INFO L435 NwaCegarLoop]: 173 mSDtfsCounter, 72 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:23:30,271 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 278 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:23:30,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2025-01-09 04:23:30,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 238. [2025-01-09 04:23:30,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 237 states have (on average 1.5316455696202531) internal successors, (363), 237 states have internal predecessors, (363), 0 states have call successors, (0), 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-09 04:23:30,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 363 transitions. [2025-01-09 04:23:30,289 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 363 transitions. Word has length 64 [2025-01-09 04:23:30,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:23:30,289 INFO L471 AbstractCegarLoop]: Abstraction has 238 states and 363 transitions. [2025-01-09 04:23:30,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:23:30,289 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 363 transitions. [2025-01-09 04:23:30,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-01-09 04:23:30,290 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:23:30,290 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:23:30,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 04:23:30,290 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:23:30,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:23:30,291 INFO L85 PathProgramCache]: Analyzing trace with hash -272798492, now seen corresponding path program 1 times [2025-01-09 04:23:30,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:23:30,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904015590] [2025-01-09 04:23:30,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:23:30,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:23:30,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-01-09 04:23:30,322 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-01-09 04:23:30,323 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:23:30,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:23:30,474 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-09 04:23:30,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:23:30,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904015590] [2025-01-09 04:23:30,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904015590] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:23:30,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:23:30,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 04:23:30,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767405803] [2025-01-09 04:23:30,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:23:30,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 04:23:30,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:23:30,477 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 04:23:30,477 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:23:30,478 INFO L87 Difference]: Start difference. First operand 238 states and 363 transitions. Second operand has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:23:30,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:23:30,630 INFO L93 Difference]: Finished difference Result 1438 states and 2313 transitions. [2025-01-09 04:23:30,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 04:23:30,630 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2025-01-09 04:23:30,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:23:30,636 INFO L225 Difference]: With dead ends: 1438 [2025-01-09 04:23:30,637 INFO L226 Difference]: Without dead ends: 1238 [2025-01-09 04:23:30,638 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2025-01-09 04:23:30,640 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 1195 mSDsluCounter, 649 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1195 SdHoareTripleChecker+Valid, 779 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:23:30,640 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1195 Valid, 779 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:23:30,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1238 states. [2025-01-09 04:23:30,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1238 to 436. [2025-01-09 04:23:30,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 436 states, 435 states have (on average 1.560919540229885) internal successors, (679), 435 states have internal predecessors, (679), 0 states have call successors, (0), 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-09 04:23:30,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 679 transitions. [2025-01-09 04:23:30,672 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 679 transitions. Word has length 64 [2025-01-09 04:23:30,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:23:30,672 INFO L471 AbstractCegarLoop]: Abstraction has 436 states and 679 transitions. [2025-01-09 04:23:30,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:23:30,672 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 679 transitions. [2025-01-09 04:23:30,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-01-09 04:23:30,673 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:23:30,673 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:23:30,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 04:23:30,673 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:23:30,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:23:30,674 INFO L85 PathProgramCache]: Analyzing trace with hash -250141954, now seen corresponding path program 1 times [2025-01-09 04:23:30,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:23:30,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850364507] [2025-01-09 04:23:30,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:23:30,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:23:30,690 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-01-09 04:23:30,728 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-01-09 04:23:30,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:23:30,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:23:30,930 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-09 04:23:30,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:23:30,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850364507] [2025-01-09 04:23:30,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850364507] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:23:30,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:23:30,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:23:30,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107514152] [2025-01-09 04:23:30,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:23:30,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:23:30,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:23:30,933 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:23:30,933 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:23:30,933 INFO L87 Difference]: Start difference. First operand 436 states and 679 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 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-09 04:23:30,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:23:30,953 INFO L93 Difference]: Finished difference Result 462 states and 712 transitions. [2025-01-09 04:23:30,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:23:30,953 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 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 65 [2025-01-09 04:23:30,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:23:30,955 INFO L225 Difference]: With dead ends: 462 [2025-01-09 04:23:30,956 INFO L226 Difference]: Without dead ends: 460 [2025-01-09 04:23:30,956 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:23:30,957 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 0 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 516 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:23:30,958 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 516 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:23:30,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2025-01-09 04:23:30,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 460. [2025-01-09 04:23:30,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 460 states, 459 states have (on average 1.5315904139433552) internal successors, (703), 459 states have internal predecessors, (703), 0 states have call successors, (0), 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-09 04:23:30,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 703 transitions. [2025-01-09 04:23:30,975 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 703 transitions. Word has length 65 [2025-01-09 04:23:30,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:23:30,976 INFO L471 AbstractCegarLoop]: Abstraction has 460 states and 703 transitions. [2025-01-09 04:23:30,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 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-09 04:23:30,976 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 703 transitions. [2025-01-09 04:23:30,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-01-09 04:23:30,979 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:23:30,980 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:23:30,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 04:23:30,980 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:23:30,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:23:30,980 INFO L85 PathProgramCache]: Analyzing trace with hash 888112636, now seen corresponding path program 1 times [2025-01-09 04:23:30,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:23:30,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605942391] [2025-01-09 04:23:30,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:23:30,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:23:30,991 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-01-09 04:23:30,998 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-01-09 04:23:30,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:23:30,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:23:31,051 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-09 04:23:31,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:23:31,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605942391] [2025-01-09 04:23:31,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605942391] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:23:31,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:23:31,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:23:31,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002718742] [2025-01-09 04:23:31,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:23:31,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:23:31,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:23:31,053 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:23:31,053 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:23:31,053 INFO L87 Difference]: Start difference. First operand 460 states and 703 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:23:31,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:23:31,086 INFO L93 Difference]: Finished difference Result 1080 states and 1679 transitions. [2025-01-09 04:23:31,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:23:31,088 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2025-01-09 04:23:31,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:23:31,091 INFO L225 Difference]: With dead ends: 1080 [2025-01-09 04:23:31,092 INFO L226 Difference]: Without dead ends: 658 [2025-01-09 04:23:31,092 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-09 04:23:31,093 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 61 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:23:31,094 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 235 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:23:31,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 658 states. [2025-01-09 04:23:31,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 658 to 656. [2025-01-09 04:23:31,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 656 states, 655 states have (on average 1.5404580152671756) internal successors, (1009), 655 states have internal predecessors, (1009), 0 states have call successors, (0), 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-09 04:23:31,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 656 states and 1009 transitions. [2025-01-09 04:23:31,110 INFO L78 Accepts]: Start accepts. Automaton has 656 states and 1009 transitions. Word has length 66 [2025-01-09 04:23:31,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:23:31,111 INFO L471 AbstractCegarLoop]: Abstraction has 656 states and 1009 transitions. [2025-01-09 04:23:31,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:23:31,111 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 1009 transitions. [2025-01-09 04:23:31,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-01-09 04:23:31,111 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:23:31,112 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:23:31,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 04:23:31,112 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:23:31,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:23:31,112 INFO L85 PathProgramCache]: Analyzing trace with hash 727577399, now seen corresponding path program 1 times [2025-01-09 04:23:31,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:23:31,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142001610] [2025-01-09 04:23:31,113 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:23:31,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:23:31,122 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-01-09 04:23:31,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-01-09 04:23:31,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:23:31,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:23:31,174 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-09 04:23:31,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:23:31,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142001610] [2025-01-09 04:23:31,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142001610] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:23:31,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:23:31,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:23:31,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568344402] [2025-01-09 04:23:31,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:23:31,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:23:31,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:23:31,175 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:23:31,176 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:23:31,176 INFO L87 Difference]: Start difference. First operand 656 states and 1009 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 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-09 04:23:31,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:23:31,208 INFO L93 Difference]: Finished difference Result 1792 states and 2779 transitions. [2025-01-09 04:23:31,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:23:31,209 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 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 67 [2025-01-09 04:23:31,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:23:31,213 INFO L225 Difference]: With dead ends: 1792 [2025-01-09 04:23:31,213 INFO L226 Difference]: Without dead ends: 1176 [2025-01-09 04:23:31,214 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-09 04:23:31,215 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 68 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:23:31,215 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 275 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:23:31,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1176 states. [2025-01-09 04:23:31,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1176 to 1174. [2025-01-09 04:23:31,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1174 states, 1173 states have (on average 1.5319693094629157) internal successors, (1797), 1173 states have internal predecessors, (1797), 0 states have call successors, (0), 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-09 04:23:31,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1174 states to 1174 states and 1797 transitions. [2025-01-09 04:23:31,247 INFO L78 Accepts]: Start accepts. Automaton has 1174 states and 1797 transitions. Word has length 67 [2025-01-09 04:23:31,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:23:31,247 INFO L471 AbstractCegarLoop]: Abstraction has 1174 states and 1797 transitions. [2025-01-09 04:23:31,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 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-09 04:23:31,247 INFO L276 IsEmpty]: Start isEmpty. Operand 1174 states and 1797 transitions. [2025-01-09 04:23:31,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-01-09 04:23:31,248 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:23:31,248 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:23:31,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 04:23:31,248 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:23:31,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:23:31,248 INFO L85 PathProgramCache]: Analyzing trace with hash 1864685815, now seen corresponding path program 1 times [2025-01-09 04:23:31,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:23:31,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276921836] [2025-01-09 04:23:31,248 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:23:31,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:23:31,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-01-09 04:23:31,266 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-01-09 04:23:31,267 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:23:31,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:23:31,297 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-09 04:23:31,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:23:31,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276921836] [2025-01-09 04:23:31,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276921836] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:23:31,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:23:31,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:23:31,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345337390] [2025-01-09 04:23:31,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:23:31,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:23:31,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:23:31,298 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:23:31,298 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:23:31,298 INFO L87 Difference]: Start difference. First operand 1174 states and 1797 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 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-09 04:23:31,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:23:31,343 INFO L93 Difference]: Finished difference Result 3250 states and 4975 transitions. [2025-01-09 04:23:31,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:23:31,344 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 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 67 [2025-01-09 04:23:31,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:23:31,350 INFO L225 Difference]: With dead ends: 3250 [2025-01-09 04:23:31,351 INFO L226 Difference]: Without dead ends: 2116 [2025-01-09 04:23:31,352 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-09 04:23:31,353 INFO L435 NwaCegarLoop]: 190 mSDtfsCounter, 76 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:23:31,353 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 291 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:23:31,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2116 states. [2025-01-09 04:23:31,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2116 to 2114. [2025-01-09 04:23:31,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2114 states, 2113 states have (on average 1.5111216280170374) internal successors, (3193), 2113 states have internal predecessors, (3193), 0 states have call successors, (0), 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-09 04:23:31,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2114 states to 2114 states and 3193 transitions. [2025-01-09 04:23:31,422 INFO L78 Accepts]: Start accepts. Automaton has 2114 states and 3193 transitions. Word has length 67 [2025-01-09 04:23:31,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:23:31,422 INFO L471 AbstractCegarLoop]: Abstraction has 2114 states and 3193 transitions. [2025-01-09 04:23:31,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 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-09 04:23:31,423 INFO L276 IsEmpty]: Start isEmpty. Operand 2114 states and 3193 transitions. [2025-01-09 04:23:31,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-01-09 04:23:31,423 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:23:31,423 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:23:31,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 04:23:31,423 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:23:31,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:23:31,424 INFO L85 PathProgramCache]: Analyzing trace with hash 1449632727, now seen corresponding path program 1 times [2025-01-09 04:23:31,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:23:31,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100093166] [2025-01-09 04:23:31,424 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:23:31,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:23:31,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-01-09 04:23:31,440 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-01-09 04:23:31,441 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:23:31,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:23:31,474 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-09 04:23:31,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:23:31,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100093166] [2025-01-09 04:23:31,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100093166] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:23:31,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:23:31,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:23:31,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304895617] [2025-01-09 04:23:31,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:23:31,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:23:31,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:23:31,476 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:23:31,476 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:23:31,477 INFO L87 Difference]: Start difference. First operand 2114 states and 3193 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 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-09 04:23:31,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:23:31,546 INFO L93 Difference]: Finished difference Result 5878 states and 8827 transitions. [2025-01-09 04:23:31,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:23:31,547 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 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 67 [2025-01-09 04:23:31,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:23:31,558 INFO L225 Difference]: With dead ends: 5878 [2025-01-09 04:23:31,559 INFO L226 Difference]: Without dead ends: 3804 [2025-01-09 04:23:31,562 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-09 04:23:31,562 INFO L435 NwaCegarLoop]: 207 mSDtfsCounter, 80 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:23:31,563 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 304 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:23:31,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3804 states. [2025-01-09 04:23:31,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3804 to 3802. [2025-01-09 04:23:31,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3802 states, 3801 states have (on average 1.4798737174427783) internal successors, (5625), 3801 states have internal predecessors, (5625), 0 states have call successors, (0), 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-09 04:23:31,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3802 states to 3802 states and 5625 transitions. [2025-01-09 04:23:31,684 INFO L78 Accepts]: Start accepts. Automaton has 3802 states and 5625 transitions. Word has length 67 [2025-01-09 04:23:31,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:23:31,684 INFO L471 AbstractCegarLoop]: Abstraction has 3802 states and 5625 transitions. [2025-01-09 04:23:31,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 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-09 04:23:31,685 INFO L276 IsEmpty]: Start isEmpty. Operand 3802 states and 5625 transitions. [2025-01-09 04:23:31,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-01-09 04:23:31,686 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:23:31,687 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:23:31,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 04:23:31,687 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:23:31,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:23:31,687 INFO L85 PathProgramCache]: Analyzing trace with hash -1108803578, now seen corresponding path program 1 times [2025-01-09 04:23:31,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:23:31,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752744075] [2025-01-09 04:23:31,688 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:23:31,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:23:31,700 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-01-09 04:23:31,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-01-09 04:23:31,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:23:31,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:23:31,788 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:23:31,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:23:31,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752744075] [2025-01-09 04:23:31,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752744075] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:23:31,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:23:31,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:23:31,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104109141] [2025-01-09 04:23:31,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:23:31,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:23:31,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:23:31,789 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:23:31,789 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:23:31,789 INFO L87 Difference]: Start difference. First operand 3802 states and 5625 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:23:31,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:23:31,845 INFO L93 Difference]: Finished difference Result 7566 states and 11211 transitions. [2025-01-09 04:23:31,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:23:31,846 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2025-01-09 04:23:31,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:23:31,859 INFO L225 Difference]: With dead ends: 7566 [2025-01-09 04:23:31,859 INFO L226 Difference]: Without dead ends: 3804 [2025-01-09 04:23:31,864 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-09 04:23:31,865 INFO L435 NwaCegarLoop]: 175 mSDtfsCounter, 65 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:23:31,865 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 294 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:23:31,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3804 states. [2025-01-09 04:23:31,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3804 to 3802. [2025-01-09 04:23:31,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3802 states, 3801 states have (on average 1.4672454617205999) internal successors, (5577), 3801 states have internal predecessors, (5577), 0 states have call successors, (0), 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-09 04:23:31,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3802 states to 3802 states and 5577 transitions. [2025-01-09 04:23:31,962 INFO L78 Accepts]: Start accepts. Automaton has 3802 states and 5577 transitions. Word has length 93 [2025-01-09 04:23:31,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:23:31,962 INFO L471 AbstractCegarLoop]: Abstraction has 3802 states and 5577 transitions. [2025-01-09 04:23:31,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:23:31,962 INFO L276 IsEmpty]: Start isEmpty. Operand 3802 states and 5577 transitions. [2025-01-09 04:23:31,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-01-09 04:23:31,966 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:23:31,967 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 04:23:31,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 04:23:31,967 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:23:31,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:23:31,967 INFO L85 PathProgramCache]: Analyzing trace with hash -690362363, now seen corresponding path program 1 times [2025-01-09 04:23:31,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:23:31,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356247671] [2025-01-09 04:23:31,968 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:23:31,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:23:31,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-01-09 04:23:31,995 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-01-09 04:23:31,996 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:23:31,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:23:32,066 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-09 04:23:32,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:23:32,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356247671] [2025-01-09 04:23:32,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356247671] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:23:32,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:23:32,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:23:32,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447588453] [2025-01-09 04:23:32,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:23:32,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:23:32,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:23:32,067 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:23:32,067 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:23:32,067 INFO L87 Difference]: Start difference. First operand 3802 states and 5577 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:23:32,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:23:32,108 INFO L93 Difference]: Finished difference Result 5686 states and 8347 transitions. [2025-01-09 04:23:32,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:23:32,109 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2025-01-09 04:23:32,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:23:32,114 INFO L225 Difference]: With dead ends: 5686 [2025-01-09 04:23:32,115 INFO L226 Difference]: Without dead ends: 1924 [2025-01-09 04:23:32,118 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-09 04:23:32,118 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 59 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:23:32,118 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 275 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:23:32,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1924 states. [2025-01-09 04:23:32,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1924 to 1922. [2025-01-09 04:23:32,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1922 states, 1921 states have (on average 1.4497657470067673) internal successors, (2785), 1921 states have internal predecessors, (2785), 0 states have call successors, (0), 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-09 04:23:32,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1922 states to 1922 states and 2785 transitions. [2025-01-09 04:23:32,176 INFO L78 Accepts]: Start accepts. Automaton has 1922 states and 2785 transitions. Word has length 93 [2025-01-09 04:23:32,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:23:32,176 INFO L471 AbstractCegarLoop]: Abstraction has 1922 states and 2785 transitions. [2025-01-09 04:23:32,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:23:32,176 INFO L276 IsEmpty]: Start isEmpty. Operand 1922 states and 2785 transitions. [2025-01-09 04:23:32,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-01-09 04:23:32,177 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:23:32,177 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:23:32,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 04:23:32,177 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:23:32,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:23:32,178 INFO L85 PathProgramCache]: Analyzing trace with hash 709142404, now seen corresponding path program 1 times [2025-01-09 04:23:32,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:23:32,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755677293] [2025-01-09 04:23:32,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:23:32,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:23:32,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-01-09 04:23:32,203 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-01-09 04:23:32,203 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:23:32,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:23:32,271 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:23:32,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:23:32,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755677293] [2025-01-09 04:23:32,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755677293] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:23:32,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:23:32,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:23:32,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37817903] [2025-01-09 04:23:32,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:23:32,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:23:32,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:23:32,273 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:23:32,273 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:23:32,273 INFO L87 Difference]: Start difference. First operand 1922 states and 2785 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:23:32,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:23:32,299 INFO L93 Difference]: Finished difference Result 2866 states and 4159 transitions. [2025-01-09 04:23:32,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:23:32,300 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2025-01-09 04:23:32,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:23:32,303 INFO L225 Difference]: With dead ends: 2866 [2025-01-09 04:23:32,303 INFO L226 Difference]: Without dead ends: 984 [2025-01-09 04:23:32,305 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-09 04:23:32,306 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 53 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:23:32,306 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 253 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:23:32,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 984 states. [2025-01-09 04:23:32,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 984 to 982. [2025-01-09 04:23:32,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 982 states, 981 states have (on average 1.4281345565749235) internal successors, (1401), 981 states have internal predecessors, (1401), 0 states have call successors, (0), 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-09 04:23:32,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 982 states to 982 states and 1401 transitions. [2025-01-09 04:23:32,326 INFO L78 Accepts]: Start accepts. Automaton has 982 states and 1401 transitions. Word has length 93 [2025-01-09 04:23:32,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:23:32,327 INFO L471 AbstractCegarLoop]: Abstraction has 982 states and 1401 transitions. [2025-01-09 04:23:32,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:23:32,327 INFO L276 IsEmpty]: Start isEmpty. Operand 982 states and 1401 transitions. [2025-01-09 04:23:32,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-01-09 04:23:32,328 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:23:32,328 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:23:32,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 04:23:32,328 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:23:32,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:23:32,328 INFO L85 PathProgramCache]: Analyzing trace with hash 1095390723, now seen corresponding path program 1 times [2025-01-09 04:23:32,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:23:32,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986160679] [2025-01-09 04:23:32,329 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:23:32,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:23:32,339 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-01-09 04:23:32,356 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-01-09 04:23:32,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:23:32,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:23:32,499 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 04:23:32,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:23:32,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986160679] [2025-01-09 04:23:32,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986160679] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:23:32,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1861487834] [2025-01-09 04:23:32,500 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:23:32,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:23:32,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:23:32,502 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-09 04:23:32,504 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-09 04:23:32,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-01-09 04:23:32,623 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-01-09 04:23:32,624 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:23:32,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:23:32,627 INFO L256 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-01-09 04:23:32,633 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:23:33,193 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:23:33,193 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:23:33,827 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:23:33,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1861487834] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 04:23:33,828 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 04:23:33,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 8, 7] total 14 [2025-01-09 04:23:33,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516384010] [2025-01-09 04:23:33,828 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 04:23:33,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 04:23:33,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:23:33,829 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 04:23:33,829 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2025-01-09 04:23:33,829 INFO L87 Difference]: Start difference. First operand 982 states and 1401 transitions. Second operand has 14 states, 14 states have (on average 17.428571428571427) internal successors, (244), 14 states have internal predecessors, (244), 0 states have call successors, (0), 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-09 04:23:34,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:23:34,374 INFO L93 Difference]: Finished difference Result 4229 states and 6054 transitions. [2025-01-09 04:23:34,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-01-09 04:23:34,375 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 17.428571428571427) internal successors, (244), 14 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2025-01-09 04:23:34,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:23:34,383 INFO L225 Difference]: With dead ends: 4229 [2025-01-09 04:23:34,384 INFO L226 Difference]: Without dead ends: 3287 [2025-01-09 04:23:34,386 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=237, Invalid=519, Unknown=0, NotChecked=0, Total=756 [2025-01-09 04:23:34,386 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 2054 mSDsluCounter, 1025 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2054 SdHoareTripleChecker+Valid, 1151 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:23:34,386 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2054 Valid, 1151 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:23:34,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3287 states. [2025-01-09 04:23:34,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3287 to 2689. [2025-01-09 04:23:34,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2689 states, 2688 states have (on average 1.4215029761904763) internal successors, (3821), 2688 states have internal predecessors, (3821), 0 states have call successors, (0), 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-09 04:23:34,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2689 states to 2689 states and 3821 transitions. [2025-01-09 04:23:34,454 INFO L78 Accepts]: Start accepts. Automaton has 2689 states and 3821 transitions. Word has length 93 [2025-01-09 04:23:34,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:23:34,455 INFO L471 AbstractCegarLoop]: Abstraction has 2689 states and 3821 transitions. [2025-01-09 04:23:34,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 17.428571428571427) internal successors, (244), 14 states have internal predecessors, (244), 0 states have call successors, (0), 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-09 04:23:34,455 INFO L276 IsEmpty]: Start isEmpty. Operand 2689 states and 3821 transitions. [2025-01-09 04:23:34,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-01-09 04:23:34,456 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:23:34,456 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:23:34,467 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-09 04:23:34,657 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-09 04:23:34,657 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:23:34,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:23:34,659 INFO L85 PathProgramCache]: Analyzing trace with hash -652999860, now seen corresponding path program 1 times [2025-01-09 04:23:34,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:23:34,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989767821] [2025-01-09 04:23:34,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:23:34,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:23:34,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-01-09 04:23:34,681 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-01-09 04:23:34,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:23:34,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:23:34,787 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 04:23:34,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:23:34,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989767821] [2025-01-09 04:23:34,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989767821] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:23:34,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:23:34,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 04:23:34,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755103666] [2025-01-09 04:23:34,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:23:34,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 04:23:34,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:23:34,788 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 04:23:34,788 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:23:34,788 INFO L87 Difference]: Start difference. First operand 2689 states and 3821 transitions. Second operand has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 7 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:23:34,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:23:34,940 INFO L93 Difference]: Finished difference Result 9408 states and 13478 transitions. [2025-01-09 04:23:34,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 04:23:34,941 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 7 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2025-01-09 04:23:34,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:23:34,968 INFO L225 Difference]: With dead ends: 9408 [2025-01-09 04:23:34,968 INFO L226 Difference]: Without dead ends: 8054 [2025-01-09 04:23:34,975 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-01-09 04:23:34,976 INFO L435 NwaCegarLoop]: 228 mSDtfsCounter, 755 mSDsluCounter, 794 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 755 SdHoareTripleChecker+Valid, 1022 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:23:34,977 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [755 Valid, 1022 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:23:34,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8054 states. [2025-01-09 04:23:35,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8054 to 3988. [2025-01-09 04:23:35,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3988 states, 3987 states have (on average 1.418610484073238) internal successors, (5656), 3987 states have internal predecessors, (5656), 0 states have call successors, (0), 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-09 04:23:35,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3988 states to 3988 states and 5656 transitions. [2025-01-09 04:23:35,098 INFO L78 Accepts]: Start accepts. Automaton has 3988 states and 5656 transitions. Word has length 94 [2025-01-09 04:23:35,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:23:35,099 INFO L471 AbstractCegarLoop]: Abstraction has 3988 states and 5656 transitions. [2025-01-09 04:23:35,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 7 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:23:35,099 INFO L276 IsEmpty]: Start isEmpty. Operand 3988 states and 5656 transitions. [2025-01-09 04:23:35,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-01-09 04:23:35,099 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:23:35,099 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:23:35,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 04:23:35,100 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:23:35,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:23:35,100 INFO L85 PathProgramCache]: Analyzing trace with hash 1679391787, now seen corresponding path program 1 times [2025-01-09 04:23:35,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:23:35,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512066759] [2025-01-09 04:23:35,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:23:35,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:23:35,110 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-01-09 04:23:35,119 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-01-09 04:23:35,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:23:35,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:23:35,217 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-09 04:23:35,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:23:35,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512066759] [2025-01-09 04:23:35,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512066759] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:23:35,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:23:35,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 04:23:35,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992198897] [2025-01-09 04:23:35,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:23:35,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 04:23:35,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:23:35,218 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 04:23:35,218 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:23:35,219 INFO L87 Difference]: Start difference. First operand 3988 states and 5656 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 7 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:23:35,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:23:35,421 INFO L93 Difference]: Finished difference Result 10707 states and 15313 transitions. [2025-01-09 04:23:35,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 04:23:35,421 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 7 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2025-01-09 04:23:35,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:23:35,435 INFO L225 Difference]: With dead ends: 10707 [2025-01-09 04:23:35,435 INFO L226 Difference]: Without dead ends: 9353 [2025-01-09 04:23:35,438 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-01-09 04:23:35,438 INFO L435 NwaCegarLoop]: 226 mSDtfsCounter, 827 mSDsluCounter, 805 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 827 SdHoareTripleChecker+Valid, 1031 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:23:35,439 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [827 Valid, 1031 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:23:35,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9353 states. [2025-01-09 04:23:35,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9353 to 5280. [2025-01-09 04:23:35,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5280 states, 5279 states have (on average 1.416935025573025) internal successors, (7480), 5279 states have internal predecessors, (7480), 0 states have call successors, (0), 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-09 04:23:35,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5280 states to 5280 states and 7480 transitions. [2025-01-09 04:23:35,580 INFO L78 Accepts]: Start accepts. Automaton has 5280 states and 7480 transitions. Word has length 94 [2025-01-09 04:23:35,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:23:35,580 INFO L471 AbstractCegarLoop]: Abstraction has 5280 states and 7480 transitions. [2025-01-09 04:23:35,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 7 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:23:35,580 INFO L276 IsEmpty]: Start isEmpty. Operand 5280 states and 7480 transitions. [2025-01-09 04:23:35,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-01-09 04:23:35,581 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:23:35,581 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:23:35,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 04:23:35,581 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:23:35,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:23:35,583 INFO L85 PathProgramCache]: Analyzing trace with hash 1654089453, now seen corresponding path program 1 times [2025-01-09 04:23:35,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:23:35,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031556156] [2025-01-09 04:23:35,583 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:23:35,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:23:35,609 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-01-09 04:23:35,617 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-01-09 04:23:35,618 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:23:35,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:23:35,729 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-09 04:23:35,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:23:35,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031556156] [2025-01-09 04:23:35,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031556156] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:23:35,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:23:35,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 04:23:35,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749803333] [2025-01-09 04:23:35,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:23:35,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 04:23:35,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:23:35,730 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 04:23:35,730 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:23:35,730 INFO L87 Difference]: Start difference. First operand 5280 states and 7480 transitions. Second operand has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 7 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:23:35,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:23:35,953 INFO L93 Difference]: Finished difference Result 11999 states and 17137 transitions. [2025-01-09 04:23:35,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 04:23:35,954 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 7 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2025-01-09 04:23:35,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:23:35,969 INFO L225 Difference]: With dead ends: 11999 [2025-01-09 04:23:35,970 INFO L226 Difference]: Without dead ends: 10645 [2025-01-09 04:23:35,972 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-01-09 04:23:35,973 INFO L435 NwaCegarLoop]: 224 mSDtfsCounter, 903 mSDsluCounter, 746 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 903 SdHoareTripleChecker+Valid, 970 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:23:35,973 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [903 Valid, 970 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:23:35,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10645 states. [2025-01-09 04:23:36,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10645 to 6572. [2025-01-09 04:23:36,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6572 states, 6571 states have (on average 1.4159184294627911) internal successors, (9304), 6571 states have internal predecessors, (9304), 0 states have call successors, (0), 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-09 04:23:36,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6572 states to 6572 states and 9304 transitions. [2025-01-09 04:23:36,199 INFO L78 Accepts]: Start accepts. Automaton has 6572 states and 9304 transitions. Word has length 94 [2025-01-09 04:23:36,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:23:36,199 INFO L471 AbstractCegarLoop]: Abstraction has 6572 states and 9304 transitions. [2025-01-09 04:23:36,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 7 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:23:36,199 INFO L276 IsEmpty]: Start isEmpty. Operand 6572 states and 9304 transitions. [2025-01-09 04:23:36,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-01-09 04:23:36,200 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:23:36,200 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:23:36,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 04:23:36,200 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:23:36,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:23:36,200 INFO L85 PathProgramCache]: Analyzing trace with hash -525532497, now seen corresponding path program 1 times [2025-01-09 04:23:36,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:23:36,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406390469] [2025-01-09 04:23:36,200 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:23:36,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:23:36,208 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-01-09 04:23:36,215 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-01-09 04:23:36,215 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:23:36,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:23:36,301 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-09 04:23:36,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:23:36,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406390469] [2025-01-09 04:23:36,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406390469] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:23:36,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:23:36,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 04:23:36,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146624116] [2025-01-09 04:23:36,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:23:36,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 04:23:36,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:23:36,303 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 04:23:36,303 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:23:36,303 INFO L87 Difference]: Start difference. First operand 6572 states and 9304 transitions. Second operand has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 7 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:23:36,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:23:36,540 INFO L93 Difference]: Finished difference Result 13291 states and 18961 transitions. [2025-01-09 04:23:36,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 04:23:36,540 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 7 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2025-01-09 04:23:36,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:23:36,559 INFO L225 Difference]: With dead ends: 13291 [2025-01-09 04:23:36,559 INFO L226 Difference]: Without dead ends: 11937 [2025-01-09 04:23:36,565 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-01-09 04:23:36,565 INFO L435 NwaCegarLoop]: 228 mSDtfsCounter, 794 mSDsluCounter, 851 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 794 SdHoareTripleChecker+Valid, 1079 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:23:36,565 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [794 Valid, 1079 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:23:36,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11937 states. [2025-01-09 04:23:36,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11937 to 7864. [2025-01-09 04:23:36,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7864 states, 7863 states have (on average 1.4152359150451481) internal successors, (11128), 7863 states have internal predecessors, (11128), 0 states have call successors, (0), 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-09 04:23:36,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7864 states to 7864 states and 11128 transitions. [2025-01-09 04:23:36,779 INFO L78 Accepts]: Start accepts. Automaton has 7864 states and 11128 transitions. Word has length 94 [2025-01-09 04:23:36,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:23:36,779 INFO L471 AbstractCegarLoop]: Abstraction has 7864 states and 11128 transitions. [2025-01-09 04:23:36,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 7 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:23:36,780 INFO L276 IsEmpty]: Start isEmpty. Operand 7864 states and 11128 transitions. [2025-01-09 04:23:36,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-01-09 04:23:36,780 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:23:36,781 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:23:36,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 04:23:36,781 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:23:36,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:23:36,781 INFO L85 PathProgramCache]: Analyzing trace with hash -867735, now seen corresponding path program 1 times [2025-01-09 04:23:36,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:23:36,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91278171] [2025-01-09 04:23:36,781 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:23:36,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:23:36,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-01-09 04:23:36,795 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-01-09 04:23:36,795 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:23:36,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:23:36,879 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 04:23:36,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:23:36,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91278171] [2025-01-09 04:23:36,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91278171] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:23:36,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:23:36,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 04:23:36,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866639300] [2025-01-09 04:23:36,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:23:36,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 04:23:36,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:23:36,880 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 04:23:36,880 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:23:36,881 INFO L87 Difference]: Start difference. First operand 7864 states and 11128 transitions. Second operand has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 7 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-09 04:23:37,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:23:37,129 INFO L93 Difference]: Finished difference Result 14583 states and 20785 transitions. [2025-01-09 04:23:37,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 04:23:37,130 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 7 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 94 [2025-01-09 04:23:37,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:23:37,150 INFO L225 Difference]: With dead ends: 14583 [2025-01-09 04:23:37,150 INFO L226 Difference]: Without dead ends: 13229 [2025-01-09 04:23:37,153 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-01-09 04:23:37,154 INFO L435 NwaCegarLoop]: 232 mSDtfsCounter, 755 mSDsluCounter, 1050 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 755 SdHoareTripleChecker+Valid, 1282 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:23:37,154 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [755 Valid, 1282 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:23:37,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13229 states. [2025-01-09 04:23:37,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13229 to 9163. [2025-01-09 04:23:37,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9163 states, 9162 states have (on average 1.4148657498362802) internal successors, (12963), 9162 states have internal predecessors, (12963), 0 states have call successors, (0), 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-09 04:23:37,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9163 states to 9163 states and 12963 transitions. [2025-01-09 04:23:37,363 INFO L78 Accepts]: Start accepts. Automaton has 9163 states and 12963 transitions. Word has length 94 [2025-01-09 04:23:37,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:23:37,364 INFO L471 AbstractCegarLoop]: Abstraction has 9163 states and 12963 transitions. [2025-01-09 04:23:37,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 7 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-09 04:23:37,364 INFO L276 IsEmpty]: Start isEmpty. Operand 9163 states and 12963 transitions. [2025-01-09 04:23:37,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-01-09 04:23:37,365 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:23:37,365 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:23:37,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 04:23:37,365 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:23:37,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:23:37,366 INFO L85 PathProgramCache]: Analyzing trace with hash -1201456150, now seen corresponding path program 1 times [2025-01-09 04:23:37,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:23:37,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389796950] [2025-01-09 04:23:37,366 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:23:37,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:23:37,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-01-09 04:23:37,418 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-01-09 04:23:37,419 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:23:37,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:23:37,837 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:23:37,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:23:37,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389796950] [2025-01-09 04:23:37,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389796950] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:23:37,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [769479756] [2025-01-09 04:23:37,838 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:23:37,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:23:37,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:23:37,840 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-09 04:23:37,841 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-09 04:23:37,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-01-09 04:23:37,961 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-01-09 04:23:37,961 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:23:37,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:23:37,966 INFO L256 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-09 04:23:37,969 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:23:38,451 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:23:38,451 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:23:39,322 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:23:39,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [769479756] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 04:23:39,323 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 04:23:39,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 24 [2025-01-09 04:23:39,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781315944] [2025-01-09 04:23:39,323 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 04:23:39,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-01-09 04:23:39,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:23:39,324 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-01-09 04:23:39,324 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=524, Unknown=0, NotChecked=0, Total=600 [2025-01-09 04:23:39,324 INFO L87 Difference]: Start difference. First operand 9163 states and 12963 transitions. Second operand has 25 states, 25 states have (on average 10.72) internal successors, (268), 24 states have internal predecessors, (268), 0 states have call successors, (0), 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-09 04:23:43,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:23:43,127 INFO L93 Difference]: Finished difference Result 84028 states and 119781 transitions. [2025-01-09 04:23:43,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2025-01-09 04:23:43,127 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 10.72) internal successors, (268), 24 states have internal predecessors, (268), 0 states have call successors, (0), 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 97 [2025-01-09 04:23:43,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:23:43,230 INFO L225 Difference]: With dead ends: 84028 [2025-01-09 04:23:43,230 INFO L226 Difference]: Without dead ends: 74968 [2025-01-09 04:23:43,244 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2863 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1707, Invalid=8393, Unknown=0, NotChecked=0, Total=10100 [2025-01-09 04:23:43,245 INFO L435 NwaCegarLoop]: 203 mSDtfsCounter, 5183 mSDsluCounter, 2025 mSDsCounter, 0 mSdLazyCounter, 2481 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5183 SdHoareTripleChecker+Valid, 2228 SdHoareTripleChecker+Invalid, 2548 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 2481 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:23:43,245 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5183 Valid, 2228 Invalid, 2548 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 2481 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 04:23:43,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74968 states. [2025-01-09 04:23:44,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74968 to 45170. [2025-01-09 04:23:44,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45170 states, 45169 states have (on average 1.399610352232726) internal successors, (63219), 45169 states have internal predecessors, (63219), 0 states have call successors, (0), 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-09 04:23:44,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45170 states to 45170 states and 63219 transitions. [2025-01-09 04:23:44,635 INFO L78 Accepts]: Start accepts. Automaton has 45170 states and 63219 transitions. Word has length 97 [2025-01-09 04:23:44,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:23:44,635 INFO L471 AbstractCegarLoop]: Abstraction has 45170 states and 63219 transitions. [2025-01-09 04:23:44,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 10.72) internal successors, (268), 24 states have internal predecessors, (268), 0 states have call successors, (0), 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-09 04:23:44,635 INFO L276 IsEmpty]: Start isEmpty. Operand 45170 states and 63219 transitions. [2025-01-09 04:23:44,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-01-09 04:23:44,637 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:23:44,637 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:23:44,644 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 04:23:44,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:23:44,840 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:23:44,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:23:44,841 INFO L85 PathProgramCache]: Analyzing trace with hash -404195479, now seen corresponding path program 1 times [2025-01-09 04:23:44,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:23:44,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238830499] [2025-01-09 04:23:44,841 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:23:44,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:23:44,852 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-01-09 04:23:44,863 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-01-09 04:23:44,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:23:44,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:23:44,917 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:23:44,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:23:44,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238830499] [2025-01-09 04:23:44,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238830499] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:23:44,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:23:44,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:23:44,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646039059] [2025-01-09 04:23:44,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:23:44,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:23:44,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:23:44,919 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:23:44,919 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:23:44,919 INFO L87 Difference]: Start difference. First operand 45170 states and 63219 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 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-09 04:23:45,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:23:45,286 INFO L93 Difference]: Finished difference Result 68736 states and 96002 transitions. [2025-01-09 04:23:45,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:23:45,286 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 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 97 [2025-01-09 04:23:45,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:23:45,315 INFO L225 Difference]: With dead ends: 68736 [2025-01-09 04:23:45,315 INFO L226 Difference]: Without dead ends: 24185 [2025-01-09 04:23:45,347 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-09 04:23:45,348 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 37 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:23:45,348 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 240 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:23:45,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24185 states. [2025-01-09 04:23:45,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24185 to 24183. [2025-01-09 04:23:45,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24183 states, 24182 states have (on average 1.3702754114630717) internal successors, (33136), 24182 states have internal predecessors, (33136), 0 states have call successors, (0), 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-09 04:23:45,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24183 states to 24183 states and 33136 transitions. [2025-01-09 04:23:45,920 INFO L78 Accepts]: Start accepts. Automaton has 24183 states and 33136 transitions. Word has length 97 [2025-01-09 04:23:45,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:23:45,920 INFO L471 AbstractCegarLoop]: Abstraction has 24183 states and 33136 transitions. [2025-01-09 04:23:45,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 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-09 04:23:45,921 INFO L276 IsEmpty]: Start isEmpty. Operand 24183 states and 33136 transitions. [2025-01-09 04:23:45,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-01-09 04:23:45,922 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:23:45,922 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:23:45,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 04:23:45,922 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:23:45,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:23:45,923 INFO L85 PathProgramCache]: Analyzing trace with hash 304297583, now seen corresponding path program 1 times [2025-01-09 04:23:45,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:23:45,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537815599] [2025-01-09 04:23:45,923 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:23:45,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:23:45,932 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-01-09 04:23:45,944 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-01-09 04:23:45,944 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:23:45,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:23:46,223 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:23:46,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:23:46,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537815599] [2025-01-09 04:23:46,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537815599] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:23:46,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1827621189] [2025-01-09 04:23:46,224 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:23:46,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:23:46,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:23:46,227 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 04:23:46,228 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 04:23:46,288 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-01-09 04:23:46,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-01-09 04:23:46,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:23:46,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:23:46,334 INFO L256 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-09 04:23:46,336 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:23:46,696 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:23:46,696 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:23:47,477 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:23:47,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1827621189] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 04:23:47,477 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 04:23:47,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2025-01-09 04:23:47,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723002913] [2025-01-09 04:23:47,478 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 04:23:47,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-01-09 04:23:47,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:23:47,478 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-01-09 04:23:47,478 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=343, Unknown=0, NotChecked=0, Total=420 [2025-01-09 04:23:47,479 INFO L87 Difference]: Start difference. First operand 24183 states and 33136 transitions. Second operand has 21 states, 21 states have (on average 9.619047619047619) internal successors, (202), 20 states have internal predecessors, (202), 0 states have call successors, (0), 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-09 04:23:49,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:23:49,151 INFO L93 Difference]: Finished difference Result 84207 states and 114826 transitions. [2025-01-09 04:23:49,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 04:23:49,151 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 9.619047619047619) internal successors, (202), 20 states have internal predecessors, (202), 0 states have call successors, (0), 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 97 [2025-01-09 04:23:49,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:23:49,231 INFO L225 Difference]: With dead ends: 84207 [2025-01-09 04:23:49,232 INFO L226 Difference]: Without dead ends: 60451 [2025-01-09 04:23:49,262 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=254, Invalid=738, Unknown=0, NotChecked=0, Total=992 [2025-01-09 04:23:49,263 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 1603 mSDsluCounter, 816 mSDsCounter, 0 mSdLazyCounter, 574 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1603 SdHoareTripleChecker+Valid, 939 SdHoareTripleChecker+Invalid, 592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 574 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:23:49,264 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1603 Valid, 939 Invalid, 592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 574 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:23:49,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60451 states. [2025-01-09 04:23:50,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60451 to 51538. [2025-01-09 04:23:50,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51538 states, 51537 states have (on average 1.3588101752139239) internal successors, (70029), 51537 states have internal predecessors, (70029), 0 states have call successors, (0), 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-09 04:23:50,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51538 states to 51538 states and 70029 transitions. [2025-01-09 04:23:50,596 INFO L78 Accepts]: Start accepts. Automaton has 51538 states and 70029 transitions. Word has length 97 [2025-01-09 04:23:50,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:23:50,597 INFO L471 AbstractCegarLoop]: Abstraction has 51538 states and 70029 transitions. [2025-01-09 04:23:50,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 9.619047619047619) internal successors, (202), 20 states have internal predecessors, (202), 0 states have call successors, (0), 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-09 04:23:50,597 INFO L276 IsEmpty]: Start isEmpty. Operand 51538 states and 70029 transitions. [2025-01-09 04:23:50,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-01-09 04:23:50,599 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:23:50,599 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:23:50,607 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-09 04:23:50,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:23:50,803 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:23:50,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:23:50,803 INFO L85 PathProgramCache]: Analyzing trace with hash 34158766, now seen corresponding path program 1 times [2025-01-09 04:23:50,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:23:50,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980525562] [2025-01-09 04:23:50,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:23:50,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:23:50,815 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-01-09 04:23:50,826 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-01-09 04:23:50,826 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:23:50,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:23:50,856 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:23:50,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:23:50,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980525562] [2025-01-09 04:23:50,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980525562] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:23:50,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:23:50,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:23:50,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026246134] [2025-01-09 04:23:50,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:23:50,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:23:50,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:23:50,858 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:23:50,858 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:23:50,858 INFO L87 Difference]: Start difference. First operand 51538 states and 70029 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 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-09 04:23:52,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:23:52,367 INFO L93 Difference]: Finished difference Result 139130 states and 189303 transitions. [2025-01-09 04:23:52,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:23:52,368 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 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 97 [2025-01-09 04:23:52,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:23:52,481 INFO L225 Difference]: With dead ends: 139130 [2025-01-09 04:23:52,481 INFO L226 Difference]: Without dead ends: 87813 [2025-01-09 04:23:52,503 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-09 04:23:52,503 INFO L435 NwaCegarLoop]: 175 mSDtfsCounter, 61 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:23:52,503 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 302 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:23:52,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87813 states. [2025-01-09 04:23:53,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87813 to 66511. [2025-01-09 04:23:54,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66511 states, 66510 states have (on average 1.3543827995790108) internal successors, (90080), 66510 states have internal predecessors, (90080), 0 states have call successors, (0), 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-09 04:23:54,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66511 states to 66511 states and 90080 transitions. [2025-01-09 04:23:54,087 INFO L78 Accepts]: Start accepts. Automaton has 66511 states and 90080 transitions. Word has length 97 [2025-01-09 04:23:54,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:23:54,088 INFO L471 AbstractCegarLoop]: Abstraction has 66511 states and 90080 transitions. [2025-01-09 04:23:54,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 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-09 04:23:54,088 INFO L276 IsEmpty]: Start isEmpty. Operand 66511 states and 90080 transitions. [2025-01-09 04:23:54,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-01-09 04:23:54,094 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:23:54,094 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:23:54,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-09 04:23:54,094 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:23:54,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:23:54,094 INFO L85 PathProgramCache]: Analyzing trace with hash 116664646, now seen corresponding path program 1 times [2025-01-09 04:23:54,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:23:54,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125918644] [2025-01-09 04:23:54,095 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:23:54,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:23:54,106 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-01-09 04:23:54,114 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-01-09 04:23:54,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:23:54,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:23:54,140 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:23:54,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:23:54,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125918644] [2025-01-09 04:23:54,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125918644] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:23:54,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:23:54,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:23:54,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880355615] [2025-01-09 04:23:54,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:23:54,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:23:54,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:23:54,141 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:23:54,142 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:23:54,142 INFO L87 Difference]: Start difference. First operand 66511 states and 90080 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 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-09 04:23:55,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:23:55,694 INFO L93 Difference]: Finished difference Result 84798 states and 114723 transitions. [2025-01-09 04:23:55,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:23:55,695 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 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 98 [2025-01-09 04:23:55,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:23:55,773 INFO L225 Difference]: With dead ends: 84798 [2025-01-09 04:23:55,773 INFO L226 Difference]: Without dead ends: 62656 [2025-01-09 04:23:55,793 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-09 04:23:55,793 INFO L435 NwaCegarLoop]: 170 mSDtfsCounter, 66 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:23:55,793 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 293 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:23:55,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62656 states. [2025-01-09 04:23:57,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62656 to 62654. [2025-01-09 04:23:57,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62654 states, 62653 states have (on average 1.3453785133991987) internal successors, (84292), 62653 states have internal predecessors, (84292), 0 states have call successors, (0), 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-09 04:23:57,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62654 states to 62654 states and 84292 transitions. [2025-01-09 04:23:57,584 INFO L78 Accepts]: Start accepts. Automaton has 62654 states and 84292 transitions. Word has length 98 [2025-01-09 04:23:57,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:23:57,585 INFO L471 AbstractCegarLoop]: Abstraction has 62654 states and 84292 transitions. [2025-01-09 04:23:57,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 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-09 04:23:57,585 INFO L276 IsEmpty]: Start isEmpty. Operand 62654 states and 84292 transitions. [2025-01-09 04:23:57,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-01-09 04:23:57,587 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:23:57,588 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:23:57,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-01-09 04:23:57,588 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:23:57,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:23:57,588 INFO L85 PathProgramCache]: Analyzing trace with hash 1824349094, now seen corresponding path program 1 times [2025-01-09 04:23:57,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:23:57,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010078794] [2025-01-09 04:23:57,588 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:23:57,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:23:57,599 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-01-09 04:23:57,611 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-01-09 04:23:57,611 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:23:57,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:23:57,645 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:23:57,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:23:57,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010078794] [2025-01-09 04:23:57,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010078794] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:23:57,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:23:57,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:23:57,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125146990] [2025-01-09 04:23:57,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:23:57,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:23:57,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:23:57,646 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:23:57,646 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:23:57,646 INFO L87 Difference]: Start difference. First operand 62654 states and 84292 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 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-09 04:24:00,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:24:00,009 INFO L93 Difference]: Finished difference Result 175762 states and 235089 transitions. [2025-01-09 04:24:00,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:24:00,010 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 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 98 [2025-01-09 04:24:00,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:24:00,156 INFO L225 Difference]: With dead ends: 175762 [2025-01-09 04:24:00,157 INFO L226 Difference]: Without dead ends: 113697 [2025-01-09 04:24:00,201 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-09 04:24:00,202 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 58 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:24:00,202 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 277 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:24:00,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113697 states. [2025-01-09 04:24:03,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113697 to 113695. [2025-01-09 04:24:03,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113695 states, 113694 states have (on average 1.318266575193062) internal successors, (149879), 113694 states have internal predecessors, (149879), 0 states have call successors, (0), 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-09 04:24:03,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113695 states to 113695 states and 149879 transitions. [2025-01-09 04:24:03,440 INFO L78 Accepts]: Start accepts. Automaton has 113695 states and 149879 transitions. Word has length 98 [2025-01-09 04:24:03,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:24:03,440 INFO L471 AbstractCegarLoop]: Abstraction has 113695 states and 149879 transitions. [2025-01-09 04:24:03,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 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-09 04:24:03,440 INFO L276 IsEmpty]: Start isEmpty. Operand 113695 states and 149879 transitions. [2025-01-09 04:24:03,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-01-09 04:24:03,444 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:24:03,444 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:24:03,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-01-09 04:24:03,444 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:24:03,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:24:03,445 INFO L85 PathProgramCache]: Analyzing trace with hash 1176240314, now seen corresponding path program 1 times [2025-01-09 04:24:03,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:24:03,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610117679] [2025-01-09 04:24:03,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:24:03,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:24:03,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-01-09 04:24:03,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-01-09 04:24:03,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:24:03,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:24:03,484 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:24:03,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:24:03,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610117679] [2025-01-09 04:24:03,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610117679] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:24:03,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:24:03,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:24:03,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598816189] [2025-01-09 04:24:03,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:24:03,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:24:03,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:24:03,485 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:24:03,485 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:24:03,485 INFO L87 Difference]: Start difference. First operand 113695 states and 149879 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 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-09 04:24:08,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:24:08,590 INFO L93 Difference]: Finished difference Result 318883 states and 418589 transitions. [2025-01-09 04:24:08,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:24:08,590 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 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 98 [2025-01-09 04:24:08,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:24:08,892 INFO L225 Difference]: With dead ends: 318883 [2025-01-09 04:24:08,892 INFO L226 Difference]: Without dead ends: 206027 [2025-01-09 04:24:08,963 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-09 04:24:08,963 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 61 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:24:08,963 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 263 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:24:09,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206027 states.