./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label46+token_ring.03.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/Problem05_label46+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 81b1f0d7bc9c0822a8207cacf976d5f28113ec35347c6e8d0beebb39e2d17414 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 15:44:22,424 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 15:44:22,472 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 15:44:22,477 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 15:44:22,477 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 15:44:22,495 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 15:44:22,496 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 15:44:22,496 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 15:44:22,496 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 15:44:22,496 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 15:44:22,496 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 15:44:22,496 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 15:44:22,496 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 15:44:22,496 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 15:44:22,497 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 15:44:22,497 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 15:44:22,497 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 15:44:22,497 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 15:44:22,497 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 15:44:22,497 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 15:44:22,497 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 15:44:22,497 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 15:44:22,497 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 15:44:22,497 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 15:44:22,497 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 15:44:22,497 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 15:44:22,497 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 15:44:22,498 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 15:44:22,498 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 15:44:22,498 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 15:44:22,498 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 15:44:22,498 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 15:44:22,498 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 15:44:22,498 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 15:44:22,498 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 15:44:22,498 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 15:44:22,498 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 15:44:22,498 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 15:44:22,498 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 15:44:22,498 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 15:44:22,498 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 15:44:22,498 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 15:44:22,499 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 15:44:22,499 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 -> 81b1f0d7bc9c0822a8207cacf976d5f28113ec35347c6e8d0beebb39e2d17414 [2025-03-03 15:44:22,749 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 15:44:22,756 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 15:44:22,758 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 15:44:22,759 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 15:44:22,759 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 15:44:22,760 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/Problem05_label46+token_ring.03.cil-2.c [2025-03-03 15:44:23,950 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f84f04dc/484235dc51a4444a822ef0c8d45e29d3/FLAGaa4976228 [2025-03-03 15:44:24,577 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 15:44:24,579 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label46+token_ring.03.cil-2.c [2025-03-03 15:44:24,619 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f84f04dc/484235dc51a4444a822ef0c8d45e29d3/FLAGaa4976228 [2025-03-03 15:44:25,047 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f84f04dc/484235dc51a4444a822ef0c8d45e29d3 [2025-03-03 15:44:25,049 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 15:44:25,050 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 15:44:25,051 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 15:44:25,051 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 15:44:25,054 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 15:44:25,054 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 03:44:25" (1/1) ... [2025-03-03 15:44:25,055 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f8d9517 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:44:25, skipping insertion in model container [2025-03-03 15:44:25,055 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 03:44:25" (1/1) ... [2025-03-03 15:44:25,182 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 15:44:26,229 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_label46+token_ring.03.cil-2.c[382357,382370] [2025-03-03 15:44:26,258 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_label46+token_ring.03.cil-2.c[383339,383352] [2025-03-03 15:44:26,425 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 15:44:26,432 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 15:44:26,913 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_label46+token_ring.03.cil-2.c[382357,382370] [2025-03-03 15:44:26,916 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_label46+token_ring.03.cil-2.c[383339,383352] [2025-03-03 15:44:26,924 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 15:44:26,961 INFO L204 MainTranslator]: Completed translation [2025-03-03 15:44:26,962 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:44:26 WrapperNode [2025-03-03 15:44:26,962 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 15:44:26,963 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 15:44:26,963 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 15:44:26,963 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 15:44:26,968 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:44:26" (1/1) ... [2025-03-03 15:44:27,019 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:44:26" (1/1) ... [2025-03-03 15:44:27,270 INFO L138 Inliner]: procedures = 50, calls = 50, calls flagged for inlining = 28, calls inlined = 28, statements flattened = 12672 [2025-03-03 15:44:27,271 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 15:44:27,272 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 15:44:27,272 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 15:44:27,272 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 15:44:27,279 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:44:26" (1/1) ... [2025-03-03 15:44:27,280 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:44:26" (1/1) ... [2025-03-03 15:44:27,376 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:44:26" (1/1) ... [2025-03-03 15:44:27,455 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 15:44:27,455 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:44:26" (1/1) ... [2025-03-03 15:44:27,455 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:44:26" (1/1) ... [2025-03-03 15:44:27,633 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:44:26" (1/1) ... [2025-03-03 15:44:27,653 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:44:26" (1/1) ... [2025-03-03 15:44:27,686 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:44:26" (1/1) ... [2025-03-03 15:44:27,714 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:44:26" (1/1) ... [2025-03-03 15:44:27,792 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 15:44:27,794 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 15:44:27,795 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 15:44:27,795 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 15:44:27,796 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:44:26" (1/1) ... [2025-03-03 15:44:27,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 15:44:27,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:44:27,828 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 15:44:27,839 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 15:44:27,859 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 15:44:27,859 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2025-03-03 15:44:27,859 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2025-03-03 15:44:27,859 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-03-03 15:44:27,859 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-03-03 15:44:27,860 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2025-03-03 15:44:27,860 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2025-03-03 15:44:27,860 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2025-03-03 15:44:27,860 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2025-03-03 15:44:27,860 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2025-03-03 15:44:27,860 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2025-03-03 15:44:27,860 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2025-03-03 15:44:27,860 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2025-03-03 15:44:27,860 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 15:44:27,860 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 15:44:27,860 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 15:44:27,956 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 15:44:27,957 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 15:44:34,061 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4481: havoc calculate_output3_#t~ret16#1; [2025-03-03 15:44:34,061 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7469: havoc calculate_output5_#t~ret18#1; [2025-03-03 15:44:34,062 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3033: havoc calculate_output2_#t~ret15#1; [2025-03-03 15:44:34,062 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10440: havoc calculate_output7_#t~ret20#1; [2025-03-03 15:44:34,063 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8922: havoc calculate_output6_#t~ret19#1; [2025-03-03 15:44:34,063 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6035: havoc calculate_output4_#t~ret17#1; [2025-03-03 15:44:34,063 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1543: havoc calculate_output_#t~ret14#1; [2025-03-03 15:44:34,218 INFO L? ?]: Removed 1701 outVars from TransFormulas that were not future-live. [2025-03-03 15:44:34,218 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 15:44:34,267 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 15:44:34,267 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 15:44:34,267 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 03:44:34 BoogieIcfgContainer [2025-03-03 15:44:34,267 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 15:44:34,269 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 15:44:34,269 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 15:44:34,273 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 15:44:34,273 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 03:44:25" (1/3) ... [2025-03-03 15:44:34,274 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2068532e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 03:44:34, skipping insertion in model container [2025-03-03 15:44:34,274 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:44:26" (2/3) ... [2025-03-03 15:44:34,274 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2068532e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 03:44:34, skipping insertion in model container [2025-03-03 15:44:34,274 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 03:44:34" (3/3) ... [2025-03-03 15:44:34,275 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem05_label46+token_ring.03.cil-2.c [2025-03-03 15:44:34,287 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 15:44:34,289 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem05_label46+token_ring.03.cil-2.c that has 7 procedures, 2348 locations, 1 initial locations, 7 loop locations, and 2 error locations. [2025-03-03 15:44:34,367 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 15:44:34,378 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;@3f21cfae, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 15:44:34,378 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-03 15:44:34,386 INFO L276 IsEmpty]: Start isEmpty. Operand has 2348 states, 2322 states have (on average 1.8496985357450473) internal successors, (4295), 2325 states have internal predecessors, (4295), 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-03 15:44:34,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-03 15:44:34,395 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:44:34,396 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:44:34,396 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:44:34,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:44:34,401 INFO L85 PathProgramCache]: Analyzing trace with hash -487538790, now seen corresponding path program 1 times [2025-03-03 15:44:34,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:44:34,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29955931] [2025-03-03 15:44:34,406 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:44:34,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:44:34,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-03 15:44:34,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-03 15:44:34,503 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:44:34,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:44:34,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:44:34,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:44:34,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29955931] [2025-03-03 15:44:34,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29955931] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:44:34,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:44:34,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:44:34,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064429245] [2025-03-03 15:44:34,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:44:34,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:44:34,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:44:34,840 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:44:34,841 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:44:34,846 INFO L87 Difference]: Start difference. First operand has 2348 states, 2322 states have (on average 1.8496985357450473) internal successors, (4295), 2325 states have internal predecessors, (4295), 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 13.8) internal successors, (69), 4 states have internal predecessors, (69), 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-03 15:44:35,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:44:35,315 INFO L93 Difference]: Finished difference Result 4849 states and 8893 transitions. [2025-03-03 15:44:35,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 15:44:35,317 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (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 79 [2025-03-03 15:44:35,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:44:35,343 INFO L225 Difference]: With dead ends: 4849 [2025-03-03 15:44:35,343 INFO L226 Difference]: Without dead ends: 2442 [2025-03-03 15:44:35,352 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:44:35,356 INFO L435 NwaCegarLoop]: 4210 mSDtfsCounter, 4419 mSDsluCounter, 8509 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4430 SdHoareTripleChecker+Valid, 12719 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:44:35,358 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4430 Valid, 12719 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 15:44:35,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2442 states. [2025-03-03 15:44:35,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2442 to 2431. [2025-03-03 15:44:35,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2431 states, 2387 states have (on average 1.8236279849183075) internal successors, (4353), 2390 states have internal predecessors, (4353), 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-03 15:44:35,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2431 states to 2431 states and 4412 transitions. [2025-03-03 15:44:35,480 INFO L78 Accepts]: Start accepts. Automaton has 2431 states and 4412 transitions. Word has length 79 [2025-03-03 15:44:35,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:44:35,480 INFO L471 AbstractCegarLoop]: Abstraction has 2431 states and 4412 transitions. [2025-03-03 15:44:35,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (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-03 15:44:35,481 INFO L276 IsEmpty]: Start isEmpty. Operand 2431 states and 4412 transitions. [2025-03-03 15:44:35,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-03 15:44:35,484 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:44:35,484 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:44:35,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 15:44:35,485 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:44:35,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:44:35,485 INFO L85 PathProgramCache]: Analyzing trace with hash 1778468956, now seen corresponding path program 1 times [2025-03-03 15:44:35,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:44:35,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344667893] [2025-03-03 15:44:35,486 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:44:35,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:44:35,499 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-03 15:44:35,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-03 15:44:35,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:44:35,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:44:35,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:44:35,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:44:35,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344667893] [2025-03-03 15:44:35,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344667893] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:44:35,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:44:35,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:44:35,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114583605] [2025-03-03 15:44:35,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:44:35,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:44:35,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:44:35,653 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:44:35,653 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:44:35,654 INFO L87 Difference]: Start difference. First operand 2431 states and 4412 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (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-03 15:44:35,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:44:35,898 INFO L93 Difference]: Finished difference Result 2754 states and 4895 transitions. [2025-03-03 15:44:35,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:44:35,899 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (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 79 [2025-03-03 15:44:35,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:44:35,910 INFO L225 Difference]: With dead ends: 2754 [2025-03-03 15:44:35,911 INFO L226 Difference]: Without dead ends: 2455 [2025-03-03 15:44:35,913 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:44:35,914 INFO L435 NwaCegarLoop]: 4129 mSDtfsCounter, 4248 mSDsluCounter, 8193 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4259 SdHoareTripleChecker+Valid, 12322 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:44:35,914 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4259 Valid, 12322 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:44:35,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2455 states. [2025-03-03 15:44:35,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2455 to 2431. [2025-03-03 15:44:35,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2431 states, 2387 states have (on average 1.8227901131126938) internal successors, (4351), 2390 states have internal predecessors, (4351), 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-03 15:44:35,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2431 states to 2431 states and 4410 transitions. [2025-03-03 15:44:35,976 INFO L78 Accepts]: Start accepts. Automaton has 2431 states and 4410 transitions. Word has length 79 [2025-03-03 15:44:35,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:44:35,976 INFO L471 AbstractCegarLoop]: Abstraction has 2431 states and 4410 transitions. [2025-03-03 15:44:35,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (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-03 15:44:35,976 INFO L276 IsEmpty]: Start isEmpty. Operand 2431 states and 4410 transitions. [2025-03-03 15:44:35,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-03 15:44:35,977 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:44:35,977 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:44:35,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 15:44:35,978 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:44:35,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:44:35,978 INFO L85 PathProgramCache]: Analyzing trace with hash -396211141, now seen corresponding path program 1 times [2025-03-03 15:44:35,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:44:35,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046936396] [2025-03-03 15:44:35,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:44:35,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:44:35,986 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-03 15:44:35,989 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-03 15:44:35,989 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:44:35,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:44:36,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:44:36,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:44:36,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046936396] [2025-03-03 15:44:36,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046936396] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:44:36,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:44:36,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:44:36,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411466936] [2025-03-03 15:44:36,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:44:36,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:44:36,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:44:36,114 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:44:36,114 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:44:36,114 INFO L87 Difference]: Start difference. First operand 2431 states and 4410 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (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-03 15:44:36,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:44:36,757 INFO L93 Difference]: Finished difference Result 2904 states and 5103 transitions. [2025-03-03 15:44:36,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:44:36,757 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (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 79 [2025-03-03 15:44:36,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:44:36,767 INFO L225 Difference]: With dead ends: 2904 [2025-03-03 15:44:36,767 INFO L226 Difference]: Without dead ends: 2605 [2025-03-03 15:44:36,769 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:44:36,771 INFO L435 NwaCegarLoop]: 4249 mSDtfsCounter, 4333 mSDsluCounter, 12733 mSDsCounter, 0 mSdLazyCounter, 488 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4344 SdHoareTripleChecker+Valid, 16982 SdHoareTripleChecker+Invalid, 511 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 15:44:36,771 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4344 Valid, 16982 Invalid, 511 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [23 Valid, 488 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 15:44:36,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2605 states. [2025-03-03 15:44:36,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2605 to 2570. [2025-03-03 15:44:36,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2570 states, 2507 states have (on average 1.8041483845233346) internal successors, (4523), 2511 states have internal predecessors, (4523), 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-03 15:44:36,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2570 states to 2570 states and 4609 transitions. [2025-03-03 15:44:36,831 INFO L78 Accepts]: Start accepts. Automaton has 2570 states and 4609 transitions. Word has length 79 [2025-03-03 15:44:36,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:44:36,832 INFO L471 AbstractCegarLoop]: Abstraction has 2570 states and 4609 transitions. [2025-03-03 15:44:36,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (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-03 15:44:36,832 INFO L276 IsEmpty]: Start isEmpty. Operand 2570 states and 4609 transitions. [2025-03-03 15:44:36,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-03 15:44:36,834 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:44:36,834 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:44:36,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 15:44:36,834 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:44:36,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:44:36,834 INFO L85 PathProgramCache]: Analyzing trace with hash 2090908634, now seen corresponding path program 1 times [2025-03-03 15:44:36,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:44:36,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781344476] [2025-03-03 15:44:36,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:44:36,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:44:36,843 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-03 15:44:36,849 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-03 15:44:36,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:44:36,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:44:36,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:44:36,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:44:36,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781344476] [2025-03-03 15:44:36,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781344476] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:44:36,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:44:36,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:44:36,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523025957] [2025-03-03 15:44:36,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:44:36,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:44:36,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:44:36,947 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:44:36,947 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:44:36,947 INFO L87 Difference]: Start difference. First operand 2570 states and 4609 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (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-03 15:44:37,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:44:37,418 INFO L93 Difference]: Finished difference Result 3383 states and 5796 transitions. [2025-03-03 15:44:37,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:44:37,418 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (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 79 [2025-03-03 15:44:37,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:44:37,429 INFO L225 Difference]: With dead ends: 3383 [2025-03-03 15:44:37,429 INFO L226 Difference]: Without dead ends: 2945 [2025-03-03 15:44:37,431 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:44:37,432 INFO L435 NwaCegarLoop]: 4243 mSDtfsCounter, 4432 mSDsluCounter, 12710 mSDsCounter, 0 mSdLazyCounter, 491 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4447 SdHoareTripleChecker+Valid, 16953 SdHoareTripleChecker+Invalid, 517 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:44:37,432 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4447 Valid, 16953 Invalid, 517 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 491 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 15:44:37,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2945 states. [2025-03-03 15:44:37,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2945 to 2851. [2025-03-03 15:44:37,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2851 states, 2750 states have (on average 1.7723636363636364) internal successors, (4874), 2758 states have internal predecessors, (4874), 63 states have call successors, (63), 30 states have call predecessors, (63), 36 states have return successors, (79), 66 states have call predecessors, (79), 63 states have call successors, (79) [2025-03-03 15:44:37,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2851 states to 2851 states and 5016 transitions. [2025-03-03 15:44:37,533 INFO L78 Accepts]: Start accepts. Automaton has 2851 states and 5016 transitions. Word has length 79 [2025-03-03 15:44:37,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:44:37,533 INFO L471 AbstractCegarLoop]: Abstraction has 2851 states and 5016 transitions. [2025-03-03 15:44:37,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (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-03 15:44:37,533 INFO L276 IsEmpty]: Start isEmpty. Operand 2851 states and 5016 transitions. [2025-03-03 15:44:37,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-03 15:44:37,535 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:44:37,535 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:44:37,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 15:44:37,535 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:44:37,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:44:37,535 INFO L85 PathProgramCache]: Analyzing trace with hash 924212315, now seen corresponding path program 1 times [2025-03-03 15:44:37,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:44:37,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843150896] [2025-03-03 15:44:37,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:44:37,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:44:37,548 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-03 15:44:37,551 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-03 15:44:37,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:44:37,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:44:37,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:44:37,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:44:37,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843150896] [2025-03-03 15:44:37,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843150896] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:44:37,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:44:37,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:44:37,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919979135] [2025-03-03 15:44:37,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:44:37,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:44:37,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:44:37,633 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:44:37,634 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:44:37,634 INFO L87 Difference]: Start difference. First operand 2851 states and 5016 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (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-03 15:44:37,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:44:37,842 INFO L93 Difference]: Finished difference Result 3614 states and 6140 transitions. [2025-03-03 15:44:37,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:44:37,844 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (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 79 [2025-03-03 15:44:37,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:44:37,857 INFO L225 Difference]: With dead ends: 3614 [2025-03-03 15:44:37,857 INFO L226 Difference]: Without dead ends: 2895 [2025-03-03 15:44:37,861 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:44:37,862 INFO L435 NwaCegarLoop]: 4120 mSDtfsCounter, 4240 mSDsluCounter, 8174 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4251 SdHoareTripleChecker+Valid, 12294 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:44:37,863 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4251 Valid, 12294 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:44:37,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2895 states. [2025-03-03 15:44:38,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2895 to 2851. [2025-03-03 15:44:38,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2851 states, 2750 states have (on average 1.7705454545454546) internal successors, (4869), 2758 states have internal predecessors, (4869), 63 states have call successors, (63), 30 states have call predecessors, (63), 36 states have return successors, (79), 66 states have call predecessors, (79), 63 states have call successors, (79) [2025-03-03 15:44:38,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2851 states to 2851 states and 5011 transitions. [2025-03-03 15:44:38,023 INFO L78 Accepts]: Start accepts. Automaton has 2851 states and 5011 transitions. Word has length 79 [2025-03-03 15:44:38,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:44:38,024 INFO L471 AbstractCegarLoop]: Abstraction has 2851 states and 5011 transitions. [2025-03-03 15:44:38,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (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-03 15:44:38,024 INFO L276 IsEmpty]: Start isEmpty. Operand 2851 states and 5011 transitions. [2025-03-03 15:44:38,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-03 15:44:38,025 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:44:38,025 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:44:38,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 15:44:38,028 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:44:38,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:44:38,029 INFO L85 PathProgramCache]: Analyzing trace with hash 1025124282, now seen corresponding path program 1 times [2025-03-03 15:44:38,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:44:38,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200433350] [2025-03-03 15:44:38,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:44:38,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:44:38,037 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-03 15:44:38,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-03 15:44:38,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:44:38,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:44:38,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:44:38,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:44:38,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200433350] [2025-03-03 15:44:38,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200433350] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:44:38,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:44:38,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:44:38,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418147900] [2025-03-03 15:44:38,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:44:38,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:44:38,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:44:38,129 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:44:38,129 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:44:38,129 INFO L87 Difference]: Start difference. First operand 2851 states and 5011 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (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-03 15:44:38,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:44:38,510 INFO L93 Difference]: Finished difference Result 4230 states and 7016 transitions. [2025-03-03 15:44:38,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:44:38,511 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (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 79 [2025-03-03 15:44:38,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:44:38,523 INFO L225 Difference]: With dead ends: 4230 [2025-03-03 15:44:38,523 INFO L226 Difference]: Without dead ends: 3511 [2025-03-03 15:44:38,526 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:44:38,527 INFO L435 NwaCegarLoop]: 4235 mSDtfsCounter, 4359 mSDsluCounter, 12687 mSDsCounter, 0 mSdLazyCounter, 491 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4374 SdHoareTripleChecker+Valid, 16922 SdHoareTripleChecker+Invalid, 517 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:44:38,527 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4374 Valid, 16922 Invalid, 517 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 491 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 15:44:38,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3511 states. [2025-03-03 15:44:38,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3511 to 3419. [2025-03-03 15:44:38,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3419 states, 3238 states have (on average 1.7192711550339717) internal successors, (5567), 3260 states have internal predecessors, (5567), 105 states have call successors, (105), 54 states have call predecessors, (105), 74 states have return successors, (169), 112 states have call predecessors, (169), 105 states have call successors, (169) [2025-03-03 15:44:38,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3419 states to 3419 states and 5841 transitions. [2025-03-03 15:44:38,614 INFO L78 Accepts]: Start accepts. Automaton has 3419 states and 5841 transitions. Word has length 79 [2025-03-03 15:44:38,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:44:38,614 INFO L471 AbstractCegarLoop]: Abstraction has 3419 states and 5841 transitions. [2025-03-03 15:44:38,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (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-03 15:44:38,615 INFO L276 IsEmpty]: Start isEmpty. Operand 3419 states and 5841 transitions. [2025-03-03 15:44:38,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-03 15:44:38,616 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:44:38,616 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:44:38,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 15:44:38,616 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:44:38,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:44:38,617 INFO L85 PathProgramCache]: Analyzing trace with hash 1305474171, now seen corresponding path program 1 times [2025-03-03 15:44:38,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:44:38,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608058027] [2025-03-03 15:44:38,617 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:44:38,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:44:38,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-03 15:44:38,623 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-03 15:44:38,624 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:44:38,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:44:38,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:44:38,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:44:38,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608058027] [2025-03-03 15:44:38,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608058027] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:44:38,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:44:38,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:44:38,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282810150] [2025-03-03 15:44:38,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:44:38,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:44:38,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:44:38,680 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:44:38,680 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:44:38,680 INFO L87 Difference]: Start difference. First operand 3419 states and 5841 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (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-03 15:44:38,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:44:38,887 INFO L93 Difference]: Finished difference Result 4764 states and 7820 transitions. [2025-03-03 15:44:38,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:44:38,888 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (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 79 [2025-03-03 15:44:38,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:44:38,903 INFO L225 Difference]: With dead ends: 4764 [2025-03-03 15:44:38,903 INFO L226 Difference]: Without dead ends: 3477 [2025-03-03 15:44:38,908 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:44:38,909 INFO L435 NwaCegarLoop]: 4115 mSDtfsCounter, 4236 mSDsluCounter, 8165 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4247 SdHoareTripleChecker+Valid, 12280 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:44:38,909 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4247 Valid, 12280 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:44:38,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3477 states. [2025-03-03 15:44:39,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3477 to 3419. [2025-03-03 15:44:39,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3419 states, 3238 states have (on average 1.7164916615194565) internal successors, (5558), 3260 states have internal predecessors, (5558), 105 states have call successors, (105), 54 states have call predecessors, (105), 74 states have return successors, (169), 112 states have call predecessors, (169), 105 states have call successors, (169) [2025-03-03 15:44:39,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3419 states to 3419 states and 5832 transitions. [2025-03-03 15:44:39,069 INFO L78 Accepts]: Start accepts. Automaton has 3419 states and 5832 transitions. Word has length 79 [2025-03-03 15:44:39,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:44:39,070 INFO L471 AbstractCegarLoop]: Abstraction has 3419 states and 5832 transitions. [2025-03-03 15:44:39,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (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-03 15:44:39,070 INFO L276 IsEmpty]: Start isEmpty. Operand 3419 states and 5832 transitions. [2025-03-03 15:44:39,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-03 15:44:39,072 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:44:39,072 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:44:39,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 15:44:39,072 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:44:39,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:44:39,073 INFO L85 PathProgramCache]: Analyzing trace with hash -625144934, now seen corresponding path program 1 times [2025-03-03 15:44:39,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:44:39,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833581831] [2025-03-03 15:44:39,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:44:39,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:44:39,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-03 15:44:39,083 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-03 15:44:39,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:44:39,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:44:39,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:44:39,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:44:39,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833581831] [2025-03-03 15:44:39,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833581831] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:44:39,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:44:39,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:44:39,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960238744] [2025-03-03 15:44:39,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:44:39,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 15:44:39,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:44:39,118 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 15:44:39,118 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 15:44:39,119 INFO L87 Difference]: Start difference. First operand 3419 states and 5832 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (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-03 15:44:39,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:44:39,288 INFO L93 Difference]: Finished difference Result 5943 states and 9555 transitions. [2025-03-03 15:44:39,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:44:39,289 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (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 79 [2025-03-03 15:44:39,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:44:39,305 INFO L225 Difference]: With dead ends: 5943 [2025-03-03 15:44:39,306 INFO L226 Difference]: Without dead ends: 4657 [2025-03-03 15:44:39,311 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 15:44:39,312 INFO L435 NwaCegarLoop]: 4380 mSDtfsCounter, 4347 mSDsluCounter, 4317 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4347 SdHoareTripleChecker+Valid, 8697 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-03 15:44:39,312 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4347 Valid, 8697 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:44:39,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4657 states. [2025-03-03 15:44:39,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4657 to 4648. [2025-03-03 15:44:39,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4648 states, 4292 states have (on average 1.635135135135135) internal successors, (7018), 4343 states have internal predecessors, (7018), 206 states have call successors, (206), 108 states have call predecessors, (206), 148 states have return successors, (327), 204 states have call predecessors, (327), 206 states have call successors, (327) [2025-03-03 15:44:39,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4648 states to 4648 states and 7551 transitions. [2025-03-03 15:44:39,462 INFO L78 Accepts]: Start accepts. Automaton has 4648 states and 7551 transitions. Word has length 79 [2025-03-03 15:44:39,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:44:39,462 INFO L471 AbstractCegarLoop]: Abstraction has 4648 states and 7551 transitions. [2025-03-03 15:44:39,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (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-03 15:44:39,463 INFO L276 IsEmpty]: Start isEmpty. Operand 4648 states and 7551 transitions. [2025-03-03 15:44:39,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-03 15:44:39,470 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:44:39,471 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:44:39,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 15:44:39,471 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:44:39,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:44:39,471 INFO L85 PathProgramCache]: Analyzing trace with hash -1353994054, now seen corresponding path program 1 times [2025-03-03 15:44:39,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:44:39,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842459387] [2025-03-03 15:44:39,472 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:44:39,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:44:39,482 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-03 15:44:39,485 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-03 15:44:39,485 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:44:39,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:44:39,612 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-03 15:44:39,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:44:39,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842459387] [2025-03-03 15:44:39,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842459387] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:44:39,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1647026227] [2025-03-03 15:44:39,613 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:44:39,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:44:39,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:44:39,618 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 15:44:39,630 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 15:44:39,720 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-03 15:44:39,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-03 15:44:39,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:44:39,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:44:39,797 INFO L256 TraceCheckSpWp]: Trace formula consists of 497 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 15:44:39,802 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:44:39,875 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-03 15:44:39,876 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 15:44:39,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1647026227] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:44:39,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 15:44:39,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-03-03 15:44:39,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538100992] [2025-03-03 15:44:39,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:44:39,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:44:39,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:44:39,881 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:44:39,881 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:44:39,882 INFO L87 Difference]: Start difference. First operand 4648 states and 7551 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 2 states have internal predecessors, (94), 2 states have call successors, (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-03 15:44:40,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:44:40,068 INFO L93 Difference]: Finished difference Result 9587 states and 14641 transitions. [2025-03-03 15:44:40,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:44:40,069 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 2 states have internal predecessors, (94), 2 states have call successors, (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 130 [2025-03-03 15:44:40,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:44:40,101 INFO L225 Difference]: With dead ends: 9587 [2025-03-03 15:44:40,101 INFO L226 Difference]: Without dead ends: 7072 [2025-03-03 15:44:40,111 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:44:40,111 INFO L435 NwaCegarLoop]: 4184 mSDtfsCounter, 4140 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4140 SdHoareTripleChecker+Valid, 4386 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:44:40,112 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4140 Valid, 4386 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:44:40,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7072 states. [2025-03-03 15:44:40,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7072 to 7016. [2025-03-03 15:44:40,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7016 states, 6328 states have (on average 1.5619469026548674) internal successors, (9884), 6428 states have internal predecessors, (9884), 390 states have call successors, (390), 216 states have call predecessors, (390), 296 states have return successors, (625), 379 states have call predecessors, (625), 390 states have call successors, (625) [2025-03-03 15:44:40,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7016 states to 7016 states and 10899 transitions. [2025-03-03 15:44:40,367 INFO L78 Accepts]: Start accepts. Automaton has 7016 states and 10899 transitions. Word has length 130 [2025-03-03 15:44:40,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:44:40,368 INFO L471 AbstractCegarLoop]: Abstraction has 7016 states and 10899 transitions. [2025-03-03 15:44:40,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 2 states have internal predecessors, (94), 2 states have call successors, (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-03 15:44:40,368 INFO L276 IsEmpty]: Start isEmpty. Operand 7016 states and 10899 transitions. [2025-03-03 15:44:40,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-03 15:44:40,375 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:44:40,375 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:44:40,382 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-03 15:44:40,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:44:40,582 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:44:40,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:44:40,583 INFO L85 PathProgramCache]: Analyzing trace with hash -928323724, now seen corresponding path program 1 times [2025-03-03 15:44:40,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:44:40,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931019972] [2025-03-03 15:44:40,583 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:44:40,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:44:40,592 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-03 15:44:40,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-03 15:44:40,598 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:44:40,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:44:40,659 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-03 15:44:40,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:44:40,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931019972] [2025-03-03 15:44:40,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931019972] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:44:40,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1243592601] [2025-03-03 15:44:40,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:44:40,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:44:40,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:44:40,664 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 15:44:40,665 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 15:44:40,713 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-03 15:44:40,756 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-03 15:44:40,756 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:44:40,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:44:40,758 INFO L256 TraceCheckSpWp]: Trace formula consists of 491 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 15:44:40,761 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:44:40,810 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-03 15:44:40,811 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 15:44:40,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1243592601] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:44:40,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 15:44:40,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-03-03 15:44:40,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613286516] [2025-03-03 15:44:40,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:44:40,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:44:40,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:44:40,813 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:44:40,813 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:44:40,813 INFO L87 Difference]: Start difference. First operand 7016 states and 10899 transitions. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 2 states have internal predecessors, (100), 2 states have call successors, (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-03 15:44:41,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:44:41,127 INFO L93 Difference]: Finished difference Result 16649 states and 24697 transitions. [2025-03-03 15:44:41,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:44:41,127 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 2 states have internal predecessors, (100), 2 states have call successors, (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 130 [2025-03-03 15:44:41,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:44:41,167 INFO L225 Difference]: With dead ends: 16649 [2025-03-03 15:44:41,167 INFO L226 Difference]: Without dead ends: 11766 [2025-03-03 15:44:41,186 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:44:41,186 INFO L435 NwaCegarLoop]: 4184 mSDtfsCounter, 4134 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4134 SdHoareTripleChecker+Valid, 4386 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:44:41,186 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4134 Valid, 4386 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:44:41,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11766 states. [2025-03-03 15:44:41,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11766 to 11656. [2025-03-03 15:44:41,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11656 states, 10306 states have (on average 1.5008732777023093) internal successors, (15468), 10504 states have internal predecessors, (15468), 756 states have call successors, (756), 432 states have call predecessors, (756), 592 states have return successors, (1219), 727 states have call predecessors, (1219), 756 states have call successors, (1219) [2025-03-03 15:44:41,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11656 states to 11656 states and 17443 transitions. [2025-03-03 15:44:41,902 INFO L78 Accepts]: Start accepts. Automaton has 11656 states and 17443 transitions. Word has length 130 [2025-03-03 15:44:41,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:44:41,902 INFO L471 AbstractCegarLoop]: Abstraction has 11656 states and 17443 transitions. [2025-03-03 15:44:41,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 2 states have internal predecessors, (100), 2 states have call successors, (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-03 15:44:41,902 INFO L276 IsEmpty]: Start isEmpty. Operand 11656 states and 17443 transitions. [2025-03-03 15:44:41,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-03 15:44:41,912 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:44:41,912 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:44:41,919 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-03 15:44:42,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-03 15:44:42,116 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:44:42,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:44:42,117 INFO L85 PathProgramCache]: Analyzing trace with hash 1283469742, now seen corresponding path program 1 times [2025-03-03 15:44:42,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:44:42,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674922963] [2025-03-03 15:44:42,117 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:44:42,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:44:42,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-03 15:44:42,127 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-03 15:44:42,127 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:44:42,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:44:42,207 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-03 15:44:42,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:44:42,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674922963] [2025-03-03 15:44:42,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674922963] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:44:42,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [315194883] [2025-03-03 15:44:42,208 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:44:42,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:44:42,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:44:42,210 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 15:44:42,211 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 15:44:42,256 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-03 15:44:42,291 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-03 15:44:42,292 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:44:42,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:44:42,294 INFO L256 TraceCheckSpWp]: Trace formula consists of 485 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 15:44:42,296 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:44:42,329 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 15:44:42,329 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 15:44:42,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [315194883] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:44:42,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 15:44:42,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-03-03 15:44:42,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876081663] [2025-03-03 15:44:42,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:44:42,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:44:42,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:44:42,330 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:44:42,330 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:44:42,330 INFO L87 Difference]: Start difference. First operand 11656 states and 17443 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 2 states have internal predecessors, (88), 2 states have call successors, (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-03 15:44:42,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:44:42,946 INFO L93 Difference]: Finished difference Result 30437 states and 44271 transitions. [2025-03-03 15:44:42,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:44:42,947 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 2 states have internal predecessors, (88), 2 states have call successors, (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 130 [2025-03-03 15:44:42,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:44:43,030 INFO L225 Difference]: With dead ends: 30437 [2025-03-03 15:44:43,030 INFO L226 Difference]: Without dead ends: 20914 [2025-03-03 15:44:43,063 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:44:43,064 INFO L435 NwaCegarLoop]: 4184 mSDtfsCounter, 4146 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4146 SdHoareTripleChecker+Valid, 4386 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:44:43,064 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4146 Valid, 4386 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:44:43,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20914 states. [2025-03-03 15:44:43,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20914 to 20696. [2025-03-03 15:44:44,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20696 states, 18042 states have (on average 1.4581531980933378) internal successors, (26308), 18436 states have internal predecessors, (26308), 1468 states have call successors, (1468), 864 states have call predecessors, (1468), 1184 states have return successors, (2387), 1403 states have call predecessors, (2387), 1468 states have call successors, (2387) [2025-03-03 15:44:44,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20696 states to 20696 states and 30163 transitions. [2025-03-03 15:44:44,060 INFO L78 Accepts]: Start accepts. Automaton has 20696 states and 30163 transitions. Word has length 130 [2025-03-03 15:44:44,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:44:44,061 INFO L471 AbstractCegarLoop]: Abstraction has 20696 states and 30163 transitions. [2025-03-03 15:44:44,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 2 states have internal predecessors, (88), 2 states have call successors, (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-03 15:44:44,061 INFO L276 IsEmpty]: Start isEmpty. Operand 20696 states and 30163 transitions. [2025-03-03 15:44:44,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-03 15:44:44,075 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:44:44,075 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:44:44,083 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-03 15:44:44,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:44:44,280 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:44:44,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:44:44,281 INFO L85 PathProgramCache]: Analyzing trace with hash -1570376472, now seen corresponding path program 1 times [2025-03-03 15:44:44,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:44:44,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438651945] [2025-03-03 15:44:44,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:44:44,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:44:44,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-03 15:44:44,290 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-03 15:44:44,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:44:44,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:44:44,335 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-03 15:44:44,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:44:44,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438651945] [2025-03-03 15:44:44,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438651945] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:44:44,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [227385806] [2025-03-03 15:44:44,335 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:44:44,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:44:44,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:44:44,338 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 15:44:44,339 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 15:44:44,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-03 15:44:44,420 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-03 15:44:44,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:44:44,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:44:44,422 INFO L256 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 15:44:44,424 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:44:44,446 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-03 15:44:44,447 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 15:44:44,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [227385806] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:44:44,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 15:44:44,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-03 15:44:44,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283643347] [2025-03-03 15:44:44,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:44:44,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:44:44,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:44:44,449 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:44:44,449 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:44:44,449 INFO L87 Difference]: Start difference. First operand 20696 states and 30163 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 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-03 15:44:45,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:44:45,752 INFO L93 Difference]: Finished difference Result 56559 states and 81761 transitions. [2025-03-03 15:44:45,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:44:45,752 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 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 130 [2025-03-03 15:44:45,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:44:45,882 INFO L225 Difference]: With dead ends: 56559 [2025-03-03 15:44:45,882 INFO L226 Difference]: Without dead ends: 37997 [2025-03-03 15:44:45,921 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:44:45,922 INFO L435 NwaCegarLoop]: 4385 mSDtfsCounter, 197 mSDsluCounter, 4182 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 8567 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:44:45,922 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 8567 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:44:45,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37997 states. [2025-03-03 15:44:47,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37997 to 37997. [2025-03-03 15:44:47,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37997 states, 32912 states have (on average 1.4311193485658726) internal successors, (47101), 33627 states have internal predecessors, (47101), 2753 states have call successors, (2753), 1690 states have call predecessors, (2753), 2330 states have return successors, (5010), 2695 states have call predecessors, (5010), 2753 states have call successors, (5010) [2025-03-03 15:44:47,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37997 states to 37997 states and 54864 transitions. [2025-03-03 15:44:47,652 INFO L78 Accepts]: Start accepts. Automaton has 37997 states and 54864 transitions. Word has length 130 [2025-03-03 15:44:47,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:44:47,653 INFO L471 AbstractCegarLoop]: Abstraction has 37997 states and 54864 transitions. [2025-03-03 15:44:47,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 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-03 15:44:47,653 INFO L276 IsEmpty]: Start isEmpty. Operand 37997 states and 54864 transitions. [2025-03-03 15:44:47,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2025-03-03 15:44:47,736 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:44:47,736 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:44:47,743 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-03 15:44:47,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:44:47,941 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:44:47,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:44:47,942 INFO L85 PathProgramCache]: Analyzing trace with hash -673862789, now seen corresponding path program 1 times [2025-03-03 15:44:47,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:44:47,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922507865] [2025-03-03 15:44:47,942 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:44:47,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:44:47,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 189 statements into 1 equivalence classes. [2025-03-03 15:44:47,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 189 of 189 statements. [2025-03-03 15:44:47,961 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:44:47,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:44:48,035 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2025-03-03 15:44:48,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:44:48,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922507865] [2025-03-03 15:44:48,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922507865] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:44:48,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1632326766] [2025-03-03 15:44:48,036 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:44:48,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:44:48,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:44:48,038 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 15:44:48,040 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-03 15:44:48,092 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 189 statements into 1 equivalence classes. [2025-03-03 15:44:48,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 189 of 189 statements. [2025-03-03 15:44:48,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:44:48,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:44:48,144 INFO L256 TraceCheckSpWp]: Trace formula consists of 639 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 15:44:48,147 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:44:48,241 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 102 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-03 15:44:48,241 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 15:44:48,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1632326766] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:44:48,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 15:44:48,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-03 15:44:48,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101818033] [2025-03-03 15:44:48,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:44:48,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:44:48,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:44:48,242 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:44:48,242 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:44:48,242 INFO L87 Difference]: Start difference. First operand 37997 states and 54864 transitions. Second operand has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 3 states have call successors, (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-03 15:44:49,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:44:49,596 INFO L93 Difference]: Finished difference Result 62381 states and 89991 transitions. [2025-03-03 15:44:49,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:44:49,596 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 3 states have call successors, (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 189 [2025-03-03 15:44:49,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:44:49,713 INFO L225 Difference]: With dead ends: 62381 [2025-03-03 15:44:49,713 INFO L226 Difference]: Without dead ends: 33881 [2025-03-03 15:44:49,768 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:44:49,769 INFO L435 NwaCegarLoop]: 4181 mSDtfsCounter, 4108 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4108 SdHoareTripleChecker+Valid, 4225 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:44:49,769 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4108 Valid, 4225 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:44:49,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33881 states. [2025-03-03 15:44:50,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33881 to 26045. [2025-03-03 15:44:50,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26045 states, 22856 states have (on average 1.4088641932096604) internal successors, (32201), 23095 states have internal predecessors, (32201), 1809 states have call successors, (1809), 1186 states have call predecessors, (1809), 1378 states have return successors, (2546), 1771 states have call predecessors, (2546), 1809 states have call successors, (2546) [2025-03-03 15:44:50,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26045 states to 26045 states and 36556 transitions. [2025-03-03 15:44:50,997 INFO L78 Accepts]: Start accepts. Automaton has 26045 states and 36556 transitions. Word has length 189 [2025-03-03 15:44:50,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:44:50,998 INFO L471 AbstractCegarLoop]: Abstraction has 26045 states and 36556 transitions. [2025-03-03 15:44:50,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 3 states have call successors, (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-03 15:44:50,998 INFO L276 IsEmpty]: Start isEmpty. Operand 26045 states and 36556 transitions. [2025-03-03 15:44:51,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2025-03-03 15:44:51,030 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:44:51,031 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:44:51,039 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-03 15:44:51,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-03 15:44:51,233 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:44:51,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:44:51,234 INFO L85 PathProgramCache]: Analyzing trace with hash -1462486276, now seen corresponding path program 1 times [2025-03-03 15:44:51,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:44:51,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225944135] [2025-03-03 15:44:51,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:44:51,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:44:51,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 189 statements into 1 equivalence classes. [2025-03-03 15:44:51,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 189 of 189 statements. [2025-03-03 15:44:51,250 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:44:51,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:44:51,427 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2025-03-03 15:44:51,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:44:51,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225944135] [2025-03-03 15:44:51,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225944135] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:44:51,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [231381908] [2025-03-03 15:44:51,427 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:44:51,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:44:51,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:44:51,429 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 15:44:51,431 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-03 15:44:51,484 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 189 statements into 1 equivalence classes. [2025-03-03 15:44:51,533 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 189 of 189 statements. [2025-03-03 15:44:51,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:44:51,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:44:51,536 INFO L256 TraceCheckSpWp]: Trace formula consists of 636 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 15:44:51,539 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:44:51,606 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-03 15:44:51,607 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 15:44:51,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [231381908] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:44:51,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 15:44:51,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-03 15:44:51,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95228773] [2025-03-03 15:44:51,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:44:51,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:44:51,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:44:51,608 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:44:51,609 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:44:51,609 INFO L87 Difference]: Start difference. First operand 26045 states and 36556 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-03 15:44:52,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:44:52,473 INFO L93 Difference]: Finished difference Result 52627 states and 73537 transitions. [2025-03-03 15:44:52,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:44:52,474 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 3 states have call successors, (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 189 [2025-03-03 15:44:52,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:44:52,569 INFO L225 Difference]: With dead ends: 52627 [2025-03-03 15:44:52,569 INFO L226 Difference]: Without dead ends: 28723 [2025-03-03 15:44:52,608 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:44:52,609 INFO L435 NwaCegarLoop]: 4179 mSDtfsCounter, 4125 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4125 SdHoareTripleChecker+Valid, 4222 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:44:52,609 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4125 Valid, 4222 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:44:52,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28723 states. [2025-03-03 15:44:54,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28723 to 28723. [2025-03-03 15:44:54,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28723 states, 25330 states have (on average 1.3730359257797078) internal successors, (34779), 25569 states have internal predecessors, (34779), 1867 states have call successors, (1867), 1332 states have call predecessors, (1867), 1524 states have return successors, (2618), 1829 states have call predecessors, (2618), 1867 states have call successors, (2618) [2025-03-03 15:44:54,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28723 states to 28723 states and 39264 transitions. [2025-03-03 15:44:54,199 INFO L78 Accepts]: Start accepts. Automaton has 28723 states and 39264 transitions. Word has length 189 [2025-03-03 15:44:54,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:44:54,200 INFO L471 AbstractCegarLoop]: Abstraction has 28723 states and 39264 transitions. [2025-03-03 15:44:54,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-03 15:44:54,200 INFO L276 IsEmpty]: Start isEmpty. Operand 28723 states and 39264 transitions. [2025-03-03 15:44:54,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2025-03-03 15:44:54,228 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:44:54,228 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:44:54,235 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-03 15:44:54,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:44:54,429 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:44:54,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:44:54,429 INFO L85 PathProgramCache]: Analyzing trace with hash 1024898977, now seen corresponding path program 1 times [2025-03-03 15:44:54,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:44:54,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337270049] [2025-03-03 15:44:54,430 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:44:54,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:44:54,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 189 statements into 1 equivalence classes. [2025-03-03 15:44:54,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 189 of 189 statements. [2025-03-03 15:44:54,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:44:54,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:44:54,495 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2025-03-03 15:44:54,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:44:54,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337270049] [2025-03-03 15:44:54,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337270049] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:44:54,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1171881896] [2025-03-03 15:44:54,496 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:44:54,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:44:54,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:44:54,498 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 15:44:54,499 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-03 15:44:54,549 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 189 statements into 1 equivalence classes. [2025-03-03 15:44:54,594 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 189 of 189 statements. [2025-03-03 15:44:54,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:44:54,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:44:54,597 INFO L256 TraceCheckSpWp]: Trace formula consists of 627 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 15:44:54,599 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:44:54,640 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2025-03-03 15:44:54,640 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 15:44:54,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1171881896] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:44:54,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 15:44:54,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-03 15:44:54,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071433204] [2025-03-03 15:44:54,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:44:54,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:44:54,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:44:54,641 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:44:54,641 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:44:54,641 INFO L87 Difference]: Start difference. First operand 28723 states and 39264 transitions. Second operand has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 3 states have call successors, (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-03 15:44:55,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:44:55,509 INFO L93 Difference]: Finished difference Result 51390 states and 69066 transitions. [2025-03-03 15:44:55,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:44:55,509 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 3 states have call successors, (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 189 [2025-03-03 15:44:55,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:44:55,604 INFO L225 Difference]: With dead ends: 51390 [2025-03-03 15:44:55,604 INFO L226 Difference]: Without dead ends: 31167 [2025-03-03 15:44:55,646 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:44:55,647 INFO L435 NwaCegarLoop]: 4240 mSDtfsCounter, 4117 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4117 SdHoareTripleChecker+Valid, 4449 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:44:55,647 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4117 Valid, 4449 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:44:55,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31167 states. [2025-03-03 15:44:57,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31167 to 31003. [2025-03-03 15:44:57,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31003 states, 27466 states have (on average 1.3486856477098959) internal successors, (37043), 27705 states have internal predecessors, (37043), 1895 states have call successors, (1895), 1448 states have call predecessors, (1895), 1640 states have return successors, (2762), 1857 states have call predecessors, (2762), 1895 states have call successors, (2762) [2025-03-03 15:44:57,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31003 states to 31003 states and 41700 transitions. [2025-03-03 15:44:57,126 INFO L78 Accepts]: Start accepts. Automaton has 31003 states and 41700 transitions. Word has length 189 [2025-03-03 15:44:57,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:44:57,126 INFO L471 AbstractCegarLoop]: Abstraction has 31003 states and 41700 transitions. [2025-03-03 15:44:57,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 3 states have call successors, (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-03 15:44:57,126 INFO L276 IsEmpty]: Start isEmpty. Operand 31003 states and 41700 transitions. [2025-03-03 15:44:57,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2025-03-03 15:44:57,245 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:44:57,245 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:44:57,252 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-03 15:44:57,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:44:57,446 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:44:57,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:44:57,446 INFO L85 PathProgramCache]: Analyzing trace with hash -1565769217, now seen corresponding path program 1 times [2025-03-03 15:44:57,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:44:57,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629261471] [2025-03-03 15:44:57,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:44:57,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:44:57,453 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-03-03 15:44:57,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-03-03 15:44:57,456 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:44:57,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:44:57,516 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2025-03-03 15:44:57,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:44:57,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629261471] [2025-03-03 15:44:57,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629261471] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:44:57,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [712425679] [2025-03-03 15:44:57,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:44:57,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:44:57,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:44:57,518 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 15:44:57,520 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-03 15:44:57,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-03-03 15:44:57,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-03-03 15:44:57,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:44:57,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:44:57,617 INFO L256 TraceCheckSpWp]: Trace formula consists of 628 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 15:44:57,619 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:44:57,641 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-03 15:44:57,642 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 15:44:57,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [712425679] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:44:57,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 15:44:57,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-03 15:44:57,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785706387] [2025-03-03 15:44:57,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:44:57,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:44:57,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:44:57,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:44:57,643 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:44:57,643 INFO L87 Difference]: Start difference. First operand 31003 states and 41700 transitions. Second operand has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 3 states have call successors, (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-03 15:44:59,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:44:59,153 INFO L93 Difference]: Finished difference Result 85063 states and 113658 transitions. [2025-03-03 15:44:59,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:44:59,153 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 3 states have call successors, (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 190 [2025-03-03 15:44:59,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:44:59,328 INFO L225 Difference]: With dead ends: 85063 [2025-03-03 15:44:59,328 INFO L226 Difference]: Without dead ends: 56201 [2025-03-03 15:44:59,376 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:44:59,377 INFO L435 NwaCegarLoop]: 4376 mSDtfsCounter, 179 mSDsluCounter, 4176 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 8552 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:44:59,377 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 8552 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:44:59,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56201 states. [2025-03-03 15:45:01,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56201 to 56199. [2025-03-03 15:45:01,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56199 states, 49448 states have (on average 1.3241587121824947) internal successors, (65477), 49925 states have internal predecessors, (65477), 3629 states have call successors, (3629), 2736 states have call predecessors, (3629), 3120 states have return successors, (6322), 3553 states have call predecessors, (6322), 3629 states have call successors, (6322) [2025-03-03 15:45:01,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56199 states to 56199 states and 75428 transitions. [2025-03-03 15:45:02,018 INFO L78 Accepts]: Start accepts. Automaton has 56199 states and 75428 transitions. Word has length 190 [2025-03-03 15:45:02,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:45:02,018 INFO L471 AbstractCegarLoop]: Abstraction has 56199 states and 75428 transitions. [2025-03-03 15:45:02,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 3 states have call successors, (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-03 15:45:02,018 INFO L276 IsEmpty]: Start isEmpty. Operand 56199 states and 75428 transitions. [2025-03-03 15:45:02,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2025-03-03 15:45:02,074 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:45:02,074 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:45:02,081 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-03 15:45:02,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-03 15:45:02,275 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:45:02,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:45:02,276 INFO L85 PathProgramCache]: Analyzing trace with hash -1460166588, now seen corresponding path program 1 times [2025-03-03 15:45:02,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:45:02,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254801805] [2025-03-03 15:45:02,277 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:45:02,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:45:02,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-03-03 15:45:02,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-03-03 15:45:02,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:45:02,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:45:02,329 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2025-03-03 15:45:02,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:45:02,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254801805] [2025-03-03 15:45:02,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254801805] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:45:02,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1501890496] [2025-03-03 15:45:02,329 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:45:02,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:45:02,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:45:02,331 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 15:45:02,334 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-03 15:45:02,382 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-03-03 15:45:02,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-03-03 15:45:02,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:45:02,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:45:02,428 INFO L256 TraceCheckSpWp]: Trace formula consists of 630 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 15:45:02,430 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:45:02,472 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2025-03-03 15:45:02,473 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 15:45:02,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1501890496] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:45:02,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 15:45:02,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-03 15:45:02,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753970682] [2025-03-03 15:45:02,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:45:02,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:45:02,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:45:02,475 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:45:02,476 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:45:02,476 INFO L87 Difference]: Start difference. First operand 56199 states and 75428 transitions. Second operand has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 3 states have call successors, (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-03 15:45:04,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:45:04,153 INFO L93 Difference]: Finished difference Result 114137 states and 154137 transitions. [2025-03-03 15:45:04,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:45:04,153 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 3 states have call successors, (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 191 [2025-03-03 15:45:04,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:45:04,359 INFO L225 Difference]: With dead ends: 114137 [2025-03-03 15:45:04,359 INFO L226 Difference]: Without dead ends: 60087 [2025-03-03 15:45:04,456 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:45:04,457 INFO L435 NwaCegarLoop]: 4187 mSDtfsCounter, 4138 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4138 SdHoareTripleChecker+Valid, 4229 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:45:04,458 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4138 Valid, 4229 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:45:04,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60087 states. [2025-03-03 15:45:07,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60087 to 56199. [2025-03-03 15:45:07,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56199 states, 49448 states have (on average 1.3044208056948714) internal successors, (64501), 49925 states have internal predecessors, (64501), 3629 states have call successors, (3629), 2736 states have call predecessors, (3629), 3120 states have return successors, (5974), 3553 states have call predecessors, (5974), 3629 states have call successors, (5974) [2025-03-03 15:45:07,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56199 states to 56199 states and 74104 transitions. [2025-03-03 15:45:07,853 INFO L78 Accepts]: Start accepts. Automaton has 56199 states and 74104 transitions. Word has length 191 [2025-03-03 15:45:07,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:45:07,853 INFO L471 AbstractCegarLoop]: Abstraction has 56199 states and 74104 transitions. [2025-03-03 15:45:07,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 3 states have call successors, (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-03 15:45:07,853 INFO L276 IsEmpty]: Start isEmpty. Operand 56199 states and 74104 transitions. [2025-03-03 15:45:07,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2025-03-03 15:45:07,899 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:45:07,899 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:45:07,905 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-03 15:45:08,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-03 15:45:08,100 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:45:08,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:45:08,100 INFO L85 PathProgramCache]: Analyzing trace with hash -818246298, now seen corresponding path program 1 times [2025-03-03 15:45:08,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:45:08,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714922813] [2025-03-03 15:45:08,101 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:45:08,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:45:08,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-03-03 15:45:08,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-03-03 15:45:08,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:45:08,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:45:08,165 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2025-03-03 15:45:08,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:45:08,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714922813] [2025-03-03 15:45:08,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714922813] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:45:08,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1752466391] [2025-03-03 15:45:08,166 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:45:08,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:45:08,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:45:08,168 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 15:45:08,169 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-03 15:45:08,217 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-03-03 15:45:08,261 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-03-03 15:45:08,261 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:45:08,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:45:08,263 INFO L256 TraceCheckSpWp]: Trace formula consists of 624 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 15:45:08,265 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:45:08,280 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-03-03 15:45:08,280 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 15:45:08,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1752466391] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:45:08,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 15:45:08,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-03 15:45:08,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353539949] [2025-03-03 15:45:08,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:45:08,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:45:08,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:45:08,282 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:45:08,282 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:45:08,282 INFO L87 Difference]: Start difference. First operand 56199 states and 74104 transitions. Second operand has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 3 states have call successors, (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)