./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.6.ufo.BOUNDED-12.pals+Problem12_label07.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/combinations/pals_lcr.6.ufo.BOUNDED-12.pals+Problem12_label07.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 d71af2f98c077390fd8e26a4651323aedf075614618ebe27bc0480b53a002253 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 05:54:47,139 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 05:54:47,196 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 05:54:47,201 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 05:54:47,201 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 05:54:47,226 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 05:54:47,227 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 05:54:47,227 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 05:54:47,227 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 05:54:47,227 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 05:54:47,228 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 05:54:47,228 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 05:54:47,228 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 05:54:47,228 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 05:54:47,228 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 05:54:47,228 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 05:54:47,229 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 05:54:47,229 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 05:54:47,229 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 05:54:47,229 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 05:54:47,229 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 05:54:47,229 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 05:54:47,229 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 05:54:47,229 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 05:54:47,229 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 05:54:47,229 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 05:54:47,230 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 05:54:47,230 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 05:54:47,230 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 05:54:47,230 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 05:54:47,230 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 05:54:47,230 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 05:54:47,230 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:54:47,230 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 05:54:47,231 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 05:54:47,231 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 05:54:47,231 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 05:54:47,231 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:54:47,231 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 05:54:47,231 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 05:54:47,231 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 05:54:47,231 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 05:54:47,231 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 05:54:47,231 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 05:54:47,231 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 05:54:47,231 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 05:54:47,232 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 05:54:47,232 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 05:54:47,232 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 -> d71af2f98c077390fd8e26a4651323aedf075614618ebe27bc0480b53a002253 [2025-01-09 05:54:47,452 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 05:54:47,466 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 05:54:47,470 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 05:54:47,472 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 05:54:47,472 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 05:54:47,473 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.6.ufo.BOUNDED-12.pals+Problem12_label07.c [2025-01-09 05:54:48,722 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/df23ae1dc/0a05fa99fccd4135a5298585caaa92cb/FLAGdb4763940 [2025-01-09 05:54:49,192 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 05:54:49,193 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.6.ufo.BOUNDED-12.pals+Problem12_label07.c [2025-01-09 05:54:49,215 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/df23ae1dc/0a05fa99fccd4135a5298585caaa92cb/FLAGdb4763940 [2025-01-09 05:54:49,226 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/df23ae1dc/0a05fa99fccd4135a5298585caaa92cb [2025-01-09 05:54:49,228 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 05:54:49,229 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 05:54:49,230 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 05:54:49,230 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 05:54:49,233 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 05:54:49,233 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 05:54:49" (1/1) ... [2025-01-09 05:54:49,234 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21462408 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:54:49, skipping insertion in model container [2025-01-09 05:54:49,234 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 05:54:49" (1/1) ... [2025-01-09 05:54:49,312 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 05:54:49,604 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/combinations/pals_lcr.6.ufo.BOUNDED-12.pals+Problem12_label07.c[15482,15495] [2025-01-09 05:54:49,636 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/combinations/pals_lcr.6.ufo.BOUNDED-12.pals+Problem12_label07.c[16324,16337] [2025-01-09 05:54:50,073 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 05:54:50,087 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 05:54:50,124 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/combinations/pals_lcr.6.ufo.BOUNDED-12.pals+Problem12_label07.c[15482,15495] [2025-01-09 05:54:50,129 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/combinations/pals_lcr.6.ufo.BOUNDED-12.pals+Problem12_label07.c[16324,16337] [2025-01-09 05:54:50,374 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 05:54:50,394 INFO L204 MainTranslator]: Completed translation [2025-01-09 05:54:50,395 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:54:50 WrapperNode [2025-01-09 05:54:50,395 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 05:54:50,396 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 05:54:50,396 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 05:54:50,396 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 05:54:50,401 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:54:50" (1/1) ... [2025-01-09 05:54:50,445 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:54:50" (1/1) ... [2025-01-09 05:54:50,687 INFO L138 Inliner]: procedures = 37, calls = 23, calls flagged for inlining = 18, calls inlined = 18, statements flattened = 5153 [2025-01-09 05:54:50,688 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 05:54:50,688 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 05:54:50,688 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 05:54:50,688 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 05:54:50,695 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:54:50" (1/1) ... [2025-01-09 05:54:50,696 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:54:50" (1/1) ... [2025-01-09 05:54:50,743 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:54:50" (1/1) ... [2025-01-09 05:54:50,868 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 05:54:50,868 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:54:50" (1/1) ... [2025-01-09 05:54:50,869 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:54:50" (1/1) ... [2025-01-09 05:54:50,968 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:54:50" (1/1) ... [2025-01-09 05:54:50,984 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:54:50" (1/1) ... [2025-01-09 05:54:51,007 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:54:50" (1/1) ... [2025-01-09 05:54:51,052 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:54:50" (1/1) ... [2025-01-09 05:54:51,071 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:54:50" (1/1) ... [2025-01-09 05:54:51,115 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 05:54:51,116 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 05:54:51,117 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 05:54:51,117 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 05:54:51,118 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:54:50" (1/1) ... [2025-01-09 05:54:51,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:54:51,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:54:51,146 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 05:54:51,154 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 05:54:51,179 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 05:54:51,180 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 05:54:51,180 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 05:54:51,180 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 05:54:51,256 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 05:54:51,257 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 05:54:54,654 INFO L? ?]: Removed 749 outVars from TransFormulas that were not future-live. [2025-01-09 05:54:54,654 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 05:54:54,687 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 05:54:54,687 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 05:54:54,688 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 05:54:54 BoogieIcfgContainer [2025-01-09 05:54:54,688 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 05:54:54,690 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 05:54:54,690 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 05:54:54,694 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 05:54:54,694 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 05:54:49" (1/3) ... [2025-01-09 05:54:54,694 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@450ecc00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 05:54:54, skipping insertion in model container [2025-01-09 05:54:54,695 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:54:50" (2/3) ... [2025-01-09 05:54:54,695 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@450ecc00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 05:54:54, skipping insertion in model container [2025-01-09 05:54:54,695 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 05:54:54" (3/3) ... [2025-01-09 05:54:54,696 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.6.ufo.BOUNDED-12.pals+Problem12_label07.c [2025-01-09 05:54:54,708 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 05:54:54,711 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.6.ufo.BOUNDED-12.pals+Problem12_label07.c that has 1 procedures, 913 locations, 1 initial locations, 2 loop locations, and 2 error locations. [2025-01-09 05:54:54,777 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 05:54:54,788 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;@689bb8b8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 05:54:54,788 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-09 05:54:54,795 INFO L276 IsEmpty]: Start isEmpty. Operand has 913 states, 910 states have (on average 1.9032967032967032) internal successors, (1732), 912 states have internal predecessors, (1732), 0 states have call successors, (0), 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 05:54:54,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-01-09 05:54:54,800 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:54:54,801 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:54:54,801 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:54:54,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:54:54,806 INFO L85 PathProgramCache]: Analyzing trace with hash -2052927245, now seen corresponding path program 1 times [2025-01-09 05:54:54,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:54:54,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781664153] [2025-01-09 05:54:54,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:54:54,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:54:54,869 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-09 05:54:54,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-09 05:54:54,888 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:54:54,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:54:54,967 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 05:54:54,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:54:54,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781664153] [2025-01-09 05:54:54,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781664153] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:54:54,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:54:54,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 05:54:54,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277219228] [2025-01-09 05:54:54,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:54:54,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:54:54,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:54:54,987 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:54:54,988 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:54:54,991 INFO L87 Difference]: Start difference. First operand has 913 states, 910 states have (on average 1.9032967032967032) internal successors, (1732), 912 states have internal predecessors, (1732), 0 states have call successors, (0), 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 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 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 05:54:57,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:54:57,954 INFO L93 Difference]: Finished difference Result 2535 states and 4877 transitions. [2025-01-09 05:54:57,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:54:57,956 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2025-01-09 05:54:57,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:54:57,971 INFO L225 Difference]: With dead ends: 2535 [2025-01-09 05:54:57,971 INFO L226 Difference]: Without dead ends: 1599 [2025-01-09 05:54:57,980 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:54:57,986 INFO L435 NwaCegarLoop]: 258 mSDtfsCounter, 1018 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 2337 mSolverCounterSat, 1058 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1018 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 3395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1058 IncrementalHoareTripleChecker+Valid, 2337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-01-09 05:54:57,986 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1018 Valid, 269 Invalid, 3395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1058 Valid, 2337 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-01-09 05:54:57,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1599 states. [2025-01-09 05:54:58,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1599 to 1599. [2025-01-09 05:54:58,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1599 states, 1597 states have (on average 1.8641202254226674) internal successors, (2977), 1598 states have internal predecessors, (2977), 0 states have call successors, (0), 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 05:54:58,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1599 states to 1599 states and 2977 transitions. [2025-01-09 05:54:58,064 INFO L78 Accepts]: Start accepts. Automaton has 1599 states and 2977 transitions. Word has length 7 [2025-01-09 05:54:58,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:54:58,065 INFO L471 AbstractCegarLoop]: Abstraction has 1599 states and 2977 transitions. [2025-01-09 05:54:58,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 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 05:54:58,065 INFO L276 IsEmpty]: Start isEmpty. Operand 1599 states and 2977 transitions. [2025-01-09 05:54:58,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-01-09 05:54:58,066 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:54:58,066 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] [2025-01-09 05:54:58,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 05:54:58,066 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:54:58,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:54:58,067 INFO L85 PathProgramCache]: Analyzing trace with hash -39335136, now seen corresponding path program 1 times [2025-01-09 05:54:58,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:54:58,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229497898] [2025-01-09 05:54:58,067 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:54:58,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:54:58,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-09 05:54:58,119 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 05:54:58,119 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:54:58,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:54:58,325 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 05:54:58,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:54:58,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229497898] [2025-01-09 05:54:58,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229497898] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:54:58,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:54:58,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 05:54:58,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38740148] [2025-01-09 05:54:58,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:54:58,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 05:54:58,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:54:58,327 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 05:54:58,328 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 05:54:58,328 INFO L87 Difference]: Start difference. First operand 1599 states and 2977 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 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 05:54:58,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:54:58,384 INFO L93 Difference]: Finished difference Result 1651 states and 3058 transitions. [2025-01-09 05:54:58,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 05:54:58,385 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 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 26 [2025-01-09 05:54:58,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:54:58,389 INFO L225 Difference]: With dead ends: 1651 [2025-01-09 05:54:58,389 INFO L226 Difference]: Without dead ends: 1599 [2025-01-09 05:54:58,390 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 05:54:58,391 INFO L435 NwaCegarLoop]: 1600 mSDtfsCounter, 0 mSDsluCounter, 4755 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6355 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:54:58,391 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6355 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:54:58,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1599 states. [2025-01-09 05:54:58,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1599 to 1599. [2025-01-09 05:54:58,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1599 states, 1597 states have (on average 1.839073262366938) internal successors, (2937), 1598 states have internal predecessors, (2937), 0 states have call successors, (0), 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 05:54:58,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1599 states to 1599 states and 2937 transitions. [2025-01-09 05:54:58,415 INFO L78 Accepts]: Start accepts. Automaton has 1599 states and 2937 transitions. Word has length 26 [2025-01-09 05:54:58,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:54:58,415 INFO L471 AbstractCegarLoop]: Abstraction has 1599 states and 2937 transitions. [2025-01-09 05:54:58,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 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 05:54:58,416 INFO L276 IsEmpty]: Start isEmpty. Operand 1599 states and 2937 transitions. [2025-01-09 05:54:58,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-01-09 05:54:58,417 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:54:58,417 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:54:58,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 05:54:58,417 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:54:58,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:54:58,418 INFO L85 PathProgramCache]: Analyzing trace with hash -1783115668, now seen corresponding path program 1 times [2025-01-09 05:54:58,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:54:58,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351777009] [2025-01-09 05:54:58,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:54:58,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:54:58,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-01-09 05:54:58,440 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-01-09 05:54:58,440 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:54:58,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:54:58,589 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 05:54:58,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:54:58,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351777009] [2025-01-09 05:54:58,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351777009] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:54:58,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:54:58,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 05:54:58,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054287925] [2025-01-09 05:54:58,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:54:58,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 05:54:58,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:54:58,591 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 05:54:58,591 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 05:54:58,591 INFO L87 Difference]: Start difference. First operand 1599 states and 2937 transitions. Second operand has 8 states, 8 states have (on average 8.125) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:54:58,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:54:58,834 INFO L93 Difference]: Finished difference Result 2175 states and 3861 transitions. [2025-01-09 05:54:58,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 05:54:58,834 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.125) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2025-01-09 05:54:58,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:54:58,841 INFO L225 Difference]: With dead ends: 2175 [2025-01-09 05:54:58,841 INFO L226 Difference]: Without dead ends: 2127 [2025-01-09 05:54:58,842 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=181, Unknown=0, NotChecked=0, Total=272 [2025-01-09 05:54:58,843 INFO L435 NwaCegarLoop]: 1558 mSDtfsCounter, 9697 mSDsluCounter, 2377 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9697 SdHoareTripleChecker+Valid, 3935 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 05:54:58,844 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9697 Valid, 3935 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 05:54:58,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2127 states. [2025-01-09 05:54:58,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2127 to 1645. [2025-01-09 05:54:58,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1645 states, 1643 states have (on average 1.8326232501521607) internal successors, (3011), 1644 states have internal predecessors, (3011), 0 states have call successors, (0), 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 05:54:58,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1645 states to 1645 states and 3011 transitions. [2025-01-09 05:54:58,875 INFO L78 Accepts]: Start accepts. Automaton has 1645 states and 3011 transitions. Word has length 65 [2025-01-09 05:54:58,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:54:58,876 INFO L471 AbstractCegarLoop]: Abstraction has 1645 states and 3011 transitions. [2025-01-09 05:54:58,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.125) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:54:58,877 INFO L276 IsEmpty]: Start isEmpty. Operand 1645 states and 3011 transitions. [2025-01-09 05:54:58,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-01-09 05:54:58,880 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:54:58,880 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:54:58,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 05:54:58,880 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:54:58,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:54:58,881 INFO L85 PathProgramCache]: Analyzing trace with hash -1297900228, now seen corresponding path program 1 times [2025-01-09 05:54:58,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:54:58,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724414515] [2025-01-09 05:54:58,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:54:58,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:54:58,897 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-01-09 05:54:58,917 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-01-09 05:54:58,920 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:54:58,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:54:59,018 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 05:54:59,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:54:59,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724414515] [2025-01-09 05:54:59,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724414515] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:54:59,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:54:59,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:54:59,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091543049] [2025-01-09 05:54:59,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:54:59,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:54:59,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:54:59,019 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:54:59,019 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:54:59,019 INFO L87 Difference]: Start difference. First operand 1645 states and 3011 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:54:59,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:54:59,056 INFO L93 Difference]: Finished difference Result 1822 states and 3294 transitions. [2025-01-09 05:54:59,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:54:59,057 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2025-01-09 05:54:59,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:54:59,064 INFO L225 Difference]: With dead ends: 1822 [2025-01-09 05:54:59,064 INFO L226 Difference]: Without dead ends: 1728 [2025-01-09 05:54:59,065 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 05:54:59,066 INFO L435 NwaCegarLoop]: 1560 mSDtfsCounter, 1490 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1490 SdHoareTripleChecker+Valid, 1632 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 05:54:59,066 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1490 Valid, 1632 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:54:59,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1728 states. [2025-01-09 05:54:59,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1728 to 1726. [2025-01-09 05:54:59,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1726 states, 1724 states have (on average 1.8207656612529002) internal successors, (3139), 1725 states have internal predecessors, (3139), 0 states have call successors, (0), 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 05:54:59,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1726 states to 1726 states and 3139 transitions. [2025-01-09 05:54:59,099 INFO L78 Accepts]: Start accepts. Automaton has 1726 states and 3139 transitions. Word has length 67 [2025-01-09 05:54:59,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:54:59,099 INFO L471 AbstractCegarLoop]: Abstraction has 1726 states and 3139 transitions. [2025-01-09 05:54:59,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:54:59,099 INFO L276 IsEmpty]: Start isEmpty. Operand 1726 states and 3139 transitions. [2025-01-09 05:54:59,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-01-09 05:54:59,101 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:54:59,101 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:54:59,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 05:54:59,102 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:54:59,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:54:59,102 INFO L85 PathProgramCache]: Analyzing trace with hash -1231406716, now seen corresponding path program 1 times [2025-01-09 05:54:59,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:54:59,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216704627] [2025-01-09 05:54:59,102 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:54:59,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:54:59,111 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-01-09 05:54:59,122 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-01-09 05:54:59,122 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:54:59,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:54:59,480 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 05:54:59,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:54:59,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216704627] [2025-01-09 05:54:59,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216704627] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:54:59,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:54:59,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 05:54:59,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697615468] [2025-01-09 05:54:59,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:54:59,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 05:54:59,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:54:59,481 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 05:54:59,481 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-01-09 05:54:59,481 INFO L87 Difference]: Start difference. First operand 1726 states and 3139 transitions. Second operand has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 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 05:54:59,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:54:59,724 INFO L93 Difference]: Finished difference Result 1903 states and 3419 transitions. [2025-01-09 05:54:59,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 05:54:59,725 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2025-01-09 05:54:59,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:54:59,729 INFO L225 Difference]: With dead ends: 1903 [2025-01-09 05:54:59,729 INFO L226 Difference]: Without dead ends: 1728 [2025-01-09 05:54:59,730 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2025-01-09 05:54:59,732 INFO L435 NwaCegarLoop]: 1554 mSDtfsCounter, 4516 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4516 SdHoareTripleChecker+Valid, 1922 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 05:54:59,732 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4516 Valid, 1922 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 05:54:59,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1728 states. [2025-01-09 05:54:59,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1728 to 1726. [2025-01-09 05:54:59,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1726 states, 1724 states have (on average 1.8196055684454757) internal successors, (3137), 1725 states have internal predecessors, (3137), 0 states have call successors, (0), 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 05:54:59,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1726 states to 1726 states and 3137 transitions. [2025-01-09 05:54:59,756 INFO L78 Accepts]: Start accepts. Automaton has 1726 states and 3137 transitions. Word has length 67 [2025-01-09 05:54:59,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:54:59,756 INFO L471 AbstractCegarLoop]: Abstraction has 1726 states and 3137 transitions. [2025-01-09 05:54:59,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 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 05:54:59,756 INFO L276 IsEmpty]: Start isEmpty. Operand 1726 states and 3137 transitions. [2025-01-09 05:54:59,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-01-09 05:54:59,757 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:54:59,758 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:54:59,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 05:54:59,758 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:54:59,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:54:59,758 INFO L85 PathProgramCache]: Analyzing trace with hash 66374464, now seen corresponding path program 1 times [2025-01-09 05:54:59,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:54:59,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892947567] [2025-01-09 05:54:59,758 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:54:59,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:54:59,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-01-09 05:54:59,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-01-09 05:54:59,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:54:59,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:54:59,990 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 05:54:59,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:54:59,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892947567] [2025-01-09 05:54:59,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892947567] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:54:59,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:54:59,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 05:54:59,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469190358] [2025-01-09 05:54:59,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:54:59,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 05:54:59,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:54:59,991 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 05:54:59,991 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 05:54:59,991 INFO L87 Difference]: Start difference. First operand 1726 states and 3137 transitions. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 0 states have call successors, (0), 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 05:55:00,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:55:00,023 INFO L93 Difference]: Finished difference Result 1734 states and 3146 transitions. [2025-01-09 05:55:00,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 05:55:00,024 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 0 states have call successors, (0), 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 68 [2025-01-09 05:55:00,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:55:00,029 INFO L225 Difference]: With dead ends: 1734 [2025-01-09 05:55:00,029 INFO L226 Difference]: Without dead ends: 1732 [2025-01-09 05:55:00,029 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 05:55:00,031 INFO L435 NwaCegarLoop]: 1559 mSDtfsCounter, 0 mSDsluCounter, 4668 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6227 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 05:55:00,031 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6227 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:55:00,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1732 states. [2025-01-09 05:55:00,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1732 to 1732. [2025-01-09 05:55:00,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1732 states, 1730 states have (on average 1.8161849710982658) internal successors, (3142), 1731 states have internal predecessors, (3142), 0 states have call successors, (0), 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 05:55:00,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1732 states to 1732 states and 3142 transitions. [2025-01-09 05:55:00,058 INFO L78 Accepts]: Start accepts. Automaton has 1732 states and 3142 transitions. Word has length 68 [2025-01-09 05:55:00,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:55:00,058 INFO L471 AbstractCegarLoop]: Abstraction has 1732 states and 3142 transitions. [2025-01-09 05:55:00,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 0 states have call successors, (0), 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 05:55:00,059 INFO L276 IsEmpty]: Start isEmpty. Operand 1732 states and 3142 transitions. [2025-01-09 05:55:00,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-01-09 05:55:00,059 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:55:00,059 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:55:00,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 05:55:00,060 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:55:00,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:55:00,061 INFO L85 PathProgramCache]: Analyzing trace with hash -2026826780, now seen corresponding path program 1 times [2025-01-09 05:55:00,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:55:00,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066291710] [2025-01-09 05:55:00,061 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:55:00,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:55:00,069 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-09 05:55:00,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 05:55:00,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:55:00,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:55:00,111 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 05:55:00,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:55:00,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066291710] [2025-01-09 05:55:00,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066291710] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:55:00,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:55:00,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:55:00,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418302874] [2025-01-09 05:55:00,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:55:00,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:55:00,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:55:00,112 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:55:00,112 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:55:00,112 INFO L87 Difference]: Start difference. First operand 1732 states and 3142 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 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 05:55:00,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:55:00,136 INFO L93 Difference]: Finished difference Result 1926 states and 3443 transitions. [2025-01-09 05:55:00,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:55:00,137 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 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 05:55:00,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:55:00,142 INFO L225 Difference]: With dead ends: 1926 [2025-01-09 05:55:00,142 INFO L226 Difference]: Without dead ends: 1826 [2025-01-09 05:55:00,142 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 05:55:00,143 INFO L435 NwaCegarLoop]: 1624 mSDtfsCounter, 1506 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1506 SdHoareTripleChecker+Valid, 1702 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:55:00,143 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1506 Valid, 1702 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:55:00,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1826 states. [2025-01-09 05:55:00,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1826 to 1824. [2025-01-09 05:55:00,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1824 states, 1822 states have (on average 1.8018660812294183) internal successors, (3283), 1823 states have internal predecessors, (3283), 0 states have call successors, (0), 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 05:55:00,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1824 states to 1824 states and 3283 transitions. [2025-01-09 05:55:00,170 INFO L78 Accepts]: Start accepts. Automaton has 1824 states and 3283 transitions. Word has length 69 [2025-01-09 05:55:00,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:55:00,171 INFO L471 AbstractCegarLoop]: Abstraction has 1824 states and 3283 transitions. [2025-01-09 05:55:00,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 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 05:55:00,171 INFO L276 IsEmpty]: Start isEmpty. Operand 1824 states and 3283 transitions. [2025-01-09 05:55:00,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-01-09 05:55:00,172 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:55:00,172 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:55:00,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 05:55:00,172 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:55:00,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:55:00,172 INFO L85 PathProgramCache]: Analyzing trace with hash -1863912220, now seen corresponding path program 1 times [2025-01-09 05:55:00,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:55:00,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960181225] [2025-01-09 05:55:00,173 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:55:00,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:55:00,183 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-09 05:55:00,193 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 05:55:00,193 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:55:00,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:55:00,225 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 05:55:00,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:55:00,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960181225] [2025-01-09 05:55:00,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960181225] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:55:00,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:55:00,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:55:00,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684288085] [2025-01-09 05:55:00,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:55:00,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:55:00,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:55:00,227 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:55:00,227 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:55:00,227 INFO L87 Difference]: Start difference. First operand 1824 states and 3283 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 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 05:55:00,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:55:00,252 INFO L93 Difference]: Finished difference Result 2342 states and 4083 transitions. [2025-01-09 05:55:00,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:55:00,253 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 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 05:55:00,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:55:00,259 INFO L225 Difference]: With dead ends: 2342 [2025-01-09 05:55:00,259 INFO L226 Difference]: Without dead ends: 2071 [2025-01-09 05:55:00,260 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 05:55:00,260 INFO L435 NwaCegarLoop]: 1626 mSDtfsCounter, 1504 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1504 SdHoareTripleChecker+Valid, 1708 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:55:00,260 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1504 Valid, 1708 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:55:00,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2071 states. [2025-01-09 05:55:00,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2071 to 2069. [2025-01-09 05:55:00,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2069 states, 2067 states have (on average 1.768263183357523) internal successors, (3655), 2068 states have internal predecessors, (3655), 0 states have call successors, (0), 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 05:55:00,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2069 states to 2069 states and 3655 transitions. [2025-01-09 05:55:00,292 INFO L78 Accepts]: Start accepts. Automaton has 2069 states and 3655 transitions. Word has length 69 [2025-01-09 05:55:00,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:55:00,292 INFO L471 AbstractCegarLoop]: Abstraction has 2069 states and 3655 transitions. [2025-01-09 05:55:00,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 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 05:55:00,292 INFO L276 IsEmpty]: Start isEmpty. Operand 2069 states and 3655 transitions. [2025-01-09 05:55:00,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-01-09 05:55:00,293 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:55:00,293 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:55:00,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 05:55:00,293 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:55:00,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:55:00,293 INFO L85 PathProgramCache]: Analyzing trace with hash -1600055836, now seen corresponding path program 1 times [2025-01-09 05:55:00,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:55:00,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385539251] [2025-01-09 05:55:00,293 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:55:00,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:55:00,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-09 05:55:00,305 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 05:55:00,305 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:55:00,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:55:00,333 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 05:55:00,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:55:00,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385539251] [2025-01-09 05:55:00,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385539251] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:55:00,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:55:00,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:55:00,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459174876] [2025-01-09 05:55:00,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:55:00,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:55:00,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:55:00,334 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:55:00,334 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:55:00,335 INFO L87 Difference]: Start difference. First operand 2069 states and 3655 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 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 05:55:00,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:55:00,365 INFO L93 Difference]: Finished difference Result 3053 states and 5157 transitions. [2025-01-09 05:55:00,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:55:00,365 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 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 05:55:00,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:55:00,372 INFO L225 Difference]: With dead ends: 3053 [2025-01-09 05:55:00,372 INFO L226 Difference]: Without dead ends: 2537 [2025-01-09 05:55:00,373 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 05:55:00,373 INFO L435 NwaCegarLoop]: 1624 mSDtfsCounter, 1502 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1502 SdHoareTripleChecker+Valid, 1710 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:55:00,374 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1502 Valid, 1710 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:55:00,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2537 states. [2025-01-09 05:55:00,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2537 to 2535. [2025-01-09 05:55:00,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2535 states, 2533 states have (on average 1.717726016581129) internal successors, (4351), 2534 states have internal predecessors, (4351), 0 states have call successors, (0), 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 05:55:00,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2535 states to 2535 states and 4351 transitions. [2025-01-09 05:55:00,412 INFO L78 Accepts]: Start accepts. Automaton has 2535 states and 4351 transitions. Word has length 69 [2025-01-09 05:55:00,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:55:00,412 INFO L471 AbstractCegarLoop]: Abstraction has 2535 states and 4351 transitions. [2025-01-09 05:55:00,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 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 05:55:00,412 INFO L276 IsEmpty]: Start isEmpty. Operand 2535 states and 4351 transitions. [2025-01-09 05:55:00,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-01-09 05:55:00,413 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:55:00,413 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:55:00,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 05:55:00,413 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:55:00,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:55:00,413 INFO L85 PathProgramCache]: Analyzing trace with hash -361793820, now seen corresponding path program 1 times [2025-01-09 05:55:00,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:55:00,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776789735] [2025-01-09 05:55:00,414 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:55:00,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:55:00,420 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-09 05:55:00,425 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 05:55:00,425 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:55:00,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:55:00,453 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 05:55:00,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:55:00,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776789735] [2025-01-09 05:55:00,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776789735] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:55:00,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:55:00,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:55:00,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401042793] [2025-01-09 05:55:00,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:55:00,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:55:00,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:55:00,454 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:55:00,454 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:55:00,454 INFO L87 Difference]: Start difference. First operand 2535 states and 4351 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 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 05:55:00,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:55:00,488 INFO L93 Difference]: Finished difference Result 4403 states and 7161 transitions. [2025-01-09 05:55:00,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:55:00,489 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 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 05:55:00,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:55:00,498 INFO L225 Difference]: With dead ends: 4403 [2025-01-09 05:55:00,498 INFO L226 Difference]: Without dead ends: 3421 [2025-01-09 05:55:00,500 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 05:55:00,500 INFO L435 NwaCegarLoop]: 1622 mSDtfsCounter, 1500 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1500 SdHoareTripleChecker+Valid, 1712 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:55:00,500 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1500 Valid, 1712 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:55:00,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3421 states. [2025-01-09 05:55:00,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3421 to 3419. [2025-01-09 05:55:00,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3419 states, 3417 states have (on average 1.652619256657887) internal successors, (5647), 3418 states have internal predecessors, (5647), 0 states have call successors, (0), 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 05:55:00,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3419 states to 3419 states and 5647 transitions. [2025-01-09 05:55:00,556 INFO L78 Accepts]: Start accepts. Automaton has 3419 states and 5647 transitions. Word has length 69 [2025-01-09 05:55:00,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:55:00,556 INFO L471 AbstractCegarLoop]: Abstraction has 3419 states and 5647 transitions. [2025-01-09 05:55:00,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 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 05:55:00,556 INFO L276 IsEmpty]: Start isEmpty. Operand 3419 states and 5647 transitions. [2025-01-09 05:55:00,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-01-09 05:55:00,557 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:55:00,557 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:55:00,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 05:55:00,557 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:55:00,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:55:00,557 INFO L85 PathProgramCache]: Analyzing trace with hash -796329756, now seen corresponding path program 1 times [2025-01-09 05:55:00,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:55:00,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225180556] [2025-01-09 05:55:00,557 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:55:00,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:55:00,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-09 05:55:00,570 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 05:55:00,570 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:55:00,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:55:00,635 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 05:55:00,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:55:00,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225180556] [2025-01-09 05:55:00,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225180556] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:55:00,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:55:00,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:55:00,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208072572] [2025-01-09 05:55:00,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:55:00,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:55:00,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:55:00,635 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:55:00,635 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:55:00,636 INFO L87 Difference]: Start difference. First operand 3419 states and 5647 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 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 05:55:00,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:55:00,685 INFO L93 Difference]: Finished difference Result 6959 states and 10881 transitions. [2025-01-09 05:55:00,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:55:00,685 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 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 05:55:00,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:55:00,698 INFO L225 Difference]: With dead ends: 6959 [2025-01-09 05:55:00,698 INFO L226 Difference]: Without dead ends: 5093 [2025-01-09 05:55:00,700 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 05:55:00,700 INFO L435 NwaCegarLoop]: 1610 mSDtfsCounter, 1496 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1496 SdHoareTripleChecker+Valid, 1708 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:55:00,700 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1496 Valid, 1708 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:55:00,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5093 states. [2025-01-09 05:55:00,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5093 to 5091. [2025-01-09 05:55:00,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5091 states, 5089 states have (on average 1.5812536844173708) internal successors, (8047), 5090 states have internal predecessors, (8047), 0 states have call successors, (0), 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 05:55:00,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5091 states to 5091 states and 8047 transitions. [2025-01-09 05:55:00,781 INFO L78 Accepts]: Start accepts. Automaton has 5091 states and 8047 transitions. Word has length 69 [2025-01-09 05:55:00,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:55:00,781 INFO L471 AbstractCegarLoop]: Abstraction has 5091 states and 8047 transitions. [2025-01-09 05:55:00,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 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 05:55:00,782 INFO L276 IsEmpty]: Start isEmpty. Operand 5091 states and 8047 transitions. [2025-01-09 05:55:00,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-01-09 05:55:00,782 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:55:00,782 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:55:00,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 05:55:00,782 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:55:00,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:55:00,783 INFO L85 PathProgramCache]: Analyzing trace with hash 1717704676, now seen corresponding path program 1 times [2025-01-09 05:55:00,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:55:00,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992788966] [2025-01-09 05:55:00,783 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:55:00,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:55:00,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-09 05:55:00,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 05:55:00,795 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:55:00,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:55:00,829 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 05:55:00,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:55:00,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992788966] [2025-01-09 05:55:00,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992788966] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:55:00,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:55:00,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:55:00,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102614095] [2025-01-09 05:55:00,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:55:00,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:55:00,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:55:00,830 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:55:00,830 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:55:00,830 INFO L87 Difference]: Start difference. First operand 5091 states and 8047 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 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 05:55:00,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:55:00,914 INFO L93 Difference]: Finished difference Result 11783 states and 17745 transitions. [2025-01-09 05:55:00,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:55:00,914 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 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 05:55:00,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:55:00,931 INFO L225 Difference]: With dead ends: 11783 [2025-01-09 05:55:00,931 INFO L226 Difference]: Without dead ends: 8245 [2025-01-09 05:55:00,936 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 05:55:00,937 INFO L435 NwaCegarLoop]: 1620 mSDtfsCounter, 1498 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1498 SdHoareTripleChecker+Valid, 1714 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:55:00,937 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1498 Valid, 1714 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:55:00,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8245 states. [2025-01-09 05:55:01,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8245 to 8243. [2025-01-09 05:55:01,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8243 states, 8241 states have (on average 1.5123164664482465) internal successors, (12463), 8242 states have internal predecessors, (12463), 0 states have call successors, (0), 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 05:55:01,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8243 states to 8243 states and 12463 transitions. [2025-01-09 05:55:01,088 INFO L78 Accepts]: Start accepts. Automaton has 8243 states and 12463 transitions. Word has length 69 [2025-01-09 05:55:01,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:55:01,088 INFO L471 AbstractCegarLoop]: Abstraction has 8243 states and 12463 transitions. [2025-01-09 05:55:01,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 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 05:55:01,089 INFO L276 IsEmpty]: Start isEmpty. Operand 8243 states and 12463 transitions. [2025-01-09 05:55:01,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-01-09 05:55:01,090 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:55:01,090 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:55:01,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 05:55:01,090 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:55:01,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:55:01,091 INFO L85 PathProgramCache]: Analyzing trace with hash 502318387, now seen corresponding path program 1 times [2025-01-09 05:55:01,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:55:01,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727102698] [2025-01-09 05:55:01,091 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:55:01,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:55:01,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-01-09 05:55:01,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-01-09 05:55:01,105 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:55:01,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:55:01,144 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:55:01,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:55:01,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727102698] [2025-01-09 05:55:01,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727102698] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:55:01,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:55:01,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 05:55:01,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268036344] [2025-01-09 05:55:01,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:55:01,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:55:01,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:55:01,146 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:55:01,146 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:55:01,146 INFO L87 Difference]: Start difference. First operand 8243 states and 12463 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 2 states have internal predecessors, (80), 0 states have call successors, (0), 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 05:55:03,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:55:03,887 INFO L93 Difference]: Finished difference Result 11251 states and 18087 transitions. [2025-01-09 05:55:03,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:55:03,888 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 2 states have internal predecessors, (80), 0 states have call successors, (0), 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 80 [2025-01-09 05:55:03,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:55:03,904 INFO L225 Difference]: With dead ends: 11251 [2025-01-09 05:55:03,904 INFO L226 Difference]: Without dead ends: 9747 [2025-01-09 05:55:03,907 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:55:03,908 INFO L435 NwaCegarLoop]: 470 mSDtfsCounter, 1040 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2309 mSolverCounterSat, 550 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1040 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 2859 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 550 IncrementalHoareTripleChecker+Valid, 2309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-01-09 05:55:03,908 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1040 Valid, 477 Invalid, 2859 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [550 Valid, 2309 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-01-09 05:55:03,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9747 states. [2025-01-09 05:55:04,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9747 to 9745. [2025-01-09 05:55:04,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9745 states, 9743 states have (on average 1.500564507851791) internal successors, (14620), 9744 states have internal predecessors, (14620), 0 states have call successors, (0), 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 05:55:04,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9745 states to 9745 states and 14620 transitions. [2025-01-09 05:55:04,072 INFO L78 Accepts]: Start accepts. Automaton has 9745 states and 14620 transitions. Word has length 80 [2025-01-09 05:55:04,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:55:04,072 INFO L471 AbstractCegarLoop]: Abstraction has 9745 states and 14620 transitions. [2025-01-09 05:55:04,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 2 states have internal predecessors, (80), 0 states have call successors, (0), 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 05:55:04,072 INFO L276 IsEmpty]: Start isEmpty. Operand 9745 states and 14620 transitions. [2025-01-09 05:55:04,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-01-09 05:55:04,076 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:55:04,076 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:55:04,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 05:55:04,076 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:55:04,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:55:04,077 INFO L85 PathProgramCache]: Analyzing trace with hash -1175898238, now seen corresponding path program 1 times [2025-01-09 05:55:04,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:55:04,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478048675] [2025-01-09 05:55:04,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:55:04,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:55:04,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-01-09 05:55:04,099 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-01-09 05:55:04,100 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:55:04,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:55:04,324 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 05:55:04,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:55:04,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478048675] [2025-01-09 05:55:04,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478048675] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:55:04,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:55:04,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 05:55:04,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306728286] [2025-01-09 05:55:04,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:55:04,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 05:55:04,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:55:04,326 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 05:55:04,326 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 05:55:04,327 INFO L87 Difference]: Start difference. First operand 9745 states and 14620 transitions. Second operand has 8 states, 8 states have (on average 11.125) internal successors, (89), 8 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:55:04,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:55:04,931 INFO L93 Difference]: Finished difference Result 49343 states and 71395 transitions. [2025-01-09 05:55:04,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 05:55:04,932 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.125) internal successors, (89), 8 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90 [2025-01-09 05:55:04,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:55:05,008 INFO L225 Difference]: With dead ends: 49343 [2025-01-09 05:55:05,009 INFO L226 Difference]: Without dead ends: 44605 [2025-01-09 05:55:05,022 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-01-09 05:55:05,023 INFO L435 NwaCegarLoop]: 1636 mSDtfsCounter, 8083 mSDsluCounter, 2490 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8083 SdHoareTripleChecker+Valid, 4126 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 05:55:05,023 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8083 Valid, 4126 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 05:55:05,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44605 states. [2025-01-09 05:55:05,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44605 to 15473. [2025-01-09 05:55:05,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15473 states, 15471 states have (on average 1.4703639066640812) internal successors, (22748), 15472 states have internal predecessors, (22748), 0 states have call successors, (0), 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 05:55:05,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15473 states to 15473 states and 22748 transitions. [2025-01-09 05:55:05,533 INFO L78 Accepts]: Start accepts. Automaton has 15473 states and 22748 transitions. Word has length 90 [2025-01-09 05:55:05,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:55:05,533 INFO L471 AbstractCegarLoop]: Abstraction has 15473 states and 22748 transitions. [2025-01-09 05:55:05,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.125) internal successors, (89), 8 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:55:05,533 INFO L276 IsEmpty]: Start isEmpty. Operand 15473 states and 22748 transitions. [2025-01-09 05:55:05,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-01-09 05:55:05,537 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:55:05,537 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:55:05,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 05:55:05,538 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:55:05,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:55:05,539 INFO L85 PathProgramCache]: Analyzing trace with hash -1012983678, now seen corresponding path program 1 times [2025-01-09 05:55:05,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:55:05,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414499560] [2025-01-09 05:55:05,539 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:55:05,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:55:05,549 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-01-09 05:55:05,559 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-01-09 05:55:05,559 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:55:05,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:55:05,676 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 05:55:05,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:55:05,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414499560] [2025-01-09 05:55:05,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414499560] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:55:05,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:55:05,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 05:55:05,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389203301] [2025-01-09 05:55:05,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:55:05,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 05:55:05,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:55:05,677 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 05:55:05,677 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 05:55:05,677 INFO L87 Difference]: Start difference. First operand 15473 states and 22748 transitions. Second operand has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:55:06,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:55:06,375 INFO L93 Difference]: Finished difference Result 56031 states and 80931 transitions. [2025-01-09 05:55:06,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 05:55:06,376 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90 [2025-01-09 05:55:06,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:55:06,483 INFO L225 Difference]: With dead ends: 56031 [2025-01-09 05:55:06,483 INFO L226 Difference]: Without dead ends: 49341 [2025-01-09 05:55:06,505 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-01-09 05:55:06,507 INFO L435 NwaCegarLoop]: 1635 mSDtfsCounter, 8087 mSDsluCounter, 2429 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8087 SdHoareTripleChecker+Valid, 4064 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 05:55:06,507 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8087 Valid, 4064 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 05:55:06,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49341 states. [2025-01-09 05:55:07,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49341 to 24529. [2025-01-09 05:55:07,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24529 states, 24527 states have (on average 1.4506462266074123) internal successors, (35580), 24528 states have internal predecessors, (35580), 0 states have call successors, (0), 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 05:55:07,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24529 states to 24529 states and 35580 transitions. [2025-01-09 05:55:07,142 INFO L78 Accepts]: Start accepts. Automaton has 24529 states and 35580 transitions. Word has length 90 [2025-01-09 05:55:07,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:55:07,142 INFO L471 AbstractCegarLoop]: Abstraction has 24529 states and 35580 transitions. [2025-01-09 05:55:07,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:55:07,142 INFO L276 IsEmpty]: Start isEmpty. Operand 24529 states and 35580 transitions. [2025-01-09 05:55:07,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-01-09 05:55:07,146 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:55:07,146 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:55:07,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 05:55:07,146 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:55:07,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:55:07,147 INFO L85 PathProgramCache]: Analyzing trace with hash -749127294, now seen corresponding path program 1 times [2025-01-09 05:55:07,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:55:07,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447990061] [2025-01-09 05:55:07,147 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:55:07,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:55:07,157 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-01-09 05:55:07,168 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-01-09 05:55:07,168 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:55:07,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:55:07,310 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-09 05:55:07,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:55:07,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447990061] [2025-01-09 05:55:07,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447990061] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:55:07,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:55:07,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 05:55:07,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496651747] [2025-01-09 05:55:07,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:55:07,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 05:55:07,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:55:07,311 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 05:55:07,311 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 05:55:07,311 INFO L87 Difference]: Start difference. First operand 24529 states and 35580 transitions. Second operand has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 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 05:55:08,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:55:08,389 INFO L93 Difference]: Finished difference Result 62719 states and 90435 transitions. [2025-01-09 05:55:08,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 05:55:08,389 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90 [2025-01-09 05:55:08,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:55:08,458 INFO L225 Difference]: With dead ends: 62719 [2025-01-09 05:55:08,458 INFO L226 Difference]: Without dead ends: 56029 [2025-01-09 05:55:08,474 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-01-09 05:55:08,475 INFO L435 NwaCegarLoop]: 1633 mSDtfsCounter, 8109 mSDsluCounter, 2382 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8109 SdHoareTripleChecker+Valid, 4015 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 05:55:08,476 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8109 Valid, 4015 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 05:55:08,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56029 states. [2025-01-09 05:55:09,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56029 to 31217. [2025-01-09 05:55:09,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31217 states, 31215 states have (on average 1.4443056222969726) internal successors, (45084), 31216 states have internal predecessors, (45084), 0 states have call successors, (0), 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 05:55:09,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31217 states to 31217 states and 45084 transitions. [2025-01-09 05:55:09,522 INFO L78 Accepts]: Start accepts. Automaton has 31217 states and 45084 transitions. Word has length 90 [2025-01-09 05:55:09,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:55:09,522 INFO L471 AbstractCegarLoop]: Abstraction has 31217 states and 45084 transitions. [2025-01-09 05:55:09,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 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 05:55:09,523 INFO L276 IsEmpty]: Start isEmpty. Operand 31217 states and 45084 transitions. [2025-01-09 05:55:09,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-01-09 05:55:09,527 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:55:09,527 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:55:09,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 05:55:09,528 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:55:09,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:55:09,528 INFO L85 PathProgramCache]: Analyzing trace with hash 489134722, now seen corresponding path program 1 times [2025-01-09 05:55:09,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:55:09,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917894392] [2025-01-09 05:55:09,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:55:09,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:55:09,539 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-01-09 05:55:09,549 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-01-09 05:55:09,550 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:55:09,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:55:09,697 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-09 05:55:09,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:55:09,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917894392] [2025-01-09 05:55:09,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917894392] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:55:09,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:55:09,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 05:55:09,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514032524] [2025-01-09 05:55:09,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:55:09,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 05:55:09,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:55:09,699 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 05:55:09,699 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 05:55:09,699 INFO L87 Difference]: Start difference. First operand 31217 states and 45084 transitions. Second operand has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 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 05:55:10,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:55:10,865 INFO L93 Difference]: Finished difference Result 69407 states and 99939 transitions. [2025-01-09 05:55:10,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 05:55:10,865 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90 [2025-01-09 05:55:10,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:55:10,937 INFO L225 Difference]: With dead ends: 69407 [2025-01-09 05:55:10,938 INFO L226 Difference]: Without dead ends: 62717 [2025-01-09 05:55:10,952 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-01-09 05:55:10,953 INFO L435 NwaCegarLoop]: 1631 mSDtfsCounter, 8197 mSDsluCounter, 2370 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8197 SdHoareTripleChecker+Valid, 4001 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 05:55:10,953 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8197 Valid, 4001 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 05:55:10,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62717 states. [2025-01-09 05:55:11,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62717 to 37905. [2025-01-09 05:55:11,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37905 states, 37903 states have (on average 1.4402026224837083) internal successors, (54588), 37904 states have internal predecessors, (54588), 0 states have call successors, (0), 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 05:55:11,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37905 states to 37905 states and 54588 transitions. [2025-01-09 05:55:11,767 INFO L78 Accepts]: Start accepts. Automaton has 37905 states and 54588 transitions. Word has length 90 [2025-01-09 05:55:11,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:55:11,767 INFO L471 AbstractCegarLoop]: Abstraction has 37905 states and 54588 transitions. [2025-01-09 05:55:11,767 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 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 05:55:11,767 INFO L276 IsEmpty]: Start isEmpty. Operand 37905 states and 54588 transitions. [2025-01-09 05:55:11,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-01-09 05:55:11,771 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:55:11,772 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:55:11,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 05:55:11,772 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:55:11,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:55:11,773 INFO L85 PathProgramCache]: Analyzing trace with hash 54598786, now seen corresponding path program 1 times [2025-01-09 05:55:11,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:55:11,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498660038] [2025-01-09 05:55:11,773 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:55:11,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:55:11,781 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-01-09 05:55:11,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-01-09 05:55:11,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:55:11,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:55:11,888 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 05:55:11,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:55:11,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498660038] [2025-01-09 05:55:11,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498660038] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:55:11,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:55:11,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 05:55:11,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855305944] [2025-01-09 05:55:11,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:55:11,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 05:55:11,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:55:11,889 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 05:55:11,889 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 05:55:11,889 INFO L87 Difference]: Start difference. First operand 37905 states and 54588 transitions. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 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 05:55:13,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:55:13,492 INFO L93 Difference]: Finished difference Result 76095 states and 109443 transitions. [2025-01-09 05:55:13,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 05:55:13,493 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90 [2025-01-09 05:55:13,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:55:13,584 INFO L225 Difference]: With dead ends: 76095 [2025-01-09 05:55:13,584 INFO L226 Difference]: Without dead ends: 69405 [2025-01-09 05:55:13,603 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-01-09 05:55:13,603 INFO L435 NwaCegarLoop]: 1631 mSDtfsCounter, 8135 mSDsluCounter, 2428 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8135 SdHoareTripleChecker+Valid, 4059 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 05:55:13,603 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8135 Valid, 4059 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 05:55:13,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69405 states. [2025-01-09 05:55:15,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69405 to 44593. [2025-01-09 05:55:15,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44593 states, 44591 states have (on average 1.4373304029961202) internal successors, (64092), 44592 states have internal predecessors, (64092), 0 states have call successors, (0), 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 05:55:15,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44593 states to 44593 states and 64092 transitions. [2025-01-09 05:55:15,157 INFO L78 Accepts]: Start accepts. Automaton has 44593 states and 64092 transitions. Word has length 90 [2025-01-09 05:55:15,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:55:15,157 INFO L471 AbstractCegarLoop]: Abstraction has 44593 states and 64092 transitions. [2025-01-09 05:55:15,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 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 05:55:15,158 INFO L276 IsEmpty]: Start isEmpty. Operand 44593 states and 64092 transitions. [2025-01-09 05:55:15,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-01-09 05:55:15,162 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:55:15,162 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:55:15,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 05:55:15,163 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:55:15,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:55:15,163 INFO L85 PathProgramCache]: Analyzing trace with hash -1726334078, now seen corresponding path program 1 times [2025-01-09 05:55:15,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:55:15,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597100622] [2025-01-09 05:55:15,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:55:15,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:55:15,173 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-01-09 05:55:15,183 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-01-09 05:55:15,183 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:55:15,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:55:15,473 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-09 05:55:15,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:55:15,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597100622] [2025-01-09 05:55:15,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597100622] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:55:15,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:55:15,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 05:55:15,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957128430] [2025-01-09 05:55:15,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:55:15,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 05:55:15,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:55:15,475 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 05:55:15,475 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 05:55:15,475 INFO L87 Difference]: Start difference. First operand 44593 states and 64092 transitions. Second operand has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 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 05:55:16,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:55:16,632 INFO L93 Difference]: Finished difference Result 82783 states and 118947 transitions. [2025-01-09 05:55:16,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 05:55:16,632 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90 [2025-01-09 05:55:16,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:55:16,768 INFO L225 Difference]: With dead ends: 82783 [2025-01-09 05:55:16,768 INFO L226 Difference]: Without dead ends: 76093 [2025-01-09 05:55:16,801 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-01-09 05:55:16,802 INFO L435 NwaCegarLoop]: 1630 mSDtfsCounter, 8042 mSDsluCounter, 2499 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8042 SdHoareTripleChecker+Valid, 4129 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 05:55:16,802 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8042 Valid, 4129 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 05:55:16,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76093 states. [2025-01-09 05:55:18,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76093 to 51281. [2025-01-09 05:55:18,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51281 states, 51279 states have (on average 1.435207394839993) internal successors, (73596), 51280 states have internal predecessors, (73596), 0 states have call successors, (0), 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 05:55:18,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51281 states to 51281 states and 73596 transitions. [2025-01-09 05:55:18,186 INFO L78 Accepts]: Start accepts. Automaton has 51281 states and 73596 transitions. Word has length 90 [2025-01-09 05:55:18,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:55:18,186 INFO L471 AbstractCegarLoop]: Abstraction has 51281 states and 73596 transitions. [2025-01-09 05:55:18,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 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 05:55:18,187 INFO L276 IsEmpty]: Start isEmpty. Operand 51281 states and 73596 transitions. [2025-01-09 05:55:18,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-01-09 05:55:18,191 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:55:18,191 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:55:18,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 05:55:18,191 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:55:18,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:55:18,192 INFO L85 PathProgramCache]: Analyzing trace with hash 446172403, now seen corresponding path program 1 times [2025-01-09 05:55:18,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:55:18,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798640586] [2025-01-09 05:55:18,192 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:55:18,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:55:18,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-01-09 05:55:18,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-01-09 05:55:18,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:55:18,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:55:18,314 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:55:18,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:55:18,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798640586] [2025-01-09 05:55:18,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798640586] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:55:18,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:55:18,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:55:18,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855886862] [2025-01-09 05:55:18,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:55:18,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:55:18,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:55:18,315 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:55:18,315 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:55:18,316 INFO L87 Difference]: Start difference. First operand 51281 states and 73596 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:55:19,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:55:19,616 INFO L93 Difference]: Finished difference Result 99509 states and 142174 transitions. [2025-01-09 05:55:19,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:55:19,617 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2025-01-09 05:55:19,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:55:19,686 INFO L225 Difference]: With dead ends: 99509 [2025-01-09 05:55:19,686 INFO L226 Difference]: Without dead ends: 51283 [2025-01-09 05:55:19,719 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 05:55:19,720 INFO L435 NwaCegarLoop]: 1604 mSDtfsCounter, 53 mSDsluCounter, 1550 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 3154 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:55:19,721 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 3154 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:55:19,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51283 states. [2025-01-09 05:55:21,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51283 to 51281. [2025-01-09 05:55:21,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51281 states, 51279 states have (on average 1.4217905965404942) internal successors, (72908), 51280 states have internal predecessors, (72908), 0 states have call successors, (0), 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 05:55:21,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51281 states to 51281 states and 72908 transitions. [2025-01-09 05:55:21,141 INFO L78 Accepts]: Start accepts. Automaton has 51281 states and 72908 transitions. Word has length 91 [2025-01-09 05:55:21,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:55:21,141 INFO L471 AbstractCegarLoop]: Abstraction has 51281 states and 72908 transitions. [2025-01-09 05:55:21,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:55:21,141 INFO L276 IsEmpty]: Start isEmpty. Operand 51281 states and 72908 transitions. [2025-01-09 05:55:21,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-01-09 05:55:21,144 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:55:21,144 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:55:21,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 05:55:21,144 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:55:21,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:55:21,146 INFO L85 PathProgramCache]: Analyzing trace with hash 131060762, now seen corresponding path program 1 times [2025-01-09 05:55:21,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:55:21,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39132416] [2025-01-09 05:55:21,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:55:21,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:55:21,155 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-01-09 05:55:21,164 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-01-09 05:55:21,164 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:55:21,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:55:21,208 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:55:21,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:55:21,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39132416] [2025-01-09 05:55:21,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39132416] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:55:21,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:55:21,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:55:21,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508490979] [2025-01-09 05:55:21,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:55:21,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:55:21,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:55:21,209 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:55:21,209 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:55:21,209 INFO L87 Difference]: Start difference. First operand 51281 states and 72908 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:55:21,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:55:21,559 INFO L93 Difference]: Finished difference Result 69066 states and 98132 transitions. [2025-01-09 05:55:21,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:55:21,560 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 92 [2025-01-09 05:55:21,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:55:21,588 INFO L225 Difference]: With dead ends: 69066 [2025-01-09 05:55:21,588 INFO L226 Difference]: Without dead ends: 20840 [2025-01-09 05:55:21,619 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 05:55:21,620 INFO L435 NwaCegarLoop]: 1602 mSDtfsCounter, 47 mSDsluCounter, 1549 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 3151 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:55:21,620 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 3151 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:55:21,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20840 states. [2025-01-09 05:55:22,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20840 to 20832. [2025-01-09 05:55:22,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20832 states, 20830 states have (on average 1.439990398463754) internal successors, (29995), 20831 states have internal predecessors, (29995), 0 states have call successors, (0), 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 05:55:22,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20832 states to 20832 states and 29995 transitions. [2025-01-09 05:55:22,272 INFO L78 Accepts]: Start accepts. Automaton has 20832 states and 29995 transitions. Word has length 92 [2025-01-09 05:55:22,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:55:22,272 INFO L471 AbstractCegarLoop]: Abstraction has 20832 states and 29995 transitions. [2025-01-09 05:55:22,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:55:22,272 INFO L276 IsEmpty]: Start isEmpty. Operand 20832 states and 29995 transitions. [2025-01-09 05:55:22,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-01-09 05:55:22,274 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:55:22,274 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:55:22,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 05:55:22,274 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:55:22,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:55:22,275 INFO L85 PathProgramCache]: Analyzing trace with hash 172821189, now seen corresponding path program 1 times [2025-01-09 05:55:22,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:55:22,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083043667] [2025-01-09 05:55:22,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:55:22,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:55:22,285 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-01-09 05:55:22,297 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-01-09 05:55:22,297 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:55:22,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:55:22,354 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:55:22,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:55:22,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083043667] [2025-01-09 05:55:22,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083043667] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:55:22,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:55:22,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:55:22,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842869855] [2025-01-09 05:55:22,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:55:22,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:55:22,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:55:22,356 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:55:22,356 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:55:22,356 INFO L87 Difference]: Start difference. First operand 20832 states and 29995 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:55:22,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:55:22,608 INFO L93 Difference]: Finished difference Result 29716 states and 42477 transitions. [2025-01-09 05:55:22,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:55:22,608 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2025-01-09 05:55:22,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:55:22,623 INFO L225 Difference]: With dead ends: 29716 [2025-01-09 05:55:22,623 INFO L226 Difference]: Without dead ends: 11954 [2025-01-09 05:55:22,635 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 05:55:22,637 INFO L435 NwaCegarLoop]: 1596 mSDtfsCounter, 49 mSDsluCounter, 1534 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 3130 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:55:22,637 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 3130 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:55:22,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11954 states. [2025-01-09 05:55:22,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11954 to 11952. [2025-01-09 05:55:22,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11952 states, 11950 states have (on average 1.4556485355648536) internal successors, (17395), 11951 states have internal predecessors, (17395), 0 states have call successors, (0), 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 05:55:22,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11952 states to 11952 states and 17395 transitions. [2025-01-09 05:55:22,942 INFO L78 Accepts]: Start accepts. Automaton has 11952 states and 17395 transitions. Word has length 93 [2025-01-09 05:55:22,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:55:22,942 INFO L471 AbstractCegarLoop]: Abstraction has 11952 states and 17395 transitions. [2025-01-09 05:55:22,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:55:22,942 INFO L276 IsEmpty]: Start isEmpty. Operand 11952 states and 17395 transitions. [2025-01-09 05:55:22,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-01-09 05:55:22,944 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:55:22,944 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:55:22,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 05:55:22,944 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:55:22,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:55:22,945 INFO L85 PathProgramCache]: Analyzing trace with hash -1266312232, now seen corresponding path program 1 times [2025-01-09 05:55:22,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:55:22,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757914950] [2025-01-09 05:55:22,945 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:55:22,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:55:22,955 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-01-09 05:55:22,962 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-01-09 05:55:22,962 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:55:22,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:55:23,067 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:55:23,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:55:23,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757914950] [2025-01-09 05:55:23,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757914950] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:55:23,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:55:23,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:55:23,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608168615] [2025-01-09 05:55:23,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:55:23,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 05:55:23,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:55:23,068 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 05:55:23,068 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 05:55:23,068 INFO L87 Difference]: Start difference. First operand 11952 states and 17395 transitions. Second operand has 4 states, 4 states have (on average 23.25) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:55:27,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:55:27,217 INFO L93 Difference]: Finished difference Result 17211 states and 25853 transitions. [2025-01-09 05:55:27,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 05:55:27,218 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2025-01-09 05:55:27,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:55:27,234 INFO L225 Difference]: With dead ends: 17211 [2025-01-09 05:55:27,234 INFO L226 Difference]: Without dead ends: 14205 [2025-01-09 05:55:27,238 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 05:55:27,242 INFO L435 NwaCegarLoop]: 460 mSDtfsCounter, 2399 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 4998 mSolverCounterSat, 851 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2399 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 5849 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 851 IncrementalHoareTripleChecker+Valid, 4998 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2025-01-09 05:55:27,242 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2399 Valid, 476 Invalid, 5849 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [851 Valid, 4998 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2025-01-09 05:55:27,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14205 states. [2025-01-09 05:55:27,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14205 to 14205. [2025-01-09 05:55:27,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14205 states, 14203 states have (on average 1.4340632260789974) internal successors, (20368), 14204 states have internal predecessors, (20368), 0 states have call successors, (0), 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 05:55:27,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14205 states to 14205 states and 20368 transitions. [2025-01-09 05:55:27,475 INFO L78 Accepts]: Start accepts. Automaton has 14205 states and 20368 transitions. Word has length 93 [2025-01-09 05:55:27,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:55:27,478 INFO L471 AbstractCegarLoop]: Abstraction has 14205 states and 20368 transitions. [2025-01-09 05:55:27,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:55:27,481 INFO L276 IsEmpty]: Start isEmpty. Operand 14205 states and 20368 transitions. [2025-01-09 05:55:27,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-01-09 05:55:27,483 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:55:27,483 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:55:27,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-09 05:55:27,483 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:55:27,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:55:27,483 INFO L85 PathProgramCache]: Analyzing trace with hash -150071529, now seen corresponding path program 1 times [2025-01-09 05:55:27,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:55:27,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607080875] [2025-01-09 05:55:27,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:55:27,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:55:27,492 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-01-09 05:55:27,501 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-01-09 05:55:27,501 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:55:27,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:55:27,554 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:55:27,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:55:27,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607080875] [2025-01-09 05:55:27,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607080875] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:55:27,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:55:27,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:55:27,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190628575] [2025-01-09 05:55:27,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:55:27,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:55:27,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:55:27,556 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:55:27,557 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:55:27,557 INFO L87 Difference]: Start difference. First operand 14205 states and 20368 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 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 05:55:27,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:55:27,681 INFO L93 Difference]: Finished difference Result 18649 states and 26550 transitions. [2025-01-09 05:55:27,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:55:27,681 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 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 95 [2025-01-09 05:55:27,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:55:27,697 INFO L225 Difference]: With dead ends: 18649 [2025-01-09 05:55:27,698 INFO L226 Difference]: Without dead ends: 9767 [2025-01-09 05:55:27,706 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 05:55:27,707 INFO L435 NwaCegarLoop]: 1589 mSDtfsCounter, 46 mSDsluCounter, 1526 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 3115 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:55:27,707 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 3115 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:55:27,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9767 states. [2025-01-09 05:55:27,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9767 to 9765. [2025-01-09 05:55:27,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9765 states, 9763 states have (on average 1.447096179453037) internal successors, (14128), 9764 states have internal predecessors, (14128), 0 states have call successors, (0), 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 05:55:27,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9765 states to 9765 states and 14128 transitions. [2025-01-09 05:55:27,859 INFO L78 Accepts]: Start accepts. Automaton has 9765 states and 14128 transitions. Word has length 95 [2025-01-09 05:55:27,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:55:27,860 INFO L471 AbstractCegarLoop]: Abstraction has 9765 states and 14128 transitions. [2025-01-09 05:55:27,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 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 05:55:27,860 INFO L276 IsEmpty]: Start isEmpty. Operand 9765 states and 14128 transitions. [2025-01-09 05:55:27,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-01-09 05:55:27,861 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:55:27,862 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:55:27,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-01-09 05:55:27,862 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:55:27,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:55:27,863 INFO L85 PathProgramCache]: Analyzing trace with hash 1004818921, now seen corresponding path program 1 times [2025-01-09 05:55:27,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:55:27,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391840179] [2025-01-09 05:55:27,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:55:27,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:55:27,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-01-09 05:55:27,882 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-01-09 05:55:27,882 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:55:27,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:55:27,922 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:55:27,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:55:27,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391840179] [2025-01-09 05:55:27,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391840179] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:55:27,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:55:27,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:55:27,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697228053] [2025-01-09 05:55:27,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:55:27,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:55:27,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:55:27,924 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:55:27,924 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:55:27,924 INFO L87 Difference]: Start difference. First operand 9765 states and 14128 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:55:27,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:55:27,983 INFO L93 Difference]: Finished difference Result 11989 states and 17190 transitions. [2025-01-09 05:55:27,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:55:27,983 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2025-01-09 05:55:27,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:55:27,992 INFO L225 Difference]: With dead ends: 11989 [2025-01-09 05:55:27,993 INFO L226 Difference]: Without dead ends: 7547 [2025-01-09 05:55:27,997 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 05:55:27,997 INFO L435 NwaCegarLoop]: 1582 mSDtfsCounter, 43 mSDsluCounter, 1518 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 3100 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:55:27,997 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 3100 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:55:28,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7547 states. [2025-01-09 05:55:28,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7547 to 7545. [2025-01-09 05:55:28,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7545 states, 7543 states have (on average 1.4633434972822486) internal successors, (11038), 7544 states have internal predecessors, (11038), 0 states have call successors, (0), 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 05:55:28,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7545 states to 7545 states and 11038 transitions. [2025-01-09 05:55:28,088 INFO L78 Accepts]: Start accepts. Automaton has 7545 states and 11038 transitions. Word has length 97 [2025-01-09 05:55:28,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:55:28,089 INFO L471 AbstractCegarLoop]: Abstraction has 7545 states and 11038 transitions. [2025-01-09 05:55:28,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:55:28,089 INFO L276 IsEmpty]: Start isEmpty. Operand 7545 states and 11038 transitions. [2025-01-09 05:55:28,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-01-09 05:55:28,090 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:55:28,090 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:55:28,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-01-09 05:55:28,090 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:55:28,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:55:28,090 INFO L85 PathProgramCache]: Analyzing trace with hash 1807801147, now seen corresponding path program 1 times [2025-01-09 05:55:28,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:55:28,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036560138] [2025-01-09 05:55:28,091 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:55:28,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:55:28,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-01-09 05:55:28,105 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-01-09 05:55:28,105 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:55:28,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:55:28,151 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:55:28,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:55:28,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036560138] [2025-01-09 05:55:28,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036560138] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:55:28,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:55:28,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:55:28,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059534559] [2025-01-09 05:55:28,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:55:28,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:55:28,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:55:28,152 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:55:28,152 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:55:28,152 INFO L87 Difference]: Start difference. First operand 7545 states and 11038 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 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 05:55:28,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:55:28,192 INFO L93 Difference]: Finished difference Result 8659 states and 12555 transitions. [2025-01-09 05:55:28,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:55:28,192 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 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 99 [2025-01-09 05:55:28,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:55:28,199 INFO L225 Difference]: With dead ends: 8659 [2025-01-09 05:55:28,200 INFO L226 Difference]: Without dead ends: 6437 [2025-01-09 05:55:28,201 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:55:28,202 INFO L435 NwaCegarLoop]: 1575 mSDtfsCounter, 40 mSDsluCounter, 1510 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 3085 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:55:28,202 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 3085 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:55:28,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6437 states. [2025-01-09 05:55:28,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6437 to 6435. [2025-01-09 05:55:28,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6435 states, 6433 states have (on average 1.4780040416601896) internal successors, (9508), 6434 states have internal predecessors, (9508), 0 states have call successors, (0), 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 05:55:28,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6435 states to 6435 states and 9508 transitions. [2025-01-09 05:55:28,372 INFO L78 Accepts]: Start accepts. Automaton has 6435 states and 9508 transitions. Word has length 99 [2025-01-09 05:55:28,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:55:28,372 INFO L471 AbstractCegarLoop]: Abstraction has 6435 states and 9508 transitions. [2025-01-09 05:55:28,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 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 05:55:28,372 INFO L276 IsEmpty]: Start isEmpty. Operand 6435 states and 9508 transitions. [2025-01-09 05:55:28,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-01-09 05:55:28,377 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:55:28,377 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:55:28,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-01-09 05:55:28,378 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:55:28,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:55:28,379 INFO L85 PathProgramCache]: Analyzing trace with hash -1552100595, now seen corresponding path program 1 times [2025-01-09 05:55:28,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:55:28,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650461401] [2025-01-09 05:55:28,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:55:28,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:55:28,391 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-01-09 05:55:28,401 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-01-09 05:55:28,401 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:55:28,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:55:28,991 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:55:28,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:55:28,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650461401] [2025-01-09 05:55:28,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650461401] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:55:28,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2047802026] [2025-01-09 05:55:28,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:55:28,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:55:28,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:55:28,997 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 05:55:29,001 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 05:55:29,076 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-01-09 05:55:29,124 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-01-09 05:55:29,125 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:55:29,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:55:29,130 INFO L256 TraceCheckSpWp]: Trace formula consists of 495 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-01-09 05:55:29,199 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:55:29,584 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 05:55:29,584 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 05:55:30,103 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 05:55:30,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2047802026] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 05:55:30,103 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 05:55:30,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 6, 4] total 19 [2025-01-09 05:55:30,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249699546] [2025-01-09 05:55:30,103 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 05:55:30,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-01-09 05:55:30,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:55:30,104 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-01-09 05:55:30,104 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2025-01-09 05:55:30,104 INFO L87 Difference]: Start difference. First operand 6435 states and 9508 transitions. Second operand has 19 states, 19 states have (on average 15.052631578947368) internal successors, (286), 19 states have internal predecessors, (286), 0 states have call successors, (0), 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 05:55:32,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:55:32,579 INFO L93 Difference]: Finished difference Result 12671 states and 17838 transitions. [2025-01-09 05:55:32,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2025-01-09 05:55:32,579 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 15.052631578947368) internal successors, (286), 19 states have internal predecessors, (286), 0 states have call successors, (0), 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 101 [2025-01-09 05:55:32,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:55:32,593 INFO L225 Difference]: With dead ends: 12671 [2025-01-09 05:55:32,593 INFO L226 Difference]: Without dead ends: 11559 [2025-01-09 05:55:32,598 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1243 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=839, Invalid=3321, Unknown=0, NotChecked=0, Total=4160 [2025-01-09 05:55:32,599 INFO L435 NwaCegarLoop]: 1520 mSDtfsCounter, 16629 mSDsluCounter, 5053 mSDsCounter, 0 mSdLazyCounter, 867 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16629 SdHoareTripleChecker+Valid, 6573 SdHoareTripleChecker+Invalid, 899 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 867 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 05:55:32,599 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16629 Valid, 6573 Invalid, 899 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 867 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 05:55:32,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11559 states. [2025-01-09 05:55:32,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11559 to 11295. [2025-01-09 05:55:32,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11295 states, 11293 states have (on average 1.4018418489329674) internal successors, (15831), 11294 states have internal predecessors, (15831), 0 states have call successors, (0), 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 05:55:32,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11295 states to 11295 states and 15831 transitions. [2025-01-09 05:55:32,783 INFO L78 Accepts]: Start accepts. Automaton has 11295 states and 15831 transitions. Word has length 101 [2025-01-09 05:55:32,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:55:32,783 INFO L471 AbstractCegarLoop]: Abstraction has 11295 states and 15831 transitions. [2025-01-09 05:55:32,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 15.052631578947368) internal successors, (286), 19 states have internal predecessors, (286), 0 states have call successors, (0), 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 05:55:32,784 INFO L276 IsEmpty]: Start isEmpty. Operand 11295 states and 15831 transitions. [2025-01-09 05:55:32,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-01-09 05:55:32,785 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:55:32,785 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:55:32,792 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 05:55:32,985 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,SelfDestructingSolverStorable26 [2025-01-09 05:55:32,986 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:55:32,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:55:32,987 INFO L85 PathProgramCache]: Analyzing trace with hash 1049559474, now seen corresponding path program 1 times [2025-01-09 05:55:32,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:55:32,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680721250] [2025-01-09 05:55:32,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:55:32,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:55:33,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-01-09 05:55:33,025 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-01-09 05:55:33,026 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:55:33,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:55:33,562 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:55:33,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:55:33,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680721250] [2025-01-09 05:55:33,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680721250] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:55:33,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [949066876] [2025-01-09 05:55:33,563 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:55:33,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:55:33,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:55:33,565 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 05:55:33,567 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 05:55:33,630 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-01-09 05:55:33,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-01-09 05:55:33,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:55:33,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:55:33,677 INFO L256 TraceCheckSpWp]: Trace formula consists of 500 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-01-09 05:55:33,681 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:55:34,176 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:55:34,177 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 05:55:34,990 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:55:34,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [949066876] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 05:55:34,990 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 05:55:34,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 32 [2025-01-09 05:55:34,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345445197] [2025-01-09 05:55:34,991 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 05:55:34,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-01-09 05:55:34,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:55:34,992 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-01-09 05:55:34,992 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=917, Unknown=0, NotChecked=0, Total=1056 [2025-01-09 05:55:34,992 INFO L87 Difference]: Start difference. First operand 11295 states and 15831 transitions. Second operand has 33 states, 33 states have (on average 7.757575757575758) internal successors, (256), 32 states have internal predecessors, (256), 0 states have call successors, (0), 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 05:55:37,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:55:37,052 INFO L93 Difference]: Finished difference Result 28235 states and 38174 transitions. [2025-01-09 05:55:37,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-01-09 05:55:37,052 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 7.757575757575758) internal successors, (256), 32 states have internal predecessors, (256), 0 states have call successors, (0), 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 102 [2025-01-09 05:55:37,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:55:37,075 INFO L225 Difference]: With dead ends: 28235 [2025-01-09 05:55:37,075 INFO L226 Difference]: Without dead ends: 22334 [2025-01-09 05:55:37,081 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 817 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=883, Invalid=3277, Unknown=0, NotChecked=0, Total=4160 [2025-01-09 05:55:37,081 INFO L435 NwaCegarLoop]: 1514 mSDtfsCounter, 17992 mSDsluCounter, 8236 mSDsCounter, 0 mSdLazyCounter, 1321 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17992 SdHoareTripleChecker+Valid, 9750 SdHoareTripleChecker+Invalid, 1354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 05:55:37,082 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17992 Valid, 9750 Invalid, 1354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1321 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 05:55:37,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22334 states. [2025-01-09 05:55:37,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22334 to 22270. [2025-01-09 05:55:37,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22270 states, 22268 states have (on average 1.3468205496676846) internal successors, (29991), 22269 states have internal predecessors, (29991), 0 states have call successors, (0), 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 05:55:37,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22270 states to 22270 states and 29991 transitions. [2025-01-09 05:55:37,506 INFO L78 Accepts]: Start accepts. Automaton has 22270 states and 29991 transitions. Word has length 102 [2025-01-09 05:55:37,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:55:37,507 INFO L471 AbstractCegarLoop]: Abstraction has 22270 states and 29991 transitions. [2025-01-09 05:55:37,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 7.757575757575758) internal successors, (256), 32 states have internal predecessors, (256), 0 states have call successors, (0), 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 05:55:37,507 INFO L276 IsEmpty]: Start isEmpty. Operand 22270 states and 29991 transitions. [2025-01-09 05:55:37,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-01-09 05:55:37,508 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:55:37,508 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:55:37,515 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 05:55:37,712 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,SelfDestructingSolverStorable27 [2025-01-09 05:55:37,712 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:55:37,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:55:37,713 INFO L85 PathProgramCache]: Analyzing trace with hash -440309326, now seen corresponding path program 1 times [2025-01-09 05:55:37,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:55:37,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55623772] [2025-01-09 05:55:37,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:55:37,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:55:37,720 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-01-09 05:55:37,731 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-01-09 05:55:37,731 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:55:37,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:55:37,963 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:55:37,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:55:37,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55623772] [2025-01-09 05:55:37,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55623772] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:55:37,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [518856488] [2025-01-09 05:55:37,964 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:55:37,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:55:37,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:55:37,966 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 05:55:37,967 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 05:55:38,035 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-01-09 05:55:38,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-01-09 05:55:38,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:55:38,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:55:38,083 INFO L256 TraceCheckSpWp]: Trace formula consists of 500 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-01-09 05:55:38,085 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:55:38,458 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:55:38,459 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 05:55:39,289 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:55:39,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [518856488] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 05:55:39,289 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 05:55:39,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 24 [2025-01-09 05:55:39,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405548157] [2025-01-09 05:55:39,290 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 05:55:39,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-01-09 05:55:39,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:55:39,291 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-01-09 05:55:39,291 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=514, Unknown=0, NotChecked=0, Total=600 [2025-01-09 05:55:39,292 INFO L87 Difference]: Start difference. First operand 22270 states and 29991 transitions. Second operand has 25 states, 25 states have (on average 11.44) internal successors, (286), 24 states have internal predecessors, (286), 0 states have call successors, (0), 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 05:55:41,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:55:41,111 INFO L93 Difference]: Finished difference Result 61743 states and 81188 transitions. [2025-01-09 05:55:41,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-01-09 05:55:41,112 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 11.44) internal successors, (286), 24 states have internal predecessors, (286), 0 states have call successors, (0), 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 102 [2025-01-09 05:55:41,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:55:41,164 INFO L225 Difference]: With dead ends: 61743 [2025-01-09 05:55:41,164 INFO L226 Difference]: Without dead ends: 45473 [2025-01-09 05:55:41,178 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 404 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=476, Invalid=1780, Unknown=0, NotChecked=0, Total=2256 [2025-01-09 05:55:41,179 INFO L435 NwaCegarLoop]: 1526 mSDtfsCounter, 18972 mSDsluCounter, 6658 mSDsCounter, 0 mSdLazyCounter, 778 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18972 SdHoareTripleChecker+Valid, 8184 SdHoareTripleChecker+Invalid, 805 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 778 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 05:55:41,179 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18972 Valid, 8184 Invalid, 805 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 778 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 05:55:41,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45473 states. [2025-01-09 05:55:41,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45473 to 25895. [2025-01-09 05:55:41,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25895 states, 25893 states have (on average 1.313405167419766) internal successors, (34008), 25894 states have internal predecessors, (34008), 0 states have call successors, (0), 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 05:55:41,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25895 states to 25895 states and 34008 transitions. [2025-01-09 05:55:41,957 INFO L78 Accepts]: Start accepts. Automaton has 25895 states and 34008 transitions. Word has length 102 [2025-01-09 05:55:41,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:55:41,958 INFO L471 AbstractCegarLoop]: Abstraction has 25895 states and 34008 transitions. [2025-01-09 05:55:41,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 11.44) internal successors, (286), 24 states have internal predecessors, (286), 0 states have call successors, (0), 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 05:55:41,958 INFO L276 IsEmpty]: Start isEmpty. Operand 25895 states and 34008 transitions. [2025-01-09 05:55:41,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-01-09 05:55:41,959 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:55:41,959 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:55:41,968 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 05:55:42,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:55:42,161 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:55:42,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:55:42,162 INFO L85 PathProgramCache]: Analyzing trace with hash 310552514, now seen corresponding path program 1 times [2025-01-09 05:55:42,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:55:42,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430433726] [2025-01-09 05:55:42,162 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:55:42,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:55:42,170 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-01-09 05:55:42,244 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-01-09 05:55:42,245 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:55:42,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:55:42,719 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:55:42,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:55:42,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430433726] [2025-01-09 05:55:42,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430433726] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:55:42,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1290164432] [2025-01-09 05:55:42,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:55:42,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:55:42,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:55:42,721 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 05:55:42,723 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 05:55:42,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-01-09 05:55:42,833 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-01-09 05:55:42,833 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:55:42,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:55:42,835 INFO L256 TraceCheckSpWp]: Trace formula consists of 504 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-09 05:55:42,838 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:55:43,180 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 15 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:55:43,182 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 05:55:43,919 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 15 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:55:43,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1290164432] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 05:55:43,920 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 05:55:43,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 28 [2025-01-09 05:55:43,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791159101] [2025-01-09 05:55:43,920 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 05:55:43,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-01-09 05:55:43,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:55:43,921 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-01-09 05:55:43,921 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=702, Unknown=0, NotChecked=0, Total=812 [2025-01-09 05:55:43,922 INFO L87 Difference]: Start difference. First operand 25895 states and 34008 transitions. Second operand has 29 states, 29 states have (on average 8.96551724137931) internal successors, (260), 28 states have internal predecessors, (260), 0 states have call successors, (0), 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 05:55:47,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:55:47,130 INFO L93 Difference]: Finished difference Result 111469 states and 142599 transitions. [2025-01-09 05:55:47,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-01-09 05:55:47,131 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 8.96551724137931) internal successors, (260), 28 states have internal predecessors, (260), 0 states have call successors, (0), 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 104 [2025-01-09 05:55:47,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:55:47,263 INFO L225 Difference]: With dead ends: 111469 [2025-01-09 05:55:47,263 INFO L226 Difference]: Without dead ends: 92530 [2025-01-09 05:55:47,287 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 747 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=694, Invalid=2612, Unknown=0, NotChecked=0, Total=3306 [2025-01-09 05:55:47,288 INFO L435 NwaCegarLoop]: 1526 mSDtfsCounter, 19127 mSDsluCounter, 6561 mSDsCounter, 0 mSdLazyCounter, 919 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19127 SdHoareTripleChecker+Valid, 8087 SdHoareTripleChecker+Invalid, 960 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 919 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 05:55:47,290 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19127 Valid, 8087 Invalid, 960 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 919 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 05:55:47,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92530 states. [2025-01-09 05:55:49,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92530 to 83248. [2025-01-09 05:55:49,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83248 states, 83246 states have (on average 1.2749441414602503) internal successors, (106134), 83247 states have internal predecessors, (106134), 0 states have call successors, (0), 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 05:55:49,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83248 states to 83248 states and 106134 transitions. [2025-01-09 05:55:49,927 INFO L78 Accepts]: Start accepts. Automaton has 83248 states and 106134 transitions. Word has length 104 [2025-01-09 05:55:49,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:55:49,928 INFO L471 AbstractCegarLoop]: Abstraction has 83248 states and 106134 transitions. [2025-01-09 05:55:49,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 8.96551724137931) internal successors, (260), 28 states have internal predecessors, (260), 0 states have call successors, (0), 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 05:55:49,929 INFO L276 IsEmpty]: Start isEmpty. Operand 83248 states and 106134 transitions. [2025-01-09 05:55:49,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-01-09 05:55:49,931 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:55:49,931 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:55:49,938 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-09 05:55:50,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:55:50,132 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:55:50,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:55:50,132 INFO L85 PathProgramCache]: Analyzing trace with hash -1984388670, now seen corresponding path program 1 times [2025-01-09 05:55:50,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:55:50,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90806937] [2025-01-09 05:55:50,133 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:55:50,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:55:50,148 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-01-09 05:55:50,178 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-01-09 05:55:50,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:55:50,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:55:50,531 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:55:50,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:55:50,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90806937] [2025-01-09 05:55:50,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90806937] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:55:50,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1561160873] [2025-01-09 05:55:50,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:55:50,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:55:50,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:55:50,538 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 05:55:50,540 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 05:55:50,609 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-01-09 05:55:50,652 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-01-09 05:55:50,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:55:50,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:55:50,654 INFO L256 TraceCheckSpWp]: Trace formula consists of 504 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-01-09 05:55:50,656 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:55:50,962 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:55:50,963 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 05:55:51,556 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:55:51,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1561160873] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 05:55:51,557 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 05:55:51,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2025-01-09 05:55:51,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329641467] [2025-01-09 05:55:51,557 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 05:55:51,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-01-09 05:55:51,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:55:51,558 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-01-09 05:55:51,558 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=328, Unknown=0, NotChecked=0, Total=420 [2025-01-09 05:55:51,558 INFO L87 Difference]: Start difference. First operand 83248 states and 106134 transitions. Second operand has 21 states, 21 states have (on average 10.952380952380953) internal successors, (230), 20 states have internal predecessors, (230), 0 states have call successors, (0), 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 05:55:55,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:55:55,207 INFO L93 Difference]: Finished difference Result 214126 states and 271928 transitions. [2025-01-09 05:55:55,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 05:55:55,318 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 10.952380952380953) internal successors, (230), 20 states have internal predecessors, (230), 0 states have call successors, (0), 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 104 [2025-01-09 05:55:55,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:55:55,506 INFO L225 Difference]: With dead ends: 214126 [2025-01-09 05:55:55,506 INFO L226 Difference]: Without dead ends: 142830 [2025-01-09 05:55:55,560 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=215, Invalid=597, Unknown=0, NotChecked=0, Total=812 [2025-01-09 05:55:55,560 INFO L435 NwaCegarLoop]: 1549 mSDtfsCounter, 18429 mSDsluCounter, 3299 mSDsCounter, 0 mSdLazyCounter, 389 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18429 SdHoareTripleChecker+Valid, 4848 SdHoareTripleChecker+Invalid, 407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 05:55:55,561 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18429 Valid, 4848 Invalid, 407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 389 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 05:55:55,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142830 states. [2025-01-09 05:55:59,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142830 to 138016. [2025-01-09 05:55:59,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138016 states, 138014 states have (on average 1.2590824119292245) internal successors, (173771), 138015 states have internal predecessors, (173771), 0 states have call successors, (0), 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 05:55:59,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138016 states to 138016 states and 173771 transitions. [2025-01-09 05:55:59,983 INFO L78 Accepts]: Start accepts. Automaton has 138016 states and 173771 transitions. Word has length 104 [2025-01-09 05:55:59,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:55:59,983 INFO L471 AbstractCegarLoop]: Abstraction has 138016 states and 173771 transitions. [2025-01-09 05:55:59,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 10.952380952380953) internal successors, (230), 20 states have internal predecessors, (230), 0 states have call successors, (0), 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 05:55:59,983 INFO L276 IsEmpty]: Start isEmpty. Operand 138016 states and 173771 transitions. [2025-01-09 05:55:59,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-01-09 05:55:59,994 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:55:59,994 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:56:00,001 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 05:56:00,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:56:00,195 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:56:00,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:56:00,195 INFO L85 PathProgramCache]: Analyzing trace with hash -1864718673, now seen corresponding path program 1 times [2025-01-09 05:56:00,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:56:00,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266812208] [2025-01-09 05:56:00,196 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:56:00,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:56:00,203 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-01-09 05:56:00,227 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-01-09 05:56:00,228 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:56:00,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:56:00,495 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:56:00,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:56:00,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266812208] [2025-01-09 05:56:00,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266812208] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:56:00,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [757171023] [2025-01-09 05:56:00,496 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:56:00,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:56:00,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:56:00,499 INFO L229 MonitoredProcess]: Starting monitored process 7 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 05:56:00,500 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-09 05:56:00,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-01-09 05:56:00,639 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-01-09 05:56:00,639 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:56:00,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:56:00,646 INFO L256 TraceCheckSpWp]: Trace formula consists of 506 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-01-09 05:56:00,648 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:56:02,552 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:56:02,552 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 05:56:04,929 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:56:04,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [757171023] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 05:56:04,930 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 05:56:04,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 16, 15] total 37 [2025-01-09 05:56:04,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899683372] [2025-01-09 05:56:04,930 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 05:56:04,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-01-09 05:56:04,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:56:04,931 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-01-09 05:56:04,931 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=1180, Unknown=0, NotChecked=0, Total=1332 [2025-01-09 05:56:04,932 INFO L87 Difference]: Start difference. First operand 138016 states and 173771 transitions. Second operand has 37 states, 37 states have (on average 7.918918918918919) internal successors, (293), 37 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)