./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label49+token_ring.03.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 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_label49+token_ring.03.cil-2.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 713a95fba13367522eddac239136ad149ef56d491623153a32513b25fa3198dd --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 20:07:07,817 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 20:07:07,874 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 20:07:07,881 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 20:07:07,882 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 20:07:07,896 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 20:07:07,897 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 20:07:07,897 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 20:07:07,897 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 20:07:07,898 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 20:07:07,898 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 20:07:07,898 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 20:07:07,898 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 20:07:07,898 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 20:07:07,898 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 20:07:07,898 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 20:07:07,898 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 20:07:07,898 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 20:07:07,898 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 20:07:07,898 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 20:07:07,899 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 20:07:07,899 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 20:07:07,899 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 20:07:07,899 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 20:07:07,899 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 20:07:07,899 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 20:07:07,899 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 20:07:07,899 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 20:07:07,899 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 20:07:07,899 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 20:07:07,899 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 20:07:07,899 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 20:07:07,899 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 20:07:07,899 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 20:07:07,899 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 20:07:07,899 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 20:07:07,899 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 20:07:07,899 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 20:07:07,899 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 20:07:07,900 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 20:07:07,900 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 20:07:07,900 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 20:07:07,900 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 20:07:07,900 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 -> 713a95fba13367522eddac239136ad149ef56d491623153a32513b25fa3198dd [2025-03-16 20:07:08,105 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 20:07:08,111 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 20:07:08,112 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 20:07:08,113 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 20:07:08,113 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 20:07:08,113 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/Problem05_label49+token_ring.03.cil-2.c [2025-03-16 20:07:09,281 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6bb2715c1/d3a3f7b65d164b768d215633b96fe509/FLAG8227472b1 [2025-03-16 20:07:09,748 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 20:07:09,749 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label49+token_ring.03.cil-2.c [2025-03-16 20:07:09,792 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6bb2715c1/d3a3f7b65d164b768d215633b96fe509/FLAG8227472b1 [2025-03-16 20:07:09,843 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6bb2715c1/d3a3f7b65d164b768d215633b96fe509 [2025-03-16 20:07:09,845 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 20:07:09,845 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 20:07:09,846 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 20:07:09,846 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 20:07:09,849 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 20:07:09,850 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 08:07:09" (1/1) ... [2025-03-16 20:07:09,850 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30a60230 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:07:09, skipping insertion in model container [2025-03-16 20:07:09,850 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 08:07:09" (1/1) ... [2025-03-16 20:07:09,996 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 20:07:11,076 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_label49+token_ring.03.cil-2.c[380593,380606] [2025-03-16 20:07:11,101 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_label49+token_ring.03.cil-2.c[383339,383352] [2025-03-16 20:07:11,245 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 20:07:11,253 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 20:07:11,774 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_label49+token_ring.03.cil-2.c[380593,380606] [2025-03-16 20:07:11,782 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_label49+token_ring.03.cil-2.c[383339,383352] [2025-03-16 20:07:11,802 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 20:07:11,887 INFO L204 MainTranslator]: Completed translation [2025-03-16 20:07:11,888 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:07:11 WrapperNode [2025-03-16 20:07:11,888 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 20:07:11,889 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 20:07:11,889 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 20:07:11,889 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 20:07:11,895 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:07:11" (1/1) ... [2025-03-16 20:07:11,948 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:07:11" (1/1) ... [2025-03-16 20:07:12,207 INFO L138 Inliner]: procedures = 50, calls = 50, calls flagged for inlining = 28, calls inlined = 28, statements flattened = 12672 [2025-03-16 20:07:12,208 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 20:07:12,210 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 20:07:12,211 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 20:07:12,211 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 20:07:12,221 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:07:11" (1/1) ... [2025-03-16 20:07:12,221 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:07:11" (1/1) ... [2025-03-16 20:07:12,270 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:07:11" (1/1) ... [2025-03-16 20:07:12,351 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-16 20:07:12,352 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:07:11" (1/1) ... [2025-03-16 20:07:12,352 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:07:11" (1/1) ... [2025-03-16 20:07:12,545 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:07:11" (1/1) ... [2025-03-16 20:07:12,565 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:07:11" (1/1) ... [2025-03-16 20:07:12,585 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:07:11" (1/1) ... [2025-03-16 20:07:12,651 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:07:11" (1/1) ... [2025-03-16 20:07:12,688 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 20:07:12,690 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 20:07:12,690 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 20:07:12,691 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 20:07:12,692 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:07:11" (1/1) ... [2025-03-16 20:07:12,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 20:07:12,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:07:12,716 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-16 20:07:12,720 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-16 20:07:12,735 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 20:07:12,736 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2025-03-16 20:07:12,736 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2025-03-16 20:07:12,736 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-03-16 20:07:12,736 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-03-16 20:07:12,736 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2025-03-16 20:07:12,736 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2025-03-16 20:07:12,736 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2025-03-16 20:07:12,737 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2025-03-16 20:07:12,737 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2025-03-16 20:07:12,737 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2025-03-16 20:07:12,737 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2025-03-16 20:07:12,737 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2025-03-16 20:07:12,737 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 20:07:12,737 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 20:07:12,737 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 20:07:12,821 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 20:07:12,823 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 20:07:18,723 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4481: havoc calculate_output3_#t~ret16#1; [2025-03-16 20:07:18,724 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7469: havoc calculate_output5_#t~ret18#1; [2025-03-16 20:07:18,724 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3033: havoc calculate_output2_#t~ret15#1; [2025-03-16 20:07:18,724 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L10440: havoc calculate_output7_#t~ret20#1; [2025-03-16 20:07:18,724 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L8922: havoc calculate_output6_#t~ret19#1; [2025-03-16 20:07:18,725 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6035: havoc calculate_output4_#t~ret17#1; [2025-03-16 20:07:18,725 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1543: havoc calculate_output_#t~ret14#1; [2025-03-16 20:07:19,063 INFO L? ?]: Removed 1695 outVars from TransFormulas that were not future-live. [2025-03-16 20:07:19,063 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 20:07:19,151 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 20:07:19,151 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 20:07:19,152 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 08:07:19 BoogieIcfgContainer [2025-03-16 20:07:19,152 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 20:07:19,155 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 20:07:19,155 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 20:07:19,162 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 20:07:19,163 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 08:07:09" (1/3) ... [2025-03-16 20:07:19,163 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ee23798 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 08:07:19, skipping insertion in model container [2025-03-16 20:07:19,163 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:07:11" (2/3) ... [2025-03-16 20:07:19,163 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ee23798 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 08:07:19, skipping insertion in model container [2025-03-16 20:07:19,163 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 08:07:19" (3/3) ... [2025-03-16 20:07:19,164 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem05_label49+token_ring.03.cil-2.c [2025-03-16 20:07:19,187 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 20:07:19,191 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem05_label49+token_ring.03.cil-2.c that has 7 procedures, 2268 locations, 1 initial locations, 7 loop locations, and 2 error locations. [2025-03-16 20:07:19,302 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 20:07:19,311 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;@280b0e51, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 20:07:19,311 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-16 20:07:19,319 INFO L276 IsEmpty]: Start isEmpty. Operand has 2268 states, 2243 states have (on average 1.8791796700847079) internal successors, (4215), 2245 states have internal predecessors, (4215), 17 states have call successors, (17), 6 states have call predecessors, (17), 6 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-16 20:07:19,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-16 20:07:19,326 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:07:19,327 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] [2025-03-16 20:07:19,327 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:07:19,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:07:19,331 INFO L85 PathProgramCache]: Analyzing trace with hash -441018170, now seen corresponding path program 1 times [2025-03-16 20:07:19,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:07:19,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93004442] [2025-03-16 20:07:19,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:07:19,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:07:19,399 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-16 20:07:19,424 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-16 20:07:19,425 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:07:19,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:07:19,683 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-16 20:07:19,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:07:19,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93004442] [2025-03-16 20:07:19,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93004442] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:07:19,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:07:19,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 20:07:19,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668714576] [2025-03-16 20:07:19,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:07:19,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 20:07:19,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:07:19,700 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 20:07:19,701 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:07:19,706 INFO L87 Difference]: Start difference. First operand has 2268 states, 2243 states have (on average 1.8791796700847079) internal successors, (4215), 2245 states have internal predecessors, (4215), 17 states have call successors, (17), 6 states have call predecessors, (17), 6 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:07:20,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:07:20,083 INFO L93 Difference]: Finished difference Result 4676 states and 8720 transitions. [2025-03-16 20:07:20,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 20:07:20,085 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 71 [2025-03-16 20:07:20,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:07:20,108 INFO L225 Difference]: With dead ends: 4676 [2025-03-16 20:07:20,109 INFO L226 Difference]: Without dead ends: 2409 [2025-03-16 20:07:20,118 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-16 20:07:20,121 INFO L435 NwaCegarLoop]: 4133 mSDtfsCounter, 4335 mSDsluCounter, 8342 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4346 SdHoareTripleChecker+Valid, 12475 SdHoareTripleChecker+Invalid, 289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 20:07:20,122 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4346 Valid, 12475 Invalid, 289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 20:07:20,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2409 states. [2025-03-16 20:07:20,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2409 to 2398. [2025-03-16 20:07:20,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2398 states, 2354 states have (on average 1.8351741716227699) internal successors, (4320), 2357 states have internal predecessors, (4320), 29 states have call successors, (29), 12 states have call predecessors, (29), 13 states have return successors, (30), 29 states have call predecessors, (30), 29 states have call successors, (30) [2025-03-16 20:07:20,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2398 states to 2398 states and 4379 transitions. [2025-03-16 20:07:20,247 INFO L78 Accepts]: Start accepts. Automaton has 2398 states and 4379 transitions. Word has length 71 [2025-03-16 20:07:20,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:07:20,248 INFO L471 AbstractCegarLoop]: Abstraction has 2398 states and 4379 transitions. [2025-03-16 20:07:20,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:07:20,248 INFO L276 IsEmpty]: Start isEmpty. Operand 2398 states and 4379 transitions. [2025-03-16 20:07:20,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-16 20:07:20,251 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:07:20,251 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] [2025-03-16 20:07:20,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 20:07:20,252 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:07:20,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:07:20,252 INFO L85 PathProgramCache]: Analyzing trace with hash 2057089672, now seen corresponding path program 1 times [2025-03-16 20:07:20,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:07:20,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127281812] [2025-03-16 20:07:20,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:07:20,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:07:20,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-16 20:07:20,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-16 20:07:20,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:07:20,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:07:20,399 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-16 20:07:20,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:07:20,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127281812] [2025-03-16 20:07:20,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127281812] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:07:20,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:07:20,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 20:07:20,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305756066] [2025-03-16 20:07:20,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:07:20,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 20:07:20,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:07:20,401 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 20:07:20,401 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:07:20,401 INFO L87 Difference]: Start difference. First operand 2398 states and 4379 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:07:20,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:07:20,626 INFO L93 Difference]: Finished difference Result 2690 states and 4831 transitions. [2025-03-16 20:07:20,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:07:20,627 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 71 [2025-03-16 20:07:20,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:07:20,638 INFO L225 Difference]: With dead ends: 2690 [2025-03-16 20:07:20,639 INFO L226 Difference]: Without dead ends: 2422 [2025-03-16 20:07:20,641 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-16 20:07:20,642 INFO L435 NwaCegarLoop]: 4115 mSDtfsCounter, 4228 mSDsluCounter, 8165 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4239 SdHoareTripleChecker+Valid, 12280 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 20:07:20,642 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4239 Valid, 12280 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 20:07:20,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2422 states. [2025-03-16 20:07:20,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2422 to 2398. [2025-03-16 20:07:20,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2398 states, 2354 states have (on average 1.8343245539507222) internal successors, (4318), 2357 states have internal predecessors, (4318), 29 states have call successors, (29), 12 states have call predecessors, (29), 13 states have return successors, (30), 29 states have call predecessors, (30), 29 states have call successors, (30) [2025-03-16 20:07:20,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2398 states to 2398 states and 4377 transitions. [2025-03-16 20:07:20,797 INFO L78 Accepts]: Start accepts. Automaton has 2398 states and 4377 transitions. Word has length 71 [2025-03-16 20:07:20,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:07:20,797 INFO L471 AbstractCegarLoop]: Abstraction has 2398 states and 4377 transitions. [2025-03-16 20:07:20,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:07:20,798 INFO L276 IsEmpty]: Start isEmpty. Operand 2398 states and 4377 transitions. [2025-03-16 20:07:20,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-16 20:07:20,799 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:07:20,799 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] [2025-03-16 20:07:20,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 20:07:20,799 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:07:20,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:07:20,800 INFO L85 PathProgramCache]: Analyzing trace with hash 126470567, now seen corresponding path program 1 times [2025-03-16 20:07:20,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:07:20,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188311898] [2025-03-16 20:07:20,800 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:07:20,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:07:20,811 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-16 20:07:20,816 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-16 20:07:20,817 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:07:20,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:07:20,932 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-16 20:07:20,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:07:20,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188311898] [2025-03-16 20:07:20,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188311898] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:07:20,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:07:20,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:07:20,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791329887] [2025-03-16 20:07:20,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:07:20,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:07:20,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:07:20,933 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:07:20,933 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:07:20,934 INFO L87 Difference]: Start difference. First operand 2398 states and 4377 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:07:21,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:07:21,304 INFO L93 Difference]: Finished difference Result 2830 states and 5034 transitions. [2025-03-16 20:07:21,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 20:07:21,305 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 71 [2025-03-16 20:07:21,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:07:21,315 INFO L225 Difference]: With dead ends: 2830 [2025-03-16 20:07:21,315 INFO L226 Difference]: Without dead ends: 2562 [2025-03-16 20:07:21,317 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-16 20:07:21,319 INFO L435 NwaCegarLoop]: 4228 mSDtfsCounter, 4313 mSDsluCounter, 12656 mSDsCounter, 0 mSdLazyCounter, 472 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4324 SdHoareTripleChecker+Valid, 16884 SdHoareTripleChecker+Invalid, 495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 20:07:21,320 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4324 Valid, 16884 Invalid, 495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 472 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 20:07:21,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2562 states. [2025-03-16 20:07:21,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2562 to 2523. [2025-03-16 20:07:21,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2523 states, 2460 states have (on average 1.8199186991869918) internal successors, (4477), 2464 states have internal predecessors, (4477), 41 states have call successors, (41), 18 states have call predecessors, (41), 20 states have return successors, (45), 42 states have call predecessors, (45), 41 states have call successors, (45) [2025-03-16 20:07:21,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2523 states to 2523 states and 4563 transitions. [2025-03-16 20:07:21,389 INFO L78 Accepts]: Start accepts. Automaton has 2523 states and 4563 transitions. Word has length 71 [2025-03-16 20:07:21,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:07:21,389 INFO L471 AbstractCegarLoop]: Abstraction has 2523 states and 4563 transitions. [2025-03-16 20:07:21,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:07:21,389 INFO L276 IsEmpty]: Start isEmpty. Operand 2523 states and 4563 transitions. [2025-03-16 20:07:21,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-16 20:07:21,391 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:07:21,391 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] [2025-03-16 20:07:21,391 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 20:07:21,391 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:07:21,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:07:21,392 INFO L85 PathProgramCache]: Analyzing trace with hash 756929192, now seen corresponding path program 1 times [2025-03-16 20:07:21,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:07:21,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821273866] [2025-03-16 20:07:21,393 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:07:21,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:07:21,402 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-16 20:07:21,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-16 20:07:21,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:07:21,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:07:21,511 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-16 20:07:21,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:07:21,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821273866] [2025-03-16 20:07:21,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821273866] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:07:21,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:07:21,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:07:21,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257275150] [2025-03-16 20:07:21,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:07:21,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:07:21,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:07:21,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:07:21,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:07:21,513 INFO L87 Difference]: Start difference. First operand 2523 states and 4563 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:07:21,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:07:21,860 INFO L93 Difference]: Finished difference Result 3218 states and 5617 transitions. [2025-03-16 20:07:21,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 20:07:21,860 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 71 [2025-03-16 20:07:21,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:07:21,869 INFO L225 Difference]: With dead ends: 3218 [2025-03-16 20:07:21,870 INFO L226 Difference]: Without dead ends: 2825 [2025-03-16 20:07:21,871 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-16 20:07:21,873 INFO L435 NwaCegarLoop]: 4224 mSDtfsCounter, 4308 mSDsluCounter, 12644 mSDsCounter, 0 mSdLazyCounter, 472 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4319 SdHoareTripleChecker+Valid, 16868 SdHoareTripleChecker+Invalid, 495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 20:07:21,874 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4319 Valid, 16868 Invalid, 495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 472 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 20:07:21,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2825 states. [2025-03-16 20:07:21,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2825 to 2784. [2025-03-16 20:07:21,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2784 states, 2681 states have (on average 1.794106676613204) internal successors, (4810), 2689 states have internal predecessors, (4810), 65 states have call successors, (65), 30 states have call predecessors, (65), 36 states have return successors, (81), 68 states have call predecessors, (81), 65 states have call successors, (81) [2025-03-16 20:07:21,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2784 states to 2784 states and 4956 transitions. [2025-03-16 20:07:21,949 INFO L78 Accepts]: Start accepts. Automaton has 2784 states and 4956 transitions. Word has length 71 [2025-03-16 20:07:21,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:07:21,949 INFO L471 AbstractCegarLoop]: Abstraction has 2784 states and 4956 transitions. [2025-03-16 20:07:21,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:07:21,949 INFO L276 IsEmpty]: Start isEmpty. Operand 2784 states and 4956 transitions. [2025-03-16 20:07:21,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-16 20:07:21,950 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:07:21,950 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] [2025-03-16 20:07:21,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 20:07:21,951 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:07:21,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:07:21,952 INFO L85 PathProgramCache]: Analyzing trace with hash 777266567, now seen corresponding path program 1 times [2025-03-16 20:07:21,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:07:21,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315559231] [2025-03-16 20:07:21,952 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:07:21,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:07:21,961 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-16 20:07:21,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-16 20:07:21,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:07:21,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:07:22,124 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-16 20:07:22,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:07:22,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315559231] [2025-03-16 20:07:22,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315559231] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:07:22,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:07:22,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:07:22,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201479330] [2025-03-16 20:07:22,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:07:22,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:07:22,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:07:22,125 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:07:22,125 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:07:22,125 INFO L87 Difference]: Start difference. First operand 2784 states and 4956 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:07:22,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:07:22,580 INFO L93 Difference]: Finished difference Result 4121 states and 7001 transitions. [2025-03-16 20:07:22,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 20:07:22,580 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 71 [2025-03-16 20:07:22,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:07:22,600 INFO L225 Difference]: With dead ends: 4121 [2025-03-16 20:07:22,600 INFO L226 Difference]: Without dead ends: 3467 [2025-03-16 20:07:22,605 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-16 20:07:22,606 INFO L435 NwaCegarLoop]: 4219 mSDtfsCounter, 4395 mSDsluCounter, 12624 mSDsCounter, 0 mSdLazyCounter, 475 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4410 SdHoareTripleChecker+Valid, 16843 SdHoareTripleChecker+Invalid, 501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 475 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 20:07:22,606 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4410 Valid, 16843 Invalid, 501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 475 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 20:07:22,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3467 states. [2025-03-16 20:07:22,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3467 to 3321. [2025-03-16 20:07:22,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3321 states, 3136 states have (on average 1.7544642857142858) internal successors, (5502), 3158 states have internal predecessors, (5502), 109 states have call successors, (109), 54 states have call predecessors, (109), 74 states have return successors, (173), 116 states have call predecessors, (173), 109 states have call successors, (173) [2025-03-16 20:07:22,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3321 states to 3321 states and 5784 transitions. [2025-03-16 20:07:22,711 INFO L78 Accepts]: Start accepts. Automaton has 3321 states and 5784 transitions. Word has length 71 [2025-03-16 20:07:22,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:07:22,712 INFO L471 AbstractCegarLoop]: Abstraction has 3321 states and 5784 transitions. [2025-03-16 20:07:22,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:07:22,712 INFO L276 IsEmpty]: Start isEmpty. Operand 3321 states and 5784 transitions. [2025-03-16 20:07:22,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-16 20:07:22,714 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:07:22,714 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] [2025-03-16 20:07:22,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 20:07:22,714 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:07:22,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:07:22,715 INFO L85 PathProgramCache]: Analyzing trace with hash 1470659272, now seen corresponding path program 1 times [2025-03-16 20:07:22,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:07:22,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948757870] [2025-03-16 20:07:22,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:07:22,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:07:22,722 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-16 20:07:22,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-16 20:07:22,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:07:22,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:07:22,785 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-16 20:07:22,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:07:22,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948757870] [2025-03-16 20:07:22,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948757870] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:07:22,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:07:22,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 20:07:22,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202326362] [2025-03-16 20:07:22,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:07:22,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 20:07:22,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:07:22,787 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 20:07:22,787 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:07:22,787 INFO L87 Difference]: Start difference. First operand 3321 states and 5784 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:07:23,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:07:23,029 INFO L93 Difference]: Finished difference Result 4628 states and 7824 transitions. [2025-03-16 20:07:23,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:07:23,030 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 71 [2025-03-16 20:07:23,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:07:23,044 INFO L225 Difference]: With dead ends: 4628 [2025-03-16 20:07:23,044 INFO L226 Difference]: Without dead ends: 3437 [2025-03-16 20:07:23,048 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-16 20:07:23,049 INFO L435 NwaCegarLoop]: 4106 mSDtfsCounter, 4220 mSDsluCounter, 8146 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4231 SdHoareTripleChecker+Valid, 12252 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 20:07:23,049 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4231 Valid, 12252 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 20:07:23,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3437 states. [2025-03-16 20:07:23,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3437 to 3321. [2025-03-16 20:07:23,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3321 states, 3136 states have (on average 1.7515943877551021) internal successors, (5493), 3158 states have internal predecessors, (5493), 109 states have call successors, (109), 54 states have call predecessors, (109), 74 states have return successors, (173), 116 states have call predecessors, (173), 109 states have call successors, (173) [2025-03-16 20:07:23,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3321 states to 3321 states and 5775 transitions. [2025-03-16 20:07:23,162 INFO L78 Accepts]: Start accepts. Automaton has 3321 states and 5775 transitions. Word has length 71 [2025-03-16 20:07:23,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:07:23,162 INFO L471 AbstractCegarLoop]: Abstraction has 3321 states and 5775 transitions. [2025-03-16 20:07:23,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:07:23,162 INFO L276 IsEmpty]: Start isEmpty. Operand 3321 states and 5775 transitions. [2025-03-16 20:07:23,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-16 20:07:23,167 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:07:23,168 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] [2025-03-16 20:07:23,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 20:07:23,168 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:07:23,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:07:23,168 INFO L85 PathProgramCache]: Analyzing trace with hash 1908668775, now seen corresponding path program 1 times [2025-03-16 20:07:23,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:07:23,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45675749] [2025-03-16 20:07:23,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:07:23,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:07:23,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-16 20:07:23,179 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-16 20:07:23,179 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:07:23,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:07:23,229 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-16 20:07:23,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:07:23,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45675749] [2025-03-16 20:07:23,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45675749] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:07:23,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:07:23,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 20:07:23,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329458337] [2025-03-16 20:07:23,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:07:23,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 20:07:23,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:07:23,230 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 20:07:23,230 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:07:23,231 INFO L87 Difference]: Start difference. First operand 3321 states and 5775 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:07:23,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:07:23,446 INFO L93 Difference]: Finished difference Result 4570 states and 7690 transitions. [2025-03-16 20:07:23,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:07:23,447 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 71 [2025-03-16 20:07:23,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:07:23,458 INFO L225 Difference]: With dead ends: 4570 [2025-03-16 20:07:23,458 INFO L226 Difference]: Without dead ends: 3379 [2025-03-16 20:07:23,461 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-16 20:07:23,461 INFO L435 NwaCegarLoop]: 4101 mSDtfsCounter, 4216 mSDsluCounter, 8137 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4227 SdHoareTripleChecker+Valid, 12238 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 20:07:23,461 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4227 Valid, 12238 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 20:07:23,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3379 states. [2025-03-16 20:07:23,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3379 to 3321. [2025-03-16 20:07:23,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3321 states, 3136 states have (on average 1.7487244897959184) internal successors, (5484), 3158 states have internal predecessors, (5484), 109 states have call successors, (109), 54 states have call predecessors, (109), 74 states have return successors, (173), 116 states have call predecessors, (173), 109 states have call successors, (173) [2025-03-16 20:07:23,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3321 states to 3321 states and 5766 transitions. [2025-03-16 20:07:23,541 INFO L78 Accepts]: Start accepts. Automaton has 3321 states and 5766 transitions. Word has length 71 [2025-03-16 20:07:23,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:07:23,541 INFO L471 AbstractCegarLoop]: Abstraction has 3321 states and 5766 transitions. [2025-03-16 20:07:23,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:07:23,542 INFO L276 IsEmpty]: Start isEmpty. Operand 3321 states and 5766 transitions. [2025-03-16 20:07:23,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-16 20:07:23,543 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:07:23,543 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] [2025-03-16 20:07:23,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 20:07:23,544 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:07:23,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:07:23,544 INFO L85 PathProgramCache]: Analyzing trace with hash -1617128506, now seen corresponding path program 1 times [2025-03-16 20:07:23,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:07:23,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932126696] [2025-03-16 20:07:23,544 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:07:23,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:07:23,549 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-16 20:07:23,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-16 20:07:23,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:07:23,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:07:23,587 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-16 20:07:23,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:07:23,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932126696] [2025-03-16 20:07:23,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932126696] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:07:23,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:07:23,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 20:07:23,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022008700] [2025-03-16 20:07:23,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:07:23,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 20:07:23,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:07:23,589 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 20:07:23,590 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 20:07:23,590 INFO L87 Difference]: Start difference. First operand 3321 states and 5766 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:07:23,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:07:23,743 INFO L93 Difference]: Finished difference Result 5662 states and 9378 transitions. [2025-03-16 20:07:23,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:07:23,744 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 71 [2025-03-16 20:07:23,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:07:23,770 INFO L225 Difference]: With dead ends: 5662 [2025-03-16 20:07:23,770 INFO L226 Difference]: Without dead ends: 4472 [2025-03-16 20:07:23,776 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-16 20:07:23,776 INFO L435 NwaCegarLoop]: 4347 mSDtfsCounter, 4320 mSDsluCounter, 4284 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4320 SdHoareTripleChecker+Valid, 8631 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 20:07:23,776 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4320 Valid, 8631 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 20:07:23,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4472 states. [2025-03-16 20:07:23,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4472 to 4463. [2025-03-16 20:07:23,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4463 states, 4099 states have (on average 1.678702122468895) internal successors, (6881), 4150 states have internal predecessors, (6881), 214 states have call successors, (214), 108 states have call predecessors, (214), 148 states have return successors, (335), 212 states have call predecessors, (335), 214 states have call successors, (335) [2025-03-16 20:07:23,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4463 states to 4463 states and 7430 transitions. [2025-03-16 20:07:23,907 INFO L78 Accepts]: Start accepts. Automaton has 4463 states and 7430 transitions. Word has length 71 [2025-03-16 20:07:23,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:07:23,907 INFO L471 AbstractCegarLoop]: Abstraction has 4463 states and 7430 transitions. [2025-03-16 20:07:23,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:07:23,908 INFO L276 IsEmpty]: Start isEmpty. Operand 4463 states and 7430 transitions. [2025-03-16 20:07:23,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-16 20:07:23,914 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:07:23,914 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 20:07:23,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 20:07:23,914 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:07:23,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:07:23,915 INFO L85 PathProgramCache]: Analyzing trace with hash 2121085020, now seen corresponding path program 1 times [2025-03-16 20:07:23,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:07:23,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436953046] [2025-03-16 20:07:23,916 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:07:23,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:07:23,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-16 20:07:23,928 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-16 20:07:23,928 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:07:23,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:07:23,973 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-16 20:07:23,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:07:23,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436953046] [2025-03-16 20:07:23,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436953046] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:07:23,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [474665756] [2025-03-16 20:07:23,973 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:07:23,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:07:23,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:07:23,976 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-16 20:07:23,977 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-16 20:07:24,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-16 20:07:24,070 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-16 20:07:24,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:07:24,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:07:24,073 INFO L256 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 20:07:24,108 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:07:24,161 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-16 20:07:24,162 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 20:07:24,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [474665756] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:07:24,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 20:07:24,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-03-16 20:07:24,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731148900] [2025-03-16 20:07:24,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:07:24,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:07:24,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:07:24,164 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:07:24,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:07:24,165 INFO L87 Difference]: Start difference. First operand 4463 states and 7430 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 2 states have internal predecessors, (82), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-16 20:07:24,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:07:24,318 INFO L93 Difference]: Finished difference Result 9036 states and 14290 transitions. [2025-03-16 20:07:24,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:07:24,318 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 2 states have internal predecessors, (82), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 115 [2025-03-16 20:07:24,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:07:24,341 INFO L225 Difference]: With dead ends: 9036 [2025-03-16 20:07:24,341 INFO L226 Difference]: Without dead ends: 6704 [2025-03-16 20:07:24,351 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:07:24,352 INFO L435 NwaCegarLoop]: 4166 mSDtfsCounter, 4126 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4126 SdHoareTripleChecker+Valid, 4352 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-16 20:07:24,353 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4126 Valid, 4352 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:07:24,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6704 states. [2025-03-16 20:07:24,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6704 to 6684. [2025-03-16 20:07:24,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6684 states, 5980 states have (on average 1.6133779264214048) internal successors, (9648), 6080 states have internal predecessors, (9648), 406 states have call successors, (406), 216 states have call predecessors, (406), 296 states have return successors, (641), 395 states have call predecessors, (641), 406 states have call successors, (641) [2025-03-16 20:07:24,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6684 states to 6684 states and 10695 transitions. [2025-03-16 20:07:24,622 INFO L78 Accepts]: Start accepts. Automaton has 6684 states and 10695 transitions. Word has length 115 [2025-03-16 20:07:24,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:07:24,622 INFO L471 AbstractCegarLoop]: Abstraction has 6684 states and 10695 transitions. [2025-03-16 20:07:24,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 2 states have internal predecessors, (82), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-16 20:07:24,622 INFO L276 IsEmpty]: Start isEmpty. Operand 6684 states and 10695 transitions. [2025-03-16 20:07:24,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-16 20:07:24,629 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:07:24,629 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 20:07:24,636 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-16 20:07:24,834 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-16 20:07:24,834 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:07:24,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:07:24,834 INFO L85 PathProgramCache]: Analyzing trace with hash 276231906, now seen corresponding path program 1 times [2025-03-16 20:07:24,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:07:24,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491659997] [2025-03-16 20:07:24,834 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:07:24,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:07:24,842 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-16 20:07:24,846 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-16 20:07:24,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:07:24,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:07:24,897 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-16 20:07:24,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:07:24,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491659997] [2025-03-16 20:07:24,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491659997] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:07:24,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2082786402] [2025-03-16 20:07:24,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:07:24,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:07:24,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:07:24,900 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-16 20:07:24,901 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-16 20:07:24,945 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-16 20:07:24,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-16 20:07:24,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:07:24,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:07:24,984 INFO L256 TraceCheckSpWp]: Trace formula consists of 486 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 20:07:24,986 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:07:25,031 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-16 20:07:25,032 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 20:07:25,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2082786402] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:07:25,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 20:07:25,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-03-16 20:07:25,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167401937] [2025-03-16 20:07:25,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:07:25,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:07:25,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:07:25,033 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:07:25,033 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:07:25,034 INFO L87 Difference]: Start difference. First operand 6684 states and 10695 transitions. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 2 states have internal predecessors, (87), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-16 20:07:25,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:07:25,367 INFO L93 Difference]: Finished difference Result 15657 states and 24105 transitions. [2025-03-16 20:07:25,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:07:25,367 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 2 states have internal predecessors, (87), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 115 [2025-03-16 20:07:25,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:07:25,404 INFO L225 Difference]: With dead ends: 15657 [2025-03-16 20:07:25,404 INFO L226 Difference]: Without dead ends: 11104 [2025-03-16 20:07:25,419 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:07:25,420 INFO L435 NwaCegarLoop]: 4166 mSDtfsCounter, 4121 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4121 SdHoareTripleChecker+Valid, 4352 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-16 20:07:25,420 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4121 Valid, 4352 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:07:25,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11104 states. [2025-03-16 20:07:25,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11104 to 11066. [2025-03-16 20:07:25,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11066 states, 9684 states have (on average 1.5561751342420487) internal successors, (15070), 9882 states have internal predecessors, (15070), 788 states have call successors, (788), 432 states have call predecessors, (788), 592 states have return successors, (1251), 759 states have call predecessors, (1251), 788 states have call successors, (1251) [2025-03-16 20:07:25,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11066 states to 11066 states and 17109 transitions. [2025-03-16 20:07:25,937 INFO L78 Accepts]: Start accepts. Automaton has 11066 states and 17109 transitions. Word has length 115 [2025-03-16 20:07:25,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:07:25,938 INFO L471 AbstractCegarLoop]: Abstraction has 11066 states and 17109 transitions. [2025-03-16 20:07:25,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 2 states have internal predecessors, (87), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-16 20:07:25,938 INFO L276 IsEmpty]: Start isEmpty. Operand 11066 states and 17109 transitions. [2025-03-16 20:07:25,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-16 20:07:25,947 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:07:25,947 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 20:07:25,954 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-16 20:07:26,147 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-16 20:07:26,148 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:07:26,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:07:26,148 INFO L85 PathProgramCache]: Analyzing trace with hash 1767945372, now seen corresponding path program 1 times [2025-03-16 20:07:26,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:07:26,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505833160] [2025-03-16 20:07:26,148 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:07:26,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:07:26,155 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-16 20:07:26,159 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-16 20:07:26,159 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:07:26,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:07:26,206 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-16 20:07:26,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:07:26,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505833160] [2025-03-16 20:07:26,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505833160] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:07:26,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [301305851] [2025-03-16 20:07:26,206 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:07:26,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:07:26,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:07:26,208 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-16 20:07:26,210 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-16 20:07:26,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-16 20:07:26,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-16 20:07:26,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:07:26,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:07:26,298 INFO L256 TraceCheckSpWp]: Trace formula consists of 480 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 20:07:26,300 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:07:26,342 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-16 20:07:26,342 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 20:07:26,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [301305851] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:07:26,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 20:07:26,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-03-16 20:07:26,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687200993] [2025-03-16 20:07:26,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:07:26,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:07:26,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:07:26,343 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:07:26,343 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:07:26,344 INFO L87 Difference]: Start difference. First operand 11066 states and 17109 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 2 states have internal predecessors, (77), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-16 20:07:26,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:07:26,909 INFO L93 Difference]: Finished difference Result 28575 states and 43145 transitions. [2025-03-16 20:07:26,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:07:26,910 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 2 states have internal predecessors, (77), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 115 [2025-03-16 20:07:26,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:07:26,965 INFO L225 Difference]: With dead ends: 28575 [2025-03-16 20:07:26,965 INFO L226 Difference]: Without dead ends: 19640 [2025-03-16 20:07:26,986 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:07:26,987 INFO L435 NwaCegarLoop]: 4166 mSDtfsCounter, 4131 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4131 SdHoareTripleChecker+Valid, 4352 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-16 20:07:26,988 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4131 Valid, 4352 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:07:27,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19640 states. [2025-03-16 20:07:27,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19640 to 19566. [2025-03-16 20:07:27,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19566 states, 16880 states have (on average 1.5162322274881517) internal successors, (25594), 17274 states have internal predecessors, (25594), 1500 states have call successors, (1500), 864 states have call predecessors, (1500), 1184 states have return successors, (2419), 1435 states have call predecessors, (2419), 1500 states have call successors, (2419) [2025-03-16 20:07:27,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19566 states to 19566 states and 29513 transitions. [2025-03-16 20:07:27,694 INFO L78 Accepts]: Start accepts. Automaton has 19566 states and 29513 transitions. Word has length 115 [2025-03-16 20:07:27,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:07:27,695 INFO L471 AbstractCegarLoop]: Abstraction has 19566 states and 29513 transitions. [2025-03-16 20:07:27,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 2 states have internal predecessors, (77), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-16 20:07:27,695 INFO L276 IsEmpty]: Start isEmpty. Operand 19566 states and 29513 transitions. [2025-03-16 20:07:27,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-16 20:07:27,712 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:07:27,712 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 20:07:27,722 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-16 20:07:27,912 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-16 20:07:27,913 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:07:27,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:07:27,913 INFO L85 PathProgramCache]: Analyzing trace with hash 2032931286, now seen corresponding path program 1 times [2025-03-16 20:07:27,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:07:27,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592469682] [2025-03-16 20:07:27,913 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:07:27,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:07:27,920 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-16 20:07:27,925 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-16 20:07:27,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:07:27,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:07:27,973 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-16 20:07:27,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:07:27,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592469682] [2025-03-16 20:07:27,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592469682] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:07:27,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [415441247] [2025-03-16 20:07:27,973 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:07:27,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:07:27,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:07:27,975 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-16 20:07:27,977 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-16 20:07:28,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-16 20:07:28,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-16 20:07:28,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:07:28,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:07:28,060 INFO L256 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 20:07:28,062 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:07:28,082 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-16 20:07:28,082 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 20:07:28,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [415441247] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:07:28,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 20:07:28,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-16 20:07:28,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230714897] [2025-03-16 20:07:28,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:07:28,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:07:28,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:07:28,085 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:07:28,085 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:07:28,085 INFO L87 Difference]: Start difference. First operand 19566 states and 29513 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-16 20:07:29,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:07:29,661 INFO L93 Difference]: Finished difference Result 53425 states and 80111 transitions. [2025-03-16 20:07:29,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:07:29,662 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 115 [2025-03-16 20:07:29,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:07:29,769 INFO L225 Difference]: With dead ends: 53425 [2025-03-16 20:07:29,769 INFO L226 Difference]: Without dead ends: 35991 [2025-03-16 20:07:29,805 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:07:29,806 INFO L435 NwaCegarLoop]: 4354 mSDtfsCounter, 184 mSDsluCounter, 4165 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 8519 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-16 20:07:29,806 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 8519 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:07:29,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35991 states. [2025-03-16 20:07:30,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35991 to 35991. [2025-03-16 20:07:31,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35991 states, 30818 states have (on average 1.4894866636381336) internal successors, (45903), 31533 states have internal predecessors, (45903), 2829 states have call successors, (2829), 1702 states have call predecessors, (2829), 2342 states have return successors, (5130), 2771 states have call predecessors, (5130), 2829 states have call successors, (5130) [2025-03-16 20:07:31,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35991 states to 35991 states and 53862 transitions. [2025-03-16 20:07:31,119 INFO L78 Accepts]: Start accepts. Automaton has 35991 states and 53862 transitions. Word has length 115 [2025-03-16 20:07:31,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:07:31,120 INFO L471 AbstractCegarLoop]: Abstraction has 35991 states and 53862 transitions. [2025-03-16 20:07:31,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-16 20:07:31,120 INFO L276 IsEmpty]: Start isEmpty. Operand 35991 states and 53862 transitions. [2025-03-16 20:07:31,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-03-16 20:07:31,200 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:07:31,200 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, 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-16 20:07:31,208 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-16 20:07:31,401 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-16 20:07:31,402 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:07:31,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:07:31,402 INFO L85 PathProgramCache]: Analyzing trace with hash 222330261, now seen corresponding path program 1 times [2025-03-16 20:07:31,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:07:31,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336132235] [2025-03-16 20:07:31,403 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:07:31,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:07:31,410 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-16 20:07:31,414 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-16 20:07:31,415 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:07:31,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:07:31,471 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2025-03-16 20:07:31,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:07:31,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336132235] [2025-03-16 20:07:31,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336132235] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:07:31,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1306072443] [2025-03-16 20:07:31,472 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:07:31,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:07:31,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:07:31,475 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-16 20:07:31,476 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-16 20:07:31,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-16 20:07:31,573 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-16 20:07:31,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:07:31,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:07:31,575 INFO L256 TraceCheckSpWp]: Trace formula consists of 630 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 20:07:31,578 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:07:31,658 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-16 20:07:31,658 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 20:07:31,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1306072443] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:07:31,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 20:07:31,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-16 20:07:31,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483305913] [2025-03-16 20:07:31,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:07:31,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:07:31,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:07:31,661 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:07:31,661 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:07:31,661 INFO L87 Difference]: Start difference. First operand 35991 states and 53862 transitions. Second operand has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-16 20:07:32,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:07:32,657 INFO L93 Difference]: Finished difference Result 58683 states and 87865 transitions. [2025-03-16 20:07:32,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:07:32,657 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 166 [2025-03-16 20:07:32,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:07:32,779 INFO L225 Difference]: With dead ends: 58683 [2025-03-16 20:07:32,779 INFO L226 Difference]: Without dead ends: 31719 [2025-03-16 20:07:32,841 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:07:32,841 INFO L435 NwaCegarLoop]: 4163 mSDtfsCounter, 4100 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4100 SdHoareTripleChecker+Valid, 4203 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-16 20:07:32,841 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4100 Valid, 4203 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:07:32,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31719 states. [2025-03-16 20:07:34,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31719 to 24287. [2025-03-16 20:07:34,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24287 states, 21050 states have (on average 1.456104513064133) internal successors, (30651), 21289 states have internal predecessors, (30651), 1849 states have call successors, (1849), 1194 states have call predecessors, (1849), 1386 states have return successors, (2610), 1811 states have call predecessors, (2610), 1849 states have call successors, (2610) [2025-03-16 20:07:34,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24287 states to 24287 states and 35110 transitions. [2025-03-16 20:07:34,442 INFO L78 Accepts]: Start accepts. Automaton has 24287 states and 35110 transitions. Word has length 166 [2025-03-16 20:07:34,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:07:34,442 INFO L471 AbstractCegarLoop]: Abstraction has 24287 states and 35110 transitions. [2025-03-16 20:07:34,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-16 20:07:34,442 INFO L276 IsEmpty]: Start isEmpty. Operand 24287 states and 35110 transitions. [2025-03-16 20:07:34,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-03-16 20:07:34,474 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:07:34,474 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, 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-16 20:07:34,481 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-16 20:07:34,678 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-16 20:07:34,678 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:07:34,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:07:34,679 INFO L85 PathProgramCache]: Analyzing trace with hash -1820960332, now seen corresponding path program 1 times [2025-03-16 20:07:34,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:07:34,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486386975] [2025-03-16 20:07:34,680 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:07:34,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:07:34,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-16 20:07:34,697 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-16 20:07:34,699 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:07:34,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:07:34,769 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2025-03-16 20:07:34,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:07:34,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486386975] [2025-03-16 20:07:34,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486386975] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:07:34,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1860994603] [2025-03-16 20:07:34,770 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:07:34,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:07:34,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:07:34,772 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-16 20:07:34,773 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-16 20:07:34,835 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-16 20:07:34,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-16 20:07:34,886 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:07:34,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:07:34,887 INFO L256 TraceCheckSpWp]: Trace formula consists of 627 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 20:07:34,890 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:07:34,953 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-16 20:07:34,956 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 20:07:34,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1860994603] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:07:34,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 20:07:34,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-16 20:07:34,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887572494] [2025-03-16 20:07:34,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:07:34,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:07:34,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:07:34,958 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:07:34,958 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:07:34,958 INFO L87 Difference]: Start difference. First operand 24287 states and 35110 transitions. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 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-16 20:07:36,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:07:36,296 INFO L93 Difference]: Finished difference Result 48785 states and 70367 transitions. [2025-03-16 20:07:36,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:07:36,297 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 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 166 [2025-03-16 20:07:36,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:07:36,398 INFO L225 Difference]: With dead ends: 48785 [2025-03-16 20:07:36,399 INFO L226 Difference]: Without dead ends: 26637 [2025-03-16 20:07:36,448 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:07:36,449 INFO L435 NwaCegarLoop]: 4161 mSDtfsCounter, 4116 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4116 SdHoareTripleChecker+Valid, 4200 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-16 20:07:36,449 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4116 Valid, 4200 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:07:36,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26637 states. [2025-03-16 20:07:37,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26637 to 26637. [2025-03-16 20:07:37,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26637 states, 23180 states have (on average 1.4186798964624676) internal successors, (32885), 23419 states have internal predecessors, (32885), 1915 states have call successors, (1915), 1348 states have call predecessors, (1915), 1540 states have return successors, (2698), 1877 states have call predecessors, (2698), 1915 states have call successors, (2698) [2025-03-16 20:07:37,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26637 states to 26637 states and 37498 transitions. [2025-03-16 20:07:37,587 INFO L78 Accepts]: Start accepts. Automaton has 26637 states and 37498 transitions. Word has length 166 [2025-03-16 20:07:37,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:07:37,587 INFO L471 AbstractCegarLoop]: Abstraction has 26637 states and 37498 transitions. [2025-03-16 20:07:37,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 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-16 20:07:37,587 INFO L276 IsEmpty]: Start isEmpty. Operand 26637 states and 37498 transitions. [2025-03-16 20:07:37,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-03-16 20:07:37,614 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:07:37,615 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, 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] [2025-03-16 20:07:37,621 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-16 20:07:37,815 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-16 20:07:37,815 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:07:37,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:07:37,816 INFO L85 PathProgramCache]: Analyzing trace with hash 1606112111, now seen corresponding path program 1 times [2025-03-16 20:07:37,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:07:37,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015180920] [2025-03-16 20:07:37,816 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:07:37,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:07:37,827 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-16 20:07:37,831 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-16 20:07:37,832 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:07:37,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:07:37,891 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2025-03-16 20:07:37,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:07:37,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015180920] [2025-03-16 20:07:37,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015180920] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:07:37,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1206774590] [2025-03-16 20:07:37,892 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:07:37,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:07:37,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:07:37,894 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-16 20:07:37,895 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-16 20:07:37,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-16 20:07:37,995 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-16 20:07:37,995 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:07:37,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:07:37,997 INFO L256 TraceCheckSpWp]: Trace formula consists of 618 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-16 20:07:37,999 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:07:38,041 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-03-16 20:07:38,041 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 20:07:38,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1206774590] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:07:38,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 20:07:38,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-16 20:07:38,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109346562] [2025-03-16 20:07:38,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:07:38,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:07:38,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:07:38,042 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:07:38,042 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:07:38,042 INFO L87 Difference]: Start difference. First operand 26637 states and 37498 transitions. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-16 20:07:38,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:07:38,786 INFO L93 Difference]: Finished difference Result 47360 states and 65604 transitions. [2025-03-16 20:07:38,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:07:38,787 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 166 [2025-03-16 20:07:38,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:07:38,868 INFO L225 Difference]: With dead ends: 47360 [2025-03-16 20:07:38,868 INFO L226 Difference]: Without dead ends: 28745 [2025-03-16 20:07:38,907 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:07:38,908 INFO L435 NwaCegarLoop]: 4219 mSDtfsCounter, 4106 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4106 SdHoareTripleChecker+Valid, 4412 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-16 20:07:38,908 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4106 Valid, 4412 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:07:38,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28745 states. [2025-03-16 20:07:40,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28745 to 28613. [2025-03-16 20:07:40,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28613 states, 24980 states have (on average 1.393634907926341) internal successors, (34813), 25219 states have internal predecessors, (34813), 1959 states have call successors, (1959), 1480 states have call predecessors, (1959), 1672 states have return successors, (2874), 1921 states have call predecessors, (2874), 1959 states have call successors, (2874) [2025-03-16 20:07:40,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28613 states to 28613 states and 39646 transitions. [2025-03-16 20:07:40,195 INFO L78 Accepts]: Start accepts. Automaton has 28613 states and 39646 transitions. Word has length 166 [2025-03-16 20:07:40,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:07:40,195 INFO L471 AbstractCegarLoop]: Abstraction has 28613 states and 39646 transitions. [2025-03-16 20:07:40,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-16 20:07:40,195 INFO L276 IsEmpty]: Start isEmpty. Operand 28613 states and 39646 transitions. [2025-03-16 20:07:40,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-03-16 20:07:40,229 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:07:40,229 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, 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-16 20:07:40,236 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-16 20:07:40,429 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-16 20:07:40,430 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:07:40,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:07:40,430 INFO L85 PathProgramCache]: Analyzing trace with hash 1302436547, now seen corresponding path program 1 times [2025-03-16 20:07:40,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:07:40,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567162772] [2025-03-16 20:07:40,430 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:07:40,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:07:40,440 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-16 20:07:40,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-16 20:07:40,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:07:40,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:07:40,507 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2025-03-16 20:07:40,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:07:40,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567162772] [2025-03-16 20:07:40,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567162772] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:07:40,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1970685022] [2025-03-16 20:07:40,507 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:07:40,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:07:40,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:07:40,510 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-16 20:07:40,511 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-16 20:07:40,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-16 20:07:40,618 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-16 20:07:40,618 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:07:40,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:07:40,620 INFO L256 TraceCheckSpWp]: Trace formula consists of 619 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 20:07:40,622 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:07:40,647 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-16 20:07:40,648 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 20:07:40,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1970685022] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:07:40,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 20:07:40,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-16 20:07:40,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664366097] [2025-03-16 20:07:40,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:07:40,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:07:40,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:07:40,650 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:07:40,650 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:07:40,650 INFO L87 Difference]: Start difference. First operand 28613 states and 39646 transitions. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-16 20:07:42,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:07:42,890 INFO L93 Difference]: Finished difference Result 78377 states and 108092 transitions. [2025-03-16 20:07:42,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:07:42,890 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 167 [2025-03-16 20:07:42,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:07:43,125 INFO L225 Difference]: With dead ends: 78377 [2025-03-16 20:07:43,125 INFO L226 Difference]: Without dead ends: 51903 [2025-03-16 20:07:43,200 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:07:43,201 INFO L435 NwaCegarLoop]: 4343 mSDtfsCounter, 166 mSDsluCounter, 4157 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 8500 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-16 20:07:43,201 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 8500 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:07:43,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51903 states. [2025-03-16 20:07:45,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51903 to 51901. [2025-03-16 20:07:45,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51901 states, 44958 states have (on average 1.3679211708705903) internal successors, (61499), 45435 states have internal predecessors, (61499), 3757 states have call successors, (3757), 2800 states have call predecessors, (3757), 3184 states have return successors, (6658), 3681 states have call predecessors, (6658), 3757 states have call successors, (6658) [2025-03-16 20:07:45,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51901 states to 51901 states and 71914 transitions. [2025-03-16 20:07:45,517 INFO L78 Accepts]: Start accepts. Automaton has 51901 states and 71914 transitions. Word has length 167 [2025-03-16 20:07:45,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:07:45,518 INFO L471 AbstractCegarLoop]: Abstraction has 51901 states and 71914 transitions. [2025-03-16 20:07:45,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-16 20:07:45,518 INFO L276 IsEmpty]: Start isEmpty. Operand 51901 states and 71914 transitions. [2025-03-16 20:07:45,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-03-16 20:07:45,584 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:07:45,584 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, 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] [2025-03-16 20:07:45,592 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-16 20:07:45,785 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-16 20:07:45,785 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:07:45,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:07:45,785 INFO L85 PathProgramCache]: Analyzing trace with hash -1406015388, now seen corresponding path program 1 times [2025-03-16 20:07:45,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:07:45,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286101023] [2025-03-16 20:07:45,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:07:45,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:07:45,792 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-16 20:07:45,796 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-16 20:07:45,796 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:07:45,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:07:45,837 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2025-03-16 20:07:45,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:07:45,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286101023] [2025-03-16 20:07:45,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286101023] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:07:45,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1542599820] [2025-03-16 20:07:45,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:07:45,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:07:45,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:07:45,840 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-16 20:07:45,842 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-16 20:07:45,894 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-16 20:07:45,940 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-16 20:07:45,940 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:07:45,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:07:45,942 INFO L256 TraceCheckSpWp]: Trace formula consists of 621 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 20:07:45,944 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:07:45,981 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-16 20:07:45,981 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 20:07:45,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1542599820] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:07:45,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 20:07:45,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-16 20:07:45,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812612210] [2025-03-16 20:07:45,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:07:45,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:07:45,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:07:45,983 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:07:45,983 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:07:45,983 INFO L87 Difference]: Start difference. First operand 51901 states and 71914 transitions. Second operand has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-16 20:07:47,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:07:47,908 INFO L93 Difference]: Finished difference Result 105079 states and 146903 transitions. [2025-03-16 20:07:47,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:07:47,909 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 168 [2025-03-16 20:07:47,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:07:48,089 INFO L225 Difference]: With dead ends: 105079 [2025-03-16 20:07:48,089 INFO L226 Difference]: Without dead ends: 55325 [2025-03-16 20:07:48,167 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:07:48,167 INFO L435 NwaCegarLoop]: 4169 mSDtfsCounter, 4124 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4124 SdHoareTripleChecker+Valid, 4207 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-16 20:07:48,167 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4124 Valid, 4207 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:07:48,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55325 states. [2025-03-16 20:07:49,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55325 to 51901. [2025-03-16 20:07:50,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51901 states, 44958 states have (on average 1.3419413674985543) internal successors, (60331), 45435 states have internal predecessors, (60331), 3757 states have call successors, (3757), 2800 states have call predecessors, (3757), 3184 states have return successors, (6262), 3681 states have call predecessors, (6262), 3757 states have call successors, (6262) [2025-03-16 20:07:50,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51901 states to 51901 states and 70350 transitions. [2025-03-16 20:07:50,144 INFO L78 Accepts]: Start accepts. Automaton has 51901 states and 70350 transitions. Word has length 168 [2025-03-16 20:07:50,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:07:50,145 INFO L471 AbstractCegarLoop]: Abstraction has 51901 states and 70350 transitions. [2025-03-16 20:07:50,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-16 20:07:50,145 INFO L276 IsEmpty]: Start isEmpty. Operand 51901 states and 70350 transitions. [2025-03-16 20:07:50,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-03-16 20:07:50,200 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:07:50,200 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, 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-16 20:07:50,207 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-16 20:07:50,401 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-16 20:07:50,401 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:07:50,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:07:50,401 INFO L85 PathProgramCache]: Analyzing trace with hash 853739394, now seen corresponding path program 1 times [2025-03-16 20:07:50,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:07:50,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101075143] [2025-03-16 20:07:50,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:07:50,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:07:50,409 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-16 20:07:50,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-16 20:07:50,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:07:50,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:07:50,454 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2025-03-16 20:07:50,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:07:50,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101075143] [2025-03-16 20:07:50,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101075143] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:07:50,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [351843243] [2025-03-16 20:07:50,454 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:07:50,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:07:50,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:07:50,457 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-16 20:07:50,458 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-16 20:07:50,516 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-16 20:07:50,561 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-16 20:07:50,561 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:07:50,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:07:50,563 INFO L256 TraceCheckSpWp]: Trace formula consists of 615 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 20:07:50,565 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:07:50,578 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-16 20:07:50,578 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 20:07:50,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [351843243] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:07:50,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 20:07:50,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-16 20:07:50,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118642546] [2025-03-16 20:07:50,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:07:50,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:07:50,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:07:50,579 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:07:50,579 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:07:50,579 INFO L87 Difference]: Start difference. First operand 51901 states and 70350 transitions. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11)