./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.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-reduced/pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.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 4ac9738018cdb6c628ad42533cfecc5c9af778919d271278199945a85d10a362 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 04:39:56,898 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 04:39:56,935 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:39:56,943 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 04:39:56,943 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 04:39:56,962 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 04:39:56,963 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 04:39:56,963 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 04:39:56,963 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 04:39:56,963 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 04:39:56,963 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 04:39:56,963 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 04:39:56,963 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 04:39:56,964 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 04:39:56,964 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 04:39:56,964 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 04:39:56,964 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 04:39:56,964 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 04:39:56,964 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 04:39:56,964 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 04:39:56,964 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 04:39:56,964 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 04:39:56,964 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 04:39:56,964 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 04:39:56,964 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 04:39:56,964 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 04:39:56,964 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 04:39:56,964 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 04:39:56,964 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 04:39:56,964 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:39:56,964 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:39:56,964 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:39:56,965 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:39:56,965 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 04:39:56,965 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:39:56,965 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:39:56,965 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:39:56,965 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:39:56,965 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 04:39:56,965 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 04:39:56,965 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 04:39:56,965 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 04:39:56,965 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 04:39:56,965 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 04:39:56,965 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 04:39:56,965 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 04:39:56,965 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 04:39:56,965 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 04:39:56,965 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 -> 4ac9738018cdb6c628ad42533cfecc5c9af778919d271278199945a85d10a362 [2025-01-09 04:39:57,167 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 04:39:57,174 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 04:39:57,176 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 04:39:57,177 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 04:39:57,177 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 04:39:57,178 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2025-01-09 04:39:58,325 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2639c1513/015fbf5539ca4543b917141b9a8eec69/FLAGac589b398 [2025-01-09 04:39:58,615 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 04:39:58,617 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2025-01-09 04:39:58,627 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2639c1513/015fbf5539ca4543b917141b9a8eec69/FLAGac589b398 [2025-01-09 04:39:58,643 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2639c1513/015fbf5539ca4543b917141b9a8eec69 [2025-01-09 04:39:58,646 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 04:39:58,648 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 04:39:58,649 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 04:39:58,650 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 04:39:58,654 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 04:39:58,654 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:39:58" (1/1) ... [2025-01-09 04:39:58,655 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79d389e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:39:58, skipping insertion in model container [2025-01-09 04:39:58,655 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:39:58" (1/1) ... [2025-01-09 04:39:58,679 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 04:39:58,831 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-reduced/pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[4411,4424] [2025-01-09 04:39:58,851 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:39:58,867 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 04:39:58,896 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-reduced/pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[4411,4424] [2025-01-09 04:39:58,903 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:39:58,920 INFO L204 MainTranslator]: Completed translation [2025-01-09 04:39:58,920 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:39:58 WrapperNode [2025-01-09 04:39:58,921 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 04:39:58,921 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 04:39:58,921 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 04:39:58,921 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 04:39:58,928 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:39:58" (1/1) ... [2025-01-09 04:39:58,938 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:39:58" (1/1) ... [2025-01-09 04:39:58,964 INFO L138 Inliner]: procedures = 23, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 362 [2025-01-09 04:39:58,964 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 04:39:58,964 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 04:39:58,965 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 04:39:58,965 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 04:39:58,975 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:39:58" (1/1) ... [2025-01-09 04:39:58,975 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:39:58" (1/1) ... [2025-01-09 04:39:58,982 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:39:58" (1/1) ... [2025-01-09 04:39:58,994 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:39:58,994 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:39:58" (1/1) ... [2025-01-09 04:39:58,994 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:39:58" (1/1) ... [2025-01-09 04:39:58,998 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:39:58" (1/1) ... [2025-01-09 04:39:58,999 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:39:58" (1/1) ... [2025-01-09 04:39:59,002 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:39:58" (1/1) ... [2025-01-09 04:39:59,003 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:39:58" (1/1) ... [2025-01-09 04:39:59,004 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:39:58" (1/1) ... [2025-01-09 04:39:59,009 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 04:39:59,010 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 04:39:59,010 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 04:39:59,010 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 04:39:59,011 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:39:58" (1/1) ... [2025-01-09 04:39:59,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:39:59,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:39:59,036 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:39:59,038 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:39:59,057 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 04:39:59,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 04:39:59,057 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 04:39:59,057 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 04:39:59,136 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 04:39:59,138 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 04:39:59,458 INFO L? ?]: Removed 35 outVars from TransFormulas that were not future-live. [2025-01-09 04:39:59,458 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 04:39:59,465 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 04:39:59,466 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 04:39:59,466 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:39:59 BoogieIcfgContainer [2025-01-09 04:39:59,466 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 04:39:59,468 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 04:39:59,468 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 04:39:59,472 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 04:39:59,472 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:39:58" (1/3) ... [2025-01-09 04:39:59,472 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b6011b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:39:59, skipping insertion in model container [2025-01-09 04:39:59,472 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:39:58" (2/3) ... [2025-01-09 04:39:59,473 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b6011b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:39:59, skipping insertion in model container [2025-01-09 04:39:59,473 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:39:59" (3/3) ... [2025-01-09 04:39:59,474 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2025-01-09 04:39:59,485 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 04:39:59,486 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c that has 1 procedures, 87 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-01-09 04:39:59,529 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 04:39:59,540 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;@67cd79e3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 04:39:59,541 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 04:39:59,544 INFO L276 IsEmpty]: Start isEmpty. Operand has 87 states, 85 states have (on average 1.6705882352941177) internal successors, (142), 86 states have internal predecessors, (142), 0 states have call successors, (0), 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:39:59,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-01-09 04:39:59,550 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:39:59,550 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] [2025-01-09 04:39:59,551 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:39:59,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:39:59,555 INFO L85 PathProgramCache]: Analyzing trace with hash 716810707, now seen corresponding path program 1 times [2025-01-09 04:39:59,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:39:59,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878699227] [2025-01-09 04:39:59,560 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:39:59,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:39:59,626 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-01-09 04:39:59,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-01-09 04:39:59,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:39:59,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:39:59,837 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:39:59,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:39:59,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878699227] [2025-01-09 04:39:59,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878699227] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:39:59,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:39:59,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:39:59,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982806686] [2025-01-09 04:39:59,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:39:59,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:39:59,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:39:59,859 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:39:59,859 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:39:59,862 INFO L87 Difference]: Start difference. First operand has 87 states, 85 states have (on average 1.6705882352941177) internal successors, (142), 86 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 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:39:59,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:39:59,903 INFO L93 Difference]: Finished difference Result 205 states and 324 transitions. [2025-01-09 04:39:59,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:39:59,906 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 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 38 [2025-01-09 04:39:59,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:39:59,911 INFO L225 Difference]: With dead ends: 205 [2025-01-09 04:39:59,911 INFO L226 Difference]: Without dead ends: 132 [2025-01-09 04:39:59,913 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:39:59,915 INFO L435 NwaCegarLoop]: 182 mSDtfsCounter, 94 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:39:59,916 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 283 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:39:59,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2025-01-09 04:39:59,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 130. [2025-01-09 04:39:59,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 129 states have (on average 1.503875968992248) internal successors, (194), 129 states have internal predecessors, (194), 0 states have call successors, (0), 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:39:59,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 194 transitions. [2025-01-09 04:39:59,942 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 194 transitions. Word has length 38 [2025-01-09 04:39:59,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:39:59,942 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 194 transitions. [2025-01-09 04:39:59,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 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:39:59,942 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 194 transitions. [2025-01-09 04:39:59,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-01-09 04:39:59,943 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:39:59,943 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] [2025-01-09 04:39:59,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 04:39:59,943 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:39:59,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:39:59,944 INFO L85 PathProgramCache]: Analyzing trace with hash -935293361, now seen corresponding path program 1 times [2025-01-09 04:39:59,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:39:59,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471045538] [2025-01-09 04:39:59,944 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:39:59,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:39:59,957 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-01-09 04:39:59,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-01-09 04:39:59,970 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:39:59,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:40:00,075 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:40:00,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:40:00,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471045538] [2025-01-09 04:40:00,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471045538] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:40:00,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:40:00,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:40:00,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296094067] [2025-01-09 04:40:00,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:40:00,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:40:00,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:40:00,077 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:40:00,077 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:40:00,078 INFO L87 Difference]: Start difference. First operand 130 states and 194 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 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:40:00,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:40:00,110 INFO L93 Difference]: Finished difference Result 318 states and 490 transitions. [2025-01-09 04:40:00,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:40:00,110 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 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 39 [2025-01-09 04:40:00,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:40:00,111 INFO L225 Difference]: With dead ends: 318 [2025-01-09 04:40:00,111 INFO L226 Difference]: Without dead ends: 208 [2025-01-09 04:40:00,112 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:40:00,112 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 79 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 235 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:40:00,113 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 235 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:40:00,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2025-01-09 04:40:00,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 206. [2025-01-09 04:40:00,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 205 states have (on average 1.526829268292683) internal successors, (313), 205 states have internal predecessors, (313), 0 states have call successors, (0), 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:40:00,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 313 transitions. [2025-01-09 04:40:00,126 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 313 transitions. Word has length 39 [2025-01-09 04:40:00,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:40:00,127 INFO L471 AbstractCegarLoop]: Abstraction has 206 states and 313 transitions. [2025-01-09 04:40:00,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 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:40:00,128 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 313 transitions. [2025-01-09 04:40:00,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-01-09 04:40:00,128 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:40:00,128 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] [2025-01-09 04:40:00,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 04:40:00,128 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:40:00,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:40:00,129 INFO L85 PathProgramCache]: Analyzing trace with hash 830312666, now seen corresponding path program 1 times [2025-01-09 04:40:00,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:40:00,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540154756] [2025-01-09 04:40:00,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:40:00,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:40:00,144 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-01-09 04:40:00,166 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-01-09 04:40:00,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:40:00,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:40:00,293 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:40:00,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:40:00,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540154756] [2025-01-09 04:40:00,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540154756] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:40:00,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:40:00,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:40:00,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619833899] [2025-01-09 04:40:00,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:40:00,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:40:00,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:40:00,294 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:40:00,294 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:40:00,294 INFO L87 Difference]: Start difference. First operand 206 states and 313 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 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:40:00,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:40:00,362 INFO L93 Difference]: Finished difference Result 950 states and 1485 transitions. [2025-01-09 04:40:00,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:40:00,362 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 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 40 [2025-01-09 04:40:00,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:40:00,365 INFO L225 Difference]: With dead ends: 950 [2025-01-09 04:40:00,365 INFO L226 Difference]: Without dead ends: 764 [2025-01-09 04:40:00,366 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:40:00,367 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 501 mSDsluCounter, 557 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 501 SdHoareTripleChecker+Valid, 676 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:40:00,367 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [501 Valid, 676 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:40:00,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 764 states. [2025-01-09 04:40:00,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 764 to 390. [2025-01-09 04:40:00,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 389 states have (on average 1.5347043701799485) internal successors, (597), 389 states have internal predecessors, (597), 0 states have call successors, (0), 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:40:00,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 597 transitions. [2025-01-09 04:40:00,384 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 597 transitions. Word has length 40 [2025-01-09 04:40:00,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:40:00,384 INFO L471 AbstractCegarLoop]: Abstraction has 390 states and 597 transitions. [2025-01-09 04:40:00,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 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:40:00,384 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 597 transitions. [2025-01-09 04:40:00,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-01-09 04:40:00,385 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:40:00,385 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] [2025-01-09 04:40:00,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 04:40:00,385 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:40:00,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:40:00,386 INFO L85 PathProgramCache]: Analyzing trace with hash -49567444, now seen corresponding path program 1 times [2025-01-09 04:40:00,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:40:00,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024962227] [2025-01-09 04:40:00,386 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:40:00,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:40:00,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-01-09 04:40:00,417 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-01-09 04:40:00,418 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:40:00,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:40:00,543 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:40:00,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:40:00,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024962227] [2025-01-09 04:40:00,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024962227] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:40:00,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:40:00,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:40:00,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333806463] [2025-01-09 04:40:00,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:40:00,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:40:00,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:40:00,544 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:40:00,545 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:40:00,545 INFO L87 Difference]: Start difference. First operand 390 states and 597 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 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:40:00,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:40:00,601 INFO L93 Difference]: Finished difference Result 1348 states and 2080 transitions. [2025-01-09 04:40:00,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:40:00,602 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 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 41 [2025-01-09 04:40:00,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:40:00,605 INFO L225 Difference]: With dead ends: 1348 [2025-01-09 04:40:00,605 INFO L226 Difference]: Without dead ends: 978 [2025-01-09 04:40:00,637 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:40:00,638 INFO L435 NwaCegarLoop]: 220 mSDtfsCounter, 275 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:40:00,638 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 439 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:40:00,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 978 states. [2025-01-09 04:40:00,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 978 to 974. [2025-01-09 04:40:00,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 974 states, 973 states have (on average 1.5344295991778005) internal successors, (1493), 973 states have internal predecessors, (1493), 0 states have call successors, (0), 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:40:00,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 974 states to 974 states and 1493 transitions. [2025-01-09 04:40:00,665 INFO L78 Accepts]: Start accepts. Automaton has 974 states and 1493 transitions. Word has length 41 [2025-01-09 04:40:00,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:40:00,665 INFO L471 AbstractCegarLoop]: Abstraction has 974 states and 1493 transitions. [2025-01-09 04:40:00,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 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:40:00,666 INFO L276 IsEmpty]: Start isEmpty. Operand 974 states and 1493 transitions. [2025-01-09 04:40:00,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-01-09 04:40:00,667 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:40:00,667 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] [2025-01-09 04:40:00,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 04:40:00,667 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:40:00,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:40:00,668 INFO L85 PathProgramCache]: Analyzing trace with hash 1536012938, now seen corresponding path program 1 times [2025-01-09 04:40:00,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:40:00,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981080209] [2025-01-09 04:40:00,668 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:40:00,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:40:00,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-01-09 04:40:00,690 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-01-09 04:40:00,691 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:40:00,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:40:00,727 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:40:00,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:40:00,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981080209] [2025-01-09 04:40:00,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981080209] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:40:00,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:40:00,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:40:00,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374162339] [2025-01-09 04:40:00,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:40:00,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:40:00,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:40:00,728 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:40:00,728 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:40:00,729 INFO L87 Difference]: Start difference. First operand 974 states and 1493 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 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:40:00,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:40:00,749 INFO L93 Difference]: Finished difference Result 2490 states and 3807 transitions. [2025-01-09 04:40:00,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:40:00,749 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 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 42 [2025-01-09 04:40:00,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:40:00,755 INFO L225 Difference]: With dead ends: 2490 [2025-01-09 04:40:00,755 INFO L226 Difference]: Without dead ends: 1536 [2025-01-09 04:40:00,756 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:40:00,758 INFO L435 NwaCegarLoop]: 189 mSDtfsCounter, 86 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 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:40:00,758 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [86 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:40:00,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1536 states. [2025-01-09 04:40:00,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1536 to 1534. [2025-01-09 04:40:00,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1534 states, 1533 states have (on average 1.5061969993476843) internal successors, (2309), 1533 states have internal predecessors, (2309), 0 states have call successors, (0), 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:40:00,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1534 states to 1534 states and 2309 transitions. [2025-01-09 04:40:00,790 INFO L78 Accepts]: Start accepts. Automaton has 1534 states and 2309 transitions. Word has length 42 [2025-01-09 04:40:00,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:40:00,790 INFO L471 AbstractCegarLoop]: Abstraction has 1534 states and 2309 transitions. [2025-01-09 04:40:00,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 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:40:00,790 INFO L276 IsEmpty]: Start isEmpty. Operand 1534 states and 2309 transitions. [2025-01-09 04:40:00,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-01-09 04:40:00,793 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:40:00,793 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] [2025-01-09 04:40:00,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 04:40:00,794 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:40:00,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:40:00,794 INFO L85 PathProgramCache]: Analyzing trace with hash 1650560821, now seen corresponding path program 1 times [2025-01-09 04:40:00,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:40:00,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565017852] [2025-01-09 04:40:00,794 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:40:00,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:40:00,808 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-01-09 04:40:00,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-01-09 04:40:00,819 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:40:00,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:40:00,881 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:40:00,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:40:00,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565017852] [2025-01-09 04:40:00,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565017852] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:40:00,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:40:00,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:40:00,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452994855] [2025-01-09 04:40:00,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:40:00,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:40:00,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:40:00,885 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:40:00,885 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:40:00,885 INFO L87 Difference]: Start difference. First operand 1534 states and 2309 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 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:40:01,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:40:01,010 INFO L93 Difference]: Finished difference Result 4562 states and 6887 transitions. [2025-01-09 04:40:01,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:40:01,010 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 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 43 [2025-01-09 04:40:01,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:40:01,019 INFO L225 Difference]: With dead ends: 4562 [2025-01-09 04:40:01,020 INFO L226 Difference]: Without dead ends: 3048 [2025-01-09 04:40:01,022 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:40:01,024 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 523 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 523 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:40:01,024 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [523 Valid, 137 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:40:01,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3048 states. [2025-01-09 04:40:01,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3048 to 3046. [2025-01-09 04:40:01,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3046 states, 3045 states have (on average 1.4965517241379311) internal successors, (4557), 3045 states have internal predecessors, (4557), 0 states have call successors, (0), 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:40:01,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3046 states to 3046 states and 4557 transitions. [2025-01-09 04:40:01,092 INFO L78 Accepts]: Start accepts. Automaton has 3046 states and 4557 transitions. Word has length 43 [2025-01-09 04:40:01,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:40:01,093 INFO L471 AbstractCegarLoop]: Abstraction has 3046 states and 4557 transitions. [2025-01-09 04:40:01,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 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:40:01,094 INFO L276 IsEmpty]: Start isEmpty. Operand 3046 states and 4557 transitions. [2025-01-09 04:40:01,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-01-09 04:40:01,097 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:40:01,097 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] [2025-01-09 04:40:01,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 04:40:01,098 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:40:01,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:40:01,098 INFO L85 PathProgramCache]: Analyzing trace with hash 836148826, now seen corresponding path program 1 times [2025-01-09 04:40:01,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:40:01,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949345827] [2025-01-09 04:40:01,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:40:01,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:40:01,109 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-01-09 04:40:01,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-01-09 04:40:01,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:40:01,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:40:01,306 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:40:01,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:40:01,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949345827] [2025-01-09 04:40:01,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949345827] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:40:01,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:40:01,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:40:01,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706416062] [2025-01-09 04:40:01,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:40:01,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:40:01,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:40:01,308 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:40:01,308 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:40:01,309 INFO L87 Difference]: Start difference. First operand 3046 states and 4557 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 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:40:01,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:40:01,339 INFO L93 Difference]: Finished difference Result 3240 states and 4846 transitions. [2025-01-09 04:40:01,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:40:01,340 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 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 43 [2025-01-09 04:40:01,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:40:01,348 INFO L225 Difference]: With dead ends: 3240 [2025-01-09 04:40:01,348 INFO L226 Difference]: Without dead ends: 3238 [2025-01-09 04:40:01,349 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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:40:01,350 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 0 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:40:01,351 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 462 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:40:01,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3238 states. [2025-01-09 04:40:01,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3238 to 3238. [2025-01-09 04:40:01,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3238 states, 3237 states have (on average 1.4670991658943466) internal successors, (4749), 3237 states have internal predecessors, (4749), 0 states have call successors, (0), 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:40:01,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3238 states to 3238 states and 4749 transitions. [2025-01-09 04:40:01,418 INFO L78 Accepts]: Start accepts. Automaton has 3238 states and 4749 transitions. Word has length 43 [2025-01-09 04:40:01,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:40:01,418 INFO L471 AbstractCegarLoop]: Abstraction has 3238 states and 4749 transitions. [2025-01-09 04:40:01,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 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:40:01,419 INFO L276 IsEmpty]: Start isEmpty. Operand 3238 states and 4749 transitions. [2025-01-09 04:40:01,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-01-09 04:40:01,419 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:40:01,419 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] [2025-01-09 04:40:01,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 04:40:01,419 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:40:01,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:40:01,420 INFO L85 PathProgramCache]: Analyzing trace with hash 161382844, now seen corresponding path program 1 times [2025-01-09 04:40:01,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:40:01,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111236102] [2025-01-09 04:40:01,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:40:01,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:40:01,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-01-09 04:40:01,433 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-01-09 04:40:01,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:40:01,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:40:01,481 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:40:01,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:40:01,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111236102] [2025-01-09 04:40:01,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111236102] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:40:01,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:40:01,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:40:01,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423764901] [2025-01-09 04:40:01,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:40:01,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:40:01,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:40:01,483 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:40:01,483 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:40:01,483 INFO L87 Difference]: Start difference. First operand 3238 states and 4749 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 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:40:01,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:40:01,522 INFO L93 Difference]: Finished difference Result 7168 states and 10493 transitions. [2025-01-09 04:40:01,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:40:01,523 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 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 44 [2025-01-09 04:40:01,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:40:01,535 INFO L225 Difference]: With dead ends: 7168 [2025-01-09 04:40:01,535 INFO L226 Difference]: Without dead ends: 3950 [2025-01-09 04:40:01,539 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:40:01,539 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 66 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:40:01,540 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 214 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:40:01,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3950 states. [2025-01-09 04:40:01,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3950 to 3928. [2025-01-09 04:40:01,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3928 states, 3927 states have (on average 1.452253628724217) internal successors, (5703), 3927 states have internal predecessors, (5703), 0 states have call successors, (0), 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:40:01,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3928 states to 3928 states and 5703 transitions. [2025-01-09 04:40:01,614 INFO L78 Accepts]: Start accepts. Automaton has 3928 states and 5703 transitions. Word has length 44 [2025-01-09 04:40:01,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:40:01,615 INFO L471 AbstractCegarLoop]: Abstraction has 3928 states and 5703 transitions. [2025-01-09 04:40:01,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 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:40:01,615 INFO L276 IsEmpty]: Start isEmpty. Operand 3928 states and 5703 transitions. [2025-01-09 04:40:01,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-01-09 04:40:01,617 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:40:01,617 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 04:40:01,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 04:40:01,617 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:40:01,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:40:01,618 INFO L85 PathProgramCache]: Analyzing trace with hash -1477612707, now seen corresponding path program 1 times [2025-01-09 04:40:01,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:40:01,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410891279] [2025-01-09 04:40:01,618 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:40:01,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:40:01,631 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-01-09 04:40:01,655 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-01-09 04:40:01,656 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:40:01,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:40:01,697 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:40:01,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:40:01,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410891279] [2025-01-09 04:40:01,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410891279] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:40:01,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:40:01,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:40:01,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711101529] [2025-01-09 04:40:01,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:40:01,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:40:01,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:40:01,699 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:40:01,699 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:40:01,699 INFO L87 Difference]: Start difference. First operand 3928 states and 5703 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 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:40:01,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:40:01,740 INFO L93 Difference]: Finished difference Result 9069 states and 13163 transitions. [2025-01-09 04:40:01,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:40:01,740 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 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 63 [2025-01-09 04:40:01,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:40:01,758 INFO L225 Difference]: With dead ends: 9069 [2025-01-09 04:40:01,759 INFO L226 Difference]: Without dead ends: 6251 [2025-01-09 04:40:01,764 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:40:01,768 INFO L435 NwaCegarLoop]: 173 mSDtfsCounter, 69 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 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:40:01,768 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 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:40:01,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6251 states. [2025-01-09 04:40:01,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6251 to 6249. [2025-01-09 04:40:01,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6249 states, 6248 states have (on average 1.4322983354673495) internal successors, (8949), 6248 states have internal predecessors, (8949), 0 states have call successors, (0), 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:40:01,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6249 states to 6249 states and 8949 transitions. [2025-01-09 04:40:01,886 INFO L78 Accepts]: Start accepts. Automaton has 6249 states and 8949 transitions. Word has length 63 [2025-01-09 04:40:01,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:40:01,886 INFO L471 AbstractCegarLoop]: Abstraction has 6249 states and 8949 transitions. [2025-01-09 04:40:01,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 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:40:01,886 INFO L276 IsEmpty]: Start isEmpty. Operand 6249 states and 8949 transitions. [2025-01-09 04:40:01,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-01-09 04:40:01,889 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:40:01,889 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 04:40:01,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 04:40:01,890 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:40:01,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:40:01,890 INFO L85 PathProgramCache]: Analyzing trace with hash 1700716252, now seen corresponding path program 1 times [2025-01-09 04:40:01,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:40:01,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59165396] [2025-01-09 04:40:01,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:40:01,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:40:01,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-01-09 04:40:01,917 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-01-09 04:40:01,917 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:40:01,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:40:02,178 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:40:02,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:40:02,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59165396] [2025-01-09 04:40:02,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59165396] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:40:02,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [798904773] [2025-01-09 04:40:02,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:40:02,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:40:02,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:40:02,180 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:40:02,182 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:40:02,236 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-01-09 04:40:02,267 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-01-09 04:40:02,267 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:40:02,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:40:02,272 INFO L256 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-01-09 04:40:02,276 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:40:02,714 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:40:02,715 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:40:03,056 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:40:03,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [798904773] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 04:40:03,056 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 04:40:03,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 7] total 21 [2025-01-09 04:40:03,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796527898] [2025-01-09 04:40:03,056 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 04:40:03,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-01-09 04:40:03,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:40:03,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-01-09 04:40:03,057 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=343, Unknown=0, NotChecked=0, Total=420 [2025-01-09 04:40:03,057 INFO L87 Difference]: Start difference. First operand 6249 states and 8949 transitions. Second operand has 21 states, 21 states have (on average 8.571428571428571) internal successors, (180), 21 states have internal predecessors, (180), 0 states have call successors, (0), 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:40:07,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:40:07,857 INFO L93 Difference]: Finished difference Result 37420 states and 53270 transitions. [2025-01-09 04:40:07,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2025-01-09 04:40:07,858 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 8.571428571428571) internal successors, (180), 21 states have internal predecessors, (180), 0 states have call successors, (0), 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 63 [2025-01-09 04:40:07,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:40:07,916 INFO L225 Difference]: With dead ends: 37420 [2025-01-09 04:40:07,917 INFO L226 Difference]: Without dead ends: 31194 [2025-01-09 04:40:07,931 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5847 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=2929, Invalid=12571, Unknown=0, NotChecked=0, Total=15500 [2025-01-09 04:40:07,931 INFO L435 NwaCegarLoop]: 191 mSDtfsCounter, 7999 mSDsluCounter, 1945 mSDsCounter, 0 mSdLazyCounter, 2460 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7999 SdHoareTripleChecker+Valid, 2136 SdHoareTripleChecker+Invalid, 2580 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 2460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-01-09 04:40:07,932 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7999 Valid, 2136 Invalid, 2580 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 2460 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-01-09 04:40:07,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31194 states. [2025-01-09 04:40:08,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31194 to 22973. [2025-01-09 04:40:08,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22973 states, 22972 states have (on average 1.4057113007139126) internal successors, (32292), 22972 states have internal predecessors, (32292), 0 states have call successors, (0), 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:40:08,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22973 states to 22973 states and 32292 transitions. [2025-01-09 04:40:08,349 INFO L78 Accepts]: Start accepts. Automaton has 22973 states and 32292 transitions. Word has length 63 [2025-01-09 04:40:08,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:40:08,350 INFO L471 AbstractCegarLoop]: Abstraction has 22973 states and 32292 transitions. [2025-01-09 04:40:08,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 8.571428571428571) internal successors, (180), 21 states have internal predecessors, (180), 0 states have call successors, (0), 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:40:08,350 INFO L276 IsEmpty]: Start isEmpty. Operand 22973 states and 32292 transitions. [2025-01-09 04:40:08,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-01-09 04:40:08,353 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:40:08,353 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:40:08,361 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 04:40:08,558 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,SelfDestructingSolverStorable9 [2025-01-09 04:40:08,560 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:40:08,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:40:08,560 INFO L85 PathProgramCache]: Analyzing trace with hash -1430287189, now seen corresponding path program 1 times [2025-01-09 04:40:08,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:40:08,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217468550] [2025-01-09 04:40:08,561 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:40:08,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:40:08,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-01-09 04:40:08,577 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-01-09 04:40:08,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:40:08,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:40:08,608 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:40:08,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:40:08,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217468550] [2025-01-09 04:40:08,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217468550] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:40:08,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:40:08,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:40:08,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361337861] [2025-01-09 04:40:08,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:40:08,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:40:08,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:40:08,610 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:40:08,610 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:40:08,610 INFO L87 Difference]: Start difference. First operand 22973 states and 32292 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:40:08,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:40:08,750 INFO L93 Difference]: Finished difference Result 45035 states and 62928 transitions. [2025-01-09 04:40:08,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:40:08,751 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:40:08,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:40:08,796 INFO L225 Difference]: With dead ends: 45035 [2025-01-09 04:40:08,796 INFO L226 Difference]: Without dead ends: 30607 [2025-01-09 04:40:08,811 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:40:08,812 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 67 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 266 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:40:08,813 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 266 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:40:08,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30607 states. [2025-01-09 04:40:09,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30607 to 30605. [2025-01-09 04:40:09,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30605 states, 30604 states have (on average 1.3802770879623578) internal successors, (42242), 30604 states have internal predecessors, (42242), 0 states have call successors, (0), 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:40:09,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30605 states to 30605 states and 42242 transitions. [2025-01-09 04:40:09,248 INFO L78 Accepts]: Start accepts. Automaton has 30605 states and 42242 transitions. Word has length 64 [2025-01-09 04:40:09,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:40:09,248 INFO L471 AbstractCegarLoop]: Abstraction has 30605 states and 42242 transitions. [2025-01-09 04:40:09,248 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:40:09,248 INFO L276 IsEmpty]: Start isEmpty. Operand 30605 states and 42242 transitions. [2025-01-09 04:40:09,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-01-09 04:40:09,251 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:40:09,251 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:40:09,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 04:40:09,252 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:40:09,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:40:09,252 INFO L85 PathProgramCache]: Analyzing trace with hash 1004794437, now seen corresponding path program 1 times [2025-01-09 04:40:09,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:40:09,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772840354] [2025-01-09 04:40:09,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:40:09,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:40:09,260 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-01-09 04:40:09,266 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-01-09 04:40:09,267 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:40:09,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:40:09,295 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:40:09,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:40:09,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772840354] [2025-01-09 04:40:09,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772840354] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:40:09,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:40:09,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:40:09,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848519128] [2025-01-09 04:40:09,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:40:09,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:40:09,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:40:09,296 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:40:09,296 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:40:09,297 INFO L87 Difference]: Start difference. First operand 30605 states and 42242 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:40:09,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:40:09,372 INFO L93 Difference]: Finished difference Result 46532 states and 64148 transitions. [2025-01-09 04:40:09,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:40:09,373 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:40:09,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:40:09,423 INFO L225 Difference]: With dead ends: 46532 [2025-01-09 04:40:09,423 INFO L226 Difference]: Without dead ends: 30607 [2025-01-09 04:40:09,538 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:40:09,538 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 64 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:40:09,538 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 252 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:40:09,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30607 states. [2025-01-09 04:40:09,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30607 to 29301. [2025-01-09 04:40:09,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29301 states, 29300 states have (on average 1.3714334470989762) internal successors, (40183), 29300 states have internal predecessors, (40183), 0 states have call successors, (0), 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:40:09,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29301 states to 29301 states and 40183 transitions. [2025-01-09 04:40:09,985 INFO L78 Accepts]: Start accepts. Automaton has 29301 states and 40183 transitions. Word has length 64 [2025-01-09 04:40:09,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:40:09,985 INFO L471 AbstractCegarLoop]: Abstraction has 29301 states and 40183 transitions. [2025-01-09 04:40:09,985 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:40:09,985 INFO L276 IsEmpty]: Start isEmpty. Operand 29301 states and 40183 transitions. [2025-01-09 04:40:09,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-01-09 04:40:09,988 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:40:09,988 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:40:09,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 04:40:09,989 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:40:09,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:40:09,990 INFO L85 PathProgramCache]: Analyzing trace with hash 1956303618, now seen corresponding path program 1 times [2025-01-09 04:40:09,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:40:09,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566505377] [2025-01-09 04:40:09,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:40:09,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:40:09,998 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-01-09 04:40:10,006 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-01-09 04:40:10,006 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:40:10,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:40:10,077 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 04:40:10,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:40:10,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566505377] [2025-01-09 04:40:10,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566505377] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:40:10,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:40:10,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:40:10,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519730976] [2025-01-09 04:40:10,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:40:10,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:40:10,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:40:10,078 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:40:10,079 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:40:10,079 INFO L87 Difference]: Start difference. First operand 29301 states and 40183 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 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:40:10,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:40:10,257 INFO L93 Difference]: Finished difference Result 55964 states and 77291 transitions. [2025-01-09 04:40:10,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:40:10,258 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 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:40:10,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:40:10,321 INFO L225 Difference]: With dead ends: 55964 [2025-01-09 04:40:10,321 INFO L226 Difference]: Without dead ends: 44458 [2025-01-09 04:40:10,338 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:40:10,339 INFO L435 NwaCegarLoop]: 218 mSDtfsCounter, 346 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 346 SdHoareTripleChecker+Valid, 582 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:40:10,339 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [346 Valid, 582 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:40:10,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44458 states. [2025-01-09 04:40:10,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44458 to 39200. [2025-01-09 04:40:10,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39200 states, 39199 states have (on average 1.366335875915202) internal successors, (53559), 39199 states have internal predecessors, (53559), 0 states have call successors, (0), 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:40:10,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39200 states to 39200 states and 53559 transitions. [2025-01-09 04:40:10,895 INFO L78 Accepts]: Start accepts. Automaton has 39200 states and 53559 transitions. Word has length 64 [2025-01-09 04:40:10,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:40:10,895 INFO L471 AbstractCegarLoop]: Abstraction has 39200 states and 53559 transitions. [2025-01-09 04:40:10,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 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:40:10,896 INFO L276 IsEmpty]: Start isEmpty. Operand 39200 states and 53559 transitions. [2025-01-09 04:40:10,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-01-09 04:40:10,899 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:40:10,899 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:40:10,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 04:40:10,899 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:40:10,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:40:10,900 INFO L85 PathProgramCache]: Analyzing trace with hash 79620841, now seen corresponding path program 1 times [2025-01-09 04:40:10,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:40:10,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516316462] [2025-01-09 04:40:10,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:40:10,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:40:10,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-01-09 04:40:10,915 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-01-09 04:40:10,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:40:10,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:40:10,949 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:40:10,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:40:10,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516316462] [2025-01-09 04:40:10,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516316462] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:40:10,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:40:10,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:40:10,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577848542] [2025-01-09 04:40:10,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:40:10,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:40:10,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:40:10,951 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:40:10,951 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:40:10,951 INFO L87 Difference]: Start difference. First operand 39200 states and 53559 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:40:11,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:40:11,064 INFO L93 Difference]: Finished difference Result 67982 states and 92281 transitions. [2025-01-09 04:40:11,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:40:11,065 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:40:11,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:40:11,114 INFO L225 Difference]: With dead ends: 67982 [2025-01-09 04:40:11,115 INFO L226 Difference]: Without dead ends: 40501 [2025-01-09 04:40:11,141 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:40:11,141 INFO L435 NwaCegarLoop]: 164 mSDtfsCounter, 68 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:40:11,142 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 270 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:40:11,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40501 states. [2025-01-09 04:40:11,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40501 to 39243. [2025-01-09 04:40:11,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39243 states, 39242 states have (on average 1.3467203506447174) internal successors, (52848), 39242 states have internal predecessors, (52848), 0 states have call successors, (0), 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:40:11,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39243 states to 39243 states and 52848 transitions. [2025-01-09 04:40:11,627 INFO L78 Accepts]: Start accepts. Automaton has 39243 states and 52848 transitions. Word has length 64 [2025-01-09 04:40:11,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:40:11,627 INFO L471 AbstractCegarLoop]: Abstraction has 39243 states and 52848 transitions. [2025-01-09 04:40:11,627 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:40:11,627 INFO L276 IsEmpty]: Start isEmpty. Operand 39243 states and 52848 transitions. [2025-01-09 04:40:11,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-01-09 04:40:11,630 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:40:11,630 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:40:11,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 04:40:11,631 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:40:11,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:40:11,631 INFO L85 PathProgramCache]: Analyzing trace with hash -1706388265, now seen corresponding path program 1 times [2025-01-09 04:40:11,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:40:11,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499218895] [2025-01-09 04:40:11,631 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:40:11,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:40:11,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-01-09 04:40:11,643 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-01-09 04:40:11,643 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:40:11,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:40:11,805 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-09 04:40:11,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:40:11,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499218895] [2025-01-09 04:40:11,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499218895] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:40:11,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:40:11,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:40:11,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350260470] [2025-01-09 04:40:11,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:40:11,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:40:11,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:40:11,807 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:40:11,807 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:40:11,808 INFO L87 Difference]: Start difference. First operand 39243 states and 52848 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 0 states have call successors, (0), 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:40:11,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:40:11,928 INFO L93 Difference]: Finished difference Result 59638 states and 81024 transitions. [2025-01-09 04:40:11,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:40:11,929 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 0 states have call successors, (0), 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:40:11,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:40:12,001 INFO L225 Difference]: With dead ends: 59638 [2025-01-09 04:40:12,001 INFO L226 Difference]: Without dead ends: 51916 [2025-01-09 04:40:12,023 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:40:12,024 INFO L435 NwaCegarLoop]: 213 mSDtfsCounter, 355 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 355 SdHoareTripleChecker+Valid, 557 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:40:12,024 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [355 Valid, 557 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:40:12,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51916 states. [2025-01-09 04:40:12,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51916 to 46667. [2025-01-09 04:40:12,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46667 states, 46666 states have (on average 1.3462478035400505) internal successors, (62824), 46666 states have internal predecessors, (62824), 0 states have call successors, (0), 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:40:12,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46667 states to 46667 states and 62824 transitions. [2025-01-09 04:40:12,594 INFO L78 Accepts]: Start accepts. Automaton has 46667 states and 62824 transitions. Word has length 64 [2025-01-09 04:40:12,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:40:12,594 INFO L471 AbstractCegarLoop]: Abstraction has 46667 states and 62824 transitions. [2025-01-09 04:40:12,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 0 states have call successors, (0), 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:40:12,594 INFO L276 IsEmpty]: Start isEmpty. Operand 46667 states and 62824 transitions. [2025-01-09 04:40:12,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-01-09 04:40:12,597 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:40:12,597 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 04:40:12,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 04:40:12,597 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:40:12,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:40:12,598 INFO L85 PathProgramCache]: Analyzing trace with hash 1607670003, now seen corresponding path program 1 times [2025-01-09 04:40:12,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:40:12,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470396107] [2025-01-09 04:40:12,598 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:40:12,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:40:12,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-01-09 04:40:12,614 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-01-09 04:40:12,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:40:12,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:40:12,680 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 04:40:12,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:40:12,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470396107] [2025-01-09 04:40:12,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470396107] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:40:12,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:40:12,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:40:12,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730005312] [2025-01-09 04:40:12,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:40:12,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:40:12,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:40:12,682 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:40:12,682 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:40:12,682 INFO L87 Difference]: Start difference. First operand 46667 states and 62824 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 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:40:12,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:40:12,834 INFO L93 Difference]: Finished difference Result 69915 states and 94824 transitions. [2025-01-09 04:40:12,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:40:12,834 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 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 65 [2025-01-09 04:40:12,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:40:12,915 INFO L225 Difference]: With dead ends: 69915 [2025-01-09 04:40:12,915 INFO L226 Difference]: Without dead ends: 59462 [2025-01-09 04:40:12,939 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:40:12,940 INFO L435 NwaCegarLoop]: 210 mSDtfsCounter, 338 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 338 SdHoareTripleChecker+Valid, 585 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:40:12,940 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [338 Valid, 585 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:40:12,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59462 states. [2025-01-09 04:40:13,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59462 to 54200. [2025-01-09 04:40:13,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54200 states, 54199 states have (on average 1.343714828686876) internal successors, (72828), 54199 states have internal predecessors, (72828), 0 states have call successors, (0), 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:40:13,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54200 states to 54200 states and 72828 transitions. [2025-01-09 04:40:13,689 INFO L78 Accepts]: Start accepts. Automaton has 54200 states and 72828 transitions. Word has length 65 [2025-01-09 04:40:13,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:40:13,690 INFO L471 AbstractCegarLoop]: Abstraction has 54200 states and 72828 transitions. [2025-01-09 04:40:13,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 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:40:13,690 INFO L276 IsEmpty]: Start isEmpty. Operand 54200 states and 72828 transitions. [2025-01-09 04:40:13,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-01-09 04:40:13,693 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:40:13,693 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 04:40:13,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 04:40:13,693 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:40:13,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:40:13,694 INFO L85 PathProgramCache]: Analyzing trace with hash -292012416, now seen corresponding path program 1 times [2025-01-09 04:40:13,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:40:13,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246945882] [2025-01-09 04:40:13,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:40:13,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:40:13,707 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-09 04:40:13,714 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 04:40:13,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:40:13,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:40:13,766 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-09 04:40:13,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:40:13,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246945882] [2025-01-09 04:40:13,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246945882] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:40:13,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:40:13,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:40:13,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304766623] [2025-01-09 04:40:13,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:40:13,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:40:13,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:40:13,767 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:40:13,767 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:40:13,767 INFO L87 Difference]: Start difference. First operand 54200 states and 72828 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 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:40:14,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:40:14,087 INFO L93 Difference]: Finished difference Result 130754 states and 175354 transitions. [2025-01-09 04:40:14,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:40:14,087 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 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 69 [2025-01-09 04:40:14,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:40:14,181 INFO L225 Difference]: With dead ends: 130754 [2025-01-09 04:40:14,181 INFO L226 Difference]: Without dead ends: 76614 [2025-01-09 04:40:14,232 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:40:14,232 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 483 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 483 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:40:14,233 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [483 Valid, 141 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:40:14,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76614 states. [2025-01-09 04:40:15,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76614 to 76146. [2025-01-09 04:40:15,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76146 states, 76145 states have (on average 1.3291089368967102) internal successors, (101205), 76145 states have internal predecessors, (101205), 0 states have call successors, (0), 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:40:15,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76146 states to 76146 states and 101205 transitions. [2025-01-09 04:40:15,235 INFO L78 Accepts]: Start accepts. Automaton has 76146 states and 101205 transitions. Word has length 69 [2025-01-09 04:40:15,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:40:15,235 INFO L471 AbstractCegarLoop]: Abstraction has 76146 states and 101205 transitions. [2025-01-09 04:40:15,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 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:40:15,235 INFO L276 IsEmpty]: Start isEmpty. Operand 76146 states and 101205 transitions. [2025-01-09 04:40:15,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-01-09 04:40:15,239 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:40:15,239 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 04:40:15,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 04:40:15,239 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:40:15,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:40:15,240 INFO L85 PathProgramCache]: Analyzing trace with hash -1359557829, now seen corresponding path program 1 times [2025-01-09 04:40:15,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:40:15,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122790998] [2025-01-09 04:40:15,240 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:40:15,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:40:15,249 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-09 04:40:15,257 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 04:40:15,257 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:40:15,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:40:15,337 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:40:15,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:40:15,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122790998] [2025-01-09 04:40:15,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122790998] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:40:15,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1960364951] [2025-01-09 04:40:15,338 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:40:15,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:40:15,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:40:15,340 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:40:15,342 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:40:15,399 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-09 04:40:15,429 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 04:40:15,429 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:40:15,429 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:40:15,430 INFO L256 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 04:40:15,432 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:40:15,585 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:40:15,586 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:40:15,664 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:40:15,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1960364951] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 04:40:15,664 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 04:40:15,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2025-01-09 04:40:15,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621402548] [2025-01-09 04:40:15,664 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 04:40:15,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 04:40:15,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:40:15,665 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 04:40:15,665 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-01-09 04:40:15,665 INFO L87 Difference]: Start difference. First operand 76146 states and 101205 transitions. Second operand has 11 states, 11 states have (on average 10.636363636363637) internal successors, (117), 10 states have internal predecessors, (117), 0 states have call successors, (0), 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:40:16,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:40:16,060 INFO L93 Difference]: Finished difference Result 135885 states and 180394 transitions. [2025-01-09 04:40:16,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 04:40:16,060 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 10.636363636363637) internal successors, (117), 10 states have internal predecessors, (117), 0 states have call successors, (0), 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 69 [2025-01-09 04:40:16,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:40:16,170 INFO L225 Difference]: With dead ends: 135885 [2025-01-09 04:40:16,170 INFO L226 Difference]: Without dead ends: 91936 [2025-01-09 04:40:16,220 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 128 SyntacticMatches, 5 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2025-01-09 04:40:16,220 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 550 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 550 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:40:16,220 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [550 Valid, 238 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:40:16,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91936 states. [2025-01-09 04:40:17,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91936 to 78144. [2025-01-09 04:40:17,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78144 states, 78143 states have (on average 1.321948223129391) internal successors, (103301), 78143 states have internal predecessors, (103301), 0 states have call successors, (0), 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:40:17,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78144 states to 78144 states and 103301 transitions. [2025-01-09 04:40:17,523 INFO L78 Accepts]: Start accepts. Automaton has 78144 states and 103301 transitions. Word has length 69 [2025-01-09 04:40:17,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:40:17,523 INFO L471 AbstractCegarLoop]: Abstraction has 78144 states and 103301 transitions. [2025-01-09 04:40:17,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.636363636363637) internal successors, (117), 10 states have internal predecessors, (117), 0 states have call successors, (0), 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:40:17,523 INFO L276 IsEmpty]: Start isEmpty. Operand 78144 states and 103301 transitions. [2025-01-09 04:40:17,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-01-09 04:40:17,526 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:40:17,526 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 04:40:17,532 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:40:17,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-01-09 04:40:17,727 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:40:17,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:40:17,727 INFO L85 PathProgramCache]: Analyzing trace with hash -2115524128, now seen corresponding path program 1 times [2025-01-09 04:40:17,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:40:17,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001183320] [2025-01-09 04:40:17,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:40:17,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:40:17,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-09 04:40:17,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 04:40:17,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:40:17,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:40:17,781 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 04:40:17,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:40:17,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001183320] [2025-01-09 04:40:17,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001183320] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:40:17,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:40:17,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:40:17,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646380307] [2025-01-09 04:40:17,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:40:17,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:40:17,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:40:17,783 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:40:17,783 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:40:17,783 INFO L87 Difference]: Start difference. First operand 78144 states and 103301 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 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:40:18,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:40:18,262 INFO L93 Difference]: Finished difference Result 178048 states and 235042 transitions. [2025-01-09 04:40:18,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:40:18,263 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 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 69 [2025-01-09 04:40:18,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:40:18,393 INFO L225 Difference]: With dead ends: 178048 [2025-01-09 04:40:18,393 INFO L226 Difference]: Without dead ends: 100083 [2025-01-09 04:40:18,433 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:40:18,435 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 467 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 467 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:40:18,435 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [467 Valid, 149 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:40:18,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100083 states. [2025-01-09 04:40:19,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100083 to 99678. [2025-01-09 04:40:19,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99678 states, 99677 states have (on average 1.3070618096451538) internal successors, (130284), 99677 states have internal predecessors, (130284), 0 states have call successors, (0), 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:40:19,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99678 states to 99678 states and 130284 transitions. [2025-01-09 04:40:19,655 INFO L78 Accepts]: Start accepts. Automaton has 99678 states and 130284 transitions. Word has length 69 [2025-01-09 04:40:19,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:40:19,656 INFO L471 AbstractCegarLoop]: Abstraction has 99678 states and 130284 transitions. [2025-01-09 04:40:19,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 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:40:19,656 INFO L276 IsEmpty]: Start isEmpty. Operand 99678 states and 130284 transitions. [2025-01-09 04:40:19,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-01-09 04:40:19,659 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:40:19,659 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 04:40:19,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 04:40:19,659 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:40:19,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:40:19,660 INFO L85 PathProgramCache]: Analyzing trace with hash 2022495301, now seen corresponding path program 1 times [2025-01-09 04:40:19,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:40:19,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153169656] [2025-01-09 04:40:19,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:40:19,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:40:19,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-09 04:40:19,675 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 04:40:19,675 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:40:19,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:40:19,732 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:40:19,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:40:19,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153169656] [2025-01-09 04:40:19,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153169656] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:40:19,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [58011615] [2025-01-09 04:40:19,732 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:40:19,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:40:19,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:40:19,735 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:40:19,737 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:40:19,786 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-09 04:40:19,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 04:40:19,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:40:19,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:40:19,815 INFO L256 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 04:40:19,817 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:40:19,954 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:40:19,956 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:40:20,039 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:40:20,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [58011615] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 04:40:20,040 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 04:40:20,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2025-01-09 04:40:20,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227614896] [2025-01-09 04:40:20,040 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 04:40:20,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 04:40:20,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:40:20,041 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 04:40:20,041 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-01-09 04:40:20,041 INFO L87 Difference]: Start difference. First operand 99678 states and 130284 transitions. Second operand has 11 states, 11 states have (on average 10.636363636363637) internal successors, (117), 10 states have internal predecessors, (117), 0 states have call successors, (0), 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:40:20,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:40:20,676 INFO L93 Difference]: Finished difference Result 197431 states and 258863 transitions. [2025-01-09 04:40:20,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 04:40:20,677 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 10.636363636363637) internal successors, (117), 10 states have internal predecessors, (117), 0 states have call successors, (0), 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 69 [2025-01-09 04:40:20,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:40:20,802 INFO L225 Difference]: With dead ends: 197431 [2025-01-09 04:40:20,802 INFO L226 Difference]: Without dead ends: 120624 [2025-01-09 04:40:20,858 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 128 SyntacticMatches, 5 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2025-01-09 04:40:20,859 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 1370 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1370 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:40:20,859 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1370 Valid, 364 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:40:20,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120624 states. [2025-01-09 04:40:21,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120624 to 103239. [2025-01-09 04:40:21,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103239 states, 103238 states have (on average 1.3046358898855073) internal successors, (134688), 103238 states have internal predecessors, (134688), 0 states have call successors, (0), 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:40:22,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103239 states to 103239 states and 134688 transitions. [2025-01-09 04:40:22,097 INFO L78 Accepts]: Start accepts. Automaton has 103239 states and 134688 transitions. Word has length 69 [2025-01-09 04:40:22,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:40:22,097 INFO L471 AbstractCegarLoop]: Abstraction has 103239 states and 134688 transitions. [2025-01-09 04:40:22,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.636363636363637) internal successors, (117), 10 states have internal predecessors, (117), 0 states have call successors, (0), 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:40:22,097 INFO L276 IsEmpty]: Start isEmpty. Operand 103239 states and 134688 transitions. [2025-01-09 04:40:22,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-01-09 04:40:22,102 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:40:22,102 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 04:40:22,109 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:40:22,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:40:22,302 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:40:22,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:40:22,303 INFO L85 PathProgramCache]: Analyzing trace with hash -1494386851, now seen corresponding path program 1 times [2025-01-09 04:40:22,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:40:22,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806962712] [2025-01-09 04:40:22,303 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:40:22,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:40:22,317 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-01-09 04:40:22,324 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-01-09 04:40:22,324 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:40:22,325 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:40:22,402 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:40:22,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:40:22,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806962712] [2025-01-09 04:40:22,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806962712] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:40:22,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [995088620] [2025-01-09 04:40:22,403 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:40:22,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:40:22,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:40:22,405 INFO L229 MonitoredProcess]: Starting monitored process 5 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:40:22,407 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 04:40:22,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-01-09 04:40:22,495 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-01-09 04:40:22,495 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:40:22,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:40:22,498 INFO L256 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 04:40:22,499 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:40:22,676 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:40:22,676 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:40:22,754 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:40:22,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [995088620] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 04:40:22,754 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 04:40:22,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2025-01-09 04:40:22,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882378963] [2025-01-09 04:40:22,754 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 04:40:22,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 04:40:22,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:40:22,755 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 04:40:22,755 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-01-09 04:40:22,755 INFO L87 Difference]: Start difference. First operand 103239 states and 134688 transitions. Second operand has 11 states, 11 states have (on average 11.090909090909092) internal successors, (122), 10 states have internal predecessors, (122), 0 states have call successors, (0), 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:40:23,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:40:23,433 INFO L93 Difference]: Finished difference Result 205811 states and 269311 transitions. [2025-01-09 04:40:23,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 04:40:23,434 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 11.090909090909092) internal successors, (122), 10 states have internal predecessors, (122), 0 states have call successors, (0), 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 70 [2025-01-09 04:40:23,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:40:23,601 INFO L225 Difference]: With dead ends: 205811 [2025-01-09 04:40:23,601 INFO L226 Difference]: Without dead ends: 152953 [2025-01-09 04:40:23,661 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 130 SyntacticMatches, 5 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2025-01-09 04:40:23,662 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 588 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 588 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:40:23,662 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [588 Valid, 280 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:40:23,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152953 states. [2025-01-09 04:40:24,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152953 to 116574. [2025-01-09 04:40:24,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116574 states, 116573 states have (on average 1.3047618230636597) internal successors, (152100), 116573 states have internal predecessors, (152100), 0 states have call successors, (0), 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:40:25,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116574 states to 116574 states and 152100 transitions. [2025-01-09 04:40:25,134 INFO L78 Accepts]: Start accepts. Automaton has 116574 states and 152100 transitions. Word has length 70 [2025-01-09 04:40:25,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:40:25,134 INFO L471 AbstractCegarLoop]: Abstraction has 116574 states and 152100 transitions. [2025-01-09 04:40:25,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.090909090909092) internal successors, (122), 10 states have internal predecessors, (122), 0 states have call successors, (0), 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:40:25,135 INFO L276 IsEmpty]: Start isEmpty. Operand 116574 states and 152100 transitions. [2025-01-09 04:40:25,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-01-09 04:40:25,139 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:40:25,139 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 04:40:25,145 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-09 04:40:25,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2025-01-09 04:40:25,344 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:40:25,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:40:25,345 INFO L85 PathProgramCache]: Analyzing trace with hash 1653225065, now seen corresponding path program 1 times [2025-01-09 04:40:25,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:40:25,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949215757] [2025-01-09 04:40:25,345 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:40:25,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:40:25,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-01-09 04:40:25,373 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-01-09 04:40:25,373 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:40:25,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:40:25,580 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:40:25,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:40:25,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949215757] [2025-01-09 04:40:25,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949215757] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:40:25,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1206158487] [2025-01-09 04:40:25,581 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:40:25,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:40:25,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:40:25,585 INFO L229 MonitoredProcess]: Starting monitored process 6 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:40:25,587 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 04:40:25,642 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-01-09 04:40:25,669 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-01-09 04:40:25,669 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:40:25,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:40:25,674 INFO L256 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-01-09 04:40:25,679 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:40:26,723 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:40:26,723 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:40:27,274 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:40:27,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1206158487] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 04:40:27,274 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 04:40:27,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13, 13] total 32 [2025-01-09 04:40:27,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813188240] [2025-01-09 04:40:27,274 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 04:40:27,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-01-09 04:40:27,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:40:27,275 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-01-09 04:40:27,275 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=892, Unknown=0, NotChecked=0, Total=992 [2025-01-09 04:40:27,276 INFO L87 Difference]: Start difference. First operand 116574 states and 152100 transitions. Second operand has 32 states, 32 states have (on average 6.125) internal successors, (196), 32 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:41:09,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:41:09,806 INFO L93 Difference]: Finished difference Result 1703707 states and 2221645 transitions. [2025-01-09 04:41:09,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 841 states. [2025-01-09 04:41:09,807 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 6.125) internal successors, (196), 32 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2025-01-09 04:41:09,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:41:12,964 INFO L225 Difference]: With dead ends: 1703707 [2025-01-09 04:41:12,964 INFO L226 Difference]: Without dead ends: 1588265 [2025-01-09 04:41:13,191 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 989 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 869 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 377791 ImplicationChecksByTransitivity, 32.3s TimeCoverageRelationStatistics Valid=61970, Invalid=695800, Unknown=0, NotChecked=0, Total=757770 [2025-01-09 04:41:13,193 INFO L435 NwaCegarLoop]: 295 mSDtfsCounter, 33058 mSDsluCounter, 6237 mSDsCounter, 0 mSdLazyCounter, 9125 mSolverCounterSat, 704 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33058 SdHoareTripleChecker+Valid, 6532 SdHoareTripleChecker+Invalid, 9829 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 704 IncrementalHoareTripleChecker+Valid, 9125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2025-01-09 04:41:13,193 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33058 Valid, 6532 Invalid, 9829 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [704 Valid, 9125 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2025-01-09 04:41:14,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1588265 states. [2025-01-09 04:41:22,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1588265 to 247605. [2025-01-09 04:41:22,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247605 states, 247604 states have (on average 1.3099061404500736) internal successors, (324338), 247604 states have internal predecessors, (324338), 0 states have call successors, (0), 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:41:23,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247605 states to 247605 states and 324338 transitions. [2025-01-09 04:41:23,290 INFO L78 Accepts]: Start accepts. Automaton has 247605 states and 324338 transitions. Word has length 71 [2025-01-09 04:41:23,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:41:23,290 INFO L471 AbstractCegarLoop]: Abstraction has 247605 states and 324338 transitions. [2025-01-09 04:41:23,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 6.125) internal successors, (196), 32 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:41:23,290 INFO L276 IsEmpty]: Start isEmpty. Operand 247605 states and 324338 transitions. [2025-01-09 04:41:23,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-01-09 04:41:23,295 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:41:23,295 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:41:23,301 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-09 04:41:23,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-01-09 04:41:23,495 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:41:23,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:41:23,496 INFO L85 PathProgramCache]: Analyzing trace with hash -1601087637, now seen corresponding path program 1 times [2025-01-09 04:41:23,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:41:23,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797250800] [2025-01-09 04:41:23,496 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:41:23,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:41:23,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-01-09 04:41:23,507 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-01-09 04:41:23,507 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:41:23,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:41:23,527 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:41:23,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:41:23,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797250800] [2025-01-09 04:41:23,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797250800] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:41:23,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:41:23,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:41:23,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503051614] [2025-01-09 04:41:23,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:41:23,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:41:23,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:41:23,529 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:41:23,529 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:41:23,529 INFO L87 Difference]: Start difference. First operand 247605 states and 324338 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)