./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label49+token_ring.03.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/Problem05_label49+token_ring.03.cil-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 713a95fba13367522eddac239136ad149ef56d491623153a32513b25fa3198dd --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 06:59:29,988 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 06:59:30,044 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 06:59:30,048 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 06:59:30,049 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 06:59:30,070 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 06:59:30,071 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 06:59:30,071 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 06:59:30,072 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 06:59:30,072 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 06:59:30,072 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 06:59:30,073 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 06:59:30,073 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 06:59:30,073 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 06:59:30,073 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 06:59:30,073 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 06:59:30,074 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 06:59:30,074 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 06:59:30,074 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 06:59:30,074 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 06:59:30,074 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 06:59:30,074 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 06:59:30,074 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 06:59:30,074 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 06:59:30,074 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 06:59:30,074 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 06:59:30,074 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 06:59:30,074 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 06:59:30,074 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 06:59:30,074 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 06:59:30,074 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 06:59:30,074 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 06:59:30,075 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 06:59:30,075 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 06:59:30,075 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 06:59:30,075 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 06:59:30,075 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 06:59:30,075 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 06:59:30,075 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 06:59:30,075 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 06:59:30,075 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 06:59:30,075 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 06:59:30,075 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 06:59:30,075 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 713a95fba13367522eddac239136ad149ef56d491623153a32513b25fa3198dd [2025-03-08 06:59:30,299 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 06:59:30,307 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 06:59:30,309 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 06:59:30,309 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 06:59:30,310 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 06:59:30,311 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/Problem05_label49+token_ring.03.cil-2.c [2025-03-08 06:59:31,462 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eee3843ab/159374e7c261479aad760fc4d086b926/FLAG9236e5b2e [2025-03-08 06:59:32,070 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 06:59:32,072 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label49+token_ring.03.cil-2.c [2025-03-08 06:59:32,120 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eee3843ab/159374e7c261479aad760fc4d086b926/FLAG9236e5b2e [2025-03-08 06:59:32,138 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eee3843ab/159374e7c261479aad760fc4d086b926 [2025-03-08 06:59:32,141 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 06:59:32,143 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 06:59:32,145 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 06:59:32,145 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 06:59:32,148 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 06:59:32,149 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 06:59:32" (1/1) ... [2025-03-08 06:59:32,151 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4acad3b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:59:32, skipping insertion in model container [2025-03-08 06:59:32,151 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 06:59:32" (1/1) ... [2025-03-08 06:59:32,288 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 06:59:33,435 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label49+token_ring.03.cil-2.c[380593,380606] [2025-03-08 06:59:33,467 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label49+token_ring.03.cil-2.c[383339,383352] [2025-03-08 06:59:33,606 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 06:59:33,614 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 06:59:34,163 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label49+token_ring.03.cil-2.c[380593,380606] [2025-03-08 06:59:34,168 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label49+token_ring.03.cil-2.c[383339,383352] [2025-03-08 06:59:34,181 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 06:59:34,229 INFO L204 MainTranslator]: Completed translation [2025-03-08 06:59:34,230 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:59:34 WrapperNode [2025-03-08 06:59:34,231 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 06:59:34,232 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 06:59:34,232 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 06:59:34,232 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 06:59:34,236 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:59:34" (1/1) ... [2025-03-08 06:59:34,298 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:59:34" (1/1) ... [2025-03-08 06:59:34,570 INFO L138 Inliner]: procedures = 50, calls = 50, calls flagged for inlining = 28, calls inlined = 28, statements flattened = 12672 [2025-03-08 06:59:34,571 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 06:59:34,572 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 06:59:34,572 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 06:59:34,572 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 06:59:34,579 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:59:34" (1/1) ... [2025-03-08 06:59:34,579 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:59:34" (1/1) ... [2025-03-08 06:59:34,630 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:59:34" (1/1) ... [2025-03-08 06:59:34,716 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-08 06:59:34,716 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:59:34" (1/1) ... [2025-03-08 06:59:34,716 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:59:34" (1/1) ... [2025-03-08 06:59:35,012 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:59:34" (1/1) ... [2025-03-08 06:59:35,027 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:59:34" (1/1) ... [2025-03-08 06:59:35,041 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:59:34" (1/1) ... [2025-03-08 06:59:35,056 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:59:34" (1/1) ... [2025-03-08 06:59:35,096 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 06:59:35,098 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 06:59:35,098 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 06:59:35,098 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 06:59:35,099 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:59:34" (1/1) ... [2025-03-08 06:59:35,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 06:59:35,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:59:35,128 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-08 06:59:35,133 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-08 06:59:35,149 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 06:59:35,149 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2025-03-08 06:59:35,149 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2025-03-08 06:59:35,149 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-03-08 06:59:35,149 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-03-08 06:59:35,150 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2025-03-08 06:59:35,150 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2025-03-08 06:59:35,150 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2025-03-08 06:59:35,150 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2025-03-08 06:59:35,150 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2025-03-08 06:59:35,150 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2025-03-08 06:59:35,150 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2025-03-08 06:59:35,150 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2025-03-08 06:59:35,151 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 06:59:35,151 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 06:59:35,151 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 06:59:35,244 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 06:59:35,245 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 06:59:41,505 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4481: havoc calculate_output3_#t~ret16#1; [2025-03-08 06:59:41,506 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7469: havoc calculate_output5_#t~ret18#1; [2025-03-08 06:59:41,506 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3033: havoc calculate_output2_#t~ret15#1; [2025-03-08 06:59:41,506 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L10440: havoc calculate_output7_#t~ret20#1; [2025-03-08 06:59:41,507 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8922: havoc calculate_output6_#t~ret19#1; [2025-03-08 06:59:41,507 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6035: havoc calculate_output4_#t~ret17#1; [2025-03-08 06:59:41,507 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1543: havoc calculate_output_#t~ret14#1; [2025-03-08 06:59:41,689 INFO L? ?]: Removed 1701 outVars from TransFormulas that were not future-live. [2025-03-08 06:59:41,691 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 06:59:41,749 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 06:59:41,749 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 06:59:41,749 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 06:59:41 BoogieIcfgContainer [2025-03-08 06:59:41,749 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 06:59:41,752 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 06:59:41,753 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 06:59:41,756 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 06:59:41,757 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 06:59:32" (1/3) ... [2025-03-08 06:59:41,757 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f7f7fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 06:59:41, skipping insertion in model container [2025-03-08 06:59:41,758 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:59:34" (2/3) ... [2025-03-08 06:59:41,758 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f7f7fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 06:59:41, skipping insertion in model container [2025-03-08 06:59:41,759 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 06:59:41" (3/3) ... [2025-03-08 06:59:41,760 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem05_label49+token_ring.03.cil-2.c [2025-03-08 06:59:41,772 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 06:59:41,776 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem05_label49+token_ring.03.cil-2.c that has 7 procedures, 2338 locations, 1 initial locations, 7 loop locations, and 2 error locations. [2025-03-08 06:59:41,872 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 06:59:41,880 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;@31f285d8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 06:59:41,881 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-08 06:59:41,894 INFO L276 IsEmpty]: Start isEmpty. Operand has 2338 states, 2313 states have (on average 1.8525724167747515) internal successors, (4285), 2315 states have internal predecessors, (4285), 17 states have call successors, (17), 6 states have call predecessors, (17), 6 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-08 06:59:41,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-08 06:59:41,905 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:59:41,905 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:59:41,906 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:59:41,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:59:41,912 INFO L85 PathProgramCache]: Analyzing trace with hash -1895885998, now seen corresponding path program 1 times [2025-03-08 06:59:41,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:59:41,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278548054] [2025-03-08 06:59:41,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:59:41,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:59:41,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-08 06:59:42,001 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-08 06:59:42,002 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:59:42,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:59:42,267 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-08 06:59:42,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:59:42,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278548054] [2025-03-08 06:59:42,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278548054] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:59:42,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:59:42,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:59:42,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059269403] [2025-03-08 06:59:42,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:59:42,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:59:42,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:59:42,290 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:59:42,291 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:59:42,299 INFO L87 Difference]: Start difference. First operand has 2338 states, 2313 states have (on average 1.8525724167747515) internal successors, (4285), 2315 states have internal predecessors, (4285), 17 states have call successors, (17), 6 states have call predecessors, (17), 6 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:59:42,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:59:42,763 INFO L93 Difference]: Finished difference Result 4819 states and 8863 transitions. [2025-03-08 06:59:42,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 06:59:42,765 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 77 [2025-03-08 06:59:42,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:59:42,790 INFO L225 Difference]: With dead ends: 4819 [2025-03-08 06:59:42,790 INFO L226 Difference]: Without dead ends: 2422 [2025-03-08 06:59:42,801 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-08 06:59:42,803 INFO L435 NwaCegarLoop]: 4200 mSDtfsCounter, 4409 mSDsluCounter, 8479 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4420 SdHoareTripleChecker+Valid, 12679 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 06:59:42,804 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4420 Valid, 12679 Invalid, 301 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [38 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 06:59:42,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2422 states. [2025-03-08 06:59:42,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2422 to 2411. [2025-03-08 06:59:42,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2411 states, 2367 states have (on average 1.830587241233629) internal successors, (4333), 2370 states have internal predecessors, (4333), 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-08 06:59:42,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2411 states to 2411 states and 4392 transitions. [2025-03-08 06:59:42,943 INFO L78 Accepts]: Start accepts. Automaton has 2411 states and 4392 transitions. Word has length 77 [2025-03-08 06:59:42,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:59:42,943 INFO L471 AbstractCegarLoop]: Abstraction has 2411 states and 4392 transitions. [2025-03-08 06:59:42,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:59:42,943 INFO L276 IsEmpty]: Start isEmpty. Operand 2411 states and 4392 transitions. [2025-03-08 06:59:42,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-08 06:59:42,946 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:59:42,946 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:59:42,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 06:59:42,947 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:59:42,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:59:42,947 INFO L85 PathProgramCache]: Analyzing trace with hash 113173652, now seen corresponding path program 1 times [2025-03-08 06:59:42,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:59:42,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978019921] [2025-03-08 06:59:42,947 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:59:42,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:59:42,961 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-08 06:59:42,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-08 06:59:42,966 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:59:42,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:59:43,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-08 06:59:43,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:59:43,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978019921] [2025-03-08 06:59:43,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978019921] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:59:43,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:59:43,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:59:43,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016375752] [2025-03-08 06:59:43,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:59:43,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:59:43,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:59:43,130 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:59:43,131 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:59:43,132 INFO L87 Difference]: Start difference. First operand 2411 states and 4392 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:59:43,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:59:43,363 INFO L93 Difference]: Finished difference Result 2714 states and 4855 transitions. [2025-03-08 06:59:43,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 06:59:43,364 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 77 [2025-03-08 06:59:43,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:59:43,376 INFO L225 Difference]: With dead ends: 2714 [2025-03-08 06:59:43,376 INFO L226 Difference]: Without dead ends: 2435 [2025-03-08 06:59:43,379 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-08 06:59:43,379 INFO L435 NwaCegarLoop]: 4119 mSDtfsCounter, 4238 mSDsluCounter, 8173 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4249 SdHoareTripleChecker+Valid, 12292 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-08 06:59:43,379 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4249 Valid, 12292 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:59:43,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2435 states. [2025-03-08 06:59:43,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2435 to 2411. [2025-03-08 06:59:43,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2411 states, 2367 states have (on average 1.8297422898183355) internal successors, (4331), 2370 states have internal predecessors, (4331), 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-08 06:59:43,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2411 states to 2411 states and 4390 transitions. [2025-03-08 06:59:43,455 INFO L78 Accepts]: Start accepts. Automaton has 2411 states and 4390 transitions. Word has length 77 [2025-03-08 06:59:43,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:59:43,455 INFO L471 AbstractCegarLoop]: Abstraction has 2411 states and 4390 transitions. [2025-03-08 06:59:43,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:59:43,456 INFO L276 IsEmpty]: Start isEmpty. Operand 2411 states and 4390 transitions. [2025-03-08 06:59:43,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-08 06:59:43,459 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:59:43,459 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:59:43,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 06:59:43,459 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:59:43,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:59:43,461 INFO L85 PathProgramCache]: Analyzing trace with hash -1694673869, now seen corresponding path program 1 times [2025-03-08 06:59:43,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:59:43,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032629727] [2025-03-08 06:59:43,461 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:59:43,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:59:43,469 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-08 06:59:43,473 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-08 06:59:43,474 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:59:43,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:59:43,626 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-08 06:59:43,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:59:43,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032629727] [2025-03-08 06:59:43,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032629727] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:59:43,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:59:43,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:59:43,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118089773] [2025-03-08 06:59:43,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:59:43,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:59:43,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:59:43,628 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:59:43,629 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:59:43,629 INFO L87 Difference]: Start difference. First operand 2411 states and 4390 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:59:44,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:59:44,026 INFO L93 Difference]: Finished difference Result 2854 states and 5053 transitions. [2025-03-08 06:59:44,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:59:44,027 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 77 [2025-03-08 06:59:44,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:59:44,039 INFO L225 Difference]: With dead ends: 2854 [2025-03-08 06:59:44,039 INFO L226 Difference]: Without dead ends: 2575 [2025-03-08 06:59:44,041 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-08 06:59:44,043 INFO L435 NwaCegarLoop]: 4229 mSDtfsCounter, 4323 mSDsluCounter, 12663 mSDsCounter, 0 mSdLazyCounter, 488 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4334 SdHoareTripleChecker+Valid, 16892 SdHoareTripleChecker+Invalid, 511 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 06:59:44,044 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4334 Valid, 16892 Invalid, 511 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 488 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 06:59:44,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2575 states. [2025-03-08 06:59:44,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2575 to 2540. [2025-03-08 06:59:44,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2540 states, 2477 states have (on average 1.813887767460638) internal successors, (4493), 2481 states have internal predecessors, (4493), 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-08 06:59:44,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2540 states to 2540 states and 4579 transitions. [2025-03-08 06:59:44,102 INFO L78 Accepts]: Start accepts. Automaton has 2540 states and 4579 transitions. Word has length 77 [2025-03-08 06:59:44,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:59:44,103 INFO L471 AbstractCegarLoop]: Abstraction has 2540 states and 4579 transitions. [2025-03-08 06:59:44,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:59:44,103 INFO L276 IsEmpty]: Start isEmpty. Operand 2540 states and 4579 transitions. [2025-03-08 06:59:44,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-08 06:59:44,104 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:59:44,104 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:59:44,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 06:59:44,104 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:59:44,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:59:44,105 INFO L85 PathProgramCache]: Analyzing trace with hash -1593761902, now seen corresponding path program 1 times [2025-03-08 06:59:44,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:59:44,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181205553] [2025-03-08 06:59:44,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:59:44,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:59:44,112 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-08 06:59:44,163 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-08 06:59:44,164 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:59:44,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:59:44,262 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-08 06:59:44,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:59:44,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181205553] [2025-03-08 06:59:44,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181205553] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:59:44,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:59:44,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:59:44,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480766911] [2025-03-08 06:59:44,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:59:44,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:59:44,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:59:44,263 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:59:44,263 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:59:44,263 INFO L87 Difference]: Start difference. First operand 2540 states and 4579 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:59:44,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:59:44,650 INFO L93 Difference]: Finished difference Result 3303 states and 5716 transitions. [2025-03-08 06:59:44,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:59:44,651 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 77 [2025-03-08 06:59:44,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:59:44,662 INFO L225 Difference]: With dead ends: 3303 [2025-03-08 06:59:44,662 INFO L226 Difference]: Without dead ends: 2895 [2025-03-08 06:59:44,665 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-08 06:59:44,666 INFO L435 NwaCegarLoop]: 4223 mSDtfsCounter, 4422 mSDsluCounter, 12640 mSDsCounter, 0 mSdLazyCounter, 491 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4437 SdHoareTripleChecker+Valid, 16863 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-08 06:59:44,666 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4437 Valid, 16863 Invalid, 517 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 491 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 06:59:44,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2895 states. [2025-03-08 06:59:44,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2895 to 2801. [2025-03-08 06:59:44,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2801 states, 2700 states have (on average 1.7866666666666666) internal successors, (4824), 2708 states have internal predecessors, (4824), 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-08 06:59:44,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2801 states to 2801 states and 4966 transitions. [2025-03-08 06:59:44,740 INFO L78 Accepts]: Start accepts. Automaton has 2801 states and 4966 transitions. Word has length 77 [2025-03-08 06:59:44,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:59:44,740 INFO L471 AbstractCegarLoop]: Abstraction has 2801 states and 4966 transitions. [2025-03-08 06:59:44,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:59:44,740 INFO L276 IsEmpty]: Start isEmpty. Operand 2801 states and 4966 transitions. [2025-03-08 06:59:44,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-08 06:59:44,742 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:59:44,742 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:59:44,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 06:59:44,742 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:59:44,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:59:44,742 INFO L85 PathProgramCache]: Analyzing trace with hash -1313412013, now seen corresponding path program 1 times [2025-03-08 06:59:44,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:59:44,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515151644] [2025-03-08 06:59:44,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:59:44,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:59:44,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-08 06:59:44,756 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-08 06:59:44,756 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:59:44,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:59:44,852 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-08 06:59:44,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:59:44,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515151644] [2025-03-08 06:59:44,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515151644] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:59:44,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:59:44,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:59:44,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936723801] [2025-03-08 06:59:44,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:59:44,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:59:44,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:59:44,855 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:59:44,855 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:59:44,855 INFO L87 Difference]: Start difference. First operand 2801 states and 4966 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:59:45,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:59:45,043 INFO L93 Difference]: Finished difference Result 3514 states and 6040 transitions. [2025-03-08 06:59:45,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 06:59:45,043 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 77 [2025-03-08 06:59:45,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:59:45,055 INFO L225 Difference]: With dead ends: 3514 [2025-03-08 06:59:45,055 INFO L226 Difference]: Without dead ends: 2845 [2025-03-08 06:59:45,059 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-08 06:59:45,060 INFO L435 NwaCegarLoop]: 4110 mSDtfsCounter, 4230 mSDsluCounter, 8154 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4241 SdHoareTripleChecker+Valid, 12264 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-08 06:59:45,061 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4241 Valid, 12264 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:59:45,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2845 states. [2025-03-08 06:59:45,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2845 to 2801. [2025-03-08 06:59:45,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2801 states, 2700 states have (on average 1.7848148148148149) internal successors, (4819), 2708 states have internal predecessors, (4819), 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-08 06:59:45,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2801 states to 2801 states and 4961 transitions. [2025-03-08 06:59:45,146 INFO L78 Accepts]: Start accepts. Automaton has 2801 states and 4961 transitions. Word has length 77 [2025-03-08 06:59:45,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:59:45,147 INFO L471 AbstractCegarLoop]: Abstraction has 2801 states and 4961 transitions. [2025-03-08 06:59:45,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:59:45,147 INFO L276 IsEmpty]: Start isEmpty. Operand 2801 states and 4961 transitions. [2025-03-08 06:59:45,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-08 06:59:45,148 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:59:45,148 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:59:45,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 06:59:45,148 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:59:45,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:59:45,149 INFO L85 PathProgramCache]: Analyzing trace with hash 1050936178, now seen corresponding path program 1 times [2025-03-08 06:59:45,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:59:45,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837602465] [2025-03-08 06:59:45,149 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:59:45,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:59:45,155 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-08 06:59:45,159 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-08 06:59:45,159 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:59:45,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:59:45,256 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-08 06:59:45,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:59:45,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837602465] [2025-03-08 06:59:45,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837602465] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:59:45,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:59:45,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:59:45,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402323634] [2025-03-08 06:59:45,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:59:45,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:59:45,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:59:45,258 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:59:45,258 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:59:45,258 INFO L87 Difference]: Start difference. First operand 2801 states and 4961 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:59:45,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:59:45,667 INFO L93 Difference]: Finished difference Result 4090 states and 6876 transitions. [2025-03-08 06:59:45,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:59:45,668 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 77 [2025-03-08 06:59:45,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:59:45,685 INFO L225 Difference]: With dead ends: 4090 [2025-03-08 06:59:45,685 INFO L226 Difference]: Without dead ends: 3421 [2025-03-08 06:59:45,689 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-08 06:59:45,690 INFO L435 NwaCegarLoop]: 4215 mSDtfsCounter, 4349 mSDsluCounter, 12617 mSDsCounter, 0 mSdLazyCounter, 491 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4364 SdHoareTripleChecker+Valid, 16832 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-08 06:59:45,690 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4364 Valid, 16832 Invalid, 517 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 491 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 06:59:45,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3421 states. [2025-03-08 06:59:45,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3421 to 3329. [2025-03-08 06:59:45,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3329 states, 3148 states have (on average 1.7398348157560355) internal successors, (5477), 3170 states have internal predecessors, (5477), 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-08 06:59:45,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3329 states to 3329 states and 5751 transitions. [2025-03-08 06:59:45,803 INFO L78 Accepts]: Start accepts. Automaton has 3329 states and 5751 transitions. Word has length 77 [2025-03-08 06:59:45,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:59:45,804 INFO L471 AbstractCegarLoop]: Abstraction has 3329 states and 5751 transitions. [2025-03-08 06:59:45,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:59:45,804 INFO L276 IsEmpty]: Start isEmpty. Operand 3329 states and 5751 transitions. [2025-03-08 06:59:45,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-08 06:59:45,808 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:59:45,809 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:59:45,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 06:59:45,809 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:59:45,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:59:45,809 INFO L85 PathProgramCache]: Analyzing trace with hash 1681394803, now seen corresponding path program 1 times [2025-03-08 06:59:45,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:59:45,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937850926] [2025-03-08 06:59:45,809 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:59:45,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:59:45,815 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-08 06:59:45,817 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-08 06:59:45,817 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:59:45,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:59:45,870 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-08 06:59:45,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:59:45,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937850926] [2025-03-08 06:59:45,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937850926] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:59:45,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:59:45,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:59:45,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406180590] [2025-03-08 06:59:45,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:59:45,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:59:45,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:59:45,872 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:59:45,872 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:59:45,872 INFO L87 Difference]: Start difference. First operand 3329 states and 5751 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:59:46,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:59:46,137 INFO L93 Difference]: Finished difference Result 4584 states and 7640 transitions. [2025-03-08 06:59:46,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 06:59:46,138 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 77 [2025-03-08 06:59:46,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:59:46,150 INFO L225 Difference]: With dead ends: 4584 [2025-03-08 06:59:46,151 INFO L226 Difference]: Without dead ends: 3387 [2025-03-08 06:59:46,155 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-08 06:59:46,155 INFO L435 NwaCegarLoop]: 4105 mSDtfsCounter, 4226 mSDsluCounter, 8145 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4237 SdHoareTripleChecker+Valid, 12250 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:59:46,156 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4237 Valid, 12250 Invalid, 220 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [26 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:59:46,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3387 states. [2025-03-08 06:59:46,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3387 to 3329. [2025-03-08 06:59:46,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3329 states, 3148 states have (on average 1.7369758576874206) internal successors, (5468), 3170 states have internal predecessors, (5468), 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-08 06:59:46,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3329 states to 3329 states and 5742 transitions. [2025-03-08 06:59:46,280 INFO L78 Accepts]: Start accepts. Automaton has 3329 states and 5742 transitions. Word has length 77 [2025-03-08 06:59:46,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:59:46,280 INFO L471 AbstractCegarLoop]: Abstraction has 3329 states and 5742 transitions. [2025-03-08 06:59:46,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:59:46,281 INFO L276 IsEmpty]: Start isEmpty. Operand 3329 states and 5742 transitions. [2025-03-08 06:59:46,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-08 06:59:46,283 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:59:46,283 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:59:46,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 06:59:46,283 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:59:46,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:59:46,283 INFO L85 PathProgramCache]: Analyzing trace with hash 1701732178, now seen corresponding path program 1 times [2025-03-08 06:59:46,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:59:46,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190755627] [2025-03-08 06:59:46,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:59:46,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:59:46,290 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-08 06:59:46,294 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-08 06:59:46,294 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:59:46,294 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:59:46,338 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-08 06:59:46,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:59:46,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190755627] [2025-03-08 06:59:46,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190755627] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:59:46,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:59:46,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 06:59:46,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725362301] [2025-03-08 06:59:46,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:59:46,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 06:59:46,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:59:46,339 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 06:59:46,339 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 06:59:46,339 INFO L87 Difference]: Start difference. First operand 3329 states and 5742 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:59:46,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:59:46,591 INFO L93 Difference]: Finished difference Result 5682 states and 9294 transitions. [2025-03-08 06:59:46,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 06:59:46,591 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 77 [2025-03-08 06:59:46,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:59:46,609 INFO L225 Difference]: With dead ends: 5682 [2025-03-08 06:59:46,609 INFO L226 Difference]: Without dead ends: 4486 [2025-03-08 06:59:46,614 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-08 06:59:46,615 INFO L435 NwaCegarLoop]: 4361 mSDtfsCounter, 4328 mSDsluCounter, 4298 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4328 SdHoareTripleChecker+Valid, 8659 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-08 06:59:46,615 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4328 Valid, 8659 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:59:46,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4486 states. [2025-03-08 06:59:46,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4486 to 4477. [2025-03-08 06:59:46,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4477 states, 4121 states have (on average 1.6614899296287309) internal successors, (6847), 4172 states have internal predecessors, (6847), 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-08 06:59:46,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4477 states to 4477 states and 7380 transitions. [2025-03-08 06:59:46,768 INFO L78 Accepts]: Start accepts. Automaton has 4477 states and 7380 transitions. Word has length 77 [2025-03-08 06:59:46,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:59:46,769 INFO L471 AbstractCegarLoop]: Abstraction has 4477 states and 7380 transitions. [2025-03-08 06:59:46,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:59:46,769 INFO L276 IsEmpty]: Start isEmpty. Operand 4477 states and 7380 transitions. [2025-03-08 06:59:46,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-08 06:59:46,775 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:59:46,775 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:59:46,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 06:59:46,775 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:59:46,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:59:46,776 INFO L85 PathProgramCache]: Analyzing trace with hash -1331570662, now seen corresponding path program 1 times [2025-03-08 06:59:46,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:59:46,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456713434] [2025-03-08 06:59:46,776 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:59:46,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:59:46,782 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-08 06:59:46,788 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-08 06:59:46,789 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:59:46,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:59:46,847 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-08 06:59:46,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:59:46,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456713434] [2025-03-08 06:59:46,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456713434] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 06:59:46,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1389145424] [2025-03-08 06:59:46,848 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:59:46,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:59:46,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:59:46,850 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-08 06:59:46,851 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-08 06:59:46,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-08 06:59:46,943 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-08 06:59:46,943 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:59:46,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:59:46,946 INFO L256 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 06:59:46,950 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 06:59:47,000 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-08 06:59:47,001 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 06:59:47,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1389145424] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:59:47,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 06:59:47,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-03-08 06:59:47,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181612634] [2025-03-08 06:59:47,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:59:47,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:59:47,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:59:47,002 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:59:47,002 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:59:47,002 INFO L87 Difference]: Start difference. First operand 4477 states and 7380 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 2 states have internal predecessors, (90), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 06:59:47,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:59:47,180 INFO L93 Difference]: Finished difference Result 9074 states and 14128 transitions. [2025-03-08 06:59:47,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:59:47,180 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 2 states have internal predecessors, (90), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 125 [2025-03-08 06:59:47,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:59:47,211 INFO L225 Difference]: With dead ends: 9074 [2025-03-08 06:59:47,211 INFO L226 Difference]: Without dead ends: 6730 [2025-03-08 06:59:47,222 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:59:47,222 INFO L435 NwaCegarLoop]: 4174 mSDtfsCounter, 4130 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4130 SdHoareTripleChecker+Valid, 4366 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-08 06:59:47,222 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4130 Valid, 4366 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:59:47,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6730 states. [2025-03-08 06:59:47,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6730 to 6710. [2025-03-08 06:59:47,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6710 states, 6022 states have (on average 1.590501494520093) internal successors, (9578), 6122 states have internal predecessors, (9578), 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-08 06:59:47,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6710 states to 6710 states and 10593 transitions. [2025-03-08 06:59:47,580 INFO L78 Accepts]: Start accepts. Automaton has 6710 states and 10593 transitions. Word has length 125 [2025-03-08 06:59:47,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:59:47,580 INFO L471 AbstractCegarLoop]: Abstraction has 6710 states and 10593 transitions. [2025-03-08 06:59:47,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 2 states have internal predecessors, (90), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 06:59:47,581 INFO L276 IsEmpty]: Start isEmpty. Operand 6710 states and 10593 transitions. [2025-03-08 06:59:47,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-08 06:59:47,590 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:59:47,591 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:59:47,598 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-08 06:59:47,793 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-08 06:59:47,793 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:59:47,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:59:47,794 INFO L85 PathProgramCache]: Analyzing trace with hash -2139120736, now seen corresponding path program 1 times [2025-03-08 06:59:47,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:59:47,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328291614] [2025-03-08 06:59:47,794 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:59:47,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:59:47,805 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-08 06:59:47,814 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-08 06:59:47,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:59:47,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:59:47,893 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-08 06:59:47,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:59:47,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328291614] [2025-03-08 06:59:47,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328291614] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 06:59:47,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2117638256] [2025-03-08 06:59:47,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:59:47,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:59:47,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:59:47,897 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-08 06:59:47,898 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-08 06:59:47,947 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-08 06:59:47,994 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-08 06:59:47,994 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:59:47,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:59:47,996 INFO L256 TraceCheckSpWp]: Trace formula consists of 486 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 06:59:47,999 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 06:59:48,063 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-08 06:59:48,064 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 06:59:48,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2117638256] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:59:48,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 06:59:48,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-03-08 06:59:48,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839564003] [2025-03-08 06:59:48,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:59:48,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:59:48,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:59:48,065 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:59:48,065 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:59:48,065 INFO L87 Difference]: Start difference. First operand 6710 states and 10593 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 2 states have internal predecessors, (96), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 06:59:48,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:59:48,348 INFO L93 Difference]: Finished difference Result 15731 states and 23779 transitions. [2025-03-08 06:59:48,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:59:48,349 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 2 states have internal predecessors, (96), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 125 [2025-03-08 06:59:48,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:59:48,390 INFO L225 Difference]: With dead ends: 15731 [2025-03-08 06:59:48,390 INFO L226 Difference]: Without dead ends: 11154 [2025-03-08 06:59:48,408 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:59:48,408 INFO L435 NwaCegarLoop]: 4174 mSDtfsCounter, 4124 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4124 SdHoareTripleChecker+Valid, 4366 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-08 06:59:48,409 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4124 Valid, 4366 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:59:48,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11154 states. [2025-03-08 06:59:48,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11154 to 11116. [2025-03-08 06:59:48,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11116 states, 9766 states have (on average 1.528568502969486) internal successors, (14928), 9964 states have internal predecessors, (14928), 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-08 06:59:48,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11116 states to 11116 states and 16903 transitions. [2025-03-08 06:59:48,956 INFO L78 Accepts]: Start accepts. Automaton has 11116 states and 16903 transitions. Word has length 125 [2025-03-08 06:59:48,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:59:48,956 INFO L471 AbstractCegarLoop]: Abstraction has 11116 states and 16903 transitions. [2025-03-08 06:59:48,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 2 states have internal predecessors, (96), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 06:59:48,957 INFO L276 IsEmpty]: Start isEmpty. Operand 11116 states and 16903 transitions. [2025-03-08 06:59:48,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-08 06:59:48,967 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:59:48,967 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:59:48,975 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 06:59:49,172 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-08 06:59:49,172 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:59:49,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:59:49,173 INFO L85 PathProgramCache]: Analyzing trace with hash -322962522, now seen corresponding path program 1 times [2025-03-08 06:59:49,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:59:49,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382305543] [2025-03-08 06:59:49,173 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:59:49,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:59:49,179 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-08 06:59:49,183 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-08 06:59:49,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:59:49,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:59:49,255 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-08 06:59:49,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:59:49,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382305543] [2025-03-08 06:59:49,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382305543] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 06:59:49,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1083192823] [2025-03-08 06:59:49,255 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:59:49,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:59:49,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:59:49,257 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-08 06:59:49,259 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-08 06:59:49,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-08 06:59:49,344 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-08 06:59:49,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:59:49,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:59:49,346 INFO L256 TraceCheckSpWp]: Trace formula consists of 480 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 06:59:49,348 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 06:59:49,387 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2025-03-08 06:59:49,387 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 06:59:49,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1083192823] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:59:49,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 06:59:49,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-03-08 06:59:49,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232998864] [2025-03-08 06:59:49,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:59:49,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:59:49,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:59:49,388 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:59:49,389 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:59:49,389 INFO L87 Difference]: Start difference. First operand 11116 states and 16903 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 2 states have internal predecessors, (84), 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-08 06:59:50,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:59:50,023 INFO L93 Difference]: Finished difference Result 28817 states and 42651 transitions. [2025-03-08 06:59:50,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:59:50,023 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 2 states have internal predecessors, (84), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 125 [2025-03-08 06:59:50,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:59:50,104 INFO L225 Difference]: With dead ends: 28817 [2025-03-08 06:59:50,104 INFO L226 Difference]: Without dead ends: 19834 [2025-03-08 06:59:50,138 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:59:50,139 INFO L435 NwaCegarLoop]: 4174 mSDtfsCounter, 4136 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4136 SdHoareTripleChecker+Valid, 4366 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-08 06:59:50,139 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4136 Valid, 4366 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:59:50,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19834 states. [2025-03-08 06:59:51,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19834 to 19760. [2025-03-08 06:59:51,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19760 states, 17106 states have (on average 1.4832222611949024) internal successors, (25372), 17500 states have internal predecessors, (25372), 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-08 06:59:51,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19760 states to 19760 states and 29227 transitions. [2025-03-08 06:59:51,456 INFO L78 Accepts]: Start accepts. Automaton has 19760 states and 29227 transitions. Word has length 125 [2025-03-08 06:59:51,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:59:51,456 INFO L471 AbstractCegarLoop]: Abstraction has 19760 states and 29227 transitions. [2025-03-08 06:59:51,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 2 states have internal predecessors, (84), 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-08 06:59:51,457 INFO L276 IsEmpty]: Start isEmpty. Operand 19760 states and 29227 transitions. [2025-03-08 06:59:51,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-08 06:59:51,475 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:59:51,476 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:59:51,482 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-08 06:59:51,676 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-08 06:59:51,678 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:59:51,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:59:51,678 INFO L85 PathProgramCache]: Analyzing trace with hash -1300069716, now seen corresponding path program 1 times [2025-03-08 06:59:51,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:59:51,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688627570] [2025-03-08 06:59:51,679 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:59:51,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:59:51,689 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-08 06:59:51,696 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-08 06:59:51,697 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:59:51,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:59:51,763 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-08 06:59:51,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:59:51,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688627570] [2025-03-08 06:59:51,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688627570] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 06:59:51,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1530713787] [2025-03-08 06:59:51,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:59:51,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:59:51,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:59:51,767 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-08 06:59:51,771 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-08 06:59:51,820 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-08 06:59:51,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-08 06:59:51,859 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:59:51,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:59:51,861 INFO L256 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 06:59:51,865 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 06:59:51,882 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-08 06:59:51,882 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 06:59:51,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1530713787] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:59:51,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 06:59:51,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-08 06:59:51,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903657867] [2025-03-08 06:59:51,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:59:51,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:59:51,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:59:51,884 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:59:51,884 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:59:51,885 INFO L87 Difference]: Start difference. First operand 19760 states and 29227 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-08 06:59:53,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:59:53,091 INFO L93 Difference]: Finished difference Result 53967 states and 79169 transitions. [2025-03-08 06:59:53,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:59:53,092 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 125 [2025-03-08 06:59:53,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:59:53,217 INFO L225 Difference]: With dead ends: 53967 [2025-03-08 06:59:53,218 INFO L226 Difference]: Without dead ends: 36341 [2025-03-08 06:59:53,247 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:59:53,247 INFO L435 NwaCegarLoop]: 4368 mSDtfsCounter, 190 mSDsluCounter, 4173 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 8541 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-08 06:59:53,248 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 8541 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:59:53,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36341 states. [2025-03-08 06:59:54,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36341 to 36341. [2025-03-08 06:59:54,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36341 states, 31256 states have (on average 1.4539608395188124) internal successors, (45445), 31971 states have internal predecessors, (45445), 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-08 06:59:54,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36341 states to 36341 states and 53208 transitions. [2025-03-08 06:59:54,567 INFO L78 Accepts]: Start accepts. Automaton has 36341 states and 53208 transitions. Word has length 125 [2025-03-08 06:59:54,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:59:54,569 INFO L471 AbstractCegarLoop]: Abstraction has 36341 states and 53208 transitions. [2025-03-08 06:59:54,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-08 06:59:54,569 INFO L276 IsEmpty]: Start isEmpty. Operand 36341 states and 53208 transitions. [2025-03-08 06:59:54,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-03-08 06:59:54,648 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:59:54,648 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:59:54,658 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-08 06:59:54,848 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-08 06:59:54,849 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:59:54,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:59:54,849 INFO L85 PathProgramCache]: Analyzing trace with hash -1006525213, now seen corresponding path program 1 times [2025-03-08 06:59:54,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:59:54,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700445584] [2025-03-08 06:59:54,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:59:54,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:59:54,858 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-03-08 06:59:54,862 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-03-08 06:59:54,862 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:59:54,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:59:54,939 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-03-08 06:59:54,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:59:54,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700445584] [2025-03-08 06:59:54,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700445584] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 06:59:54,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1755112358] [2025-03-08 06:59:54,940 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:59:54,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:59:54,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:59:54,942 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-08 06:59:54,943 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-08 06:59:54,994 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-03-08 06:59:55,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-03-08 06:59:55,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:59:55,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:59:55,044 INFO L256 TraceCheckSpWp]: Trace formula consists of 630 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 06:59:55,046 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 06:59:55,131 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-08 06:59:55,132 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 06:59:55,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1755112358] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:59:55,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 06:59:55,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-08 06:59:55,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838525195] [2025-03-08 06:59:55,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:59:55,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:59:55,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:59:55,133 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:59:55,133 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:59:55,134 INFO L87 Difference]: Start difference. First operand 36341 states and 53208 transitions. Second operand has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 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-08 06:59:56,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:59:56,646 INFO L93 Difference]: Finished difference Result 59681 states and 87291 transitions. [2025-03-08 06:59:56,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:59:56,647 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 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 180 [2025-03-08 06:59:56,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:59:56,796 INFO L225 Difference]: With dead ends: 59681 [2025-03-08 06:59:56,796 INFO L226 Difference]: Without dead ends: 32453 [2025-03-08 06:59:56,874 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 180 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-08 06:59:56,875 INFO L435 NwaCegarLoop]: 4171 mSDtfsCounter, 4104 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4104 SdHoareTripleChecker+Valid, 4215 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-08 06:59:56,875 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4104 Valid, 4215 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:59:56,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32453 states. [2025-03-08 06:59:58,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32453 to 25049. [2025-03-08 06:59:58,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25049 states, 21860 states have (on average 1.4274931381518756) internal successors, (31205), 22099 states have internal predecessors, (31205), 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-08 06:59:58,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25049 states to 25049 states and 35560 transitions. [2025-03-08 06:59:58,273 INFO L78 Accepts]: Start accepts. Automaton has 25049 states and 35560 transitions. Word has length 180 [2025-03-08 06:59:58,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:59:58,273 INFO L471 AbstractCegarLoop]: Abstraction has 25049 states and 35560 transitions. [2025-03-08 06:59:58,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 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-08 06:59:58,274 INFO L276 IsEmpty]: Start isEmpty. Operand 25049 states and 35560 transitions. [2025-03-08 06:59:58,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-03-08 06:59:58,306 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:59:58,307 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:59:58,314 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-08 06:59:58,507 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-08 06:59:58,507 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:59:58,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:59:58,509 INFO L85 PathProgramCache]: Analyzing trace with hash 519408482, now seen corresponding path program 1 times [2025-03-08 06:59:58,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:59:58,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753653063] [2025-03-08 06:59:58,510 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:59:58,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:59:58,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-03-08 06:59:58,528 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-03-08 06:59:58,528 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:59:58,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:59:58,610 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-03-08 06:59:58,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:59:58,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753653063] [2025-03-08 06:59:58,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753653063] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 06:59:58,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [60670859] [2025-03-08 06:59:58,612 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:59:58,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:59:58,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:59:58,614 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-08 06:59:58,617 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-08 06:59:58,672 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-03-08 06:59:58,724 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-03-08 06:59:58,724 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:59:58,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:59:58,727 INFO L256 TraceCheckSpWp]: Trace formula consists of 627 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 06:59:58,730 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 06:59:58,798 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-08 06:59:58,798 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 06:59:58,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [60670859] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:59:58,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 06:59:58,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-08 06:59:58,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862796211] [2025-03-08 06:59:58,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:59:58,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:59:58,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:59:58,801 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:59:58,801 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:59:58,802 INFO L87 Difference]: Start difference. First operand 25049 states and 35560 transitions. Second operand has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 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-08 06:59:59,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:59:59,992 INFO L93 Difference]: Finished difference Result 50635 states and 71545 transitions. [2025-03-08 06:59:59,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:59:59,993 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 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 180 [2025-03-08 06:59:59,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:00:00,128 INFO L225 Difference]: With dead ends: 50635 [2025-03-08 07:00:00,129 INFO L226 Difference]: Without dead ends: 27727 [2025-03-08 07:00:00,187 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 180 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-08 07:00:00,188 INFO L435 NwaCegarLoop]: 4169 mSDtfsCounter, 4121 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4121 SdHoareTripleChecker+Valid, 4212 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-08 07:00:00,188 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4121 Valid, 4212 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:00:00,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27727 states. [2025-03-08 07:00:01,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27727 to 27727. [2025-03-08 07:00:01,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27727 states, 24334 states have (on average 1.388304430015616) internal successors, (33783), 24573 states have internal predecessors, (33783), 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-08 07:00:01,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27727 states to 27727 states and 38268 transitions. [2025-03-08 07:00:01,844 INFO L78 Accepts]: Start accepts. Automaton has 27727 states and 38268 transitions. Word has length 180 [2025-03-08 07:00:01,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:00:01,844 INFO L471 AbstractCegarLoop]: Abstraction has 27727 states and 38268 transitions. [2025-03-08 07:00:01,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 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-08 07:00:01,844 INFO L276 IsEmpty]: Start isEmpty. Operand 27727 states and 38268 transitions. [2025-03-08 07:00:01,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-03-08 07:00:01,881 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:00:01,883 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 07:00:01,890 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-08 07:00:02,087 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-08 07:00:02,087 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:00:02,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:00:02,087 INFO L85 PathProgramCache]: Analyzing trace with hash -360586647, now seen corresponding path program 1 times [2025-03-08 07:00:02,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:00:02,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080597212] [2025-03-08 07:00:02,088 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:00:02,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:00:02,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-03-08 07:00:02,103 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-03-08 07:00:02,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:00:02,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:00:02,185 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-03-08 07:00:02,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:00:02,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080597212] [2025-03-08 07:00:02,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080597212] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 07:00:02,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [700362570] [2025-03-08 07:00:02,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:00:02,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 07:00:02,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 07:00:02,188 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-08 07:00:02,190 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-08 07:00:02,243 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-03-08 07:00:02,297 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-03-08 07:00:02,297 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:00:02,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:00:02,300 INFO L256 TraceCheckSpWp]: Trace formula consists of 618 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 07:00:02,303 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 07:00:02,354 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2025-03-08 07:00:02,356 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 07:00:02,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [700362570] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:00:02,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 07:00:02,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-08 07:00:02,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285343432] [2025-03-08 07:00:02,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:00:02,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 07:00:02,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:00:02,357 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 07:00:02,358 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:00:02,358 INFO L87 Difference]: Start difference. First operand 27727 states and 38268 transitions. Second operand has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 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-08 07:00:03,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:00:03,978 INFO L93 Difference]: Finished difference Result 49614 states and 67290 transitions. [2025-03-08 07:00:03,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 07:00:03,979 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 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 180 [2025-03-08 07:00:03,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:00:04,098 INFO L225 Difference]: With dead ends: 49614 [2025-03-08 07:00:04,098 INFO L226 Difference]: Without dead ends: 30171 [2025-03-08 07:00:04,150 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 180 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-08 07:00:04,151 INFO L435 NwaCegarLoop]: 4226 mSDtfsCounter, 4111 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4111 SdHoareTripleChecker+Valid, 4425 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-08 07:00:04,151 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4111 Valid, 4425 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:00:04,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30171 states. [2025-03-08 07:00:05,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30171 to 30007. [2025-03-08 07:00:05,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30007 states, 26470 states have (on average 1.3618058179070647) internal successors, (36047), 26709 states have internal predecessors, (36047), 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-08 07:00:05,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30007 states to 30007 states and 40704 transitions. [2025-03-08 07:00:05,746 INFO L78 Accepts]: Start accepts. Automaton has 30007 states and 40704 transitions. Word has length 180 [2025-03-08 07:00:05,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:00:05,746 INFO L471 AbstractCegarLoop]: Abstraction has 30007 states and 40704 transitions. [2025-03-08 07:00:05,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 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-08 07:00:05,747 INFO L276 IsEmpty]: Start isEmpty. Operand 30007 states and 40704 transitions. [2025-03-08 07:00:05,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2025-03-08 07:00:05,788 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:00:05,788 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 07:00:05,795 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-08 07:00:05,989 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-08 07:00:05,990 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:00:05,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:00:05,991 INFO L85 PathProgramCache]: Analyzing trace with hash -919246193, now seen corresponding path program 1 times [2025-03-08 07:00:05,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:00:05,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665670314] [2025-03-08 07:00:05,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:00:05,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:00:06,008 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-03-08 07:00:06,013 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-03-08 07:00:06,013 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:00:06,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:00:06,114 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-03-08 07:00:06,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:00:06,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665670314] [2025-03-08 07:00:06,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665670314] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 07:00:06,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [116139591] [2025-03-08 07:00:06,114 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:00:06,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 07:00:06,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 07:00:06,118 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-08 07:00:06,130 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-08 07:00:06,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-03-08 07:00:06,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-03-08 07:00:06,287 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:00:06,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:00:06,293 INFO L256 TraceCheckSpWp]: Trace formula consists of 619 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 07:00:06,295 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 07:00:06,330 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-08 07:00:06,330 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 07:00:06,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [116139591] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:00:06,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 07:00:06,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-08 07:00:06,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936301341] [2025-03-08 07:00:06,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:00:06,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 07:00:06,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:00:06,332 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 07:00:06,332 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:00:06,332 INFO L87 Difference]: Start difference. First operand 30007 states and 40704 transitions. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 3 states have call successors, (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-08 07:00:08,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:00:08,137 INFO L93 Difference]: Finished difference Result 82235 states and 110830 transitions. [2025-03-08 07:00:08,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 07:00:08,137 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 3 states have call successors, (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 181 [2025-03-08 07:00:08,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:00:08,327 INFO L225 Difference]: With dead ends: 82235 [2025-03-08 07:00:08,328 INFO L226 Difference]: Without dead ends: 54369 [2025-03-08 07:00:08,376 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 181 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-08 07:00:08,377 INFO L435 NwaCegarLoop]: 4359 mSDtfsCounter, 172 mSDsluCounter, 4167 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 8526 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-08 07:00:08,378 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 8526 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:00:08,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54369 states. [2025-03-08 07:00:11,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54369 to 54367. [2025-03-08 07:00:11,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54367 states, 47616 states have (on average 1.3366305443548387) internal successors, (63645), 48093 states have internal predecessors, (63645), 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-08 07:00:11,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54367 states to 54367 states and 73596 transitions. [2025-03-08 07:00:11,419 INFO L78 Accepts]: Start accepts. Automaton has 54367 states and 73596 transitions. Word has length 181 [2025-03-08 07:00:11,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:00:11,419 INFO L471 AbstractCegarLoop]: Abstraction has 54367 states and 73596 transitions. [2025-03-08 07:00:11,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 3 states have call successors, (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-08 07:00:11,420 INFO L276 IsEmpty]: Start isEmpty. Operand 54367 states and 73596 transitions. [2025-03-08 07:00:11,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2025-03-08 07:00:11,701 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:00:11,701 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, 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] [2025-03-08 07:00:11,709 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-08 07:00:11,902 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-08 07:00:11,902 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:00:11,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:00:11,903 INFO L85 PathProgramCache]: Analyzing trace with hash -1744285188, now seen corresponding path program 1 times [2025-03-08 07:00:11,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:00:11,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233916426] [2025-03-08 07:00:11,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:00:11,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:00:11,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-03-08 07:00:11,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-03-08 07:00:11,913 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:00:11,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:00:11,959 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2025-03-08 07:00:11,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:00:11,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233916426] [2025-03-08 07:00:11,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233916426] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 07:00:11,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [469500082] [2025-03-08 07:00:11,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:00:11,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 07:00:11,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 07:00:11,962 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-08 07:00:11,965 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-08 07:00:12,014 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-03-08 07:00:12,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-03-08 07:00:12,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:00:12,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:00:12,061 INFO L256 TraceCheckSpWp]: Trace formula consists of 621 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 07:00:12,065 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 07:00:12,105 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2025-03-08 07:00:12,105 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 07:00:12,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [469500082] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:00:12,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 07:00:12,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-08 07:00:12,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630425713] [2025-03-08 07:00:12,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:00:12,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 07:00:12,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:00:12,107 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 07:00:12,107 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:00:12,107 INFO L87 Difference]: Start difference. First operand 54367 states and 73596 transitions. Second operand has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 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-08 07:00:13,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:00:13,905 INFO L93 Difference]: Finished difference Result 110473 states and 150473 transitions. [2025-03-08 07:00:13,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 07:00:13,906 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 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 182 [2025-03-08 07:00:13,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:00:14,148 INFO L225 Difference]: With dead ends: 110473 [2025-03-08 07:00:14,149 INFO L226 Difference]: Without dead ends: 58255 [2025-03-08 07:00:14,279 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 182 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-08 07:00:14,280 INFO L435 NwaCegarLoop]: 4177 mSDtfsCounter, 4131 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4131 SdHoareTripleChecker+Valid, 4219 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-08 07:00:14,280 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4131 Valid, 4219 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:00:14,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58255 states. [2025-03-08 07:00:17,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58255 to 54367. [2025-03-08 07:00:17,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54367 states, 47616 states have (on average 1.3161332325268817) internal successors, (62669), 48093 states have internal predecessors, (62669), 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-08 07:00:17,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54367 states to 54367 states and 72272 transitions. [2025-03-08 07:00:17,633 INFO L78 Accepts]: Start accepts. Automaton has 54367 states and 72272 transitions. Word has length 182 [2025-03-08 07:00:17,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:00:17,633 INFO L471 AbstractCegarLoop]: Abstraction has 54367 states and 72272 transitions. [2025-03-08 07:00:17,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 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-08 07:00:17,634 INFO L276 IsEmpty]: Start isEmpty. Operand 54367 states and 72272 transitions. [2025-03-08 07:00:17,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2025-03-08 07:00:17,700 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:00:17,701 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 07:00:17,708 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-08 07:00:17,901 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-08 07:00:17,901 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:00:17,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:00:17,902 INFO L85 PathProgramCache]: Analyzing trace with hash -513952832, now seen corresponding path program 1 times [2025-03-08 07:00:17,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:00:17,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178413167] [2025-03-08 07:00:17,902 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:00:17,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:00:17,915 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-03-08 07:00:17,920 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-03-08 07:00:17,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:00:17,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:00:17,987 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2025-03-08 07:00:17,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:00:17,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178413167] [2025-03-08 07:00:17,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178413167] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 07:00:17,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1328275357] [2025-03-08 07:00:17,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:00:17,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 07:00:17,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 07:00:17,989 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-08 07:00:17,991 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-08 07:00:18,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-03-08 07:00:18,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-03-08 07:00:18,096 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:00:18,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:00:18,098 INFO L256 TraceCheckSpWp]: Trace formula consists of 615 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 07:00:18,101 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 07:00:18,119 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-03-08 07:00:18,121 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 07:00:18,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1328275357] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:00:18,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 07:00:18,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-08 07:00:18,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422514704] [2025-03-08 07:00:18,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:00:18,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 07:00:18,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:00:18,123 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 07:00:18,123 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:00:18,123 INFO L87 Difference]: Start difference. First operand 54367 states and 72272 transitions. Second operand has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 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) [2025-03-08 07:00:21,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:00:21,474 INFO L93 Difference]: Finished difference Result 156567 states and 208328 transitions. [2025-03-08 07:00:21,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 07:00:21,474 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 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) Word has length 182 [2025-03-08 07:00:21,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:00:21,872 INFO L225 Difference]: With dead ends: 156567 [2025-03-08 07:00:21,873 INFO L226 Difference]: Without dead ends: 104349 [2025-03-08 07:00:21,994 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 182 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-08 07:00:21,994 INFO L435 NwaCegarLoop]: 4356 mSDtfsCounter, 182 mSDsluCounter, 4163 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 8519 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 07:00:21,994 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 8519 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:00:22,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104349 states. [2025-03-08 07:00:25,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104349 to 104347. [2025-03-08 07:00:25,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104347 states, 91184 states have (on average 1.2945363221617827) internal successors, (118041), 92137 states have internal predecessors, (118041), 7033 states have call successors, (7033), 5360 states have call predecessors, (7033), 6128 states have return successors, (13948), 6881 states have call predecessors, (13948), 7033 states have call successors, (13948) [2025-03-08 07:00:26,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104347 states to 104347 states and 139022 transitions. [2025-03-08 07:00:26,180 INFO L78 Accepts]: Start accepts. Automaton has 104347 states and 139022 transitions. Word has length 182 [2025-03-08 07:00:26,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:00:26,180 INFO L471 AbstractCegarLoop]: Abstraction has 104347 states and 139022 transitions. [2025-03-08 07:00:26,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 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) [2025-03-08 07:00:26,180 INFO L276 IsEmpty]: Start isEmpty. Operand 104347 states and 139022 transitions. [2025-03-08 07:00:26,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2025-03-08 07:00:26,299 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:00:26,299 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, 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] [2025-03-08 07:00:26,305 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-08 07:00:26,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-08 07:00:26,500 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:00:26,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:00:26,500 INFO L85 PathProgramCache]: Analyzing trace with hash 50948808, now seen corresponding path program 1 times [2025-03-08 07:00:26,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:00:26,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470682809] [2025-03-08 07:00:26,500 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:00:26,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:00:26,506 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-03-08 07:00:26,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-03-08 07:00:26,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:00:26,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:00:26,555 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2025-03-08 07:00:26,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:00:26,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470682809] [2025-03-08 07:00:26,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470682809] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 07:00:26,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [154740610] [2025-03-08 07:00:26,556 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:00:26,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 07:00:26,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 07:00:26,558 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 07:00:26,560 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-08 07:00:26,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-03-08 07:00:26,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-03-08 07:00:26,663 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:00:26,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:00:26,665 INFO L256 TraceCheckSpWp]: Trace formula consists of 618 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 07:00:26,668 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 07:00:26,757 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-08 07:00:26,757 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 07:00:26,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [154740610] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:00:26,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 07:00:26,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-08 07:00:26,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238320083] [2025-03-08 07:00:26,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:00:26,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 07:00:26,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:00:26,759 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 07:00:26,760 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:00:26,760 INFO L87 Difference]: Start difference. First operand 104347 states and 139022 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, (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)