./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label43+token_ring.03.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/Problem05_label43+token_ring.03.cil-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 d5e8784cabcb38b73600d610d5b7e0bbbbf790f527b046ae80f9a34c4ea82403 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 15:39:37,386 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 15:39:37,443 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 15:39:37,447 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 15:39:37,447 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 15:39:37,469 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 15:39:37,469 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 15:39:37,469 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 15:39:37,469 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 15:39:37,469 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 15:39:37,470 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 15:39:37,470 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 15:39:37,470 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 15:39:37,470 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 15:39:37,470 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 15:39:37,470 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 15:39:37,470 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 15:39:37,470 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 15:39:37,472 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 15:39:37,472 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 15:39:37,472 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 15:39:37,472 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 15:39:37,472 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 15:39:37,472 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 15:39:37,472 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 15:39:37,472 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 15:39:37,472 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 15:39:37,473 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 15:39:37,473 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 15:39:37,473 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 15:39:37,473 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 15:39:37,473 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 15:39:37,473 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 15:39:37,474 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 15:39:37,474 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 15:39:37,474 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 15:39:37,474 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 15:39:37,474 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 15:39:37,474 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 15:39:37,474 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 15:39:37,474 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 15:39:37,474 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 15:39:37,474 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 15:39:37,474 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/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 -> d5e8784cabcb38b73600d610d5b7e0bbbbf790f527b046ae80f9a34c4ea82403 [2025-03-03 15:39:37,712 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 15:39:37,721 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 15:39:37,723 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 15:39:37,724 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 15:39:37,724 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 15:39:37,726 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/Problem05_label43+token_ring.03.cil-1.c [2025-03-03 15:39:38,960 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1bb5c092/0f60877efbfc41ae97315b5fea7a1ba5/FLAGd558091cc [2025-03-03 15:39:39,560 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 15:39:39,561 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label43+token_ring.03.cil-1.c [2025-03-03 15:39:39,607 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1bb5c092/0f60877efbfc41ae97315b5fea7a1ba5/FLAGd558091cc [2025-03-03 15:39:39,621 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1bb5c092/0f60877efbfc41ae97315b5fea7a1ba5 [2025-03-03 15:39:39,623 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 15:39:39,624 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 15:39:39,626 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 15:39:39,626 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 15:39:39,630 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 15:39:39,631 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 03:39:39" (1/1) ... [2025-03-03 15:39:39,632 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ba29160 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:39:39, skipping insertion in model container [2025-03-03 15:39:39,632 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 03:39:39" (1/1) ... [2025-03-03 15:39:39,758 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 15:39:40,814 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label43+token_ring.03.cil-1.c[381679,381692] [2025-03-03 15:39:40,834 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label43+token_ring.03.cil-1.c[383339,383352] [2025-03-03 15:39:41,020 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 15:39:41,029 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 15:39:41,516 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label43+token_ring.03.cil-1.c[381679,381692] [2025-03-03 15:39:41,519 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label43+token_ring.03.cil-1.c[383339,383352] [2025-03-03 15:39:41,533 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 15:39:41,582 INFO L204 MainTranslator]: Completed translation [2025-03-03 15:39:41,582 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:39:41 WrapperNode [2025-03-03 15:39:41,583 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 15:39:41,584 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 15:39:41,584 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 15:39:41,584 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 15:39:41,589 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:39:41" (1/1) ... [2025-03-03 15:39:41,666 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:39:41" (1/1) ... [2025-03-03 15:39:41,958 INFO L138 Inliner]: procedures = 50, calls = 51, calls flagged for inlining = 27, calls inlined = 27, statements flattened = 12678 [2025-03-03 15:39:41,959 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 15:39:41,960 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 15:39:41,960 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 15:39:41,961 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 15:39:41,969 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:39:41" (1/1) ... [2025-03-03 15:39:41,969 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:39:41" (1/1) ... [2025-03-03 15:39:42,007 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:39:41" (1/1) ... [2025-03-03 15:39:42,194 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-03-03 15:39:42,194 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:39:41" (1/1) ... [2025-03-03 15:39:42,194 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:39:41" (1/1) ... [2025-03-03 15:39:42,314 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:39:41" (1/1) ... [2025-03-03 15:39:42,337 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:39:41" (1/1) ... [2025-03-03 15:39:42,360 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:39:41" (1/1) ... [2025-03-03 15:39:42,377 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:39:41" (1/1) ... [2025-03-03 15:39:42,435 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 15:39:42,435 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 15:39:42,435 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 15:39:42,436 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 15:39:42,436 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:39:41" (1/1) ... [2025-03-03 15:39:42,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 15:39:42,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:39:42,463 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 15:39:42,468 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 15:39:42,486 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 15:39:42,487 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2025-03-03 15:39:42,487 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2025-03-03 15:39:42,487 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-03-03 15:39:42,487 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-03-03 15:39:42,487 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2025-03-03 15:39:42,487 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2025-03-03 15:39:42,487 INFO L130 BoogieDeclarations]: Found specification of procedure error [2025-03-03 15:39:42,487 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2025-03-03 15:39:42,487 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2025-03-03 15:39:42,487 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2025-03-03 15:39:42,487 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2025-03-03 15:39:42,487 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2025-03-03 15:39:42,487 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2025-03-03 15:39:42,487 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2025-03-03 15:39:42,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 15:39:42,487 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 15:39:42,487 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 15:39:42,568 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 15:39:42,569 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 15:39:48,715 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4481: havoc calculate_output3_#t~ret16#1; [2025-03-03 15:39:48,716 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7469: havoc calculate_output5_#t~ret18#1; [2025-03-03 15:39:48,717 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3033: havoc calculate_output2_#t~ret15#1; [2025-03-03 15:39:48,717 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10440: havoc calculate_output7_#t~ret20#1; [2025-03-03 15:39:48,718 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8922: havoc calculate_output6_#t~ret19#1; [2025-03-03 15:39:48,718 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6035: havoc calculate_output4_#t~ret17#1; [2025-03-03 15:39:48,719 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1543: havoc calculate_output_#t~ret14#1; [2025-03-03 15:39:49,007 INFO L? ?]: Removed 1705 outVars from TransFormulas that were not future-live. [2025-03-03 15:39:49,007 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 15:39:49,062 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 15:39:49,065 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 15:39:49,065 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 03:39:49 BoogieIcfgContainer [2025-03-03 15:39:49,065 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 15:39:49,067 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 15:39:49,067 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 15:39:49,078 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 15:39:49,078 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 03:39:39" (1/3) ... [2025-03-03 15:39:49,079 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6544305 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 03:39:49, skipping insertion in model container [2025-03-03 15:39:49,079 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:39:41" (2/3) ... [2025-03-03 15:39:49,079 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6544305 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 03:39:49, skipping insertion in model container [2025-03-03 15:39:49,079 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 03:39:49" (3/3) ... [2025-03-03 15:39:49,081 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem05_label43+token_ring.03.cil-1.c [2025-03-03 15:39:49,093 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 15:39:49,096 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem05_label43+token_ring.03.cil-1.c that has 8 procedures, 2356 locations, 1 initial locations, 7 loop locations, and 2 error locations. [2025-03-03 15:39:49,191 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 15:39:49,200 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;@640ebd8a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 15:39:49,201 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-03 15:39:49,211 INFO L276 IsEmpty]: Start isEmpty. Operand has 2356 states, 2327 states have (on average 1.8500214868929952) internal successors, (4305), 2332 states have internal predecessors, (4305), 19 states have call successors, (19), 7 states have call predecessors, (19), 7 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-03 15:39:49,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-03 15:39:49,221 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:39:49,222 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:39:49,222 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:39:49,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:39:49,226 INFO L85 PathProgramCache]: Analyzing trace with hash 27118073, now seen corresponding path program 1 times [2025-03-03 15:39:49,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:39:49,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831243998] [2025-03-03 15:39:49,231 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:39:49,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:39:49,293 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-03 15:39:49,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-03 15:39:49,319 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:39:49,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:39:49,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:39:49,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:39:49,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831243998] [2025-03-03 15:39:49,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831243998] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:39:49,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:39:49,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:39:49,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944356234] [2025-03-03 15:39:49,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:39:49,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:39:49,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:39:49,632 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:39:49,633 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:39:49,639 INFO L87 Difference]: Start difference. First operand has 2356 states, 2327 states have (on average 1.8500214868929952) internal successors, (4305), 2332 states have internal predecessors, (4305), 19 states have call successors, (19), 7 states have call predecessors, (19), 7 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:39:50,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:39:50,094 INFO L93 Difference]: Finished difference Result 4871 states and 8935 transitions. [2025-03-03 15:39:50,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 15:39:50,096 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 80 [2025-03-03 15:39:50,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:39:50,123 INFO L225 Difference]: With dead ends: 4871 [2025-03-03 15:39:50,123 INFO L226 Difference]: Without dead ends: 2456 [2025-03-03 15:39:50,130 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-03-03 15:39:50,132 INFO L435 NwaCegarLoop]: 4221 mSDtfsCounter, 4433 mSDsluCounter, 8538 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4444 SdHoareTripleChecker+Valid, 12759 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:39:50,133 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4444 Valid, 12759 Invalid, 310 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [42 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 15:39:50,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2456 states. [2025-03-03 15:39:50,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2456 to 2443. [2025-03-03 15:39:50,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2443 states, 2397 states have (on average 1.824363788068419) internal successors, (4373), 2401 states have internal predecessors, (4373), 31 states have call successors, (31), 13 states have call predecessors, (31), 13 states have return successors, (30), 29 states have call predecessors, (30), 29 states have call successors, (30) [2025-03-03 15:39:50,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2443 states to 2443 states and 4434 transitions. [2025-03-03 15:39:50,251 INFO L78 Accepts]: Start accepts. Automaton has 2443 states and 4434 transitions. Word has length 80 [2025-03-03 15:39:50,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:39:50,251 INFO L471 AbstractCegarLoop]: Abstraction has 2443 states and 4434 transitions. [2025-03-03 15:39:50,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:39:50,252 INFO L276 IsEmpty]: Start isEmpty. Operand 2443 states and 4434 transitions. [2025-03-03 15:39:50,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-03 15:39:50,255 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:39:50,255 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:39:50,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 15:39:50,256 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:39:50,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:39:50,257 INFO L85 PathProgramCache]: Analyzing trace with hash 1553881463, now seen corresponding path program 1 times [2025-03-03 15:39:50,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:39:50,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212746578] [2025-03-03 15:39:50,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:39:50,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:39:50,267 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-03 15:39:50,276 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-03 15:39:50,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:39:50,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:39:50,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:39:50,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:39:50,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212746578] [2025-03-03 15:39:50,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212746578] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:39:50,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:39:50,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:39:50,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829913902] [2025-03-03 15:39:50,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:39:50,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:39:50,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:39:50,426 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:39:50,426 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:39:50,426 INFO L87 Difference]: Start difference. First operand 2443 states and 4434 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:39:50,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:39:50,672 INFO L93 Difference]: Finished difference Result 2778 states and 4939 transitions. [2025-03-03 15:39:50,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:39:50,672 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 80 [2025-03-03 15:39:50,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:39:50,682 INFO L225 Difference]: With dead ends: 2778 [2025-03-03 15:39:50,682 INFO L226 Difference]: Without dead ends: 2467 [2025-03-03 15:39:50,684 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-03-03 15:39:50,685 INFO L435 NwaCegarLoop]: 4140 mSDtfsCounter, 4261 mSDsluCounter, 8211 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4272 SdHoareTripleChecker+Valid, 12351 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:39:50,685 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4272 Valid, 12351 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:39:50,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2467 states. [2025-03-03 15:39:50,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2467 to 2443. [2025-03-03 15:39:50,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2443 states, 2397 states have (on average 1.8235294117647058) internal successors, (4371), 2401 states have internal predecessors, (4371), 31 states have call successors, (31), 13 states have call predecessors, (31), 13 states have return successors, (30), 29 states have call predecessors, (30), 29 states have call successors, (30) [2025-03-03 15:39:50,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2443 states to 2443 states and 4432 transitions. [2025-03-03 15:39:50,747 INFO L78 Accepts]: Start accepts. Automaton has 2443 states and 4432 transitions. Word has length 80 [2025-03-03 15:39:50,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:39:50,747 INFO L471 AbstractCegarLoop]: Abstraction has 2443 states and 4432 transitions. [2025-03-03 15:39:50,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:39:50,748 INFO L276 IsEmpty]: Start isEmpty. Operand 2443 states and 4432 transitions. [2025-03-03 15:39:50,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-03 15:39:50,750 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:39:50,750 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:39:50,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 15:39:50,750 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:39:50,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:39:50,750 INFO L85 PathProgramCache]: Analyzing trace with hash -1436692104, now seen corresponding path program 1 times [2025-03-03 15:39:50,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:39:50,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229002243] [2025-03-03 15:39:50,751 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:39:50,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:39:50,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-03 15:39:50,767 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-03 15:39:50,768 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:39:50,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:39:50,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:39:50,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:39:50,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229002243] [2025-03-03 15:39:50,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229002243] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:39:50,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:39:50,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:39:50,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016105756] [2025-03-03 15:39:50,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:39:50,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:39:50,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:39:50,887 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:39:50,888 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:39:50,888 INFO L87 Difference]: Start difference. First operand 2443 states and 4432 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:39:51,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:39:51,386 INFO L93 Difference]: Finished difference Result 2935 states and 5159 transitions. [2025-03-03 15:39:51,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:39:51,387 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 80 [2025-03-03 15:39:51,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:39:51,399 INFO L225 Difference]: With dead ends: 2935 [2025-03-03 15:39:51,399 INFO L226 Difference]: Without dead ends: 2624 [2025-03-03 15:39:51,401 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-03-03 15:39:51,402 INFO L435 NwaCegarLoop]: 4271 mSDtfsCounter, 4346 mSDsluCounter, 12798 mSDsCounter, 0 mSdLazyCounter, 503 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4357 SdHoareTripleChecker+Valid, 17069 SdHoareTripleChecker+Invalid, 528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 503 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 15:39:51,402 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4357 Valid, 17069 Invalid, 528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 503 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 15:39:51,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2624 states. [2025-03-03 15:39:51,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2624 to 2587. [2025-03-03 15:39:51,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2587 states, 2522 states have (on average 1.8053132434575734) internal successors, (4553), 2527 states have internal predecessors, (4553), 43 states have call successors, (43), 19 states have call predecessors, (43), 20 states have return successors, (45), 42 states have call predecessors, (45), 41 states have call successors, (45) [2025-03-03 15:39:51,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2587 states to 2587 states and 4641 transitions. [2025-03-03 15:39:51,482 INFO L78 Accepts]: Start accepts. Automaton has 2587 states and 4641 transitions. Word has length 80 [2025-03-03 15:39:51,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:39:51,482 INFO L471 AbstractCegarLoop]: Abstraction has 2587 states and 4641 transitions. [2025-03-03 15:39:51,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:39:51,482 INFO L276 IsEmpty]: Start isEmpty. Operand 2587 states and 4641 transitions. [2025-03-03 15:39:51,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-03 15:39:51,486 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:39:51,486 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:39:51,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 15:39:51,486 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:39:51,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:39:51,487 INFO L85 PathProgramCache]: Analyzing trace with hash -1645390407, now seen corresponding path program 1 times [2025-03-03 15:39:51,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:39:51,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676600306] [2025-03-03 15:39:51,488 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:39:51,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:39:51,498 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-03 15:39:51,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-03 15:39:51,505 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:39:51,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:39:51,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:39:51,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:39:51,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676600306] [2025-03-03 15:39:51,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676600306] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:39:51,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:39:51,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:39:51,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18823944] [2025-03-03 15:39:51,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:39:51,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:39:51,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:39:51,636 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:39:51,636 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:39:51,636 INFO L87 Difference]: Start difference. First operand 2587 states and 4641 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:39:52,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:39:52,134 INFO L93 Difference]: Finished difference Result 3429 states and 5882 transitions. [2025-03-03 15:39:52,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:39:52,135 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 80 [2025-03-03 15:39:52,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:39:52,152 INFO L225 Difference]: With dead ends: 3429 [2025-03-03 15:39:52,153 INFO L226 Difference]: Without dead ends: 2974 [2025-03-03 15:39:52,156 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-03-03 15:39:52,158 INFO L435 NwaCegarLoop]: 4265 mSDtfsCounter, 4445 mSDsluCounter, 12775 mSDsCounter, 0 mSdLazyCounter, 506 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4460 SdHoareTripleChecker+Valid, 17040 SdHoareTripleChecker+Invalid, 534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:39:52,158 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4460 Valid, 17040 Invalid, 534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 506 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 15:39:52,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2974 states. [2025-03-03 15:39:52,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2974 to 2878. [2025-03-03 15:39:52,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2878 states, 2775 states have (on average 1.7744144144144145) internal successors, (4924), 2784 states have internal predecessors, (4924), 65 states have call successors, (65), 31 states have call predecessors, (65), 36 states have return successors, (79), 66 states have call predecessors, (79), 63 states have call successors, (79) [2025-03-03 15:39:52,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2878 states to 2878 states and 5068 transitions. [2025-03-03 15:39:52,264 INFO L78 Accepts]: Start accepts. Automaton has 2878 states and 5068 transitions. Word has length 80 [2025-03-03 15:39:52,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:39:52,264 INFO L471 AbstractCegarLoop]: Abstraction has 2878 states and 5068 transitions. [2025-03-03 15:39:52,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:39:52,265 INFO L276 IsEmpty]: Start isEmpty. Operand 2878 states and 5068 transitions. [2025-03-03 15:39:52,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-03 15:39:52,267 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:39:52,267 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:39:52,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 15:39:52,268 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:39:52,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:39:52,269 INFO L85 PathProgramCache]: Analyzing trace with hash 841729368, now seen corresponding path program 1 times [2025-03-03 15:39:52,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:39:52,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258576699] [2025-03-03 15:39:52,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:39:52,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:39:52,280 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-03 15:39:52,286 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-03 15:39:52,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:39:52,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:39:52,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:39:52,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:39:52,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258576699] [2025-03-03 15:39:52,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258576699] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:39:52,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:39:52,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:39:52,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787357928] [2025-03-03 15:39:52,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:39:52,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:39:52,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:39:52,379 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:39:52,379 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:39:52,379 INFO L87 Difference]: Start difference. First operand 2878 states and 5068 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:39:52,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:39:52,653 INFO L93 Difference]: Finished difference Result 3668 states and 6244 transitions. [2025-03-03 15:39:52,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:39:52,654 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 80 [2025-03-03 15:39:52,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:39:52,670 INFO L225 Difference]: With dead ends: 3668 [2025-03-03 15:39:52,670 INFO L226 Difference]: Without dead ends: 2922 [2025-03-03 15:39:52,674 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-03-03 15:39:52,675 INFO L435 NwaCegarLoop]: 4131 mSDtfsCounter, 4253 mSDsluCounter, 8192 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4264 SdHoareTripleChecker+Valid, 12323 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:39:52,676 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4264 Valid, 12323 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:39:52,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2922 states. [2025-03-03 15:39:52,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2922 to 2878. [2025-03-03 15:39:52,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2878 states, 2775 states have (on average 1.7726126126126127) internal successors, (4919), 2784 states have internal predecessors, (4919), 65 states have call successors, (65), 31 states have call predecessors, (65), 36 states have return successors, (79), 66 states have call predecessors, (79), 63 states have call successors, (79) [2025-03-03 15:39:52,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2878 states to 2878 states and 5063 transitions. [2025-03-03 15:39:52,776 INFO L78 Accepts]: Start accepts. Automaton has 2878 states and 5063 transitions. Word has length 80 [2025-03-03 15:39:52,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:39:52,777 INFO L471 AbstractCegarLoop]: Abstraction has 2878 states and 5063 transitions. [2025-03-03 15:39:52,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:39:52,778 INFO L276 IsEmpty]: Start isEmpty. Operand 2878 states and 5063 transitions. [2025-03-03 15:39:52,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-03 15:39:52,780 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:39:52,780 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:39:52,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 15:39:52,780 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:39:52,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:39:52,781 INFO L85 PathProgramCache]: Analyzing trace with hash -324966951, now seen corresponding path program 1 times [2025-03-03 15:39:52,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:39:52,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724488989] [2025-03-03 15:39:52,781 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:39:52,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:39:52,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-03 15:39:52,793 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-03 15:39:52,793 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:39:52,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:39:52,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-03-03 15:39:52,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:39:52,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724488989] [2025-03-03 15:39:52,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724488989] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:39:52,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:39:52,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:39:52,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743639892] [2025-03-03 15:39:52,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:39:52,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:39:52,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:39:52,884 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:39:52,884 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:39:52,884 INFO L87 Difference]: Start difference. First operand 2878 states and 5063 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:39:53,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:39:53,273 INFO L93 Difference]: Finished difference Result 4306 states and 7162 transitions. [2025-03-03 15:39:53,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:39:53,274 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 80 [2025-03-03 15:39:53,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:39:53,288 INFO L225 Difference]: With dead ends: 4306 [2025-03-03 15:39:53,288 INFO L226 Difference]: Without dead ends: 3560 [2025-03-03 15:39:53,292 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-03-03 15:39:53,293 INFO L435 NwaCegarLoop]: 4257 mSDtfsCounter, 4372 mSDsluCounter, 12752 mSDsCounter, 0 mSdLazyCounter, 506 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4387 SdHoareTripleChecker+Valid, 17009 SdHoareTripleChecker+Invalid, 534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:39:53,293 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4387 Valid, 17009 Invalid, 534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 506 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 15:39:53,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3560 states. [2025-03-03 15:39:53,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3560 to 3466. [2025-03-03 15:39:53,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3466 states, 3283 states have (on average 1.7231190983856228) internal successors, (5657), 3306 states have internal predecessors, (5657), 107 states have call successors, (107), 55 states have call predecessors, (107), 74 states have return successors, (169), 112 states have call predecessors, (169), 105 states have call successors, (169) [2025-03-03 15:39:53,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3466 states to 3466 states and 5933 transitions. [2025-03-03 15:39:53,401 INFO L78 Accepts]: Start accepts. Automaton has 3466 states and 5933 transitions. Word has length 80 [2025-03-03 15:39:53,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:39:53,401 INFO L471 AbstractCegarLoop]: Abstraction has 3466 states and 5933 transitions. [2025-03-03 15:39:53,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:39:53,402 INFO L276 IsEmpty]: Start isEmpty. Operand 3466 states and 5933 transitions. [2025-03-03 15:39:53,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-03 15:39:53,404 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:39:53,404 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:39:53,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 15:39:53,404 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:39:53,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:39:53,405 INFO L85 PathProgramCache]: Analyzing trace with hash -224054984, now seen corresponding path program 1 times [2025-03-03 15:39:53,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:39:53,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237893017] [2025-03-03 15:39:53,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:39:53,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:39:53,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-03 15:39:53,417 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-03 15:39:53,417 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:39:53,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:39:53,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:39:53,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:39:53,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237893017] [2025-03-03 15:39:53,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237893017] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:39:53,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:39:53,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:39:53,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7621548] [2025-03-03 15:39:53,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:39:53,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:39:53,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:39:53,514 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:39:53,514 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:39:53,515 INFO L87 Difference]: Start difference. First operand 3466 states and 5933 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:39:53,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:39:53,704 INFO L93 Difference]: Finished difference Result 4858 states and 8004 transitions. [2025-03-03 15:39:53,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:39:53,705 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 80 [2025-03-03 15:39:53,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:39:53,716 INFO L225 Difference]: With dead ends: 4858 [2025-03-03 15:39:53,717 INFO L226 Difference]: Without dead ends: 3524 [2025-03-03 15:39:53,720 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-03-03 15:39:53,721 INFO L435 NwaCegarLoop]: 4126 mSDtfsCounter, 4249 mSDsluCounter, 8183 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4260 SdHoareTripleChecker+Valid, 12309 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:39:53,721 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4260 Valid, 12309 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:39:53,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3524 states. [2025-03-03 15:39:53,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3524 to 3466. [2025-03-03 15:39:53,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3466 states, 3283 states have (on average 1.720377703320134) internal successors, (5648), 3306 states have internal predecessors, (5648), 107 states have call successors, (107), 55 states have call predecessors, (107), 74 states have return successors, (169), 112 states have call predecessors, (169), 105 states have call successors, (169) [2025-03-03 15:39:53,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3466 states to 3466 states and 5924 transitions. [2025-03-03 15:39:53,814 INFO L78 Accepts]: Start accepts. Automaton has 3466 states and 5924 transitions. Word has length 80 [2025-03-03 15:39:53,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:39:53,814 INFO L471 AbstractCegarLoop]: Abstraction has 3466 states and 5924 transitions. [2025-03-03 15:39:53,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:39:53,815 INFO L276 IsEmpty]: Start isEmpty. Operand 3466 states and 5924 transitions. [2025-03-03 15:39:53,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-03 15:39:53,818 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:39:53,818 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:39:53,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 15:39:53,818 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:39:53,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:39:53,819 INFO L85 PathProgramCache]: Analyzing trace with hash 56294905, now seen corresponding path program 1 times [2025-03-03 15:39:53,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:39:53,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305075395] [2025-03-03 15:39:53,819 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:39:53,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:39:53,824 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-03 15:39:53,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-03 15:39:53,828 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:39:53,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:39:53,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:39:53,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:39:53,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305075395] [2025-03-03 15:39:53,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305075395] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:39:53,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:39:53,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:39:53,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893803236] [2025-03-03 15:39:53,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:39:53,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 15:39:53,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:39:53,860 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 15:39:53,860 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 15:39:53,860 INFO L87 Difference]: Start difference. First operand 3466 states and 5924 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:39:54,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:39:54,017 INFO L93 Difference]: Finished difference Result 6037 states and 9739 transitions. [2025-03-03 15:39:54,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:39:54,018 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 80 [2025-03-03 15:39:54,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:39:54,035 INFO L225 Difference]: With dead ends: 6037 [2025-03-03 15:39:54,035 INFO L226 Difference]: Without dead ends: 4704 [2025-03-03 15:39:54,040 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-03-03 15:39:54,041 INFO L435 NwaCegarLoop]: 4392 mSDtfsCounter, 4359 mSDsluCounter, 4327 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4359 SdHoareTripleChecker+Valid, 8719 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:39:54,041 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4359 Valid, 8719 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:39:54,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4704 states. [2025-03-03 15:39:54,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4704 to 4695. [2025-03-03 15:39:54,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4695 states, 4337 states have (on average 1.6389209130735531) internal successors, (7108), 4389 states have internal predecessors, (7108), 208 states have call successors, (208), 109 states have call predecessors, (208), 148 states have return successors, (327), 204 states have call predecessors, (327), 206 states have call successors, (327) [2025-03-03 15:39:54,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4695 states to 4695 states and 7643 transitions. [2025-03-03 15:39:54,175 INFO L78 Accepts]: Start accepts. Automaton has 4695 states and 7643 transitions. Word has length 80 [2025-03-03 15:39:54,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:39:54,176 INFO L471 AbstractCegarLoop]: Abstraction has 4695 states and 7643 transitions. [2025-03-03 15:39:54,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 15:39:54,176 INFO L276 IsEmpty]: Start isEmpty. Operand 4695 states and 7643 transitions. [2025-03-03 15:39:54,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-03 15:39:54,181 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:39:54,181 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:39:54,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 15:39:54,181 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:39:54,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:39:54,182 INFO L85 PathProgramCache]: Analyzing trace with hash 1545851375, now seen corresponding path program 1 times [2025-03-03 15:39:54,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:39:54,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432874516] [2025-03-03 15:39:54,182 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:39:54,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:39:54,187 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-03 15:39:54,190 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-03 15:39:54,190 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:39:54,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:39:54,237 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-03 15:39:54,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:39:54,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432874516] [2025-03-03 15:39:54,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432874516] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:39:54,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [185601046] [2025-03-03 15:39:54,238 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:39:54,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:39:54,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:39:54,240 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 15:39:54,242 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 15:39:54,289 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-03 15:39:54,330 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-03 15:39:54,330 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:39:54,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:39:54,333 INFO L256 TraceCheckSpWp]: Trace formula consists of 504 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 15:39:54,339 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:39:54,390 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-03 15:39:54,390 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 15:39:54,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [185601046] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:39:54,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 15:39:54,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-03-03 15:39:54,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226553312] [2025-03-03 15:39:54,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:39:54,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:39:54,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:39:54,392 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:39:54,392 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:39:54,392 INFO L87 Difference]: Start difference. First operand 4695 states and 7643 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 2 states have internal predecessors, (94), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 15:39:54,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:39:54,589 INFO L93 Difference]: Finished difference Result 9728 states and 14917 transitions. [2025-03-03 15:39:54,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:39:54,590 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 2 states have internal predecessors, (94), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 131 [2025-03-03 15:39:54,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:39:54,610 INFO L225 Difference]: With dead ends: 9728 [2025-03-03 15:39:54,610 INFO L226 Difference]: Without dead ends: 7166 [2025-03-03 15:39:54,618 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 131 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-03-03 15:39:54,619 INFO L435 NwaCegarLoop]: 4196 mSDtfsCounter, 4152 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4152 SdHoareTripleChecker+Valid, 4410 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-03-03 15:39:54,619 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4152 Valid, 4410 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:39:54,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7166 states. [2025-03-03 15:39:54,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7166 to 7108. [2025-03-03 15:39:54,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7108 states, 6418 states have (on average 1.5680897475849174) internal successors, (10064), 6519 states have internal predecessors, (10064), 392 states have call successors, (392), 217 states have call predecessors, (392), 296 states have return successors, (625), 379 states have call predecessors, (625), 390 states have call successors, (625) [2025-03-03 15:39:54,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7108 states to 7108 states and 11081 transitions. [2025-03-03 15:39:54,833 INFO L78 Accepts]: Start accepts. Automaton has 7108 states and 11081 transitions. Word has length 131 [2025-03-03 15:39:54,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:39:54,833 INFO L471 AbstractCegarLoop]: Abstraction has 7108 states and 11081 transitions. [2025-03-03 15:39:54,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 2 states have internal predecessors, (94), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 15:39:54,834 INFO L276 IsEmpty]: Start isEmpty. Operand 7108 states and 11081 transitions. [2025-03-03 15:39:54,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-03 15:39:54,842 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:39:54,842 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:39:54,850 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-03 15:39:55,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:39:55,043 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:39:55,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:39:55,044 INFO L85 PathProgramCache]: Analyzing trace with hash 1856729717, now seen corresponding path program 1 times [2025-03-03 15:39:55,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:39:55,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896766426] [2025-03-03 15:39:55,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:39:55,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:39:55,050 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-03 15:39:55,053 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-03 15:39:55,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:39:55,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:39:55,100 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-03 15:39:55,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:39:55,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896766426] [2025-03-03 15:39:55,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896766426] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:39:55,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1657982032] [2025-03-03 15:39:55,101 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:39:55,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:39:55,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:39:55,103 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 15:39:55,104 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 15:39:55,149 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-03 15:39:55,189 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-03 15:39:55,189 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:39:55,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:39:55,191 INFO L256 TraceCheckSpWp]: Trace formula consists of 498 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 15:39:55,193 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:39:55,245 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-03 15:39:55,245 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 15:39:55,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1657982032] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:39:55,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 15:39:55,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-03-03 15:39:55,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68462928] [2025-03-03 15:39:55,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:39:55,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:39:55,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:39:55,246 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:39:55,246 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:39:55,246 INFO L87 Difference]: Start difference. First operand 7108 states and 11081 transitions. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 2 states have internal predecessors, (100), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 15:39:55,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:39:55,562 INFO L93 Difference]: Finished difference Result 16925 states and 25243 transitions. [2025-03-03 15:39:55,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:39:55,562 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 2 states have internal predecessors, (100), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 131 [2025-03-03 15:39:55,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:39:55,596 INFO L225 Difference]: With dead ends: 16925 [2025-03-03 15:39:55,596 INFO L226 Difference]: Without dead ends: 11950 [2025-03-03 15:39:55,610 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 131 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-03-03 15:39:55,611 INFO L435 NwaCegarLoop]: 4196 mSDtfsCounter, 4146 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4146 SdHoareTripleChecker+Valid, 4410 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-03-03 15:39:55,611 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4146 Valid, 4410 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:39:55,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11950 states. [2025-03-03 15:39:56,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11950 to 11838. [2025-03-03 15:39:56,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11838 states, 10486 states have (on average 1.5094411596414266) internal successors, (15828), 10685 states have internal predecessors, (15828), 758 states have call successors, (758), 433 states have call predecessors, (758), 592 states have return successors, (1219), 727 states have call predecessors, (1219), 756 states have call successors, (1219) [2025-03-03 15:39:56,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11838 states to 11838 states and 17805 transitions. [2025-03-03 15:39:56,121 INFO L78 Accepts]: Start accepts. Automaton has 11838 states and 17805 transitions. Word has length 131 [2025-03-03 15:39:56,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:39:56,121 INFO L471 AbstractCegarLoop]: Abstraction has 11838 states and 17805 transitions. [2025-03-03 15:39:56,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 2 states have internal predecessors, (100), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 15:39:56,121 INFO L276 IsEmpty]: Start isEmpty. Operand 11838 states and 17805 transitions. [2025-03-03 15:39:56,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-03 15:39:56,132 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:39:56,132 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:39:56,139 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-03 15:39:56,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-03 15:39:56,333 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:39:56,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:39:56,333 INFO L85 PathProgramCache]: Analyzing trace with hash 1702850427, now seen corresponding path program 1 times [2025-03-03 15:39:56,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:39:56,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99680933] [2025-03-03 15:39:56,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:39:56,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:39:56,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-03 15:39:56,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-03 15:39:56,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:39:56,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:39:56,400 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-03 15:39:56,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:39:56,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99680933] [2025-03-03 15:39:56,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99680933] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:39:56,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1018300890] [2025-03-03 15:39:56,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:39:56,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:39:56,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:39:56,403 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 15:39:56,405 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 15:39:56,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-03 15:39:56,491 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-03 15:39:56,491 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:39:56,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:39:56,493 INFO L256 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 15:39:56,496 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:39:56,544 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 15:39:56,544 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 15:39:56,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1018300890] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:39:56,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 15:39:56,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-03-03 15:39:56,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721818728] [2025-03-03 15:39:56,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:39:56,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:39:56,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:39:56,545 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:39:56,545 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:39:56,546 INFO L87 Difference]: Start difference. First operand 11838 states and 17805 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 2 states have internal predecessors, (88), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 15:39:57,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:39:57,204 INFO L93 Difference]: Finished difference Result 30983 states and 45357 transitions. [2025-03-03 15:39:57,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:39:57,204 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 2 states have internal predecessors, (88), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 131 [2025-03-03 15:39:57,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:39:57,269 INFO L225 Difference]: With dead ends: 30983 [2025-03-03 15:39:57,269 INFO L226 Difference]: Without dead ends: 21278 [2025-03-03 15:39:57,292 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 131 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-03-03 15:39:57,293 INFO L435 NwaCegarLoop]: 4196 mSDtfsCounter, 4158 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4158 SdHoareTripleChecker+Valid, 4410 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-03-03 15:39:57,293 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4158 Valid, 4410 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:39:57,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21278 states. [2025-03-03 15:39:57,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21278 to 21058. [2025-03-03 15:39:58,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21058 states, 18402 states have (on average 1.4687533963699597) internal successors, (27028), 18797 states have internal predecessors, (27028), 1470 states have call successors, (1470), 865 states have call predecessors, (1470), 1184 states have return successors, (2387), 1403 states have call predecessors, (2387), 1468 states have call successors, (2387) [2025-03-03 15:39:58,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21058 states to 21058 states and 30885 transitions. [2025-03-03 15:39:58,051 INFO L78 Accepts]: Start accepts. Automaton has 21058 states and 30885 transitions. Word has length 131 [2025-03-03 15:39:58,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:39:58,051 INFO L471 AbstractCegarLoop]: Abstraction has 21058 states and 30885 transitions. [2025-03-03 15:39:58,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 2 states have internal predecessors, (88), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 15:39:58,052 INFO L276 IsEmpty]: Start isEmpty. Operand 21058 states and 30885 transitions. [2025-03-03 15:39:58,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-03 15:39:58,067 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:39:58,067 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:39:58,073 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-03 15:39:58,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:39:58,271 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:39:58,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:39:58,272 INFO L85 PathProgramCache]: Analyzing trace with hash -867036287, now seen corresponding path program 1 times [2025-03-03 15:39:58,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:39:58,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965513134] [2025-03-03 15:39:58,272 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:39:58,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:39:58,278 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-03 15:39:58,281 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-03 15:39:58,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:39:58,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:39:58,327 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-03 15:39:58,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:39:58,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965513134] [2025-03-03 15:39:58,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965513134] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:39:58,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2026791662] [2025-03-03 15:39:58,328 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:39:58,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:39:58,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:39:58,330 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 15:39:58,331 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 15:39:58,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-03 15:39:58,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-03 15:39:58,414 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:39:58,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:39:58,417 INFO L256 TraceCheckSpWp]: Trace formula consists of 486 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 15:39:58,419 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:39:58,441 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-03 15:39:58,442 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 15:39:58,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2026791662] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:39:58,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 15:39:58,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-03 15:39:58,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725399710] [2025-03-03 15:39:58,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:39:58,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:39:58,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:39:58,445 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:39:58,445 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:39:58,445 INFO L87 Difference]: Start difference. First operand 21058 states and 30885 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-03 15:39:59,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:39:59,588 INFO L93 Difference]: Finished difference Result 57283 states and 83205 transitions. [2025-03-03 15:39:59,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:39:59,589 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 131 [2025-03-03 15:39:59,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:39:59,734 INFO L225 Difference]: With dead ends: 57283 [2025-03-03 15:39:59,734 INFO L226 Difference]: Without dead ends: 38359 [2025-03-03 15:39:59,779 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 131 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-03-03 15:39:59,780 INFO L435 NwaCegarLoop]: 4398 mSDtfsCounter, 197 mSDsluCounter, 4195 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 8593 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:39:59,780 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 8593 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:39:59,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38359 states. [2025-03-03 15:40:01,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38359 to 38359. [2025-03-03 15:40:01,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38359 states, 33272 states have (on average 1.4372745852368358) internal successors, (47821), 33988 states have internal predecessors, (47821), 2755 states have call successors, (2755), 1691 states have call predecessors, (2755), 2330 states have return successors, (5010), 2695 states have call predecessors, (5010), 2753 states have call successors, (5010) [2025-03-03 15:40:01,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38359 states to 38359 states and 55586 transitions. [2025-03-03 15:40:01,785 INFO L78 Accepts]: Start accepts. Automaton has 38359 states and 55586 transitions. Word has length 131 [2025-03-03 15:40:01,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:40:01,787 INFO L471 AbstractCegarLoop]: Abstraction has 38359 states and 55586 transitions. [2025-03-03 15:40:01,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-03 15:40:01,787 INFO L276 IsEmpty]: Start isEmpty. Operand 38359 states and 55586 transitions. [2025-03-03 15:40:01,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2025-03-03 15:40:01,869 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:40:01,870 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, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:40:01,876 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-03 15:40:02,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:40:02,071 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:40:02,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:40:02,071 INFO L85 PathProgramCache]: Analyzing trace with hash -1864688756, now seen corresponding path program 1 times [2025-03-03 15:40:02,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:40:02,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620313542] [2025-03-03 15:40:02,072 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:40:02,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:40:02,082 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-03-03 15:40:02,086 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-03-03 15:40:02,086 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:40:02,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:40:02,156 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2025-03-03 15:40:02,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:40:02,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620313542] [2025-03-03 15:40:02,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620313542] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:40:02,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [109108430] [2025-03-03 15:40:02,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:40:02,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:40:02,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:40:02,159 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 15:40:02,161 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-03 15:40:02,217 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-03-03 15:40:02,263 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-03-03 15:40:02,263 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:40:02,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:40:02,266 INFO L256 TraceCheckSpWp]: Trace formula consists of 646 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 15:40:02,268 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:40:02,360 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 102 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-03 15:40:02,362 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 15:40:02,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [109108430] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:40:02,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 15:40:02,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-03 15:40:02,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448389739] [2025-03-03 15:40:02,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:40:02,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:40:02,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:40:02,363 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:40:02,363 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:40:02,363 INFO L87 Difference]: Start difference. First operand 38359 states and 55586 transitions. Second operand has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-03 15:40:03,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:40:03,324 INFO L93 Difference]: Finished difference Result 63045 states and 91315 transitions. [2025-03-03 15:40:03,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:40:03,324 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 190 [2025-03-03 15:40:03,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:40:03,443 INFO L225 Difference]: With dead ends: 63045 [2025-03-03 15:40:03,443 INFO L226 Difference]: Without dead ends: 34183 [2025-03-03 15:40:03,493 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 190 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-03-03 15:40:03,494 INFO L435 NwaCegarLoop]: 4193 mSDtfsCounter, 4120 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4120 SdHoareTripleChecker+Valid, 4237 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:40:03,494 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4120 Valid, 4237 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:40:03,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34183 states. [2025-03-03 15:40:04,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34183 to 26267. [2025-03-03 15:40:04,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26267 states, 23076 states have (on average 1.4144999133298666) internal successors, (32641), 23316 states have internal predecessors, (32641), 1811 states have call successors, (1811), 1187 states have call predecessors, (1811), 1378 states have return successors, (2546), 1771 states have call predecessors, (2546), 1809 states have call successors, (2546) [2025-03-03 15:40:04,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26267 states to 26267 states and 36998 transitions. [2025-03-03 15:40:04,619 INFO L78 Accepts]: Start accepts. Automaton has 26267 states and 36998 transitions. Word has length 190 [2025-03-03 15:40:04,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:40:04,620 INFO L471 AbstractCegarLoop]: Abstraction has 26267 states and 36998 transitions. [2025-03-03 15:40:04,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-03 15:40:04,620 INFO L276 IsEmpty]: Start isEmpty. Operand 26267 states and 36998 transitions. [2025-03-03 15:40:04,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2025-03-03 15:40:04,647 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:40:04,647 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, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:40:04,654 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-03 15:40:04,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-03 15:40:04,849 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:40:04,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:40:04,849 INFO L85 PathProgramCache]: Analyzing trace with hash -762898773, now seen corresponding path program 1 times [2025-03-03 15:40:04,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:40:04,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336703891] [2025-03-03 15:40:04,850 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:40:04,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:40:04,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-03-03 15:40:04,865 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-03-03 15:40:04,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:40:04,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:40:04,932 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2025-03-03 15:40:04,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:40:04,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336703891] [2025-03-03 15:40:04,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336703891] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:40:04,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2102049828] [2025-03-03 15:40:04,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:40:04,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:40:04,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:40:04,934 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 15:40:04,936 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-03 15:40:04,993 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-03-03 15:40:05,049 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-03-03 15:40:05,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:40:05,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:40:05,052 INFO L256 TraceCheckSpWp]: Trace formula consists of 643 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 15:40:05,054 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:40:05,125 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-03 15:40:05,125 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 15:40:05,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2102049828] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:40:05,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 15:40:05,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-03 15:40:05,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548948945] [2025-03-03 15:40:05,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:40:05,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:40:05,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:40:05,127 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:40:05,127 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:40:05,127 INFO L87 Difference]: Start difference. First operand 26267 states and 36998 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-03 15:40:06,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:40:06,191 INFO L93 Difference]: Finished difference Result 53071 states and 74421 transitions. [2025-03-03 15:40:06,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:40:06,191 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 190 [2025-03-03 15:40:06,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:40:06,290 INFO L225 Difference]: With dead ends: 53071 [2025-03-03 15:40:06,290 INFO L226 Difference]: Without dead ends: 28945 [2025-03-03 15:40:06,334 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 190 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-03-03 15:40:06,335 INFO L435 NwaCegarLoop]: 4191 mSDtfsCounter, 4137 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4137 SdHoareTripleChecker+Valid, 4234 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:40:06,335 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4137 Valid, 4234 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:40:06,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28945 states. [2025-03-03 15:40:07,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28945 to 28945. [2025-03-03 15:40:07,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28945 states, 25550 states have (on average 1.3784344422700587) internal successors, (35219), 25790 states have internal predecessors, (35219), 1869 states have call successors, (1869), 1333 states have call predecessors, (1869), 1524 states have return successors, (2618), 1829 states have call predecessors, (2618), 1867 states have call successors, (2618) [2025-03-03 15:40:07,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28945 states to 28945 states and 39706 transitions. [2025-03-03 15:40:07,994 INFO L78 Accepts]: Start accepts. Automaton has 28945 states and 39706 transitions. Word has length 190 [2025-03-03 15:40:07,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:40:07,994 INFO L471 AbstractCegarLoop]: Abstraction has 28945 states and 39706 transitions. [2025-03-03 15:40:07,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-03 15:40:07,995 INFO L276 IsEmpty]: Start isEmpty. Operand 28945 states and 39706 transitions. [2025-03-03 15:40:08,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2025-03-03 15:40:08,028 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:40:08,028 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, 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-03-03 15:40:08,035 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-03 15:40:08,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:40:08,229 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:40:08,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:40:08,230 INFO L85 PathProgramCache]: Analyzing trace with hash -963367258, now seen corresponding path program 1 times [2025-03-03 15:40:08,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:40:08,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753439347] [2025-03-03 15:40:08,230 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:40:08,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:40:08,241 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-03-03 15:40:08,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-03-03 15:40:08,248 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:40:08,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:40:08,466 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2025-03-03 15:40:08,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:40:08,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753439347] [2025-03-03 15:40:08,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753439347] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:40:08,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [829818592] [2025-03-03 15:40:08,467 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:40:08,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:40:08,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:40:08,472 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 15:40:08,474 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-03 15:40:08,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-03-03 15:40:08,638 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-03-03 15:40:08,639 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:40:08,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:40:08,641 INFO L256 TraceCheckSpWp]: Trace formula consists of 634 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 15:40:08,645 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:40:08,694 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2025-03-03 15:40:08,695 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 15:40:08,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [829818592] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:40:08,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 15:40:08,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-03 15:40:08,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865868739] [2025-03-03 15:40:08,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:40:08,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:40:08,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:40:08,696 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:40:08,696 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:40:08,700 INFO L87 Difference]: Start difference. First operand 28945 states and 39706 transitions. Second operand has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-03 15:40:09,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:40:09,915 INFO L93 Difference]: Finished difference Result 51834 states and 69950 transitions. [2025-03-03 15:40:09,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:40:09,916 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 190 [2025-03-03 15:40:09,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:40:09,990 INFO L225 Difference]: With dead ends: 51834 [2025-03-03 15:40:09,991 INFO L226 Difference]: Without dead ends: 31389 [2025-03-03 15:40:10,021 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 190 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-03-03 15:40:10,022 INFO L435 NwaCegarLoop]: 4252 mSDtfsCounter, 4117 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4117 SdHoareTripleChecker+Valid, 4473 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:40:10,022 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4117 Valid, 4473 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:40:10,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31389 states. [2025-03-03 15:40:11,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31389 to 31225. [2025-03-03 15:40:11,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31225 states, 27686 states have (on average 1.353861157263599) internal successors, (37483), 27926 states have internal predecessors, (37483), 1897 states have call successors, (1897), 1449 states have call predecessors, (1897), 1640 states have return successors, (2762), 1857 states have call predecessors, (2762), 1895 states have call successors, (2762) [2025-03-03 15:40:11,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31225 states to 31225 states and 42142 transitions. [2025-03-03 15:40:11,139 INFO L78 Accepts]: Start accepts. Automaton has 31225 states and 42142 transitions. Word has length 190 [2025-03-03 15:40:11,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:40:11,140 INFO L471 AbstractCegarLoop]: Abstraction has 31225 states and 42142 transitions. [2025-03-03 15:40:11,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-03 15:40:11,140 INFO L276 IsEmpty]: Start isEmpty. Operand 31225 states and 42142 transitions. [2025-03-03 15:40:11,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2025-03-03 15:40:11,170 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:40:11,170 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, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:40:11,185 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-03 15:40:11,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:40:11,372 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:40:11,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:40:11,376 INFO L85 PathProgramCache]: Analyzing trace with hash -1912021946, now seen corresponding path program 1 times [2025-03-03 15:40:11,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:40:11,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826649237] [2025-03-03 15:40:11,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:40:11,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:40:11,402 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-03-03 15:40:11,409 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-03-03 15:40:11,409 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:40:11,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:40:11,504 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2025-03-03 15:40:11,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:40:11,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826649237] [2025-03-03 15:40:11,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826649237] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:40:11,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1270621533] [2025-03-03 15:40:11,505 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:40:11,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:40:11,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:40:11,507 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 15:40:11,509 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-03 15:40:11,576 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-03-03 15:40:11,629 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-03-03 15:40:11,629 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:40:11,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:40:11,631 INFO L256 TraceCheckSpWp]: Trace formula consists of 635 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 15:40:11,634 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:40:11,656 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-03 15:40:11,657 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 15:40:11,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1270621533] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:40:11,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 15:40:11,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-03 15:40:11,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844131635] [2025-03-03 15:40:11,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:40:11,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:40:11,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:40:11,658 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:40:11,658 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:40:11,658 INFO L87 Difference]: Start difference. First operand 31225 states and 42142 transitions. Second operand has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-03 15:40:13,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:40:13,440 INFO L93 Difference]: Finished difference Result 85729 states and 114984 transitions. [2025-03-03 15:40:13,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:40:13,440 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 191 [2025-03-03 15:40:13,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:40:13,673 INFO L225 Difference]: With dead ends: 85729 [2025-03-03 15:40:13,673 INFO L226 Difference]: Without dead ends: 56645 [2025-03-03 15:40:13,719 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 191 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-03-03 15:40:13,721 INFO L435 NwaCegarLoop]: 4399 mSDtfsCounter, 191 mSDsluCounter, 4187 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 8586 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:40:13,721 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 8586 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:40:13,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56645 states. [2025-03-03 15:40:15,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56645 to 56641. [2025-03-03 15:40:15,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56641 states, 49888 states have (on average 1.3301194676074406) internal successors, (66357), 50366 states have internal predecessors, (66357), 3631 states have call successors, (3631), 2737 states have call predecessors, (3631), 3120 states have return successors, (6322), 3553 states have call predecessors, (6322), 3629 states have call successors, (6322) [2025-03-03 15:40:16,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56641 states to 56641 states and 76310 transitions. [2025-03-03 15:40:16,097 INFO L78 Accepts]: Start accepts. Automaton has 56641 states and 76310 transitions. Word has length 191 [2025-03-03 15:40:16,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:40:16,098 INFO L471 AbstractCegarLoop]: Abstraction has 56641 states and 76310 transitions. [2025-03-03 15:40:16,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-03 15:40:16,098 INFO L276 IsEmpty]: Start isEmpty. Operand 56641 states and 76310 transitions. [2025-03-03 15:40:16,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2025-03-03 15:40:16,153 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:40:16,153 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, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:40:16,163 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-03 15:40:16,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-03 15:40:16,354 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:40:16,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:40:16,354 INFO L85 PathProgramCache]: Analyzing trace with hash -466595375, now seen corresponding path program 1 times [2025-03-03 15:40:16,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:40:16,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286030545] [2025-03-03 15:40:16,354 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:40:16,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:40:16,362 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-03-03 15:40:16,366 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-03-03 15:40:16,366 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:40:16,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:40:16,414 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2025-03-03 15:40:16,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:40:16,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286030545] [2025-03-03 15:40:16,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286030545] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:40:16,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [16445034] [2025-03-03 15:40:16,414 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:40:16,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:40:16,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:40:16,417 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 15:40:16,419 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-03 15:40:16,467 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-03-03 15:40:16,512 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-03-03 15:40:16,512 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:40:16,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:40:16,514 INFO L256 TraceCheckSpWp]: Trace formula consists of 637 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 15:40:16,517 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:40:16,555 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2025-03-03 15:40:16,555 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 15:40:16,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [16445034] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:40:16,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 15:40:16,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-03 15:40:16,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638341394] [2025-03-03 15:40:16,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:40:16,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:40:16,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:40:16,558 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:40:16,558 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:40:16,558 INFO L87 Difference]: Start difference. First operand 56641 states and 76310 transitions. Second operand has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-03 15:40:18,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:40:18,544 INFO L93 Difference]: Finished difference Result 115021 states and 155901 transitions. [2025-03-03 15:40:18,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:40:18,548 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 192 [2025-03-03 15:40:18,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:40:18,822 INFO L225 Difference]: With dead ends: 115021 [2025-03-03 15:40:18,822 INFO L226 Difference]: Without dead ends: 60529 [2025-03-03 15:40:19,092 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 192 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-03-03 15:40:19,093 INFO L435 NwaCegarLoop]: 4199 mSDtfsCounter, 4150 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4150 SdHoareTripleChecker+Valid, 4241 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:40:19,094 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4150 Valid, 4241 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:40:19,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60529 states. [2025-03-03 15:40:21,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60529 to 56641. [2025-03-03 15:40:21,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56641 states, 49888 states have (on average 1.3105556446440025) internal successors, (65381), 50366 states have internal predecessors, (65381), 3631 states have call successors, (3631), 2737 states have call predecessors, (3631), 3120 states have return successors, (5974), 3553 states have call predecessors, (5974), 3629 states have call successors, (5974) [2025-03-03 15:40:22,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56641 states to 56641 states and 74986 transitions. [2025-03-03 15:40:22,055 INFO L78 Accepts]: Start accepts. Automaton has 56641 states and 74986 transitions. Word has length 192 [2025-03-03 15:40:22,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:40:22,055 INFO L471 AbstractCegarLoop]: Abstraction has 56641 states and 74986 transitions. [2025-03-03 15:40:22,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-03 15:40:22,056 INFO L276 IsEmpty]: Start isEmpty. Operand 56641 states and 74986 transitions. [2025-03-03 15:40:22,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2025-03-03 15:40:22,300 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:40:22,300 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, 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, 1, 1] [2025-03-03 15:40:22,307 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-03 15:40:22,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-03 15:40:22,505 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:40:22,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:40:22,506 INFO L85 PathProgramCache]: Analyzing trace with hash -2041902865, now seen corresponding path program 1 times [2025-03-03 15:40:22,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:40:22,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739964505] [2025-03-03 15:40:22,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:40:22,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:40:22,514 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-03-03 15:40:22,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-03-03 15:40:22,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:40:22,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:40:22,581 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2025-03-03 15:40:22,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:40:22,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739964505] [2025-03-03 15:40:22,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739964505] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:40:22,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [777907757] [2025-03-03 15:40:22,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:40:22,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:40:22,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:40:22,585 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 15:40:22,587 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-03 15:40:22,643 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-03-03 15:40:22,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-03-03 15:40:22,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:40:22,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:40:22,694 INFO L256 TraceCheckSpWp]: Trace formula consists of 631 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 15:40:22,696 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:40:22,711 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-03-03 15:40:22,712 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 15:40:22,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [777907757] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:40:22,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 15:40:22,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-03 15:40:22,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766786128] [2025-03-03 15:40:22,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:40:22,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:40:22,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:40:22,713 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:40:22,713 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:40:22,714 INFO L87 Difference]: Start difference. First operand 56641 states and 74986 transitions. Second operand has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 3 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-03 15:40:26,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:40:26,385 INFO L93 Difference]: Finished difference Result 163037 states and 216118 transitions. [2025-03-03 15:40:26,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:40:26,385 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 3 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 192 [2025-03-03 15:40:26,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:40:26,767 INFO L225 Difference]: With dead ends: 163037 [2025-03-03 15:40:26,767 INFO L226 Difference]: Without dead ends: 108545 [2025-03-03 15:40:26,873 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 192 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-03-03 15:40:26,874 INFO L435 NwaCegarLoop]: 4398 mSDtfsCounter, 201 mSDsluCounter, 4185 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 8583 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:40:26,874 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 8583 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:40:26,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108545 states. [2025-03-03 15:40:31,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108545 to 108541. [2025-03-03 15:40:31,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108541 states, 95376 states have (on average 1.2908173964099983) internal successors, (123113), 96330 states have internal predecessors, (123113), 7035 states have call successors, (7035), 5361 states have call predecessors, (7035), 6128 states have return successors, (13948), 6881 states have call predecessors, (13948), 7033 states have call successors, (13948) [2025-03-03 15:40:31,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108541 states to 108541 states and 144096 transitions. [2025-03-03 15:40:31,868 INFO L78 Accepts]: Start accepts. Automaton has 108541 states and 144096 transitions. Word has length 192 [2025-03-03 15:40:31,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:40:31,868 INFO L471 AbstractCegarLoop]: Abstraction has 108541 states and 144096 transitions. [2025-03-03 15:40:31,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 3 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-03 15:40:31,868 INFO L276 IsEmpty]: Start isEmpty. Operand 108541 states and 144096 transitions. [2025-03-03 15:40:31,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2025-03-03 15:40:31,975 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:40:31,975 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, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:40:31,981 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-03 15:40:32,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-03 15:40:32,176 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:40:32,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:40:32,176 INFO L85 PathProgramCache]: Analyzing trace with hash -1574875522, now seen corresponding path program 1 times [2025-03-03 15:40:32,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:40:32,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908913292] [2025-03-03 15:40:32,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:40:32,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:40:32,183 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-03-03 15:40:32,187 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-03-03 15:40:32,187 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:40:32,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:40:32,229 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2025-03-03 15:40:32,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:40:32,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908913292] [2025-03-03 15:40:32,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908913292] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:40:32,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [672515549] [2025-03-03 15:40:32,230 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:40:32,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:40:32,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:40:32,232 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 15:40:32,234 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-03 15:40:32,280 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-03-03 15:40:32,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-03-03 15:40:32,329 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:40:32,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:40:32,331 INFO L256 TraceCheckSpWp]: Trace formula consists of 634 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 15:40:32,333 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:40:32,429 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2025-03-03 15:40:32,429 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 15:40:32,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [672515549] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:40:32,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 15:40:32,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-03 15:40:32,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366526184] [2025-03-03 15:40:32,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:40:32,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:40:32,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:40:32,430 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:40:32,430 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:40:32,430 INFO L87 Difference]: Start difference. First operand 108541 states and 144096 transitions. Second operand has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-03 15:40:35,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:40:35,441 INFO L93 Difference]: Finished difference Result 187713 states and 254105 transitions. [2025-03-03 15:40:35,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:40:35,442 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 192 [2025-03-03 15:40:35,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:40:36,041 INFO L225 Difference]: With dead ends: 187713 [2025-03-03 15:40:36,041 INFO L226 Difference]: Without dead ends: 97341 [2025-03-03 15:40:36,205 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 192 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-03-03 15:40:36,205 INFO L435 NwaCegarLoop]: 4186 mSDtfsCounter, 4111 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4111 SdHoareTripleChecker+Valid, 4227 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:40:36,205 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4111 Valid, 4227 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:40:36,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97341 states.