./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label40+token_ring.03.cil-2.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/Problem05_label40+token_ring.03.cil-2.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 2f6e67caa8159a722902bebe9d23adade07462f3fac0eb20b485945b97ba6592 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 05:13:50,023 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 05:13:50,077 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 05:13:50,083 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 05:13:50,083 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 05:13:50,100 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 05:13:50,102 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 05:13:50,102 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 05:13:50,103 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 05:13:50,103 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 05:13:50,103 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 05:13:50,103 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 05:13:50,103 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 05:13:50,103 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 05:13:50,103 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 05:13:50,104 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 05:13:50,104 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 05:13:50,104 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 05:13:50,104 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 05:13:50,104 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 05:13:50,104 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 05:13:50,104 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 05:13:50,104 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 05:13:50,104 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 05:13:50,104 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 05:13:50,104 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 05:13:50,104 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 05:13:50,105 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 05:13:50,105 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 05:13:50,105 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 05:13:50,105 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 05:13:50,105 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 05:13:50,105 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:13:50,105 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 05:13:50,105 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 05:13:50,105 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 05:13:50,105 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 05:13:50,105 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:13:50,106 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 05:13:50,106 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 05:13:50,106 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 05:13:50,106 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 05:13:50,106 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 05:13:50,106 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 05:13:50,106 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 05:13:50,106 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 05:13:50,106 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 05:13:50,106 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 05:13:50,106 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 -> 2f6e67caa8159a722902bebe9d23adade07462f3fac0eb20b485945b97ba6592 [2025-01-09 05:13:50,298 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 05:13:50,302 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 05:13:50,304 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 05:13:50,305 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 05:13:50,305 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 05:13:50,306 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/Problem05_label40+token_ring.03.cil-2.c [2025-01-09 05:13:51,391 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0f6bfeaaf/539c3da2ed6d4ffc97118949897fd779/FLAG4d7090d1c [2025-01-09 05:13:51,838 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 05:13:51,839 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label40+token_ring.03.cil-2.c [2025-01-09 05:13:51,877 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0f6bfeaaf/539c3da2ed6d4ffc97118949897fd779/FLAG4d7090d1c [2025-01-09 05:13:51,890 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0f6bfeaaf/539c3da2ed6d4ffc97118949897fd779 [2025-01-09 05:13:51,893 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 05:13:51,894 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 05:13:51,894 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 05:13:51,895 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 05:13:51,898 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 05:13:51,899 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 05:13:51" (1/1) ... [2025-01-09 05:13:51,899 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@237cd493 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:13:51, skipping insertion in model container [2025-01-09 05:13:51,899 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 05:13:51" (1/1) ... [2025-01-09 05:13:52,016 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 05:13:53,053 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/Problem05_label40+token_ring.03.cil-2.c[377069,377082] [2025-01-09 05:13:53,081 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/Problem05_label40+token_ring.03.cil-2.c[383339,383352] [2025-01-09 05:13:53,212 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 05:13:53,220 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 05:13:53,691 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/Problem05_label40+token_ring.03.cil-2.c[377069,377082] [2025-01-09 05:13:53,697 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/Problem05_label40+token_ring.03.cil-2.c[383339,383352] [2025-01-09 05:13:53,707 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 05:13:53,750 INFO L204 MainTranslator]: Completed translation [2025-01-09 05:13:53,751 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:13:53 WrapperNode [2025-01-09 05:13:53,752 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 05:13:53,752 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 05:13:53,753 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 05:13:53,753 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 05:13:53,757 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:13:53" (1/1) ... [2025-01-09 05:13:53,807 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:13:53" (1/1) ... [2025-01-09 05:13:54,139 INFO L138 Inliner]: procedures = 50, calls = 50, calls flagged for inlining = 28, calls inlined = 28, statements flattened = 12672 [2025-01-09 05:13:54,140 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 05:13:54,140 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 05:13:54,140 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 05:13:54,140 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 05:13:54,147 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:13:53" (1/1) ... [2025-01-09 05:13:54,147 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:13:53" (1/1) ... [2025-01-09 05:13:54,175 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:13:53" (1/1) ... [2025-01-09 05:13:54,242 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 05:13:54,242 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:13:53" (1/1) ... [2025-01-09 05:13:54,242 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:13:53" (1/1) ... [2025-01-09 05:13:54,419 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:13:53" (1/1) ... [2025-01-09 05:13:54,432 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:13:53" (1/1) ... [2025-01-09 05:13:54,457 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:13:53" (1/1) ... [2025-01-09 05:13:54,473 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:13:53" (1/1) ... [2025-01-09 05:13:54,488 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:13:53" (1/1) ... [2025-01-09 05:13:54,524 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 05:13:54,525 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 05:13:54,525 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 05:13:54,526 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 05:13:54,529 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:13:53" (1/1) ... [2025-01-09 05:13:54,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:13:54,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:13:54,552 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 05:13:54,555 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 05:13:54,572 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 05:13:54,572 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2025-01-09 05:13:54,572 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2025-01-09 05:13:54,572 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-01-09 05:13:54,572 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-01-09 05:13:54,572 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2025-01-09 05:13:54,572 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2025-01-09 05:13:54,572 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2025-01-09 05:13:54,572 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2025-01-09 05:13:54,572 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2025-01-09 05:13:54,572 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2025-01-09 05:13:54,572 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2025-01-09 05:13:54,572 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2025-01-09 05:13:54,572 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 05:13:54,572 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 05:13:54,573 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 05:13:54,640 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 05:13:54,642 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 05:14:00,439 INFO L? ?]: Removed 1701 outVars from TransFormulas that were not future-live. [2025-01-09 05:14:00,440 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 05:14:00,486 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 05:14:00,486 INFO L312 CfgBuilder]: Removed 7 assume(true) statements. [2025-01-09 05:14:00,487 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 05:14:00 BoogieIcfgContainer [2025-01-09 05:14:00,487 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 05:14:00,488 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 05:14:00,488 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 05:14:00,493 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 05:14:00,493 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 05:13:51" (1/3) ... [2025-01-09 05:14:00,493 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b8db3b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 05:14:00, skipping insertion in model container [2025-01-09 05:14:00,494 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:13:53" (2/3) ... [2025-01-09 05:14:00,494 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b8db3b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 05:14:00, skipping insertion in model container [2025-01-09 05:14:00,494 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 05:14:00" (3/3) ... [2025-01-09 05:14:00,495 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem05_label40+token_ring.03.cil-2.c [2025-01-09 05:14:00,505 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 05:14:00,507 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem05_label40+token_ring.03.cil-2.c that has 7 procedures, 2338 locations, 1 initial locations, 7 loop locations, and 2 error locations. [2025-01-09 05:14:00,585 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 05:14:00,592 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;@740aa3a5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 05:14:00,592 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-09 05:14:00,600 INFO L276 IsEmpty]: Start isEmpty. Operand has 2338 states, 2313 states have (on average 1.8525724167747515) internal successors, (4285), 2315 states have internal predecessors, (4285), 17 states have call successors, (17), 6 states have call predecessors, (17), 6 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-01-09 05:14:00,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-01-09 05:14:00,607 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:14:00,607 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] [2025-01-09 05:14:00,607 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:14:00,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:14:00,612 INFO L85 PathProgramCache]: Analyzing trace with hash -403788940, now seen corresponding path program 1 times [2025-01-09 05:14:00,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:14:00,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471134878] [2025-01-09 05:14:00,618 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:14:00,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:14:00,678 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-01-09 05:14:00,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-01-09 05:14:00,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:14:00,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:14:00,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:14:00,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:14:00,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471134878] [2025-01-09 05:14:00,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471134878] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:14:00,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:14:00,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:14:00,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664542150] [2025-01-09 05:14:00,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:14:00,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:14:00,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:14:00,897 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:14:00,897 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:14:00,907 INFO L87 Difference]: Start difference. First operand has 2338 states, 2313 states have (on average 1.8525724167747515) internal successors, (4285), 2315 states have internal predecessors, (4285), 17 states have call successors, (17), 6 states have call predecessors, (17), 6 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:14:01,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:14:01,170 INFO L93 Difference]: Finished difference Result 4671 states and 8629 transitions. [2025-01-09 05:14:01,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:14:01,175 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 77 [2025-01-09 05:14:01,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:14:01,195 INFO L225 Difference]: With dead ends: 4671 [2025-01-09 05:14:01,195 INFO L226 Difference]: Without dead ends: 2271 [2025-01-09 05:14:01,204 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:14:01,206 INFO L435 NwaCegarLoop]: 4249 mSDtfsCounter, 223 mSDsluCounter, 4022 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 8271 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:14:01,206 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 8271 Invalid, 2 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:14:01,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2271 states. [2025-01-09 05:14:01,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2271 to 2271. [2025-01-09 05:14:01,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2271 states, 2246 states have (on average 1.8463935886019591) internal successors, (4147), 2248 states have internal predecessors, (4147), 17 states have call successors, (17), 6 states have call predecessors, (17), 6 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-01-09 05:14:01,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2271 states to 2271 states and 4181 transitions. [2025-01-09 05:14:01,307 INFO L78 Accepts]: Start accepts. Automaton has 2271 states and 4181 transitions. Word has length 77 [2025-01-09 05:14:01,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:14:01,308 INFO L471 AbstractCegarLoop]: Abstraction has 2271 states and 4181 transitions. [2025-01-09 05:14:01,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:14:01,308 INFO L276 IsEmpty]: Start isEmpty. Operand 2271 states and 4181 transitions. [2025-01-09 05:14:01,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-01-09 05:14:01,312 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:14:01,312 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] [2025-01-09 05:14:01,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 05:14:01,312 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:14:01,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:14:01,313 INFO L85 PathProgramCache]: Analyzing trace with hash 88837234, now seen corresponding path program 1 times [2025-01-09 05:14:01,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:14:01,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853385690] [2025-01-09 05:14:01,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:14:01,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:14:01,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-01-09 05:14:01,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-01-09 05:14:01,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:14:01,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:14:01,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:14:01,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:14:01,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853385690] [2025-01-09 05:14:01,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853385690] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:14:01,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:14:01,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 05:14:01,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757962791] [2025-01-09 05:14:01,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:14:01,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 05:14:01,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:14:01,469 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 05:14:01,469 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 05:14:01,469 INFO L87 Difference]: Start difference. First operand 2271 states and 4181 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:14:01,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:14:01,758 INFO L93 Difference]: Finished difference Result 2561 states and 4621 transitions. [2025-01-09 05:14:01,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 05:14:01,759 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 77 [2025-01-09 05:14:01,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:14:01,769 INFO L225 Difference]: With dead ends: 2561 [2025-01-09 05:14:01,769 INFO L226 Difference]: Without dead ends: 2422 [2025-01-09 05:14:01,771 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:14:01,771 INFO L435 NwaCegarLoop]: 4144 mSDtfsCounter, 4341 mSDsluCounter, 8362 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4352 SdHoareTripleChecker+Valid, 12506 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 05:14:01,772 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4352 Valid, 12506 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 05:14:01,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2422 states. [2025-01-09 05:14:01,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2422 to 2411. [2025-01-09 05:14:01,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2411 states, 2367 states have (on average 1.8301647655259823) internal successors, (4332), 2370 states have internal predecessors, (4332), 29 states have call successors, (29), 12 states have call predecessors, (29), 13 states have return successors, (30), 29 states have call predecessors, (30), 29 states have call successors, (30) [2025-01-09 05:14:01,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2411 states to 2411 states and 4391 transitions. [2025-01-09 05:14:01,826 INFO L78 Accepts]: Start accepts. Automaton has 2411 states and 4391 transitions. Word has length 77 [2025-01-09 05:14:01,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:14:01,826 INFO L471 AbstractCegarLoop]: Abstraction has 2411 states and 4391 transitions. [2025-01-09 05:14:01,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:14:01,827 INFO L276 IsEmpty]: Start isEmpty. Operand 2411 states and 4391 transitions. [2025-01-09 05:14:01,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-01-09 05:14:01,829 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:14:01,829 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] [2025-01-09 05:14:01,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 05:14:01,829 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:14:01,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:14:01,830 INFO L85 PathProgramCache]: Analyzing trace with hash -188010762, now seen corresponding path program 1 times [2025-01-09 05:14:01,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:14:01,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483868304] [2025-01-09 05:14:01,830 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:14:01,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:14:01,839 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-01-09 05:14:01,851 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-01-09 05:14:01,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:14:01,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:14:01,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:14:01,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:14:01,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483868304] [2025-01-09 05:14:01,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483868304] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:14:01,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:14:01,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:14:01,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564189749] [2025-01-09 05:14:01,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:14:01,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:14:01,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:14:01,976 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:14:01,976 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:14:01,976 INFO L87 Difference]: Start difference. First operand 2411 states and 4391 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:14:02,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:14:02,356 INFO L93 Difference]: Finished difference Result 2864 states and 5078 transitions. [2025-01-09 05:14:02,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:14:02,356 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 77 [2025-01-09 05:14:02,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:14:02,366 INFO L225 Difference]: With dead ends: 2864 [2025-01-09 05:14:02,367 INFO L226 Difference]: Without dead ends: 2585 [2025-01-09 05:14:02,368 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 05:14:02,369 INFO L435 NwaCegarLoop]: 4237 mSDtfsCounter, 4333 mSDsluCounter, 12684 mSDsCounter, 0 mSdLazyCounter, 488 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4344 SdHoareTripleChecker+Valid, 16921 SdHoareTripleChecker+Invalid, 511 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 05:14:02,370 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4344 Valid, 16921 Invalid, 511 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 488 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 05:14:02,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2585 states. [2025-01-09 05:14:02,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2585 to 2542. [2025-01-09 05:14:02,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2542 states, 2479 states have (on average 1.8148446954417103) internal successors, (4499), 2483 states have internal predecessors, (4499), 41 states have call successors, (41), 18 states have call predecessors, (41), 20 states have return successors, (45), 42 states have call predecessors, (45), 41 states have call successors, (45) [2025-01-09 05:14:02,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2542 states to 2542 states and 4585 transitions. [2025-01-09 05:14:02,425 INFO L78 Accepts]: Start accepts. Automaton has 2542 states and 4585 transitions. Word has length 77 [2025-01-09 05:14:02,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:14:02,425 INFO L471 AbstractCegarLoop]: Abstraction has 2542 states and 4585 transitions. [2025-01-09 05:14:02,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:14:02,425 INFO L276 IsEmpty]: Start isEmpty. Operand 2542 states and 4585 transitions. [2025-01-09 05:14:02,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-01-09 05:14:02,426 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:14:02,426 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] [2025-01-09 05:14:02,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 05:14:02,426 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:14:02,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:14:02,427 INFO L85 PathProgramCache]: Analyzing trace with hash 491261492, now seen corresponding path program 1 times [2025-01-09 05:14:02,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:14:02,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855434619] [2025-01-09 05:14:02,427 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:14:02,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:14:02,432 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-01-09 05:14:02,434 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-01-09 05:14:02,435 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:14:02,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:14:02,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:14:02,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:14:02,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855434619] [2025-01-09 05:14:02,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855434619] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:14:02,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:14:02,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:14:02,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118853053] [2025-01-09 05:14:02,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:14:02,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:14:02,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:14:02,535 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:14:02,535 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:14:02,535 INFO L87 Difference]: Start difference. First operand 2542 states and 4585 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:14:02,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:14:02,931 INFO L93 Difference]: Finished difference Result 3273 states and 5691 transitions. [2025-01-09 05:14:02,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:14:02,931 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 77 [2025-01-09 05:14:02,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:14:02,942 INFO L225 Difference]: With dead ends: 3273 [2025-01-09 05:14:02,942 INFO L226 Difference]: Without dead ends: 2863 [2025-01-09 05:14:02,944 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 05:14:02,945 INFO L435 NwaCegarLoop]: 4233 mSDtfsCounter, 4328 mSDsluCounter, 12672 mSDsCounter, 0 mSdLazyCounter, 488 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4339 SdHoareTripleChecker+Valid, 16905 SdHoareTripleChecker+Invalid, 511 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 05:14:02,945 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4339 Valid, 16905 Invalid, 511 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 488 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 05:14:02,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2863 states. [2025-01-09 05:14:03,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2863 to 2817. [2025-01-09 05:14:03,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2817 states, 2714 states have (on average 1.7877671333824614) internal successors, (4852), 2722 states have internal predecessors, (4852), 65 states have call successors, (65), 30 states have call predecessors, (65), 36 states have return successors, (81), 68 states have call predecessors, (81), 65 states have call successors, (81) [2025-01-09 05:14:03,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2817 states to 2817 states and 4998 transitions. [2025-01-09 05:14:03,018 INFO L78 Accepts]: Start accepts. Automaton has 2817 states and 4998 transitions. Word has length 77 [2025-01-09 05:14:03,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:14:03,018 INFO L471 AbstractCegarLoop]: Abstraction has 2817 states and 4998 transitions. [2025-01-09 05:14:03,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:14:03,019 INFO L276 IsEmpty]: Start isEmpty. Operand 2817 states and 4998 transitions. [2025-01-09 05:14:03,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-01-09 05:14:03,021 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:14:03,021 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] [2025-01-09 05:14:03,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 05:14:03,021 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:14:03,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:14:03,021 INFO L85 PathProgramCache]: Analyzing trace with hash -1842131146, now seen corresponding path program 1 times [2025-01-09 05:14:03,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:14:03,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912902949] [2025-01-09 05:14:03,022 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:14:03,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:14:03,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-01-09 05:14:03,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-01-09 05:14:03,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:14:03,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:14:03,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:14:03,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:14:03,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912902949] [2025-01-09 05:14:03,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912902949] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:14:03,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:14:03,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:14:03,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201509190] [2025-01-09 05:14:03,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:14:03,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:14:03,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:14:03,117 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:14:03,117 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:14:03,117 INFO L87 Difference]: Start difference. First operand 2817 states and 4998 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:14:03,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:14:03,485 INFO L93 Difference]: Finished difference Result 4138 states and 7014 transitions. [2025-01-09 05:14:03,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:14:03,485 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 77 [2025-01-09 05:14:03,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:14:03,499 INFO L225 Difference]: With dead ends: 4138 [2025-01-09 05:14:03,499 INFO L226 Difference]: Without dead ends: 3453 [2025-01-09 05:14:03,503 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 05:14:03,505 INFO L435 NwaCegarLoop]: 4230 mSDtfsCounter, 4323 mSDsluCounter, 12663 mSDsCounter, 0 mSdLazyCounter, 488 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4334 SdHoareTripleChecker+Valid, 16893 SdHoareTripleChecker+Invalid, 511 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 05:14:03,505 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4334 Valid, 16893 Invalid, 511 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 488 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 05:14:03,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3453 states. [2025-01-09 05:14:03,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3453 to 3400. [2025-01-09 05:14:03,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3400 states, 3211 states have (on average 1.7452507007162879) internal successors, (5604), 3233 states have internal predecessors, (5604), 113 states have call successors, (113), 54 states have call predecessors, (113), 74 states have return successors, (177), 120 states have call predecessors, (177), 113 states have call successors, (177) [2025-01-09 05:14:03,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3400 states to 3400 states and 5894 transitions. [2025-01-09 05:14:03,609 INFO L78 Accepts]: Start accepts. Automaton has 3400 states and 5894 transitions. Word has length 77 [2025-01-09 05:14:03,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:14:03,609 INFO L471 AbstractCegarLoop]: Abstraction has 3400 states and 5894 transitions. [2025-01-09 05:14:03,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:14:03,611 INFO L276 IsEmpty]: Start isEmpty. Operand 3400 states and 5894 transitions. [2025-01-09 05:14:03,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-01-09 05:14:03,612 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:14:03,612 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] [2025-01-09 05:14:03,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 05:14:03,612 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:14:03,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:14:03,613 INFO L85 PathProgramCache]: Analyzing trace with hash -1640307212, now seen corresponding path program 1 times [2025-01-09 05:14:03,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:14:03,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820041755] [2025-01-09 05:14:03,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:14:03,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:14:03,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-01-09 05:14:03,620 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-01-09 05:14:03,620 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:14:03,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:14:03,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:14:03,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:14:03,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820041755] [2025-01-09 05:14:03,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820041755] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:14:03,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:14:03,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:14:03,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070345621] [2025-01-09 05:14:03,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:14:03,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:14:03,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:14:03,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:14:03,681 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:14:03,681 INFO L87 Difference]: Start difference. First operand 3400 states and 5894 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:14:04,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:14:04,190 INFO L93 Difference]: Finished difference Result 6189 states and 10233 transitions. [2025-01-09 05:14:04,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:14:04,191 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 77 [2025-01-09 05:14:04,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:14:04,214 INFO L225 Difference]: With dead ends: 6189 [2025-01-09 05:14:04,214 INFO L226 Difference]: Without dead ends: 4921 [2025-01-09 05:14:04,220 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 05:14:04,221 INFO L435 NwaCegarLoop]: 4225 mSDtfsCounter, 4422 mSDsluCounter, 12643 mSDsCounter, 0 mSdLazyCounter, 491 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4437 SdHoareTripleChecker+Valid, 16868 SdHoareTripleChecker+Invalid, 517 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 05:14:04,222 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4437 Valid, 16868 Invalid, 517 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 491 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 05:14:04,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4921 states. [2025-01-09 05:14:04,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4921 to 4623. [2025-01-09 05:14:04,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4623 states, 4252 states have (on average 1.6923800564440263) internal successors, (7196), 4320 states have internal predecessors, (7196), 201 states have call successors, (201), 102 states have call predecessors, (201), 168 states have return successors, (457), 216 states have call predecessors, (457), 201 states have call successors, (457) [2025-01-09 05:14:04,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4623 states to 4623 states and 7854 transitions. [2025-01-09 05:14:04,386 INFO L78 Accepts]: Start accepts. Automaton has 4623 states and 7854 transitions. Word has length 77 [2025-01-09 05:14:04,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:14:04,387 INFO L471 AbstractCegarLoop]: Abstraction has 4623 states and 7854 transitions. [2025-01-09 05:14:04,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:14:04,387 INFO L276 IsEmpty]: Start isEmpty. Operand 4623 states and 7854 transitions. [2025-01-09 05:14:04,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-01-09 05:14:04,389 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:14:04,390 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] [2025-01-09 05:14:04,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 05:14:04,390 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:14:04,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:14:04,390 INFO L85 PathProgramCache]: Analyzing trace with hash -1079607434, now seen corresponding path program 1 times [2025-01-09 05:14:04,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:14:04,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706489039] [2025-01-09 05:14:04,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:14:04,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:14:04,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-01-09 05:14:04,401 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-01-09 05:14:04,401 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:14:04,402 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:14:04,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:14:04,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:14:04,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706489039] [2025-01-09 05:14:04,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706489039] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:14:04,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:14:04,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:14:04,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314829320] [2025-01-09 05:14:04,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:14:04,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:14:04,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:14:04,481 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:14:04,481 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:14:04,481 INFO L87 Difference]: Start difference. First operand 4623 states and 7854 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:14:05,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:14:05,038 INFO L93 Difference]: Finished difference Result 10148 states and 16867 transitions. [2025-01-09 05:14:05,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:14:05,038 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 77 [2025-01-09 05:14:05,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:14:05,077 INFO L225 Difference]: With dead ends: 10148 [2025-01-09 05:14:05,077 INFO L226 Difference]: Without dead ends: 7657 [2025-01-09 05:14:05,085 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 05:14:05,086 INFO L435 NwaCegarLoop]: 4221 mSDtfsCounter, 4335 mSDsluCounter, 12631 mSDsCounter, 0 mSdLazyCounter, 565 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4345 SdHoareTripleChecker+Valid, 16852 SdHoareTripleChecker+Invalid, 590 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 565 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 05:14:05,086 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4345 Valid, 16852 Invalid, 590 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 565 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 05:14:05,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7657 states. [2025-01-09 05:14:05,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7657 to 7170. [2025-01-09 05:14:05,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7170 states, 6389 states have (on average 1.6371889184535922) internal successors, (10460), 6603 states have internal predecessors, (10460), 369 states have call successors, (369), 198 states have call predecessors, (369), 410 states have return successors, (1393), 400 states have call predecessors, (1393), 369 states have call successors, (1393) [2025-01-09 05:14:05,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7170 states to 7170 states and 12222 transitions. [2025-01-09 05:14:05,323 INFO L78 Accepts]: Start accepts. Automaton has 7170 states and 12222 transitions. Word has length 77 [2025-01-09 05:14:05,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:14:05,323 INFO L471 AbstractCegarLoop]: Abstraction has 7170 states and 12222 transitions. [2025-01-09 05:14:05,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:14:05,323 INFO L276 IsEmpty]: Start isEmpty. Operand 7170 states and 12222 transitions. [2025-01-09 05:14:05,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-01-09 05:14:05,327 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:14:05,328 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] [2025-01-09 05:14:05,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 05:14:05,328 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:14:05,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:14:05,328 INFO L85 PathProgramCache]: Analyzing trace with hash -645878348, now seen corresponding path program 1 times [2025-01-09 05:14:05,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:14:05,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291232288] [2025-01-09 05:14:05,328 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:14:05,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:14:05,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-01-09 05:14:05,341 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-01-09 05:14:05,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:14:05,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:14:05,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:14:05,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:14:05,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291232288] [2025-01-09 05:14:05,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291232288] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:14:05,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:14:05,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:14:05,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85374611] [2025-01-09 05:14:05,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:14:05,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:14:05,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:14:05,419 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:14:05,419 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:14:05,420 INFO L87 Difference]: Start difference. First operand 7170 states and 12222 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:14:06,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:14:06,137 INFO L93 Difference]: Finished difference Result 17817 states and 31117 transitions. [2025-01-09 05:14:06,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:14:06,137 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 77 [2025-01-09 05:14:06,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:14:06,222 INFO L225 Difference]: With dead ends: 17817 [2025-01-09 05:14:06,222 INFO L226 Difference]: Without dead ends: 12779 [2025-01-09 05:14:06,241 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 05:14:06,242 INFO L435 NwaCegarLoop]: 4215 mSDtfsCounter, 4319 mSDsluCounter, 12615 mSDsCounter, 0 mSdLazyCounter, 491 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4334 SdHoareTripleChecker+Valid, 16830 SdHoareTripleChecker+Invalid, 517 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 05:14:06,242 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4334 Valid, 16830 Invalid, 517 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 491 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 05:14:06,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12779 states. [2025-01-09 05:14:06,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12779 to 12442. [2025-01-09 05:14:06,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12442 states, 10695 states have (on average 1.579242636746143) internal successors, (16890), 11363 states have internal predecessors, (16890), 689 states have call successors, (689), 390 states have call predecessors, (689), 1056 states have return successors, (4785), 752 states have call predecessors, (4785), 689 states have call successors, (4785) [2025-01-09 05:14:06,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12442 states to 12442 states and 22364 transitions. [2025-01-09 05:14:06,829 INFO L78 Accepts]: Start accepts. Automaton has 12442 states and 22364 transitions. Word has length 77 [2025-01-09 05:14:06,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:14:06,830 INFO L471 AbstractCegarLoop]: Abstraction has 12442 states and 22364 transitions. [2025-01-09 05:14:06,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:14:06,830 INFO L276 IsEmpty]: Start isEmpty. Operand 12442 states and 22364 transitions. [2025-01-09 05:14:06,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-01-09 05:14:06,837 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:14:06,837 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] [2025-01-09 05:14:06,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 05:14:06,838 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:14:06,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:14:06,838 INFO L85 PathProgramCache]: Analyzing trace with hash -605203598, now seen corresponding path program 1 times [2025-01-09 05:14:06,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:14:06,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795702354] [2025-01-09 05:14:06,838 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:14:06,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:14:06,843 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-01-09 05:14:06,846 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-01-09 05:14:06,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:14:06,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:14:06,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:14:06,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:14:06,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795702354] [2025-01-09 05:14:06,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795702354] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:14:06,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:14:06,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 05:14:06,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840499951] [2025-01-09 05:14:06,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:14:06,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 05:14:06,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:14:06,882 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 05:14:06,882 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 05:14:06,882 INFO L87 Difference]: Start difference. First operand 12442 states and 22364 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:14:07,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:14:07,794 INFO L93 Difference]: Finished difference Result 28333 states and 50835 transitions. [2025-01-09 05:14:07,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 05:14:07,795 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 77 [2025-01-09 05:14:07,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:14:07,868 INFO L225 Difference]: With dead ends: 28333 [2025-01-09 05:14:07,869 INFO L226 Difference]: Without dead ends: 18024 [2025-01-09 05:14:07,907 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 05:14:07,908 INFO L435 NwaCegarLoop]: 4366 mSDtfsCounter, 4333 mSDsluCounter, 4303 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4333 SdHoareTripleChecker+Valid, 8669 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 05:14:07,908 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4333 Valid, 8669 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 05:14:07,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18024 states. [2025-01-09 05:14:08,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18024 to 17181. [2025-01-09 05:14:08,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17181 states, 14659 states have (on average 1.5445801214271095) internal successors, (22642), 15572 states have internal predecessors, (22642), 1054 states have call successors, (1054), 588 states have call predecessors, (1054), 1466 states have return successors, (6143), 1084 states have call predecessors, (6143), 1054 states have call successors, (6143) [2025-01-09 05:14:08,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17181 states to 17181 states and 29839 transitions. [2025-01-09 05:14:08,788 INFO L78 Accepts]: Start accepts. Automaton has 17181 states and 29839 transitions. Word has length 77 [2025-01-09 05:14:08,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:14:08,788 INFO L471 AbstractCegarLoop]: Abstraction has 17181 states and 29839 transitions. [2025-01-09 05:14:08,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:14:08,788 INFO L276 IsEmpty]: Start isEmpty. Operand 17181 states and 29839 transitions. [2025-01-09 05:14:08,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-01-09 05:14:08,828 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:14:08,828 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:14:08,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 05:14:08,829 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:14:08,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:14:08,832 INFO L85 PathProgramCache]: Analyzing trace with hash -146393991, now seen corresponding path program 1 times [2025-01-09 05:14:08,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:14:08,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547155715] [2025-01-09 05:14:08,832 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:14:08,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:14:08,837 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-01-09 05:14:08,842 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-01-09 05:14:08,843 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:14:08,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:14:08,892 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-01-09 05:14:08,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:14:08,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547155715] [2025-01-09 05:14:08,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547155715] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:14:08,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1033874651] [2025-01-09 05:14:08,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:14:08,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:14:08,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:14:08,895 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 05:14:08,897 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 05:14:08,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-01-09 05:14:08,980 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-01-09 05:14:08,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:14:08,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:14:08,983 INFO L256 TraceCheckSpWp]: Trace formula consists of 483 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 05:14:08,987 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:14:09,041 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-01-09 05:14:09,041 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 05:14:09,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1033874651] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:14:09,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 05:14:09,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-01-09 05:14:09,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472875540] [2025-01-09 05:14:09,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:14:09,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:14:09,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:14:09,043 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:14:09,043 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:14:09,043 INFO L87 Difference]: Start difference. First operand 17181 states and 29839 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 2 states have internal predecessors, (90), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-01-09 05:14:09,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:14:09,900 INFO L93 Difference]: Finished difference Result 46930 states and 81419 transitions. [2025-01-09 05:14:09,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:14:09,901 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 2 states have internal predecessors, (90), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 125 [2025-01-09 05:14:09,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:14:10,019 INFO L225 Difference]: With dead ends: 46930 [2025-01-09 05:14:10,020 INFO L226 Difference]: Without dead ends: 31882 [2025-01-09 05:14:10,057 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:14:10,058 INFO L435 NwaCegarLoop]: 4176 mSDtfsCounter, 4132 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4132 SdHoareTripleChecker+Valid, 4371 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:14:10,059 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4132 Valid, 4371 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:14:10,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31882 states. [2025-01-09 05:14:11,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31882 to 31782. [2025-01-09 05:14:11,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31782 states, 26794 states have (on average 1.5161976561916848) internal successors, (40625), 28618 states have internal predecessors, (40625), 2054 states have call successors, (2054), 1176 states have call predecessors, (2054), 2932 states have return successors, (12169), 2051 states have call predecessors, (12169), 2054 states have call successors, (12169) [2025-01-09 05:14:11,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31782 states to 31782 states and 54848 transitions. [2025-01-09 05:14:11,982 INFO L78 Accepts]: Start accepts. Automaton has 31782 states and 54848 transitions. Word has length 125 [2025-01-09 05:14:11,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:14:11,983 INFO L471 AbstractCegarLoop]: Abstraction has 31782 states and 54848 transitions. [2025-01-09 05:14:11,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 2 states have internal predecessors, (90), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-01-09 05:14:11,983 INFO L276 IsEmpty]: Start isEmpty. Operand 31782 states and 54848 transitions. [2025-01-09 05:14:12,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-01-09 05:14:12,047 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:14:12,048 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:14:12,054 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 05:14:12,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-01-09 05:14:12,249 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:14:12,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:14:12,250 INFO L85 PathProgramCache]: Analyzing trace with hash -580185093, now seen corresponding path program 1 times [2025-01-09 05:14:12,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:14:12,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499445453] [2025-01-09 05:14:12,250 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:14:12,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:14:12,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-01-09 05:14:12,263 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-01-09 05:14:12,263 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:14:12,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:14:12,328 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-01-09 05:14:12,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:14:12,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499445453] [2025-01-09 05:14:12,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499445453] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:14:12,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [380960708] [2025-01-09 05:14:12,329 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:14:12,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:14:12,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:14:12,331 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 05:14:12,333 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 05:14:12,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-01-09 05:14:12,433 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-01-09 05:14:12,434 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:14:12,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:14:12,435 INFO L256 TraceCheckSpWp]: Trace formula consists of 477 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 05:14:12,438 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:14:12,493 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-01-09 05:14:12,496 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 05:14:12,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [380960708] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:14:12,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 05:14:12,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-01-09 05:14:12,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817448381] [2025-01-09 05:14:12,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:14:12,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:14:12,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:14:12,497 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:14:12,497 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:14:12,497 INFO L87 Difference]: Start difference. First operand 31782 states and 54848 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 2 states have internal predecessors, (96), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-01-09 05:14:14,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:14:14,493 INFO L93 Difference]: Finished difference Result 90387 states and 156314 transitions. [2025-01-09 05:14:14,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:14:14,493 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 2 states have internal predecessors, (96), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 125 [2025-01-09 05:14:14,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:14:14,738 INFO L225 Difference]: With dead ends: 90387 [2025-01-09 05:14:14,738 INFO L226 Difference]: Without dead ends: 60738 [2025-01-09 05:14:14,811 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:14:14,811 INFO L435 NwaCegarLoop]: 4176 mSDtfsCounter, 4126 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4126 SdHoareTripleChecker+Valid, 4371 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:14:14,812 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4126 Valid, 4371 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:14:14,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60738 states. [2025-01-09 05:14:17,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60738 to 60540. [2025-01-09 05:14:17,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60540 states, 50670 states have (on average 1.4979869745411487) internal successors, (75903), 54316 states have internal predecessors, (75903), 4004 states have call successors, (4004), 2352 states have call predecessors, (4004), 5864 states have return successors, (24171), 3935 states have call predecessors, (24171), 4004 states have call successors, (24171) [2025-01-09 05:14:17,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60540 states to 60540 states and 104078 transitions. [2025-01-09 05:14:17,788 INFO L78 Accepts]: Start accepts. Automaton has 60540 states and 104078 transitions. Word has length 125 [2025-01-09 05:14:17,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:14:17,788 INFO L471 AbstractCegarLoop]: Abstraction has 60540 states and 104078 transitions. [2025-01-09 05:14:17,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 2 states have internal predecessors, (96), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-01-09 05:14:17,789 INFO L276 IsEmpty]: Start isEmpty. Operand 60540 states and 104078 transitions. [2025-01-09 05:14:17,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-01-09 05:14:17,865 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:14:17,865 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:14:17,871 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 05:14:18,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:14:18,066 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:14:18,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:14:18,066 INFO L85 PathProgramCache]: Analyzing trace with hash -91865859, now seen corresponding path program 1 times [2025-01-09 05:14:18,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:14:18,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920173237] [2025-01-09 05:14:18,067 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:14:18,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:14:18,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-01-09 05:14:18,078 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-01-09 05:14:18,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:14:18,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:14:18,141 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-01-09 05:14:18,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:14:18,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920173237] [2025-01-09 05:14:18,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920173237] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:14:18,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [810572454] [2025-01-09 05:14:18,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:14:18,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:14:18,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:14:18,144 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 05:14:18,145 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 05:14:18,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-01-09 05:14:18,264 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-01-09 05:14:18,264 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:14:18,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:14:18,270 INFO L256 TraceCheckSpWp]: Trace formula consists of 471 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 05:14:18,272 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:14:18,524 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-01-09 05:14:18,524 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 05:14:18,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [810572454] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:14:18,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 05:14:18,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-01-09 05:14:18,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186782038] [2025-01-09 05:14:18,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:14:18,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:14:18,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:14:18,525 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:14:18,525 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:14:18,525 INFO L87 Difference]: Start difference. First operand 60540 states and 104078 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 05:14:20,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:14:20,908 INFO L93 Difference]: Finished difference Result 97774 states and 164571 transitions. [2025-01-09 05:14:20,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:14:20,909 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 125 [2025-01-09 05:14:20,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:14:21,292 INFO L225 Difference]: With dead ends: 97774 [2025-01-09 05:14:21,293 INFO L226 Difference]: Without dead ends: 78628 [2025-01-09 05:14:21,382 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:14:21,384 INFO L435 NwaCegarLoop]: 4366 mSDtfsCounter, 179 mSDsluCounter, 4176 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 8542 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:14:21,384 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 8542 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:14:21,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78628 states. [2025-01-09 05:14:25,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78628 to 78628. [2025-01-09 05:14:25,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78628 states, 65858 states have (on average 1.4916183303471104) internal successors, (98235), 70352 states have internal predecessors, (98235), 5264 states have call successors, (5264), 3144 states have call predecessors, (5264), 7504 states have return successors, (29871), 5195 states have call predecessors, (29871), 5264 states have call successors, (29871) [2025-01-09 05:14:26,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78628 states to 78628 states and 133370 transitions. [2025-01-09 05:14:26,064 INFO L78 Accepts]: Start accepts. Automaton has 78628 states and 133370 transitions. Word has length 125 [2025-01-09 05:14:26,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:14:26,064 INFO L471 AbstractCegarLoop]: Abstraction has 78628 states and 133370 transitions. [2025-01-09 05:14:26,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 05:14:26,064 INFO L276 IsEmpty]: Start isEmpty. Operand 78628 states and 133370 transitions. [2025-01-09 05:14:26,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-01-09 05:14:26,208 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:14:26,208 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:14:26,213 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 05:14:26,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:14:26,408 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:14:26,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:14:26,409 INFO L85 PathProgramCache]: Analyzing trace with hash -8230779, now seen corresponding path program 1 times [2025-01-09 05:14:26,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:14:26,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626169537] [2025-01-09 05:14:26,409 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:14:26,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:14:26,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-01-09 05:14:26,418 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-01-09 05:14:26,418 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:14:26,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:14:26,473 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2025-01-09 05:14:26,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:14:26,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626169537] [2025-01-09 05:14:26,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626169537] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:14:26,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [199337452] [2025-01-09 05:14:26,473 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:14:26,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:14:26,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:14:26,475 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 05:14:26,477 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 05:14:26,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-01-09 05:14:26,566 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-01-09 05:14:26,566 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:14:26,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:14:26,569 INFO L256 TraceCheckSpWp]: Trace formula consists of 585 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 05:14:26,571 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:14:26,691 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-01-09 05:14:26,695 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 05:14:26,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [199337452] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:14:26,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 05:14:26,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-01-09 05:14:26,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309052193] [2025-01-09 05:14:26,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:14:26,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:14:26,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:14:26,697 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:14:26,697 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:14:26,697 INFO L87 Difference]: Start difference. First operand 78628 states and 133370 transitions. Second operand has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 2 states have internal predecessors, (118), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-01-09 05:14:31,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:14:31,334 INFO L93 Difference]: Finished difference Result 228562 states and 389496 transitions. [2025-01-09 05:14:31,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:14:31,334 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 2 states have internal predecessors, (118), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 163 [2025-01-09 05:14:31,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:14:31,929 INFO L225 Difference]: With dead ends: 228562 [2025-01-09 05:14:31,929 INFO L226 Difference]: Without dead ends: 152067 [2025-01-09 05:14:32,097 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:14:32,098 INFO L435 NwaCegarLoop]: 4184 mSDtfsCounter, 4084 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4084 SdHoareTripleChecker+Valid, 4379 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:14:32,098 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4084 Valid, 4379 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:14:32,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152067 states.