./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.8_overflow.ufo.UNBOUNDED.pals+Problem12_label04.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.8_overflow.ufo.UNBOUNDED.pals+Problem12_label04.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 9d4ab7b0bf7f76413047af223f6c467063540165a0afee8e7614d892acad57a3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 06:01:24,574 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 06:01:24,618 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 06:01:24,621 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 06:01:24,622 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 06:01:24,640 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 06:01:24,641 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 06:01:24,641 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 06:01:24,641 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 06:01:24,642 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 06:01:24,642 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 06:01:24,642 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 06:01:24,642 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 06:01:24,642 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 06:01:24,642 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 06:01:24,642 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 06:01:24,643 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 06:01:24,643 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 06:01:24,643 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 06:01:24,643 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 06:01:24,643 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 06:01:24,643 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 06:01:24,643 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 06:01:24,643 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 06:01:24,643 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 06:01:24,643 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 06:01:24,643 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 06:01:24,644 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 06:01:24,644 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 06:01:24,644 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 06:01:24,644 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 06:01:24,644 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 06:01:24,644 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 06:01:24,644 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 06:01:24,644 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 06:01:24,644 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 06:01:24,644 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 06:01:24,644 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 06:01:24,645 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 06:01:24,645 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 06:01:24,645 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 06:01:24,645 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 06:01:24,645 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 06:01:24,645 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 06:01:24,645 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 06:01:24,645 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 06:01:24,645 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 06:01:24,645 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 06:01:24,645 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 -> 9d4ab7b0bf7f76413047af223f6c467063540165a0afee8e7614d892acad57a3 [2025-01-09 06:01:24,845 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 06:01:24,853 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 06:01:24,855 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 06:01:24,856 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 06:01:24,857 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 06:01:24,858 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.8_overflow.ufo.UNBOUNDED.pals+Problem12_label04.c [2025-01-09 06:01:26,157 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/21fef29a2/810a67493b7b4f22b0a5f125938658e5/FLAGe0e891a30 [2025-01-09 06:01:26,655 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 06:01:26,656 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.8_overflow.ufo.UNBOUNDED.pals+Problem12_label04.c [2025-01-09 06:01:26,695 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/21fef29a2/810a67493b7b4f22b0a5f125938658e5/FLAGe0e891a30 [2025-01-09 06:01:27,223 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/21fef29a2/810a67493b7b4f22b0a5f125938658e5 [2025-01-09 06:01:27,226 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 06:01:27,228 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 06:01:27,230 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 06:01:27,230 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 06:01:27,233 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 06:01:27,234 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 06:01:27" (1/1) ... [2025-01-09 06:01:27,234 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a719b73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:01:27, skipping insertion in model container [2025-01-09 06:01:27,234 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 06:01:27" (1/1) ... [2025-01-09 06:01:27,308 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 06:01:27,721 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.8_overflow.ufo.UNBOUNDED.pals+Problem12_label04.c[26962,26975] [2025-01-09 06:01:27,784 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.8_overflow.ufo.UNBOUNDED.pals+Problem12_label04.c[34023,34036] [2025-01-09 06:01:28,204 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 06:01:28,224 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 06:01:28,270 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.8_overflow.ufo.UNBOUNDED.pals+Problem12_label04.c[26962,26975] [2025-01-09 06:01:28,283 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.8_overflow.ufo.UNBOUNDED.pals+Problem12_label04.c[34023,34036] [2025-01-09 06:01:28,577 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 06:01:28,599 INFO L204 MainTranslator]: Completed translation [2025-01-09 06:01:28,600 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:01:28 WrapperNode [2025-01-09 06:01:28,600 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 06:01:28,601 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 06:01:28,601 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 06:01:28,601 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 06:01:28,608 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:01:28" (1/1) ... [2025-01-09 06:01:28,664 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:01:28" (1/1) ... [2025-01-09 06:01:29,116 INFO L138 Inliner]: procedures = 40, calls = 25, calls flagged for inlining = 20, calls inlined = 20, statements flattened = 5283 [2025-01-09 06:01:29,117 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 06:01:29,118 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 06:01:29,118 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 06:01:29,118 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 06:01:29,125 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:01:28" (1/1) ... [2025-01-09 06:01:29,125 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:01:28" (1/1) ... [2025-01-09 06:01:29,164 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:01:28" (1/1) ... [2025-01-09 06:01:29,383 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 06:01:29,384 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:01:28" (1/1) ... [2025-01-09 06:01:29,384 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:01:28" (1/1) ... [2025-01-09 06:01:29,486 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:01:28" (1/1) ... [2025-01-09 06:01:29,505 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:01:28" (1/1) ... [2025-01-09 06:01:29,522 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:01:28" (1/1) ... [2025-01-09 06:01:29,552 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:01:28" (1/1) ... [2025-01-09 06:01:29,575 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:01:28" (1/1) ... [2025-01-09 06:01:29,638 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 06:01:29,640 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 06:01:29,640 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 06:01:29,640 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 06:01:29,642 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:01:28" (1/1) ... [2025-01-09 06:01:29,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 06:01:29,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 06:01:29,673 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 06:01:29,690 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 06:01:29,710 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 06:01:29,710 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 06:01:29,710 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 06:01:29,710 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 06:01:29,846 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 06:01:29,848 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 06:01:34,591 INFO L? ?]: Removed 759 outVars from TransFormulas that were not future-live. [2025-01-09 06:01:34,591 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 06:01:34,610 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 06:01:34,610 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2025-01-09 06:01:34,611 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 06:01:34 BoogieIcfgContainer [2025-01-09 06:01:34,611 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 06:01:34,613 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 06:01:34,613 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 06:01:34,620 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 06:01:34,620 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 06:01:27" (1/3) ... [2025-01-09 06:01:34,622 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@423e810f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 06:01:34, skipping insertion in model container [2025-01-09 06:01:34,622 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:01:28" (2/3) ... [2025-01-09 06:01:34,622 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@423e810f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 06:01:34, skipping insertion in model container [2025-01-09 06:01:34,623 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 06:01:34" (3/3) ... [2025-01-09 06:01:34,624 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.8_overflow.ufo.UNBOUNDED.pals+Problem12_label04.c [2025-01-09 06:01:34,635 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 06:01:34,639 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.8_overflow.ufo.UNBOUNDED.pals+Problem12_label04.c that has 1 procedures, 946 locations, 1 initial locations, 2 loop locations, and 2 error locations. [2025-01-09 06:01:34,707 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 06:01:34,716 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;@673e2b9c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 06:01:34,717 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-09 06:01:34,724 INFO L276 IsEmpty]: Start isEmpty. Operand has 946 states, 943 states have (on average 1.9024390243902438) internal successors, (1794), 945 states have internal predecessors, (1794), 0 states have call successors, (0), 0 states 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 06:01:34,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-01-09 06:01:34,730 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:01:34,730 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] [2025-01-09 06:01:34,731 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:01:34,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:01:34,735 INFO L85 PathProgramCache]: Analyzing trace with hash 447802254, now seen corresponding path program 1 times [2025-01-09 06:01:34,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:01:34,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204242822] [2025-01-09 06:01:34,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:01:34,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:01:34,815 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-09 06:01:34,844 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-09 06:01:34,844 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:01:34,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:01:34,928 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 06:01:34,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:01:34,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204242822] [2025-01-09 06:01:34,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204242822] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:01:34,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:01:34,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 06:01:34,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918231768] [2025-01-09 06:01:34,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:01:34,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 06:01:34,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:01:34,945 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 06:01:34,945 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 06:01:34,949 INFO L87 Difference]: Start difference. First operand has 946 states, 943 states have (on average 1.9024390243902438) internal successors, (1794), 945 states have internal predecessors, (1794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 0 states 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 06:01:35,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:01:35,006 INFO L93 Difference]: Finished difference Result 1824 states and 3457 transitions. [2025-01-09 06:01:35,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 06:01:35,011 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 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 30 [2025-01-09 06:01:35,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:01:35,028 INFO L225 Difference]: With dead ends: 1824 [2025-01-09 06:01:35,028 INFO L226 Difference]: Without dead ends: 881 [2025-01-09 06:01:35,036 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 06:01:35,041 INFO L435 NwaCegarLoop]: 1728 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1728 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 06:01:35,041 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1728 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 06:01:35,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 881 states. [2025-01-09 06:01:35,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 881 to 881. [2025-01-09 06:01:35,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 881 states, 879 states have (on average 1.8930602957906713) internal successors, (1664), 880 states have internal predecessors, (1664), 0 states have call successors, (0), 0 states 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 06:01:35,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 881 states to 881 states and 1664 transitions. [2025-01-09 06:01:35,109 INFO L78 Accepts]: Start accepts. Automaton has 881 states and 1664 transitions. Word has length 30 [2025-01-09 06:01:35,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:01:35,110 INFO L471 AbstractCegarLoop]: Abstraction has 881 states and 1664 transitions. [2025-01-09 06:01:35,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 0 states 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 06:01:35,110 INFO L276 IsEmpty]: Start isEmpty. Operand 881 states and 1664 transitions. [2025-01-09 06:01:35,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-01-09 06:01:35,111 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:01:35,111 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] [2025-01-09 06:01:35,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 06:01:35,111 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:01:35,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:01:35,112 INFO L85 PathProgramCache]: Analyzing trace with hash 313788748, now seen corresponding path program 1 times [2025-01-09 06:01:35,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:01:35,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782725832] [2025-01-09 06:01:35,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:01:35,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:01:35,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-09 06:01:35,170 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-09 06:01:35,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:01:35,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:01:35,364 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 06:01:35,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:01:35,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782725832] [2025-01-09 06:01:35,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782725832] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:01:35,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:01:35,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 06:01:35,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714551515] [2025-01-09 06:01:35,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:01:35,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 06:01:35,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:01:35,366 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 06:01:35,366 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 06:01:35,366 INFO L87 Difference]: Start difference. First operand 881 states and 1664 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states 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 06:01:35,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:01:35,484 INFO L93 Difference]: Finished difference Result 945 states and 1765 transitions. [2025-01-09 06:01:35,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 06:01:35,485 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 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 30 [2025-01-09 06:01:35,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:01:35,488 INFO L225 Difference]: With dead ends: 945 [2025-01-09 06:01:35,488 INFO L226 Difference]: Without dead ends: 881 [2025-01-09 06:01:35,491 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 06:01:35,491 INFO L435 NwaCegarLoop]: 1662 mSDtfsCounter, 0 mSDsluCounter, 4920 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6582 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 06:01:35,491 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6582 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 06:01:35,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 881 states. [2025-01-09 06:01:35,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 881 to 881. [2025-01-09 06:01:35,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 881 states, 879 states have (on average 1.8236632536973834) internal successors, (1603), 880 states have internal predecessors, (1603), 0 states have call successors, (0), 0 states 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 06:01:35,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 881 states to 881 states and 1603 transitions. [2025-01-09 06:01:35,529 INFO L78 Accepts]: Start accepts. Automaton has 881 states and 1603 transitions. Word has length 30 [2025-01-09 06:01:35,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:01:35,530 INFO L471 AbstractCegarLoop]: Abstraction has 881 states and 1603 transitions. [2025-01-09 06:01:35,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states 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 06:01:35,530 INFO L276 IsEmpty]: Start isEmpty. Operand 881 states and 1603 transitions. [2025-01-09 06:01:35,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-01-09 06:01:35,532 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:01:35,532 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] [2025-01-09 06:01:35,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 06:01:35,532 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:01:35,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:01:35,532 INFO L85 PathProgramCache]: Analyzing trace with hash -975028451, now seen corresponding path program 1 times [2025-01-09 06:01:35,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:01:35,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117128668] [2025-01-09 06:01:35,533 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:01:35,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:01:35,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-01-09 06:01:35,576 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-01-09 06:01:35,576 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:01:35,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:01:35,692 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 06:01:35,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:01:35,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117128668] [2025-01-09 06:01:35,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117128668] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:01:35,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:01:35,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 06:01:35,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446044983] [2025-01-09 06:01:35,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:01:35,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 06:01:35,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:01:35,694 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 06:01:35,694 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 06:01:35,694 INFO L87 Difference]: Start difference. First operand 881 states and 1603 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 2 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 06:01:38,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:01:38,561 INFO L93 Difference]: Finished difference Result 2385 states and 4476 transitions. [2025-01-09 06:01:38,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 06:01:38,562 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 2 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2025-01-09 06:01:38,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:01:38,567 INFO L225 Difference]: With dead ends: 2385 [2025-01-09 06:01:38,567 INFO L226 Difference]: Without dead ends: 1632 [2025-01-09 06:01:38,568 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 06:01:38,569 INFO L435 NwaCegarLoop]: 234 mSDtfsCounter, 918 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2277 mSolverCounterSat, 998 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 918 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 3275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 998 IncrementalHoareTripleChecker+Valid, 2277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-01-09 06:01:38,569 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [918 Valid, 241 Invalid, 3275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [998 Valid, 2277 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-01-09 06:01:38,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1632 states. [2025-01-09 06:01:38,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1632 to 1632. [2025-01-09 06:01:38,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1632 states, 1630 states have (on average 1.826993865030675) internal successors, (2978), 1631 states have internal predecessors, (2978), 0 states have call successors, (0), 0 states 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 06:01:38,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1632 states to 1632 states and 2978 transitions. [2025-01-09 06:01:38,593 INFO L78 Accepts]: Start accepts. Automaton has 1632 states and 2978 transitions. Word has length 61 [2025-01-09 06:01:38,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:01:38,593 INFO L471 AbstractCegarLoop]: Abstraction has 1632 states and 2978 transitions. [2025-01-09 06:01:38,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 2 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 06:01:38,593 INFO L276 IsEmpty]: Start isEmpty. Operand 1632 states and 2978 transitions. [2025-01-09 06:01:38,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-01-09 06:01:38,594 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:01:38,595 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:01:38,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 06:01:38,595 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:01:38,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:01:38,595 INFO L85 PathProgramCache]: Analyzing trace with hash 763987068, now seen corresponding path program 1 times [2025-01-09 06:01:38,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:01:38,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121895379] [2025-01-09 06:01:38,595 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:01:38,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:01:38,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-01-09 06:01:38,620 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-01-09 06:01:38,620 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:01:38,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:01:38,847 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 06:01:38,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:01:38,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121895379] [2025-01-09 06:01:38,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121895379] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:01:38,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:01:38,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 06:01:38,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824335476] [2025-01-09 06:01:38,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:01:38,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 06:01:38,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:01:38,848 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 06:01:38,848 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-01-09 06:01:38,848 INFO L87 Difference]: Start difference. First operand 1632 states and 2978 transitions. Second operand has 10 states, 10 states have (on average 9.0) internal successors, (90), 10 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 06:01:39,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:01:39,282 INFO L93 Difference]: Finished difference Result 2592 states and 4530 transitions. [2025-01-09 06:01:39,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-09 06:01:39,283 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.0) internal successors, (90), 10 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90 [2025-01-09 06:01:39,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:01:39,294 INFO L225 Difference]: With dead ends: 2592 [2025-01-09 06:01:39,295 INFO L226 Difference]: Without dead ends: 2532 [2025-01-09 06:01:39,296 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=162, Invalid=344, Unknown=0, NotChecked=0, Total=506 [2025-01-09 06:01:39,297 INFO L435 NwaCegarLoop]: 1599 mSDtfsCounter, 13456 mSDsluCounter, 4240 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13456 SdHoareTripleChecker+Valid, 5839 SdHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 06:01:39,297 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13456 Valid, 5839 Invalid, 337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 06:01:39,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2532 states. [2025-01-09 06:01:39,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2532 to 1690. [2025-01-09 06:01:39,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1690 states, 1688 states have (on average 1.819905213270142) internal successors, (3072), 1689 states have internal predecessors, (3072), 0 states have call successors, (0), 0 states 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 06:01:39,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1690 states to 1690 states and 3072 transitions. [2025-01-09 06:01:39,344 INFO L78 Accepts]: Start accepts. Automaton has 1690 states and 3072 transitions. Word has length 90 [2025-01-09 06:01:39,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:01:39,345 INFO L471 AbstractCegarLoop]: Abstraction has 1690 states and 3072 transitions. [2025-01-09 06:01:39,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.0) internal successors, (90), 10 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 06:01:39,346 INFO L276 IsEmpty]: Start isEmpty. Operand 1690 states and 3072 transitions. [2025-01-09 06:01:39,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-01-09 06:01:39,349 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:01:39,349 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, 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 06:01:39,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 06:01:39,350 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:01:39,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:01:39,350 INFO L85 PathProgramCache]: Analyzing trace with hash -1663523956, now seen corresponding path program 1 times [2025-01-09 06:01:39,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:01:39,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345793539] [2025-01-09 06:01:39,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:01:39,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:01:39,373 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-01-09 06:01:39,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-01-09 06:01:39,393 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:01:39,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:01:39,542 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 06:01:39,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:01:39,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345793539] [2025-01-09 06:01:39,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345793539] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:01:39,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:01:39,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 06:01:39,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667100905] [2025-01-09 06:01:39,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:01:39,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 06:01:39,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:01:39,543 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 06:01:39,543 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 06:01:39,543 INFO L87 Difference]: Start difference. First operand 1690 states and 3072 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 06:01:39,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:01:39,573 INFO L93 Difference]: Finished difference Result 1915 states and 3435 transitions. [2025-01-09 06:01:39,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 06:01:39,574 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 06:01:39,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:01:39,581 INFO L225 Difference]: With dead ends: 1915 [2025-01-09 06:01:39,581 INFO L226 Difference]: Without dead ends: 1797 [2025-01-09 06:01:39,582 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 06:01:39,583 INFO L435 NwaCegarLoop]: 1601 mSDtfsCounter, 1506 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1506 SdHoareTripleChecker+Valid, 1693 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 06:01:39,583 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1506 Valid, 1693 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 06:01:39,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1797 states. [2025-01-09 06:01:39,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1797 to 1795. [2025-01-09 06:01:39,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1795 states, 1793 states have (on average 1.8070273284997211) internal successors, (3240), 1794 states have internal predecessors, (3240), 0 states have call successors, (0), 0 states 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 06:01:39,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1795 states to 1795 states and 3240 transitions. [2025-01-09 06:01:39,618 INFO L78 Accepts]: Start accepts. Automaton has 1795 states and 3240 transitions. Word has length 92 [2025-01-09 06:01:39,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:01:39,619 INFO L471 AbstractCegarLoop]: Abstraction has 1795 states and 3240 transitions. [2025-01-09 06:01:39,619 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 06:01:39,619 INFO L276 IsEmpty]: Start isEmpty. Operand 1795 states and 3240 transitions. [2025-01-09 06:01:39,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-01-09 06:01:39,620 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:01:39,621 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, 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 06:01:39,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 06:01:39,621 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:01:39,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:01:39,622 INFO L85 PathProgramCache]: Analyzing trace with hash -1597030444, now seen corresponding path program 1 times [2025-01-09 06:01:39,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:01:39,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926395488] [2025-01-09 06:01:39,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:01:39,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:01:39,643 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-01-09 06:01:39,659 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-01-09 06:01:39,659 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:01:39,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:01:40,049 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 06:01:40,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:01:40,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926395488] [2025-01-09 06:01:40,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926395488] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:01:40,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:01:40,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 06:01:40,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729230718] [2025-01-09 06:01:40,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:01:40,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 06:01:40,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:01:40,051 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 06:01:40,051 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-01-09 06:01:40,051 INFO L87 Difference]: Start difference. First operand 1795 states and 3240 transitions. Second operand has 10 states, 10 states have (on average 9.2) internal successors, (92), 10 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 06:01:40,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:01:40,376 INFO L93 Difference]: Finished difference Result 2020 states and 3600 transitions. [2025-01-09 06:01:40,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 06:01:40,377 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.2) internal successors, (92), 10 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 06:01:40,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:01:40,382 INFO L225 Difference]: With dead ends: 2020 [2025-01-09 06:01:40,382 INFO L226 Difference]: Without dead ends: 1797 [2025-01-09 06:01:40,383 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2025-01-09 06:01:40,384 INFO L435 NwaCegarLoop]: 1593 mSDtfsCounter, 12132 mSDsluCounter, 661 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12132 SdHoareTripleChecker+Valid, 2254 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 06:01:40,384 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12132 Valid, 2254 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 06:01:40,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1797 states. [2025-01-09 06:01:40,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1797 to 1795. [2025-01-09 06:01:40,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1795 states, 1793 states have (on average 1.8059118795315114) internal successors, (3238), 1794 states have internal predecessors, (3238), 0 states have call successors, (0), 0 states 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 06:01:40,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1795 states to 1795 states and 3238 transitions. [2025-01-09 06:01:40,412 INFO L78 Accepts]: Start accepts. Automaton has 1795 states and 3238 transitions. Word has length 92 [2025-01-09 06:01:40,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:01:40,412 INFO L471 AbstractCegarLoop]: Abstraction has 1795 states and 3238 transitions. [2025-01-09 06:01:40,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.2) internal successors, (92), 10 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 06:01:40,413 INFO L276 IsEmpty]: Start isEmpty. Operand 1795 states and 3238 transitions. [2025-01-09 06:01:40,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-01-09 06:01:40,413 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:01:40,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, 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 06:01:40,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 06:01:40,413 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:01:40,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:01:40,414 INFO L85 PathProgramCache]: Analyzing trace with hash 1616940962, now seen corresponding path program 1 times [2025-01-09 06:01:40,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:01:40,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945953339] [2025-01-09 06:01:40,414 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:01:40,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:01:40,426 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-01-09 06:01:40,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-01-09 06:01:40,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:01:40,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:01:40,693 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 06:01:40,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:01:40,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945953339] [2025-01-09 06:01:40,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945953339] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:01:40,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:01:40,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 06:01:40,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609654478] [2025-01-09 06:01:40,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:01:40,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 06:01:40,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:01:40,694 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 06:01:40,694 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 06:01:40,695 INFO L87 Difference]: Start difference. First operand 1795 states and 3238 transitions. Second operand has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 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 06:01:40,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:01:40,754 INFO L93 Difference]: Finished difference Result 1803 states and 3247 transitions. [2025-01-09 06:01:40,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 06:01:40,758 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 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 06:01:40,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:01:40,768 INFO L225 Difference]: With dead ends: 1803 [2025-01-09 06:01:40,768 INFO L226 Difference]: Without dead ends: 1801 [2025-01-09 06:01:40,769 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 06:01:40,774 INFO L435 NwaCegarLoop]: 1600 mSDtfsCounter, 0 mSDsluCounter, 4791 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6391 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 06:01:40,774 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6391 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 06:01:40,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1801 states. [2025-01-09 06:01:40,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1801 to 1801. [2025-01-09 06:01:40,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1801 states, 1799 states have (on average 1.802668148971651) internal successors, (3243), 1800 states have internal predecessors, (3243), 0 states have call successors, (0), 0 states 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 06:01:40,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1801 states to 1801 states and 3243 transitions. [2025-01-09 06:01:40,874 INFO L78 Accepts]: Start accepts. Automaton has 1801 states and 3243 transitions. Word has length 93 [2025-01-09 06:01:40,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:01:40,875 INFO L471 AbstractCegarLoop]: Abstraction has 1801 states and 3243 transitions. [2025-01-09 06:01:40,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 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 06:01:40,879 INFO L276 IsEmpty]: Start isEmpty. Operand 1801 states and 3243 transitions. [2025-01-09 06:01:40,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-01-09 06:01:40,879 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:01:40,879 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, 1, 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 06:01:40,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 06:01:40,880 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:01:40,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:01:40,880 INFO L85 PathProgramCache]: Analyzing trace with hash -1163994508, now seen corresponding path program 1 times [2025-01-09 06:01:40,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:01:40,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141634944] [2025-01-09 06:01:40,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:01:40,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:01:40,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-01-09 06:01:40,938 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-01-09 06:01:40,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:01:40,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:01:40,994 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 06:01:40,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:01:40,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141634944] [2025-01-09 06:01:40,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141634944] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:01:40,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:01:40,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 06:01:40,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620833903] [2025-01-09 06:01:40,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:01:40,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 06:01:40,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:01:40,995 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 06:01:40,995 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 06:01:40,995 INFO L87 Difference]: Start difference. First operand 1801 states and 3243 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states 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 06:01:41,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:01:41,022 INFO L93 Difference]: Finished difference Result 2043 states and 3624 transitions. [2025-01-09 06:01:41,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 06:01:41,022 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2025-01-09 06:01:41,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:01:41,028 INFO L225 Difference]: With dead ends: 2043 [2025-01-09 06:01:41,028 INFO L226 Difference]: Without dead ends: 1919 [2025-01-09 06:01:41,029 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 06:01:41,029 INFO L435 NwaCegarLoop]: 1685 mSDtfsCounter, 1526 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1526 SdHoareTripleChecker+Valid, 1783 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 06:01:41,029 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1526 Valid, 1783 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 06:01:41,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1919 states. [2025-01-09 06:01:41,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1919 to 1917. [2025-01-09 06:01:41,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1917 states, 1915 states have (on average 1.7879895561357702) internal successors, (3424), 1916 states have internal predecessors, (3424), 0 states have call successors, (0), 0 states 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 06:01:41,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1917 states to 1917 states and 3424 transitions. [2025-01-09 06:01:41,058 INFO L78 Accepts]: Start accepts. Automaton has 1917 states and 3424 transitions. Word has length 94 [2025-01-09 06:01:41,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:01:41,058 INFO L471 AbstractCegarLoop]: Abstraction has 1917 states and 3424 transitions. [2025-01-09 06:01:41,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states 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 06:01:41,059 INFO L276 IsEmpty]: Start isEmpty. Operand 1917 states and 3424 transitions. [2025-01-09 06:01:41,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-01-09 06:01:41,059 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:01:41,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, 1, 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 06:01:41,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 06:01:41,059 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:01:41,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:01:41,060 INFO L85 PathProgramCache]: Analyzing trace with hash -1203905420, now seen corresponding path program 1 times [2025-01-09 06:01:41,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:01:41,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149687695] [2025-01-09 06:01:41,060 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:01:41,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:01:41,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-01-09 06:01:41,086 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-01-09 06:01:41,086 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:01:41,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:01:41,127 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 06:01:41,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:01:41,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149687695] [2025-01-09 06:01:41,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149687695] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:01:41,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:01:41,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 06:01:41,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665498807] [2025-01-09 06:01:41,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:01:41,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 06:01:41,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:01:41,128 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 06:01:41,128 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 06:01:41,128 INFO L87 Difference]: Start difference. First operand 1917 states and 3424 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states 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 06:01:41,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:01:41,160 INFO L93 Difference]: Finished difference Result 2579 states and 4464 transitions. [2025-01-09 06:01:41,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 06:01:41,161 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2025-01-09 06:01:41,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:01:41,170 INFO L225 Difference]: With dead ends: 2579 [2025-01-09 06:01:41,170 INFO L226 Difference]: Without dead ends: 2236 [2025-01-09 06:01:41,172 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 06:01:41,172 INFO L435 NwaCegarLoop]: 1677 mSDtfsCounter, 1522 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1522 SdHoareTripleChecker+Valid, 1783 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 06:01:41,172 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1522 Valid, 1783 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 06:01:41,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2236 states. [2025-01-09 06:01:41,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2236 to 2234. [2025-01-09 06:01:41,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2234 states, 2232 states have (on average 1.7544802867383513) internal successors, (3916), 2233 states have internal predecessors, (3916), 0 states have call successors, (0), 0 states 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 06:01:41,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2234 states to 2234 states and 3916 transitions. [2025-01-09 06:01:41,219 INFO L78 Accepts]: Start accepts. Automaton has 2234 states and 3916 transitions. Word has length 94 [2025-01-09 06:01:41,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:01:41,219 INFO L471 AbstractCegarLoop]: Abstraction has 2234 states and 3916 transitions. [2025-01-09 06:01:41,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states 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 06:01:41,219 INFO L276 IsEmpty]: Start isEmpty. Operand 2234 states and 3916 transitions. [2025-01-09 06:01:41,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-01-09 06:01:41,220 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:01:41,220 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, 1, 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 06:01:41,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 06:01:41,220 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:01:41,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:01:41,220 INFO L85 PathProgramCache]: Analyzing trace with hash -1040990860, now seen corresponding path program 1 times [2025-01-09 06:01:41,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:01:41,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89872988] [2025-01-09 06:01:41,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:01:41,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:01:41,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-01-09 06:01:41,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-01-09 06:01:41,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:01:41,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:01:41,312 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 06:01:41,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:01:41,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89872988] [2025-01-09 06:01:41,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89872988] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:01:41,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:01:41,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 06:01:41,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204998939] [2025-01-09 06:01:41,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:01:41,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 06:01:41,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:01:41,313 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 06:01:41,313 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 06:01:41,313 INFO L87 Difference]: Start difference. First operand 2234 states and 3916 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states 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 06:01:41,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:01:41,358 INFO L93 Difference]: Finished difference Result 3506 states and 5898 transitions. [2025-01-09 06:01:41,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 06:01:41,358 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2025-01-09 06:01:41,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:01:41,369 INFO L225 Difference]: With dead ends: 3506 [2025-01-09 06:01:41,369 INFO L226 Difference]: Without dead ends: 2846 [2025-01-09 06:01:41,371 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 06:01:41,372 INFO L435 NwaCegarLoop]: 1675 mSDtfsCounter, 1520 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1520 SdHoareTripleChecker+Valid, 1785 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 06:01:41,372 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1520 Valid, 1785 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 06:01:41,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2846 states. [2025-01-09 06:01:41,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2846 to 2844. [2025-01-09 06:01:41,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2844 states, 2842 states have (on average 1.7072484166080226) internal successors, (4852), 2843 states have internal predecessors, (4852), 0 states have call successors, (0), 0 states 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 06:01:41,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2844 states to 2844 states and 4852 transitions. [2025-01-09 06:01:41,488 INFO L78 Accepts]: Start accepts. Automaton has 2844 states and 4852 transitions. Word has length 94 [2025-01-09 06:01:41,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:01:41,488 INFO L471 AbstractCegarLoop]: Abstraction has 2844 states and 4852 transitions. [2025-01-09 06:01:41,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states 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 06:01:41,488 INFO L276 IsEmpty]: Start isEmpty. Operand 2844 states and 4852 transitions. [2025-01-09 06:01:41,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-01-09 06:01:41,489 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:01:41,489 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, 1, 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 06:01:41,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 06:01:41,489 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:01:41,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:01:41,491 INFO L85 PathProgramCache]: Analyzing trace with hash 461127540, now seen corresponding path program 1 times [2025-01-09 06:01:41,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:01:41,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705602924] [2025-01-09 06:01:41,491 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:01:41,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:01:41,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-01-09 06:01:41,514 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-01-09 06:01:41,514 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:01:41,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:01:41,561 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 06:01:41,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:01:41,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705602924] [2025-01-09 06:01:41,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705602924] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:01:41,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:01:41,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 06:01:41,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832460341] [2025-01-09 06:01:41,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:01:41,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 06:01:41,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:01:41,562 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 06:01:41,562 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 06:01:41,562 INFO L87 Difference]: Start difference. First operand 2844 states and 4852 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states 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 06:01:41,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:01:41,609 INFO L93 Difference]: Finished difference Result 5288 states and 8622 transitions. [2025-01-09 06:01:41,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 06:01:41,609 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2025-01-09 06:01:41,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:01:41,623 INFO L225 Difference]: With dead ends: 5288 [2025-01-09 06:01:41,623 INFO L226 Difference]: Without dead ends: 4018 [2025-01-09 06:01:41,625 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 06:01:41,626 INFO L435 NwaCegarLoop]: 1663 mSDtfsCounter, 1516 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1516 SdHoareTripleChecker+Valid, 1781 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 06:01:41,626 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1516 Valid, 1781 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 06:01:41,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4018 states. [2025-01-09 06:01:41,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4018 to 4016. [2025-01-09 06:01:41,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4016 states, 4014 states have (on average 1.6512207274539112) internal successors, (6628), 4015 states have internal predecessors, (6628), 0 states have call successors, (0), 0 states 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 06:01:41,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4016 states to 4016 states and 6628 transitions. [2025-01-09 06:01:41,693 INFO L78 Accepts]: Start accepts. Automaton has 4016 states and 6628 transitions. Word has length 94 [2025-01-09 06:01:41,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:01:41,693 INFO L471 AbstractCegarLoop]: Abstraction has 4016 states and 6628 transitions. [2025-01-09 06:01:41,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states 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 06:01:41,693 INFO L276 IsEmpty]: Start isEmpty. Operand 4016 states and 6628 transitions. [2025-01-09 06:01:41,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-01-09 06:01:41,694 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:01:41,694 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, 1, 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 06:01:41,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 06:01:41,694 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:01:41,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:01:41,694 INFO L85 PathProgramCache]: Analyzing trace with hash -1754341260, now seen corresponding path program 1 times [2025-01-09 06:01:41,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:01:41,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833348992] [2025-01-09 06:01:41,695 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:01:41,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:01:41,706 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-01-09 06:01:41,714 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-01-09 06:01:41,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:01:41,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:01:41,754 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 06:01:41,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:01:41,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833348992] [2025-01-09 06:01:41,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833348992] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:01:41,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:01:41,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 06:01:41,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416540610] [2025-01-09 06:01:41,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:01:41,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 06:01:41,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:01:41,756 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 06:01:41,756 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 06:01:41,756 INFO L87 Difference]: Start difference. First operand 4016 states and 6628 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states 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 06:01:41,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:01:41,818 INFO L93 Difference]: Finished difference Result 8708 states and 13782 transitions. [2025-01-09 06:01:41,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 06:01:41,818 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2025-01-09 06:01:41,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:01:41,846 INFO L225 Difference]: With dead ends: 8708 [2025-01-09 06:01:41,847 INFO L226 Difference]: Without dead ends: 6266 [2025-01-09 06:01:41,851 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 06:01:41,852 INFO L435 NwaCegarLoop]: 1661 mSDtfsCounter, 1514 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1514 SdHoareTripleChecker+Valid, 1783 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 06:01:41,852 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1514 Valid, 1783 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 06:01:41,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6266 states. [2025-01-09 06:01:42,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6266 to 6264. [2025-01-09 06:01:42,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6264 states, 6262 states have (on average 1.5950175662727564) internal successors, (9988), 6263 states have internal predecessors, (9988), 0 states have call successors, (0), 0 states 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 06:01:42,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6264 states to 6264 states and 9988 transitions. [2025-01-09 06:01:42,042 INFO L78 Accepts]: Start accepts. Automaton has 6264 states and 9988 transitions. Word has length 94 [2025-01-09 06:01:42,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:01:42,042 INFO L471 AbstractCegarLoop]: Abstraction has 6264 states and 9988 transitions. [2025-01-09 06:01:42,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states 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 06:01:42,042 INFO L276 IsEmpty]: Start isEmpty. Operand 6264 states and 9988 transitions. [2025-01-09 06:01:42,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-01-09 06:01:42,043 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:01:42,043 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, 1, 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 06:01:42,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 06:01:42,043 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:01:42,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:01:42,044 INFO L85 PathProgramCache]: Analyzing trace with hash 26591604, now seen corresponding path program 1 times [2025-01-09 06:01:42,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:01:42,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107164441] [2025-01-09 06:01:42,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:01:42,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:01:42,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-01-09 06:01:42,068 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-01-09 06:01:42,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:01:42,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:01:42,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:01:42,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:01:42,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107164441] [2025-01-09 06:01:42,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107164441] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:01:42,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:01:42,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 06:01:42,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114207286] [2025-01-09 06:01:42,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:01:42,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 06:01:42,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:01:42,120 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 06:01:42,120 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 06:01:42,124 INFO L87 Difference]: Start difference. First operand 6264 states and 9988 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states 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 06:01:42,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:01:42,263 INFO L93 Difference]: Finished difference Result 15260 states and 23526 transitions. [2025-01-09 06:01:42,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 06:01:42,264 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2025-01-09 06:01:42,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:01:42,285 INFO L225 Difference]: With dead ends: 15260 [2025-01-09 06:01:42,285 INFO L226 Difference]: Without dead ends: 10570 [2025-01-09 06:01:42,293 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 06:01:42,295 INFO L435 NwaCegarLoop]: 1659 mSDtfsCounter, 1512 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1512 SdHoareTripleChecker+Valid, 1785 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 06:01:42,295 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1512 Valid, 1785 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 06:01:42,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10570 states. [2025-01-09 06:01:42,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10570 to 10568. [2025-01-09 06:01:42,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10568 states, 10566 states have (on average 1.5449555176982774) internal successors, (16324), 10567 states have internal predecessors, (16324), 0 states have call successors, (0), 0 states 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 06:01:42,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10568 states to 10568 states and 16324 transitions. [2025-01-09 06:01:42,519 INFO L78 Accepts]: Start accepts. Automaton has 10568 states and 16324 transitions. Word has length 94 [2025-01-09 06:01:42,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:01:42,519 INFO L471 AbstractCegarLoop]: Abstraction has 10568 states and 16324 transitions. [2025-01-09 06:01:42,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states 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 06:01:42,519 INFO L276 IsEmpty]: Start isEmpty. Operand 10568 states and 16324 transitions. [2025-01-09 06:01:42,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-01-09 06:01:42,520 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:01:42,520 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, 1, 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 06:01:42,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 06:01:42,521 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:01:42,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:01:42,522 INFO L85 PathProgramCache]: Analyzing trace with hash -777134476, now seen corresponding path program 1 times [2025-01-09 06:01:42,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:01:42,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583855904] [2025-01-09 06:01:42,522 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:01:42,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:01:42,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-01-09 06:01:42,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-01-09 06:01:42,547 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:01:42,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:01:42,595 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 06:01:42,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:01:42,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583855904] [2025-01-09 06:01:42,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583855904] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:01:42,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:01:42,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 06:01:42,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197416154] [2025-01-09 06:01:42,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:01:42,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 06:01:42,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:01:42,598 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 06:01:42,598 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 06:01:42,599 INFO L87 Difference]: Start difference. First operand 10568 states and 16324 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states 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 06:01:42,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:01:42,787 INFO L93 Difference]: Finished difference Result 27788 states and 41862 transitions. [2025-01-09 06:01:42,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 06:01:42,788 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2025-01-09 06:01:42,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:01:42,824 INFO L225 Difference]: With dead ends: 27788 [2025-01-09 06:01:42,824 INFO L226 Difference]: Without dead ends: 18794 [2025-01-09 06:01:42,840 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 06:01:42,840 INFO L435 NwaCegarLoop]: 1673 mSDtfsCounter, 1518 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1518 SdHoareTripleChecker+Valid, 1787 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 06:01:42,841 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1518 Valid, 1787 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 06:01:42,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18794 states. [2025-01-09 06:01:43,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18794 to 18792. [2025-01-09 06:01:43,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18792 states, 18790 states have (on average 1.502288451303885) internal successors, (28228), 18791 states have internal predecessors, (28228), 0 states have call successors, (0), 0 states 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 06:01:43,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18792 states to 18792 states and 28228 transitions. [2025-01-09 06:01:43,288 INFO L78 Accepts]: Start accepts. Automaton has 18792 states and 28228 transitions. Word has length 94 [2025-01-09 06:01:43,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:01:43,288 INFO L471 AbstractCegarLoop]: Abstraction has 18792 states and 28228 transitions. [2025-01-09 06:01:43,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states 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 06:01:43,289 INFO L276 IsEmpty]: Start isEmpty. Operand 18792 states and 28228 transitions. [2025-01-09 06:01:43,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-01-09 06:01:43,290 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:01:43,290 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:01:43,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 06:01:43,290 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:01:43,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:01:43,290 INFO L85 PathProgramCache]: Analyzing trace with hash 1148992372, now seen corresponding path program 1 times [2025-01-09 06:01:43,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:01:43,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663778034] [2025-01-09 06:01:43,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:01:43,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:01:43,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-01-09 06:01:43,311 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-01-09 06:01:43,311 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:01:43,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:01:43,353 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 06:01:43,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:01:43,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663778034] [2025-01-09 06:01:43,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663778034] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:01:43,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:01:43,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 06:01:43,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562677735] [2025-01-09 06:01:43,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:01:43,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 06:01:43,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:01:43,355 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 06:01:43,355 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 06:01:43,355 INFO L87 Difference]: Start difference. First operand 18792 states and 28228 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states 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 06:01:43,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:01:43,833 INFO L93 Difference]: Finished difference Result 51692 states and 76230 transitions. [2025-01-09 06:01:43,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 06:01:43,834 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2025-01-09 06:01:43,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:01:43,985 INFO L225 Difference]: With dead ends: 51692 [2025-01-09 06:01:43,987 INFO L226 Difference]: Without dead ends: 34474 [2025-01-09 06:01:44,024 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 06:01:44,024 INFO L435 NwaCegarLoop]: 1687 mSDtfsCounter, 1524 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1524 SdHoareTripleChecker+Valid, 1789 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 06:01:44,025 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1524 Valid, 1789 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 06:01:44,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34474 states. [2025-01-09 06:01:44,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34474 to 34472. [2025-01-09 06:01:44,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34472 states, 34470 states have (on average 1.4650420655642589) internal successors, (50500), 34471 states have internal predecessors, (50500), 0 states have call successors, (0), 0 states 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 06:01:44,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34472 states to 34472 states and 50500 transitions. [2025-01-09 06:01:44,711 INFO L78 Accepts]: Start accepts. Automaton has 34472 states and 50500 transitions. Word has length 94 [2025-01-09 06:01:44,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:01:44,711 INFO L471 AbstractCegarLoop]: Abstraction has 34472 states and 50500 transitions. [2025-01-09 06:01:44,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states 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 06:01:44,711 INFO L276 IsEmpty]: Start isEmpty. Operand 34472 states and 50500 transitions. [2025-01-09 06:01:44,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-01-09 06:01:44,718 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:01:44,718 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:01:44,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 06:01:44,719 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:01:44,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:01:44,719 INFO L85 PathProgramCache]: Analyzing trace with hash -429562990, now seen corresponding path program 1 times [2025-01-09 06:01:44,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:01:44,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360090315] [2025-01-09 06:01:44,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:01:44,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:01:44,732 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-01-09 06:01:44,743 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-01-09 06:01:44,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:01:44,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:01:45,100 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 06:01:45,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:01:45,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360090315] [2025-01-09 06:01:45,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360090315] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:01:45,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:01:45,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 06:01:45,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453883414] [2025-01-09 06:01:45,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:01:45,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 06:01:45,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:01:45,103 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 06:01:45,104 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-01-09 06:01:45,104 INFO L87 Difference]: Start difference. First operand 34472 states and 50500 transitions. Second operand has 10 states, 10 states have (on average 11.8) internal successors, (118), 10 states have internal predecessors, (118), 0 states have call successors, (0), 0 states 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 06:01:48,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:01:48,382 INFO L93 Difference]: Finished difference Result 294458 states and 426573 transitions. [2025-01-09 06:01:48,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 06:01:48,383 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.8) internal successors, (118), 10 states have internal predecessors, (118), 0 states have call successors, (0), 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 119 [2025-01-09 06:01:48,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:01:49,106 INFO L225 Difference]: With dead ends: 294458 [2025-01-09 06:01:49,106 INFO L226 Difference]: Without dead ends: 271416 [2025-01-09 06:01:49,172 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2025-01-09 06:01:49,173 INFO L435 NwaCegarLoop]: 1698 mSDtfsCounter, 11712 mSDsluCounter, 3275 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11712 SdHoareTripleChecker+Valid, 4973 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 06:01:49,173 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11712 Valid, 4973 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 06:01:49,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271416 states. [2025-01-09 06:01:51,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271416 to 62504. [2025-01-09 06:01:51,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62504 states, 62502 states have (on average 1.4510255671818502) internal successors, (90692), 62503 states have internal predecessors, (90692), 0 states have call successors, (0), 0 states 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 06:01:52,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62504 states to 62504 states and 90692 transitions. [2025-01-09 06:01:52,085 INFO L78 Accepts]: Start accepts. Automaton has 62504 states and 90692 transitions. Word has length 119 [2025-01-09 06:01:52,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:01:52,085 INFO L471 AbstractCegarLoop]: Abstraction has 62504 states and 90692 transitions. [2025-01-09 06:01:52,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.8) internal successors, (118), 10 states have internal predecessors, (118), 0 states have call successors, (0), 0 states 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 06:01:52,085 INFO L276 IsEmpty]: Start isEmpty. Operand 62504 states and 90692 transitions. [2025-01-09 06:01:52,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-01-09 06:01:52,106 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:01:52,106 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:01:52,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 06:01:52,106 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:01:52,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:01:52,107 INFO L85 PathProgramCache]: Analyzing trace with hash -469473902, now seen corresponding path program 1 times [2025-01-09 06:01:52,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:01:52,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415694925] [2025-01-09 06:01:52,107 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:01:52,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:01:52,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-01-09 06:01:52,182 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-01-09 06:01:52,183 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:01:52,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:01:52,520 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-09 06:01:52,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:01:52,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415694925] [2025-01-09 06:01:52,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415694925] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:01:52,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:01:52,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 06:01:52,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386510517] [2025-01-09 06:01:52,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:01:52,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 06:01:52,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:01:52,526 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 06:01:52,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-01-09 06:01:52,526 INFO L87 Difference]: Start difference. First operand 62504 states and 90692 transitions. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states 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 06:01:57,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:01:57,006 INFO L93 Difference]: Finished difference Result 327354 states and 473933 transitions. [2025-01-09 06:01:57,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 06:01:57,007 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 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 119 [2025-01-09 06:01:57,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:01:57,543 INFO L225 Difference]: With dead ends: 327354 [2025-01-09 06:01:57,544 INFO L226 Difference]: Without dead ends: 294456 [2025-01-09 06:01:57,618 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2025-01-09 06:01:57,619 INFO L435 NwaCegarLoop]: 1698 mSDtfsCounter, 11788 mSDsluCounter, 3337 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11788 SdHoareTripleChecker+Valid, 5035 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 06:01:57,619 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11788 Valid, 5035 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 06:01:57,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294456 states. [2025-01-09 06:02:01,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294456 to 106920. [2025-01-09 06:02:01,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106920 states, 106918 states have (on average 1.4432368731177163) internal successors, (154308), 106919 states have internal predecessors, (154308), 0 states have call successors, (0), 0 states 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 06:02:01,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106920 states to 106920 states and 154308 transitions. [2025-01-09 06:02:01,789 INFO L78 Accepts]: Start accepts. Automaton has 106920 states and 154308 transitions. Word has length 119 [2025-01-09 06:02:01,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:02:01,790 INFO L471 AbstractCegarLoop]: Abstraction has 106920 states and 154308 transitions. [2025-01-09 06:02:01,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states 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 06:02:01,790 INFO L276 IsEmpty]: Start isEmpty. Operand 106920 states and 154308 transitions. [2025-01-09 06:02:01,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-01-09 06:02:01,801 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:02:01,801 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:02:01,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 06:02:01,802 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:02:01,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:02:01,802 INFO L85 PathProgramCache]: Analyzing trace with hash -306559342, now seen corresponding path program 1 times [2025-01-09 06:02:01,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:02:01,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214213195] [2025-01-09 06:02:01,803 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:02:01,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:02:01,817 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-01-09 06:02:01,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-01-09 06:02:01,828 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:02:01,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:02:02,025 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-09 06:02:02,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:02:02,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214213195] [2025-01-09 06:02:02,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214213195] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:02:02,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:02:02,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 06:02:02,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171660650] [2025-01-09 06:02:02,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:02:02,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 06:02:02,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:02:02,027 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 06:02:02,028 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-01-09 06:02:02,028 INFO L87 Difference]: Start difference. First operand 106920 states and 154308 transitions. Second operand has 10 states, 10 states have (on average 11.2) internal successors, (112), 10 states have internal predecessors, (112), 0 states have call successors, (0), 0 states 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 06:02:08,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:02:08,393 INFO L93 Difference]: Finished difference Result 360250 states and 521165 transitions. [2025-01-09 06:02:08,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 06:02:08,393 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.2) internal successors, (112), 10 states have internal predecessors, (112), 0 states have call successors, (0), 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 119 [2025-01-09 06:02:08,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:02:08,950 INFO L225 Difference]: With dead ends: 360250 [2025-01-09 06:02:08,951 INFO L226 Difference]: Without dead ends: 327352 [2025-01-09 06:02:09,029 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2025-01-09 06:02:09,030 INFO L435 NwaCegarLoop]: 1696 mSDtfsCounter, 11884 mSDsluCounter, 3225 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11884 SdHoareTripleChecker+Valid, 4921 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 06:02:09,030 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11884 Valid, 4921 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 06:02:09,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327352 states. [2025-01-09 06:02:14,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327352 to 139816. [2025-01-09 06:02:14,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139816 states, 139814 states have (on average 1.4414865464116613) internal successors, (201540), 139815 states have internal predecessors, (201540), 0 states have call successors, (0), 0 states 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 06:02:14,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139816 states to 139816 states and 201540 transitions. [2025-01-09 06:02:14,833 INFO L78 Accepts]: Start accepts. Automaton has 139816 states and 201540 transitions. Word has length 119 [2025-01-09 06:02:14,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:02:14,833 INFO L471 AbstractCegarLoop]: Abstraction has 139816 states and 201540 transitions. [2025-01-09 06:02:14,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.2) internal successors, (112), 10 states have internal predecessors, (112), 0 states have call successors, (0), 0 states 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 06:02:14,833 INFO L276 IsEmpty]: Start isEmpty. Operand 139816 states and 201540 transitions. [2025-01-09 06:02:14,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-01-09 06:02:14,843 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:02:14,844 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:02:14,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 06:02:14,844 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:02:14,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:02:14,844 INFO L85 PathProgramCache]: Analyzing trace with hash 1195559058, now seen corresponding path program 1 times [2025-01-09 06:02:14,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:02:14,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929584270] [2025-01-09 06:02:14,845 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:02:14,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:02:14,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-01-09 06:02:14,866 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-01-09 06:02:14,867 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:02:14,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:02:15,196 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 06:02:15,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:02:15,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929584270] [2025-01-09 06:02:15,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929584270] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:02:15,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:02:15,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 06:02:15,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055969089] [2025-01-09 06:02:15,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:02:15,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 06:02:15,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:02:15,198 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 06:02:15,198 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-01-09 06:02:15,198 INFO L87 Difference]: Start difference. First operand 139816 states and 201540 transitions. Second operand has 10 states, 10 states have (on average 10.8) internal successors, (108), 10 states have internal predecessors, (108), 0 states have call successors, (0), 0 states 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 06:02:22,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:02:22,033 INFO L93 Difference]: Finished difference Result 393146 states and 568397 transitions. [2025-01-09 06:02:22,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 06:02:22,034 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 10.8) internal successors, (108), 10 states have internal predecessors, (108), 0 states have call successors, (0), 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 119 [2025-01-09 06:02:22,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:02:22,886 INFO L225 Difference]: With dead ends: 393146 [2025-01-09 06:02:22,886 INFO L226 Difference]: Without dead ends: 360248 [2025-01-09 06:02:22,943 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2025-01-09 06:02:22,943 INFO L435 NwaCegarLoop]: 1694 mSDtfsCounter, 11969 mSDsluCounter, 3241 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11969 SdHoareTripleChecker+Valid, 4935 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 06:02:22,944 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11969 Valid, 4935 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 06:02:23,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360248 states.