./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.11.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.11.cil-1.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ecd70163e84c8e1a236d7543bf55ca7587f7becacb8c522f7caae4b1076f13b5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 17:55:10,726 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 17:55:10,762 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 17:55:10,765 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 17:55:10,765 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 17:55:10,779 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 17:55:10,780 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 17:55:10,780 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 17:55:10,780 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 17:55:10,780 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 17:55:10,780 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 17:55:10,780 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 17:55:10,780 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 17:55:10,781 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 17:55:10,781 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 17:55:10,781 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 17:55:10,781 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 17:55:10,781 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 17:55:10,781 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 17:55:10,781 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 17:55:10,781 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 17:55:10,781 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 17:55:10,781 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 17:55:10,781 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 17:55:10,781 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 17:55:10,781 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 17:55:10,781 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 17:55:10,781 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 17:55:10,781 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 17:55:10,781 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 17:55:10,781 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 17:55:10,782 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 17:55:10,782 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 17:55:10,782 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 17:55:10,782 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 17:55:10,782 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 17:55:10,782 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 17:55:10,782 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 17:55:10,782 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 17:55:10,782 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 17:55:10,782 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 17:55:10,782 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 17:55:10,782 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 17:55:10,782 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ecd70163e84c8e1a236d7543bf55ca7587f7becacb8c522f7caae4b1076f13b5 [2025-02-05 17:55:11,019 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 17:55:11,028 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 17:55:11,030 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 17:55:11,031 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 17:55:11,031 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 17:55:11,033 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.11.cil-1.c [2025-02-05 17:55:12,191 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e4ea99de2/dae740bce2de4f66b08b79a9de199fbe/FLAG9ef99d411 [2025-02-05 17:55:12,534 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 17:55:12,534 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.11.cil-1.c [2025-02-05 17:55:12,558 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e4ea99de2/dae740bce2de4f66b08b79a9de199fbe/FLAG9ef99d411 [2025-02-05 17:55:12,791 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e4ea99de2/dae740bce2de4f66b08b79a9de199fbe [2025-02-05 17:55:12,800 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 17:55:12,805 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 17:55:12,807 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 17:55:12,807 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 17:55:12,810 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 17:55:12,811 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 05:55:12" (1/1) ... [2025-02-05 17:55:12,812 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f2b0628 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:55:12, skipping insertion in model container [2025-02-05 17:55:12,812 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 05:55:12" (1/1) ... [2025-02-05 17:55:12,839 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 17:55:12,950 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.11.cil-1.c[914,927] [2025-02-05 17:55:12,985 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.11.cil-1.c[7115,7128] [2025-02-05 17:55:13,046 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 17:55:13,054 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 17:55:13,062 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.11.cil-1.c[914,927] [2025-02-05 17:55:13,073 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.11.cil-1.c[7115,7128] [2025-02-05 17:55:13,110 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 17:55:13,125 INFO L204 MainTranslator]: Completed translation [2025-02-05 17:55:13,125 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:55:13 WrapperNode [2025-02-05 17:55:13,126 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 17:55:13,126 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 17:55:13,126 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 17:55:13,127 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 17:55:13,130 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:55:13" (1/1) ... [2025-02-05 17:55:13,139 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:55:13" (1/1) ... [2025-02-05 17:55:13,168 INFO L138 Inliner]: procedures = 75, calls = 91, calls flagged for inlining = 43, calls inlined = 43, statements flattened = 960 [2025-02-05 17:55:13,168 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 17:55:13,169 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 17:55:13,169 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 17:55:13,169 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 17:55:13,177 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:55:13" (1/1) ... [2025-02-05 17:55:13,177 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:55:13" (1/1) ... [2025-02-05 17:55:13,180 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:55:13" (1/1) ... [2025-02-05 17:55:13,194 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-05 17:55:13,194 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:55:13" (1/1) ... [2025-02-05 17:55:13,194 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:55:13" (1/1) ... [2025-02-05 17:55:13,207 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:55:13" (1/1) ... [2025-02-05 17:55:13,208 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:55:13" (1/1) ... [2025-02-05 17:55:13,210 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:55:13" (1/1) ... [2025-02-05 17:55:13,211 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:55:13" (1/1) ... [2025-02-05 17:55:13,213 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 17:55:13,214 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 17:55:13,214 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 17:55:13,214 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 17:55:13,215 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:55:13" (1/1) ... [2025-02-05 17:55:13,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 17:55:13,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:55:13,246 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 17:55:13,250 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 17:55:13,268 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 17:55:13,269 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-02-05 17:55:13,269 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-02-05 17:55:13,269 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2025-02-05 17:55:13,269 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2025-02-05 17:55:13,269 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2025-02-05 17:55:13,269 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2025-02-05 17:55:13,269 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2025-02-05 17:55:13,269 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2025-02-05 17:55:13,269 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2025-02-05 17:55:13,270 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2025-02-05 17:55:13,270 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2025-02-05 17:55:13,270 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2025-02-05 17:55:13,270 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2025-02-05 17:55:13,270 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2025-02-05 17:55:13,270 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2025-02-05 17:55:13,270 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2025-02-05 17:55:13,270 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2025-02-05 17:55:13,270 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2025-02-05 17:55:13,270 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2025-02-05 17:55:13,271 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2025-02-05 17:55:13,271 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2025-02-05 17:55:13,271 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2025-02-05 17:55:13,271 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 17:55:13,271 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2025-02-05 17:55:13,271 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2025-02-05 17:55:13,271 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2025-02-05 17:55:13,271 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2025-02-05 17:55:13,272 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 17:55:13,272 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 17:55:13,272 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2025-02-05 17:55:13,272 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2025-02-05 17:55:13,272 INFO L130 BoogieDeclarations]: Found specification of procedure error2 [2025-02-05 17:55:13,272 INFO L138 BoogieDeclarations]: Found implementation of procedure error2 [2025-02-05 17:55:13,381 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 17:55:13,384 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 17:55:14,158 INFO L? ?]: Removed 125 outVars from TransFormulas that were not future-live. [2025-02-05 17:55:14,158 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 17:55:14,171 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 17:55:14,171 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 17:55:14,171 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 05:55:14 BoogieIcfgContainer [2025-02-05 17:55:14,172 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 17:55:14,173 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 17:55:14,173 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 17:55:14,176 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 17:55:14,177 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 05:55:12" (1/3) ... [2025-02-05 17:55:14,177 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66d66314 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 05:55:14, skipping insertion in model container [2025-02-05 17:55:14,177 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:55:13" (2/3) ... [2025-02-05 17:55:14,177 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66d66314 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 05:55:14, skipping insertion in model container [2025-02-05 17:55:14,177 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 05:55:14" (3/3) ... [2025-02-05 17:55:14,178 INFO L128 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-1+token_ring.11.cil-1.c [2025-02-05 17:55:14,188 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 17:55:14,189 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pc_sfifo_2.cil-1+token_ring.11.cil-1.c that has 16 procedures, 492 locations, 1 initial locations, 18 loop locations, and 2 error locations. [2025-02-05 17:55:14,232 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 17:55:14,239 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;@5d08b5e5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 17:55:14,239 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-02-05 17:55:14,243 INFO L276 IsEmpty]: Start isEmpty. Operand has 493 states, 433 states have (on average 1.5612009237875288) internal successors, (676), 442 states have internal predecessors, (676), 41 states have call successors, (41), 15 states have call predecessors, (41), 15 states have return successors, (41), 39 states have call predecessors, (41), 41 states have call successors, (41) [2025-02-05 17:55:14,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-02-05 17:55:14,249 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:55:14,250 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] [2025-02-05 17:55:14,250 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:55:14,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:55:14,254 INFO L85 PathProgramCache]: Analyzing trace with hash -1687019346, now seen corresponding path program 1 times [2025-02-05 17:55:14,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:55:14,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114444148] [2025-02-05 17:55:14,259 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:55:14,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:55:14,315 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-02-05 17:55:14,333 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-02-05 17:55:14,334 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:55:14,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:55:14,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:55:14,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:55:14,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114444148] [2025-02-05 17:55:14,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114444148] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:55:14,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:55:14,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:55:14,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258592935] [2025-02-05 17:55:14,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:55:14,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:55:14,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:55:14,471 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:55:14,472 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:55:14,474 INFO L87 Difference]: Start difference. First operand has 493 states, 433 states have (on average 1.5612009237875288) internal successors, (676), 442 states have internal predecessors, (676), 41 states have call successors, (41), 15 states have call predecessors, (41), 15 states have return successors, (41), 39 states have call predecessors, (41), 41 states have call successors, (41) Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-02-05 17:55:14,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:55:14,558 INFO L93 Difference]: Finished difference Result 959 states and 1471 transitions. [2025-02-05 17:55:14,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:55:14,564 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2025-02-05 17:55:14,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:55:14,575 INFO L225 Difference]: With dead ends: 959 [2025-02-05 17:55:14,578 INFO L226 Difference]: Without dead ends: 481 [2025-02-05 17:55:14,585 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:55:14,589 INFO L435 NwaCegarLoop]: 730 mSDtfsCounter, 133 mSDsluCounter, 595 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 1325 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:55:14,592 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 1325 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:55:14,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2025-02-05 17:55:14,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 481. [2025-02-05 17:55:14,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 481 states, 425 states have (on average 1.515294117647059) internal successors, (644), 430 states have internal predecessors, (644), 41 states have call successors, (41), 15 states have call predecessors, (41), 13 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2025-02-05 17:55:14,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 722 transitions. [2025-02-05 17:55:14,651 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 722 transitions. Word has length 65 [2025-02-05 17:55:14,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:55:14,652 INFO L471 AbstractCegarLoop]: Abstraction has 481 states and 722 transitions. [2025-02-05 17:55:14,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-02-05 17:55:14,652 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 722 transitions. [2025-02-05 17:55:14,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-02-05 17:55:14,657 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:55:14,657 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] [2025-02-05 17:55:14,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 17:55:14,658 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:55:14,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:55:14,658 INFO L85 PathProgramCache]: Analyzing trace with hash -1707356721, now seen corresponding path program 1 times [2025-02-05 17:55:14,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:55:14,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263951531] [2025-02-05 17:55:14,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:55:14,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:55:14,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-02-05 17:55:14,686 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-02-05 17:55:14,687 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:55:14,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:55:14,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:55:14,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:55:14,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263951531] [2025-02-05 17:55:14,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263951531] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:55:14,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:55:14,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:55:14,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649001055] [2025-02-05 17:55:14,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:55:14,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:55:14,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:55:14,923 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:55:14,923 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:55:14,923 INFO L87 Difference]: Start difference. First operand 481 states and 722 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-02-05 17:55:15,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:55:15,650 INFO L93 Difference]: Finished difference Result 676 states and 992 transitions. [2025-02-05 17:55:15,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 17:55:15,650 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2025-02-05 17:55:15,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:55:15,655 INFO L225 Difference]: With dead ends: 676 [2025-02-05 17:55:15,655 INFO L226 Difference]: Without dead ends: 586 [2025-02-05 17:55:15,656 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 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-02-05 17:55:15,656 INFO L435 NwaCegarLoop]: 437 mSDtfsCounter, 456 mSDsluCounter, 1124 mSDsCounter, 0 mSdLazyCounter, 1036 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 463 SdHoareTripleChecker+Valid, 1561 SdHoareTripleChecker+Invalid, 1096 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 1036 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 17:55:15,656 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [463 Valid, 1561 Invalid, 1096 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 1036 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 17:55:15,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2025-02-05 17:55:15,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 579. [2025-02-05 17:55:15,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 579 states, 503 states have (on average 1.489065606361829) internal successors, (749), 510 states have internal predecessors, (749), 52 states have call successors, (52), 22 states have call predecessors, (52), 22 states have return successors, (53), 49 states have call predecessors, (53), 48 states have call successors, (53) [2025-02-05 17:55:15,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 854 transitions. [2025-02-05 17:55:15,696 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 854 transitions. Word has length 65 [2025-02-05 17:55:15,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:55:15,697 INFO L471 AbstractCegarLoop]: Abstraction has 579 states and 854 transitions. [2025-02-05 17:55:15,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-02-05 17:55:15,697 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 854 transitions. [2025-02-05 17:55:15,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-02-05 17:55:15,699 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:55:15,699 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] [2025-02-05 17:55:15,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 17:55:15,699 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:55:15,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:55:15,700 INFO L85 PathProgramCache]: Analyzing trace with hash 1152270604, now seen corresponding path program 1 times [2025-02-05 17:55:15,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:55:15,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318185228] [2025-02-05 17:55:15,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:55:15,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:55:15,707 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-02-05 17:55:15,737 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-02-05 17:55:15,738 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:55:15,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:55:15,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:55:15,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:55:15,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318185228] [2025-02-05 17:55:15,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318185228] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:55:15,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:55:15,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:55:15,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683309648] [2025-02-05 17:55:15,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:55:15,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:55:15,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:55:15,896 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:55:15,896 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:55:15,896 INFO L87 Difference]: Start difference. First operand 579 states and 854 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-02-05 17:55:16,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:55:16,599 INFO L93 Difference]: Finished difference Result 902 states and 1287 transitions. [2025-02-05 17:55:16,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:55:16,600 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2025-02-05 17:55:16,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:55:16,603 INFO L225 Difference]: With dead ends: 902 [2025-02-05 17:55:16,603 INFO L226 Difference]: Without dead ends: 721 [2025-02-05 17:55:16,604 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 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-02-05 17:55:16,604 INFO L435 NwaCegarLoop]: 470 mSDtfsCounter, 1054 mSDsluCounter, 1319 mSDsCounter, 0 mSdLazyCounter, 1272 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1086 SdHoareTripleChecker+Valid, 1789 SdHoareTripleChecker+Invalid, 1341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 1272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 17:55:16,604 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1086 Valid, 1789 Invalid, 1341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 1272 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 17:55:16,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 721 states. [2025-02-05 17:55:16,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 721 to 677. [2025-02-05 17:55:16,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 677 states, 581 states have (on average 1.46815834767642) internal successors, (853), 590 states have internal predecessors, (853), 63 states have call successors, (63), 29 states have call predecessors, (63), 31 states have return successors, (72), 61 states have call predecessors, (72), 59 states have call successors, (72) [2025-02-05 17:55:16,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 677 states to 677 states and 988 transitions. [2025-02-05 17:55:16,634 INFO L78 Accepts]: Start accepts. Automaton has 677 states and 988 transitions. Word has length 65 [2025-02-05 17:55:16,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:55:16,635 INFO L471 AbstractCegarLoop]: Abstraction has 677 states and 988 transitions. [2025-02-05 17:55:16,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-02-05 17:55:16,635 INFO L276 IsEmpty]: Start isEmpty. Operand 677 states and 988 transitions. [2025-02-05 17:55:16,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-02-05 17:55:16,636 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:55:16,636 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] [2025-02-05 17:55:16,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 17:55:16,636 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:55:16,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:55:16,637 INFO L85 PathProgramCache]: Analyzing trace with hash -2009506099, now seen corresponding path program 1 times [2025-02-05 17:55:16,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:55:16,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380772973] [2025-02-05 17:55:16,637 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:55:16,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:55:16,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-02-05 17:55:16,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-02-05 17:55:16,654 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:55:16,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:55:16,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:55:16,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:55:16,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380772973] [2025-02-05 17:55:16,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380772973] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:55:16,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:55:16,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:55:16,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738909663] [2025-02-05 17:55:16,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:55:16,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:55:16,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:55:16,740 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:55:16,740 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:55:16,740 INFO L87 Difference]: Start difference. First operand 677 states and 988 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-05 17:55:16,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:55:16,798 INFO L93 Difference]: Finished difference Result 955 states and 1364 transitions. [2025-02-05 17:55:16,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 17:55:16,799 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 65 [2025-02-05 17:55:16,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:55:16,803 INFO L225 Difference]: With dead ends: 955 [2025-02-05 17:55:16,804 INFO L226 Difference]: Without dead ends: 682 [2025-02-05 17:55:16,805 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-02-05 17:55:16,806 INFO L435 NwaCegarLoop]: 719 mSDtfsCounter, 0 mSDsluCounter, 2871 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3590 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:55:16,807 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3590 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:55:16,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 682 states. [2025-02-05 17:55:16,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 682 to 682. [2025-02-05 17:55:16,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 682 states, 585 states have (on average 1.4615384615384615) internal successors, (855), 594 states have internal predecessors, (855), 63 states have call successors, (63), 29 states have call predecessors, (63), 32 states have return successors, (73), 62 states have call predecessors, (73), 59 states have call successors, (73) [2025-02-05 17:55:16,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 682 states and 991 transitions. [2025-02-05 17:55:16,847 INFO L78 Accepts]: Start accepts. Automaton has 682 states and 991 transitions. Word has length 65 [2025-02-05 17:55:16,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:55:16,848 INFO L471 AbstractCegarLoop]: Abstraction has 682 states and 991 transitions. [2025-02-05 17:55:16,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-05 17:55:16,848 INFO L276 IsEmpty]: Start isEmpty. Operand 682 states and 991 transitions. [2025-02-05 17:55:16,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-02-05 17:55:16,849 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:55:16,849 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] [2025-02-05 17:55:16,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 17:55:16,850 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:55:16,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:55:16,850 INFO L85 PathProgramCache]: Analyzing trace with hash -376702100, now seen corresponding path program 1 times [2025-02-05 17:55:16,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:55:16,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077718146] [2025-02-05 17:55:16,850 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:55:16,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:55:16,859 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-02-05 17:55:16,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-02-05 17:55:16,867 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:55:16,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:55:16,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:55:17,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:55:17,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077718146] [2025-02-05 17:55:17,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077718146] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:55:17,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:55:17,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 17:55:17,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488466640] [2025-02-05 17:55:17,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:55:17,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 17:55:17,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:55:17,002 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 17:55:17,002 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-05 17:55:17,003 INFO L87 Difference]: Start difference. First operand 682 states and 991 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 7 states have internal predecessors, (50), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2025-02-05 17:55:18,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:55:18,187 INFO L93 Difference]: Finished difference Result 1950 states and 2695 transitions. [2025-02-05 17:55:18,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-05 17:55:18,189 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 7 states have internal predecessors, (50), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 65 [2025-02-05 17:55:18,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:55:18,198 INFO L225 Difference]: With dead ends: 1950 [2025-02-05 17:55:18,198 INFO L226 Difference]: Without dead ends: 1654 [2025-02-05 17:55:18,199 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=292, Unknown=0, NotChecked=0, Total=380 [2025-02-05 17:55:18,200 INFO L435 NwaCegarLoop]: 473 mSDtfsCounter, 3099 mSDsluCounter, 1484 mSDsCounter, 0 mSdLazyCounter, 1397 mSolverCounterSat, 454 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3113 SdHoareTripleChecker+Valid, 1957 SdHoareTripleChecker+Invalid, 1851 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 454 IncrementalHoareTripleChecker+Valid, 1397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:55:18,200 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3113 Valid, 1957 Invalid, 1851 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [454 Valid, 1397 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-05 17:55:18,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1654 states. [2025-02-05 17:55:18,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1654 to 1600. [2025-02-05 17:55:18,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1600 states, 1317 states have (on average 1.3659832953682611) internal successors, (1799), 1341 states have internal predecessors, (1799), 151 states have call successors, (151), 112 states have call predecessors, (151), 130 states have return successors, (187), 149 states have call predecessors, (187), 147 states have call successors, (187) [2025-02-05 17:55:18,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1600 states to 1600 states and 2137 transitions. [2025-02-05 17:55:18,277 INFO L78 Accepts]: Start accepts. Automaton has 1600 states and 2137 transitions. Word has length 65 [2025-02-05 17:55:18,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:55:18,277 INFO L471 AbstractCegarLoop]: Abstraction has 1600 states and 2137 transitions. [2025-02-05 17:55:18,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 7 states have internal predecessors, (50), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2025-02-05 17:55:18,278 INFO L276 IsEmpty]: Start isEmpty. Operand 1600 states and 2137 transitions. [2025-02-05 17:55:18,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-02-05 17:55:18,278 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:55:18,278 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] [2025-02-05 17:55:18,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 17:55:18,279 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:55:18,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:55:18,279 INFO L85 PathProgramCache]: Analyzing trace with hash -286206710, now seen corresponding path program 1 times [2025-02-05 17:55:18,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:55:18,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565903859] [2025-02-05 17:55:18,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:55:18,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:55:18,285 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-02-05 17:55:18,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-02-05 17:55:18,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:55:18,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:55:18,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:55:18,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:55:18,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565903859] [2025-02-05 17:55:18,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565903859] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:55:18,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:55:18,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:55:18,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773432749] [2025-02-05 17:55:18,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:55:18,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:55:18,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:55:18,333 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:55:18,333 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:55:18,334 INFO L87 Difference]: Start difference. First operand 1600 states and 2137 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-05 17:55:18,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:55:18,416 INFO L93 Difference]: Finished difference Result 2838 states and 3721 transitions. [2025-02-05 17:55:18,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 17:55:18,417 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 66 [2025-02-05 17:55:18,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:55:18,423 INFO L225 Difference]: With dead ends: 2838 [2025-02-05 17:55:18,423 INFO L226 Difference]: Without dead ends: 1630 [2025-02-05 17:55:18,426 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-02-05 17:55:18,426 INFO L435 NwaCegarLoop]: 719 mSDtfsCounter, 0 mSDsluCounter, 2871 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3590 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:55:18,426 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3590 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:55:18,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1630 states. [2025-02-05 17:55:18,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1630 to 1630. [2025-02-05 17:55:18,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1630 states, 1341 states have (on average 1.3534675615212528) internal successors, (1815), 1365 states have internal predecessors, (1815), 151 states have call successors, (151), 112 states have call predecessors, (151), 136 states have return successors, (193), 155 states have call predecessors, (193), 147 states have call successors, (193) [2025-02-05 17:55:18,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1630 states to 1630 states and 2159 transitions. [2025-02-05 17:55:18,564 INFO L78 Accepts]: Start accepts. Automaton has 1630 states and 2159 transitions. Word has length 66 [2025-02-05 17:55:18,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:55:18,568 INFO L471 AbstractCegarLoop]: Abstraction has 1630 states and 2159 transitions. [2025-02-05 17:55:18,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-05 17:55:18,568 INFO L276 IsEmpty]: Start isEmpty. Operand 1630 states and 2159 transitions. [2025-02-05 17:55:18,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-02-05 17:55:18,569 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:55:18,569 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] [2025-02-05 17:55:18,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 17:55:18,569 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:55:18,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:55:18,569 INFO L85 PathProgramCache]: Analyzing trace with hash -274890583, now seen corresponding path program 1 times [2025-02-05 17:55:18,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:55:18,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112724544] [2025-02-05 17:55:18,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:55:18,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:55:18,583 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-02-05 17:55:18,590 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-02-05 17:55:18,593 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:55:18,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:55:18,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:55:18,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:55:18,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112724544] [2025-02-05 17:55:18,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112724544] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:55:18,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:55:18,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:55:18,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961202836] [2025-02-05 17:55:18,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:55:18,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:55:18,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:55:18,732 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:55:18,732 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:55:18,733 INFO L87 Difference]: Start difference. First operand 1630 states and 2159 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-02-05 17:55:19,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:55:19,489 INFO L93 Difference]: Finished difference Result 2862 states and 3662 transitions. [2025-02-05 17:55:19,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-05 17:55:19,490 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 66 [2025-02-05 17:55:19,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:55:19,497 INFO L225 Difference]: With dead ends: 2862 [2025-02-05 17:55:19,498 INFO L226 Difference]: Without dead ends: 1852 [2025-02-05 17:55:19,500 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-02-05 17:55:19,500 INFO L435 NwaCegarLoop]: 410 mSDtfsCounter, 1039 mSDsluCounter, 1166 mSDsCounter, 0 mSdLazyCounter, 1261 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1068 SdHoareTripleChecker+Valid, 1576 SdHoareTripleChecker+Invalid, 1336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 1261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 17:55:19,500 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1068 Valid, 1576 Invalid, 1336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 1261 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 17:55:19,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1852 states. [2025-02-05 17:55:19,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1852 to 1571. [2025-02-05 17:55:19,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1571 states, 1298 states have (on average 1.3513097072419107) internal successors, (1754), 1317 states have internal predecessors, (1754), 145 states have call successors, (145), 107 states have call predecessors, (145), 126 states have return successors, (178), 148 states have call predecessors, (178), 141 states have call successors, (178) [2025-02-05 17:55:19,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 2077 transitions. [2025-02-05 17:55:19,594 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 2077 transitions. Word has length 66 [2025-02-05 17:55:19,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:55:19,594 INFO L471 AbstractCegarLoop]: Abstraction has 1571 states and 2077 transitions. [2025-02-05 17:55:19,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-02-05 17:55:19,595 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 2077 transitions. [2025-02-05 17:55:19,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-02-05 17:55:19,595 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:55:19,595 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] [2025-02-05 17:55:19,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 17:55:19,596 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:55:19,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:55:19,596 INFO L85 PathProgramCache]: Analyzing trace with hash 1942867370, now seen corresponding path program 1 times [2025-02-05 17:55:19,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:55:19,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818957548] [2025-02-05 17:55:19,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:55:19,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:55:19,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-02-05 17:55:19,611 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-02-05 17:55:19,612 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:55:19,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:55:19,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:55:19,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:55:19,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818957548] [2025-02-05 17:55:19,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818957548] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:55:19,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:55:19,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 17:55:19,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502959261] [2025-02-05 17:55:19,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:55:19,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 17:55:19,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:55:19,657 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 17:55:19,658 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 17:55:19,658 INFO L87 Difference]: Start difference. First operand 1571 states and 2077 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-02-05 17:55:20,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:55:20,129 INFO L93 Difference]: Finished difference Result 3817 states and 4911 transitions. [2025-02-05 17:55:20,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 17:55:20,130 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 66 [2025-02-05 17:55:20,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:55:20,140 INFO L225 Difference]: With dead ends: 3817 [2025-02-05 17:55:20,140 INFO L226 Difference]: Without dead ends: 2639 [2025-02-05 17:55:20,143 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:55:20,144 INFO L435 NwaCegarLoop]: 403 mSDtfsCounter, 998 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 432 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1028 SdHoareTripleChecker+Valid, 806 SdHoareTripleChecker+Invalid, 496 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 17:55:20,144 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1028 Valid, 806 Invalid, 496 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 432 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 17:55:20,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2639 states. [2025-02-05 17:55:20,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2639 to 2635. [2025-02-05 17:55:20,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2635 states, 2122 states have (on average 1.2954759660697455) internal successors, (2749), 2157 states have internal predecessors, (2749), 261 states have call successors, (261), 206 states have call predecessors, (261), 250 states have return successors, (366), 273 states have call predecessors, (366), 257 states have call successors, (366) [2025-02-05 17:55:20,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2635 states to 2635 states and 3376 transitions. [2025-02-05 17:55:20,276 INFO L78 Accepts]: Start accepts. Automaton has 2635 states and 3376 transitions. Word has length 66 [2025-02-05 17:55:20,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:55:20,276 INFO L471 AbstractCegarLoop]: Abstraction has 2635 states and 3376 transitions. [2025-02-05 17:55:20,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-02-05 17:55:20,277 INFO L276 IsEmpty]: Start isEmpty. Operand 2635 states and 3376 transitions. [2025-02-05 17:55:20,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-02-05 17:55:20,277 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:55:20,278 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] [2025-02-05 17:55:20,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 17:55:20,278 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:55:20,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:55:20,278 INFO L85 PathProgramCache]: Analyzing trace with hash -92149308, now seen corresponding path program 1 times [2025-02-05 17:55:20,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:55:20,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585511192] [2025-02-05 17:55:20,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:55:20,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:55:20,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-02-05 17:55:20,286 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-02-05 17:55:20,287 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:55:20,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:55:20,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:55:20,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:55:20,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585511192] [2025-02-05 17:55:20,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585511192] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:55:20,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:55:20,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:55:20,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750519040] [2025-02-05 17:55:20,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:55:20,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:55:20,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:55:20,305 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:55:20,305 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:55:20,306 INFO L87 Difference]: Start difference. First operand 2635 states and 3376 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-05 17:55:20,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:55:20,457 INFO L93 Difference]: Finished difference Result 5734 states and 7240 transitions. [2025-02-05 17:55:20,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:55:20,457 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 67 [2025-02-05 17:55:20,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:55:20,473 INFO L225 Difference]: With dead ends: 5734 [2025-02-05 17:55:20,473 INFO L226 Difference]: Without dead ends: 3456 [2025-02-05 17:55:20,477 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:55:20,477 INFO L435 NwaCegarLoop]: 739 mSDtfsCounter, 101 mSDsluCounter, 689 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 1428 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:55:20,477 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 1428 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:55:20,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3456 states. [2025-02-05 17:55:20,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3456 to 3394. [2025-02-05 17:55:20,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3394 states, 2710 states have (on average 1.2797047970479705) internal successors, (3468), 2750 states have internal predecessors, (3468), 345 states have call successors, (345), 279 states have call predecessors, (345), 337 states have return successors, (470), 366 states have call predecessors, (470), 341 states have call successors, (470) [2025-02-05 17:55:20,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3394 states to 3394 states and 4283 transitions. [2025-02-05 17:55:20,641 INFO L78 Accepts]: Start accepts. Automaton has 3394 states and 4283 transitions. Word has length 67 [2025-02-05 17:55:20,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:55:20,642 INFO L471 AbstractCegarLoop]: Abstraction has 3394 states and 4283 transitions. [2025-02-05 17:55:20,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-05 17:55:20,642 INFO L276 IsEmpty]: Start isEmpty. Operand 3394 states and 4283 transitions. [2025-02-05 17:55:20,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-02-05 17:55:20,643 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:55:20,643 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] [2025-02-05 17:55:20,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 17:55:20,643 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:55:20,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:55:20,644 INFO L85 PathProgramCache]: Analyzing trace with hash 458670688, now seen corresponding path program 1 times [2025-02-05 17:55:20,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:55:20,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806282894] [2025-02-05 17:55:20,644 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:55:20,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:55:20,654 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-02-05 17:55:20,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-02-05 17:55:20,663 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:55:20,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:55:20,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:55:20,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:55:20,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806282894] [2025-02-05 17:55:20,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806282894] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:55:20,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:55:20,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:55:20,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111852827] [2025-02-05 17:55:20,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:55:20,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:55:20,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:55:20,707 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:55:20,707 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:55:20,711 INFO L87 Difference]: Start difference. First operand 3394 states and 4283 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-05 17:55:20,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:55:20,840 INFO L93 Difference]: Finished difference Result 3744 states and 4702 transitions. [2025-02-05 17:55:20,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:55:20,840 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 73 [2025-02-05 17:55:20,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:55:20,847 INFO L225 Difference]: With dead ends: 3744 [2025-02-05 17:55:20,847 INFO L226 Difference]: Without dead ends: 738 [2025-02-05 17:55:20,853 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:55:20,853 INFO L435 NwaCegarLoop]: 700 mSDtfsCounter, 682 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 682 SdHoareTripleChecker+Valid, 700 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:55:20,854 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [682 Valid, 700 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:55:20,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 738 states. [2025-02-05 17:55:20,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 738 to 694. [2025-02-05 17:55:20,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 694 states, 585 states have (on average 1.3846153846153846) internal successors, (810), 592 states have internal predecessors, (810), 67 states have call successors, (67), 38 states have call predecessors, (67), 40 states have return successors, (67), 65 states have call predecessors, (67), 63 states have call successors, (67) [2025-02-05 17:55:20,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 694 states to 694 states and 944 transitions. [2025-02-05 17:55:20,901 INFO L78 Accepts]: Start accepts. Automaton has 694 states and 944 transitions. Word has length 73 [2025-02-05 17:55:20,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:55:20,902 INFO L471 AbstractCegarLoop]: Abstraction has 694 states and 944 transitions. [2025-02-05 17:55:20,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-05 17:55:20,902 INFO L276 IsEmpty]: Start isEmpty. Operand 694 states and 944 transitions. [2025-02-05 17:55:20,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-02-05 17:55:20,903 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:55:20,903 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:55:20,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 17:55:20,904 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:55:20,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:55:20,904 INFO L85 PathProgramCache]: Analyzing trace with hash -2131606446, now seen corresponding path program 1 times [2025-02-05 17:55:20,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:55:20,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865570908] [2025-02-05 17:55:20,905 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:55:20,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:55:20,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-02-05 17:55:20,918 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-02-05 17:55:20,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:55:20,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:55:21,009 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-05 17:55:21,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:55:21,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865570908] [2025-02-05 17:55:21,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865570908] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:55:21,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:55:21,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:55:21,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733248752] [2025-02-05 17:55:21,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:55:21,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:55:21,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:55:21,011 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:55:21,011 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:55:21,011 INFO L87 Difference]: Start difference. First operand 694 states and 944 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 4 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-02-05 17:55:21,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:55:21,863 INFO L93 Difference]: Finished difference Result 1295 states and 1621 transitions. [2025-02-05 17:55:21,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-05 17:55:21,864 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 4 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 84 [2025-02-05 17:55:21,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:55:21,869 INFO L225 Difference]: With dead ends: 1295 [2025-02-05 17:55:21,870 INFO L226 Difference]: Without dead ends: 931 [2025-02-05 17:55:21,870 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2025-02-05 17:55:21,871 INFO L435 NwaCegarLoop]: 444 mSDtfsCounter, 617 mSDsluCounter, 1480 mSDsCounter, 0 mSdLazyCounter, 1391 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 627 SdHoareTripleChecker+Valid, 1924 SdHoareTripleChecker+Invalid, 1518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 1391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 17:55:21,872 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [627 Valid, 1924 Invalid, 1518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 1391 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 17:55:21,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 931 states. [2025-02-05 17:55:21,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 931 to 891. [2025-02-05 17:55:21,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 891 states, 733 states have (on average 1.3274215552523874) internal successors, (973), 741 states have internal predecessors, (973), 91 states have call successors, (91), 59 states have call predecessors, (91), 65 states have return successors, (98), 92 states have call predecessors, (98), 87 states have call successors, (98) [2025-02-05 17:55:21,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 891 states to 891 states and 1162 transitions. [2025-02-05 17:55:21,921 INFO L78 Accepts]: Start accepts. Automaton has 891 states and 1162 transitions. Word has length 84 [2025-02-05 17:55:21,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:55:21,921 INFO L471 AbstractCegarLoop]: Abstraction has 891 states and 1162 transitions. [2025-02-05 17:55:21,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 4 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-02-05 17:55:21,922 INFO L276 IsEmpty]: Start isEmpty. Operand 891 states and 1162 transitions. [2025-02-05 17:55:21,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-02-05 17:55:21,923 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:55:21,923 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 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] [2025-02-05 17:55:21,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 17:55:21,924 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:55:21,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:55:21,924 INFO L85 PathProgramCache]: Analyzing trace with hash 1149246914, now seen corresponding path program 1 times [2025-02-05 17:55:21,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:55:21,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757167918] [2025-02-05 17:55:21,924 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:55:21,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:55:21,931 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-02-05 17:55:21,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-02-05 17:55:21,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:55:21,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:55:22,072 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 20 proven. 9 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-02-05 17:55:22,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:55:22,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757167918] [2025-02-05 17:55:22,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757167918] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 17:55:22,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1024461356] [2025-02-05 17:55:22,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:55:22,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 17:55:22,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:55:22,078 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 17:55:22,080 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 17:55:22,144 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-02-05 17:55:22,188 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-02-05 17:55:22,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:55:22,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:55:22,191 INFO L256 TraceCheckSpWp]: Trace formula consists of 560 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-05 17:55:22,196 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 17:55:22,254 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-05 17:55:22,254 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 17:55:22,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1024461356] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:55:22,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 17:55:22,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 13 [2025-02-05 17:55:22,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160197955] [2025-02-05 17:55:22,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:55:22,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:55:22,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:55:22,255 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:55:22,255 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-02-05 17:55:22,256 INFO L87 Difference]: Start difference. First operand 891 states and 1162 transitions. Second operand has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 5 states have internal predecessors, (106), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-05 17:55:22,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:55:22,280 INFO L93 Difference]: Finished difference Result 955 states and 1225 transitions. [2025-02-05 17:55:22,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 17:55:22,280 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 5 states have internal predecessors, (106), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) Word has length 145 [2025-02-05 17:55:22,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:55:22,283 INFO L225 Difference]: With dead ends: 955 [2025-02-05 17:55:22,283 INFO L226 Difference]: Without dead ends: 384 [2025-02-05 17:55:22,284 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-02-05 17:55:22,284 INFO L435 NwaCegarLoop]: 652 mSDtfsCounter, 0 mSDsluCounter, 2602 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3254 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:55:22,285 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3254 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:55:22,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2025-02-05 17:55:22,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 384. [2025-02-05 17:55:22,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 350 states have (on average 1.54) internal successors, (539), 352 states have internal predecessors, (539), 27 states have call successors, (27), 7 states have call predecessors, (27), 6 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-02-05 17:55:22,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 591 transitions. [2025-02-05 17:55:22,294 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 591 transitions. Word has length 145 [2025-02-05 17:55:22,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:55:22,295 INFO L471 AbstractCegarLoop]: Abstraction has 384 states and 591 transitions. [2025-02-05 17:55:22,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 5 states have internal predecessors, (106), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-05 17:55:22,295 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 591 transitions. [2025-02-05 17:55:22,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-02-05 17:55:22,296 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:55:22,296 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 17:55:22,305 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-05 17:55:22,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-02-05 17:55:22,497 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:55:22,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:55:22,498 INFO L85 PathProgramCache]: Analyzing trace with hash 1029765881, now seen corresponding path program 1 times [2025-02-05 17:55:22,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:55:22,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560432097] [2025-02-05 17:55:22,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:55:22,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:55:22,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-02-05 17:55:22,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-02-05 17:55:22,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:55:22,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:55:22,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:55:22,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:55:22,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560432097] [2025-02-05 17:55:22,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560432097] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:55:22,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:55:22,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:55:22,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858998584] [2025-02-05 17:55:22,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:55:22,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:55:22,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:55:22,547 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:55:22,547 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:55:22,548 INFO L87 Difference]: Start difference. First operand 384 states and 591 transitions. Second operand has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:55:22,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:55:22,560 INFO L93 Difference]: Finished difference Result 757 states and 1165 transitions. [2025-02-05 17:55:22,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:55:22,560 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 168 [2025-02-05 17:55:22,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:55:22,562 INFO L225 Difference]: With dead ends: 757 [2025-02-05 17:55:22,562 INFO L226 Difference]: Without dead ends: 384 [2025-02-05 17:55:22,563 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:55:22,564 INFO L435 NwaCegarLoop]: 589 mSDtfsCounter, 580 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 580 SdHoareTripleChecker+Valid, 590 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:55:22,564 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [580 Valid, 590 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:55:22,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2025-02-05 17:55:22,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 384. [2025-02-05 17:55:22,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 350 states have (on average 1.5371428571428571) internal successors, (538), 352 states have internal predecessors, (538), 27 states have call successors, (27), 7 states have call predecessors, (27), 6 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-02-05 17:55:22,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 590 transitions. [2025-02-05 17:55:22,574 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 590 transitions. Word has length 168 [2025-02-05 17:55:22,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:55:22,574 INFO L471 AbstractCegarLoop]: Abstraction has 384 states and 590 transitions. [2025-02-05 17:55:22,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:55:22,575 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 590 transitions. [2025-02-05 17:55:22,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-02-05 17:55:22,576 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:55:22,576 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 17:55:22,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 17:55:22,576 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:55:22,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:55:22,577 INFO L85 PathProgramCache]: Analyzing trace with hash -1608195174, now seen corresponding path program 1 times [2025-02-05 17:55:22,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:55:22,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501056925] [2025-02-05 17:55:22,577 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:55:22,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:55:22,586 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-02-05 17:55:22,589 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-02-05 17:55:22,589 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:55:22,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:55:22,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:55:22,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:55:22,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501056925] [2025-02-05 17:55:22,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501056925] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:55:22,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:55:22,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:55:22,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364289934] [2025-02-05 17:55:22,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:55:22,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:55:22,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:55:22,671 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:55:22,671 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:55:22,671 INFO L87 Difference]: Start difference. First operand 384 states and 590 transitions. Second operand has 5 states, 5 states have (on average 31.4) internal successors, (157), 4 states have internal predecessors, (157), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:55:23,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:55:23,142 INFO L93 Difference]: Finished difference Result 1156 states and 1794 transitions. [2025-02-05 17:55:23,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 17:55:23,142 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 4 states have internal predecessors, (157), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 168 [2025-02-05 17:55:23,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:55:23,146 INFO L225 Difference]: With dead ends: 1156 [2025-02-05 17:55:23,146 INFO L226 Difference]: Without dead ends: 792 [2025-02-05 17:55:23,147 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-02-05 17:55:23,148 INFO L435 NwaCegarLoop]: 465 mSDtfsCounter, 1104 mSDsluCounter, 1197 mSDsCounter, 0 mSdLazyCounter, 596 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1123 SdHoareTripleChecker+Valid, 1662 SdHoareTripleChecker+Invalid, 654 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 17:55:23,148 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1123 Valid, 1662 Invalid, 654 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 596 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 17:55:23,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 792 states. [2025-02-05 17:55:23,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 792 to 763. [2025-02-05 17:55:23,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 763 states, 702 states have (on average 1.5484330484330484) internal successors, (1087), 705 states have internal predecessors, (1087), 47 states have call successors, (47), 13 states have call predecessors, (47), 13 states have return successors, (46), 45 states have call predecessors, (46), 45 states have call successors, (46) [2025-02-05 17:55:23,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 763 states to 763 states and 1180 transitions. [2025-02-05 17:55:23,167 INFO L78 Accepts]: Start accepts. Automaton has 763 states and 1180 transitions. Word has length 168 [2025-02-05 17:55:23,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:55:23,167 INFO L471 AbstractCegarLoop]: Abstraction has 763 states and 1180 transitions. [2025-02-05 17:55:23,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 4 states have internal predecessors, (157), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:55:23,168 INFO L276 IsEmpty]: Start isEmpty. Operand 763 states and 1180 transitions. [2025-02-05 17:55:23,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-02-05 17:55:23,169 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:55:23,169 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 17:55:23,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 17:55:23,169 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:55:23,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:55:23,169 INFO L85 PathProgramCache]: Analyzing trace with hash 1000488728, now seen corresponding path program 1 times [2025-02-05 17:55:23,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:55:23,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978740144] [2025-02-05 17:55:23,170 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:55:23,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:55:23,178 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-02-05 17:55:23,181 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-02-05 17:55:23,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:55:23,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:55:23,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:55:23,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:55:23,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978740144] [2025-02-05 17:55:23,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978740144] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:55:23,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:55:23,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:55:23,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854092119] [2025-02-05 17:55:23,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:55:23,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:55:23,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:55:23,322 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:55:23,322 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:55:23,323 INFO L87 Difference]: Start difference. First operand 763 states and 1180 transitions. Second operand has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:55:23,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:55:23,983 INFO L93 Difference]: Finished difference Result 1985 states and 3107 transitions. [2025-02-05 17:55:23,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:55:23,984 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 168 [2025-02-05 17:55:23,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:55:23,990 INFO L225 Difference]: With dead ends: 1985 [2025-02-05 17:55:23,990 INFO L226 Difference]: Without dead ends: 1242 [2025-02-05 17:55:23,991 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-02-05 17:55:23,992 INFO L435 NwaCegarLoop]: 794 mSDtfsCounter, 1111 mSDsluCounter, 2452 mSDsCounter, 0 mSdLazyCounter, 1031 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1130 SdHoareTripleChecker+Valid, 3246 SdHoareTripleChecker+Invalid, 1064 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1031 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 17:55:23,992 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1130 Valid, 3246 Invalid, 1064 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1031 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 17:55:23,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1242 states. [2025-02-05 17:55:24,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1242 to 1117. [2025-02-05 17:55:24,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1117 states, 1029 states have (on average 1.5413022351797863) internal successors, (1586), 1033 states have internal predecessors, (1586), 67 states have call successors, (67), 19 states have call predecessors, (67), 20 states have return successors, (69), 66 states have call predecessors, (69), 65 states have call successors, (69) [2025-02-05 17:55:24,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1117 states to 1117 states and 1722 transitions. [2025-02-05 17:55:24,026 INFO L78 Accepts]: Start accepts. Automaton has 1117 states and 1722 transitions. Word has length 168 [2025-02-05 17:55:24,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:55:24,026 INFO L471 AbstractCegarLoop]: Abstraction has 1117 states and 1722 transitions. [2025-02-05 17:55:24,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:55:24,026 INFO L276 IsEmpty]: Start isEmpty. Operand 1117 states and 1722 transitions. [2025-02-05 17:55:24,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-02-05 17:55:24,027 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:55:24,028 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 17:55:24,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 17:55:24,028 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:55:24,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:55:24,028 INFO L85 PathProgramCache]: Analyzing trace with hash 1948978457, now seen corresponding path program 1 times [2025-02-05 17:55:24,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:55:24,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717523759] [2025-02-05 17:55:24,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:55:24,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:55:24,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-02-05 17:55:24,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-02-05 17:55:24,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:55:24,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:55:24,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:55:24,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:55:24,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717523759] [2025-02-05 17:55:24,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717523759] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:55:24,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:55:24,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:55:24,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713272007] [2025-02-05 17:55:24,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:55:24,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:55:24,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:55:24,154 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:55:24,154 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:55:24,154 INFO L87 Difference]: Start difference. First operand 1117 states and 1722 transitions. Second operand has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:55:24,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:55:24,817 INFO L93 Difference]: Finished difference Result 3111 states and 4860 transitions. [2025-02-05 17:55:24,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:55:24,817 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 168 [2025-02-05 17:55:24,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:55:24,824 INFO L225 Difference]: With dead ends: 3111 [2025-02-05 17:55:24,825 INFO L226 Difference]: Without dead ends: 2014 [2025-02-05 17:55:24,826 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-02-05 17:55:24,827 INFO L435 NwaCegarLoop]: 790 mSDtfsCounter, 1106 mSDsluCounter, 2440 mSDsCounter, 0 mSdLazyCounter, 1031 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1125 SdHoareTripleChecker+Valid, 3230 SdHoareTripleChecker+Invalid, 1064 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1031 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 17:55:24,827 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1125 Valid, 3230 Invalid, 1064 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1031 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 17:55:24,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2014 states. [2025-02-05 17:55:24,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2014 to 1870. [2025-02-05 17:55:24,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1870 states, 1726 states have (on average 1.545191193511008) internal successors, (2667), 1734 states have internal predecessors, (2667), 107 states have call successors, (107), 31 states have call predecessors, (107), 36 states have return successors, (121), 108 states have call predecessors, (121), 105 states have call successors, (121) [2025-02-05 17:55:24,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1870 states to 1870 states and 2895 transitions. [2025-02-05 17:55:24,921 INFO L78 Accepts]: Start accepts. Automaton has 1870 states and 2895 transitions. Word has length 168 [2025-02-05 17:55:24,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:55:24,921 INFO L471 AbstractCegarLoop]: Abstraction has 1870 states and 2895 transitions. [2025-02-05 17:55:24,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:55:24,921 INFO L276 IsEmpty]: Start isEmpty. Operand 1870 states and 2895 transitions. [2025-02-05 17:55:24,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-02-05 17:55:24,924 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:55:24,924 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 17:55:24,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 17:55:24,924 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:55:24,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:55:24,927 INFO L85 PathProgramCache]: Analyzing trace with hash 2118122232, now seen corresponding path program 1 times [2025-02-05 17:55:24,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:55:24,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581251001] [2025-02-05 17:55:24,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:55:24,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:55:24,942 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-02-05 17:55:24,947 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-02-05 17:55:24,948 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:55:24,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:55:25,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:55:25,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:55:25,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581251001] [2025-02-05 17:55:25,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1581251001] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:55:25,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:55:25,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:55:25,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863170320] [2025-02-05 17:55:25,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:55:25,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:55:25,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:55:25,060 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:55:25,061 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:55:25,061 INFO L87 Difference]: Start difference. First operand 1870 states and 2895 transitions. Second operand has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:55:25,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:55:25,723 INFO L93 Difference]: Finished difference Result 5538 states and 8719 transitions. [2025-02-05 17:55:25,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:55:25,724 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 168 [2025-02-05 17:55:25,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:55:25,736 INFO L225 Difference]: With dead ends: 5538 [2025-02-05 17:55:25,736 INFO L226 Difference]: Without dead ends: 3688 [2025-02-05 17:55:25,740 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-02-05 17:55:25,741 INFO L435 NwaCegarLoop]: 787 mSDtfsCounter, 1101 mSDsluCounter, 2431 mSDsCounter, 0 mSdLazyCounter, 1031 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1120 SdHoareTripleChecker+Valid, 3218 SdHoareTripleChecker+Invalid, 1064 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1031 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 17:55:25,741 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1120 Valid, 3218 Invalid, 1064 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1031 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 17:55:25,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3688 states. [2025-02-05 17:55:25,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3688 to 3505. [2025-02-05 17:55:25,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3505 states, 3243 states have (on average 1.5624421831637372) internal successors, (5067), 3265 states have internal predecessors, (5067), 187 states have call successors, (187), 55 states have call predecessors, (187), 74 states have return successors, (249), 192 states have call predecessors, (249), 185 states have call successors, (249) [2025-02-05 17:55:25,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3505 states to 3505 states and 5503 transitions. [2025-02-05 17:55:25,876 INFO L78 Accepts]: Start accepts. Automaton has 3505 states and 5503 transitions. Word has length 168 [2025-02-05 17:55:25,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:55:25,876 INFO L471 AbstractCegarLoop]: Abstraction has 3505 states and 5503 transitions. [2025-02-05 17:55:25,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:55:25,877 INFO L276 IsEmpty]: Start isEmpty. Operand 3505 states and 5503 transitions. [2025-02-05 17:55:25,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-02-05 17:55:25,881 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:55:25,881 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 17:55:25,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 17:55:25,881 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:55:25,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:55:25,881 INFO L85 PathProgramCache]: Analyzing trace with hash 183915833, now seen corresponding path program 1 times [2025-02-05 17:55:25,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:55:25,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383888804] [2025-02-05 17:55:25,882 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:55:25,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:55:25,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-02-05 17:55:25,894 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-02-05 17:55:25,894 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:55:25,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:55:25,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:55:25,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:55:25,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383888804] [2025-02-05 17:55:25,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383888804] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:55:25,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:55:25,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:55:25,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351626798] [2025-02-05 17:55:25,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:55:25,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:55:25,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:55:25,986 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:55:25,986 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:55:25,986 INFO L87 Difference]: Start difference. First operand 3505 states and 5503 transitions. Second operand has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:55:26,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:55:26,713 INFO L93 Difference]: Finished difference Result 10889 states and 17473 transitions. [2025-02-05 17:55:26,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:55:26,714 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 168 [2025-02-05 17:55:26,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:55:26,775 INFO L225 Difference]: With dead ends: 10889 [2025-02-05 17:55:26,775 INFO L226 Difference]: Without dead ends: 7404 [2025-02-05 17:55:26,780 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-02-05 17:55:26,781 INFO L435 NwaCegarLoop]: 784 mSDtfsCounter, 1096 mSDsluCounter, 2422 mSDsCounter, 0 mSdLazyCounter, 1031 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1115 SdHoareTripleChecker+Valid, 3206 SdHoareTripleChecker+Invalid, 1064 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1031 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 17:55:26,781 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1115 Valid, 3206 Invalid, 1064 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1031 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 17:55:26,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7404 states. [2025-02-05 17:55:27,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7404 to 7144. [2025-02-05 17:55:27,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7144 states, 6628 states have (on average 1.5912794206397103) internal successors, (10547), 6696 states have internal predecessors, (10547), 347 states have call successors, (347), 103 states have call predecessors, (347), 168 states have return successors, (601), 360 states have call predecessors, (601), 345 states have call successors, (601) [2025-02-05 17:55:27,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7144 states to 7144 states and 11495 transitions. [2025-02-05 17:55:27,073 INFO L78 Accepts]: Start accepts. Automaton has 7144 states and 11495 transitions. Word has length 168 [2025-02-05 17:55:27,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:55:27,073 INFO L471 AbstractCegarLoop]: Abstraction has 7144 states and 11495 transitions. [2025-02-05 17:55:27,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:55:27,073 INFO L276 IsEmpty]: Start isEmpty. Operand 7144 states and 11495 transitions. [2025-02-05 17:55:27,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-02-05 17:55:27,077 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:55:27,077 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 17:55:27,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-05 17:55:27,078 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:55:27,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:55:27,078 INFO L85 PathProgramCache]: Analyzing trace with hash 2061184728, now seen corresponding path program 1 times [2025-02-05 17:55:27,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:55:27,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291254222] [2025-02-05 17:55:27,078 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:55:27,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:55:27,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-02-05 17:55:27,099 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-02-05 17:55:27,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:55:27,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:55:27,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:55:27,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:55:27,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291254222] [2025-02-05 17:55:27,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291254222] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:55:27,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:55:27,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:55:27,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637870005] [2025-02-05 17:55:27,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:55:27,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:55:27,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:55:27,218 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:55:27,218 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:55:27,218 INFO L87 Difference]: Start difference. First operand 7144 states and 11495 transitions. Second operand has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:55:27,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:55:27,745 INFO L93 Difference]: Finished difference Result 15928 states and 26320 transitions. [2025-02-05 17:55:27,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:55:27,745 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 168 [2025-02-05 17:55:27,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:55:27,768 INFO L225 Difference]: With dead ends: 15928 [2025-02-05 17:55:27,768 INFO L226 Difference]: Without dead ends: 8804 [2025-02-05 17:55:27,779 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-02-05 17:55:27,779 INFO L435 NwaCegarLoop]: 446 mSDtfsCounter, 787 mSDsluCounter, 743 mSDsCounter, 0 mSdLazyCounter, 420 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 806 SdHoareTripleChecker+Valid, 1189 SdHoareTripleChecker+Invalid, 454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 17:55:27,779 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [806 Valid, 1189 Invalid, 454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 420 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 17:55:27,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8804 states. [2025-02-05 17:55:27,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8804 to 7144. [2025-02-05 17:55:27,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7144 states, 6628 states have (on average 1.588714544357272) internal successors, (10530), 6696 states have internal predecessors, (10530), 347 states have call successors, (347), 103 states have call predecessors, (347), 168 states have return successors, (601), 360 states have call predecessors, (601), 345 states have call successors, (601) [2025-02-05 17:55:27,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7144 states to 7144 states and 11478 transitions. [2025-02-05 17:55:27,975 INFO L78 Accepts]: Start accepts. Automaton has 7144 states and 11478 transitions. Word has length 168 [2025-02-05 17:55:27,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:55:27,975 INFO L471 AbstractCegarLoop]: Abstraction has 7144 states and 11478 transitions. [2025-02-05 17:55:27,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:55:27,975 INFO L276 IsEmpty]: Start isEmpty. Operand 7144 states and 11478 transitions. [2025-02-05 17:55:27,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-02-05 17:55:27,978 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:55:27,978 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 17:55:27,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-05 17:55:27,979 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:55:27,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:55:27,980 INFO L85 PathProgramCache]: Analyzing trace with hash 1983194457, now seen corresponding path program 1 times [2025-02-05 17:55:27,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:55:27,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133054256] [2025-02-05 17:55:27,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:55:27,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:55:27,991 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-02-05 17:55:27,995 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-02-05 17:55:27,995 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:55:27,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:55:28,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:55:28,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:55:28,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133054256] [2025-02-05 17:55:28,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133054256] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:55:28,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:55:28,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:55:28,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109575573] [2025-02-05 17:55:28,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:55:28,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:55:28,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:55:28,067 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:55:28,067 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:55:28,067 INFO L87 Difference]: Start difference. First operand 7144 states and 11478 transitions. Second operand has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:55:28,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:55:28,539 INFO L93 Difference]: Finished difference Result 15845 states and 26120 transitions. [2025-02-05 17:55:28,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:55:28,540 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 168 [2025-02-05 17:55:28,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:55:28,564 INFO L225 Difference]: With dead ends: 15845 [2025-02-05 17:55:28,564 INFO L226 Difference]: Without dead ends: 8721 [2025-02-05 17:55:28,577 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-02-05 17:55:28,577 INFO L435 NwaCegarLoop]: 443 mSDtfsCounter, 784 mSDsluCounter, 738 mSDsCounter, 0 mSdLazyCounter, 420 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 803 SdHoareTripleChecker+Valid, 1181 SdHoareTripleChecker+Invalid, 454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 17:55:28,577 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [803 Valid, 1181 Invalid, 454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 420 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 17:55:28,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8721 states. [2025-02-05 17:55:28,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8721 to 7144. [2025-02-05 17:55:28,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7144 states, 6628 states have (on average 1.586149668074834) internal successors, (10513), 6696 states have internal predecessors, (10513), 347 states have call successors, (347), 103 states have call predecessors, (347), 168 states have return successors, (601), 360 states have call predecessors, (601), 345 states have call successors, (601) [2025-02-05 17:55:28,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7144 states to 7144 states and 11461 transitions. [2025-02-05 17:55:28,779 INFO L78 Accepts]: Start accepts. Automaton has 7144 states and 11461 transitions. Word has length 168 [2025-02-05 17:55:28,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:55:28,780 INFO L471 AbstractCegarLoop]: Abstraction has 7144 states and 11461 transitions. [2025-02-05 17:55:28,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:55:28,780 INFO L276 IsEmpty]: Start isEmpty. Operand 7144 states and 11461 transitions. [2025-02-05 17:55:28,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-02-05 17:55:28,783 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:55:28,783 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 17:55:28,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-05 17:55:28,783 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:55:28,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:55:28,784 INFO L85 PathProgramCache]: Analyzing trace with hash 41015992, now seen corresponding path program 1 times [2025-02-05 17:55:28,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:55:28,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995728098] [2025-02-05 17:55:28,784 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:55:28,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:55:28,793 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-02-05 17:55:28,797 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-02-05 17:55:28,798 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:55:28,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:55:28,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:55:28,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:55:28,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995728098] [2025-02-05 17:55:28,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995728098] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:55:28,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:55:28,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:55:28,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258972135] [2025-02-05 17:55:28,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:55:28,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:55:28,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:55:28,879 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:55:28,880 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:55:28,880 INFO L87 Difference]: Start difference. First operand 7144 states and 11461 transitions. Second operand has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:55:29,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:55:29,333 INFO L93 Difference]: Finished difference Result 15762 states and 25920 transitions. [2025-02-05 17:55:29,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:55:29,334 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 168 [2025-02-05 17:55:29,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:55:29,357 INFO L225 Difference]: With dead ends: 15762 [2025-02-05 17:55:29,358 INFO L226 Difference]: Without dead ends: 8638 [2025-02-05 17:55:29,372 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-02-05 17:55:29,373 INFO L435 NwaCegarLoop]: 440 mSDtfsCounter, 781 mSDsluCounter, 733 mSDsCounter, 0 mSdLazyCounter, 420 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 800 SdHoareTripleChecker+Valid, 1173 SdHoareTripleChecker+Invalid, 454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 17:55:29,374 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [800 Valid, 1173 Invalid, 454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 420 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 17:55:29,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8638 states. [2025-02-05 17:55:29,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8638 to 7144. [2025-02-05 17:55:29,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7144 states, 6628 states have (on average 1.583584791792396) internal successors, (10496), 6696 states have internal predecessors, (10496), 347 states have call successors, (347), 103 states have call predecessors, (347), 168 states have return successors, (601), 360 states have call predecessors, (601), 345 states have call successors, (601) [2025-02-05 17:55:29,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7144 states to 7144 states and 11444 transitions. [2025-02-05 17:55:29,582 INFO L78 Accepts]: Start accepts. Automaton has 7144 states and 11444 transitions. Word has length 168 [2025-02-05 17:55:29,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:55:29,582 INFO L471 AbstractCegarLoop]: Abstraction has 7144 states and 11444 transitions. [2025-02-05 17:55:29,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:55:29,583 INFO L276 IsEmpty]: Start isEmpty. Operand 7144 states and 11444 transitions. [2025-02-05 17:55:29,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-02-05 17:55:29,586 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:55:29,586 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 17:55:29,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-05 17:55:29,586 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:55:29,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:55:29,587 INFO L85 PathProgramCache]: Analyzing trace with hash -852918919, now seen corresponding path program 1 times [2025-02-05 17:55:29,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:55:29,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456393157] [2025-02-05 17:55:29,587 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:55:29,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:55:29,596 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-02-05 17:55:29,599 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-02-05 17:55:29,599 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:55:29,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:55:29,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:55:29,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:55:29,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456393157] [2025-02-05 17:55:29,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456393157] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:55:29,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:55:29,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:55:29,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698542217] [2025-02-05 17:55:29,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:55:29,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:55:29,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:55:29,738 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:55:29,738 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:55:29,738 INFO L87 Difference]: Start difference. First operand 7144 states and 11444 transitions. Second operand has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:55:30,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:55:30,941 INFO L93 Difference]: Finished difference Result 22708 states and 37314 transitions. [2025-02-05 17:55:30,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:55:30,942 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 168 [2025-02-05 17:55:30,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:55:30,998 INFO L225 Difference]: With dead ends: 22708 [2025-02-05 17:55:30,999 INFO L226 Difference]: Without dead ends: 15584 [2025-02-05 17:55:31,022 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-02-05 17:55:31,027 INFO L435 NwaCegarLoop]: 766 mSDtfsCounter, 1067 mSDsluCounter, 2371 mSDsCounter, 0 mSdLazyCounter, 1031 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1086 SdHoareTripleChecker+Valid, 3137 SdHoareTripleChecker+Invalid, 1064 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1031 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 17:55:31,027 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1086 Valid, 3137 Invalid, 1064 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1031 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 17:55:31,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15584 states. [2025-02-05 17:55:31,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15584 to 15232. [2025-02-05 17:55:31,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15232 states, 14154 states have (on average 1.6149498375017663) internal successors, (22858), 14368 states have internal predecessors, (22858), 667 states have call successors, (667), 199 states have call predecessors, (667), 410 states have return successors, (1689), 696 states have call predecessors, (1689), 665 states have call successors, (1689) [2025-02-05 17:55:31,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15232 states to 15232 states and 25214 transitions. [2025-02-05 17:55:31,569 INFO L78 Accepts]: Start accepts. Automaton has 15232 states and 25214 transitions. Word has length 168 [2025-02-05 17:55:31,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:55:31,569 INFO L471 AbstractCegarLoop]: Abstraction has 15232 states and 25214 transitions. [2025-02-05 17:55:31,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:55:31,570 INFO L276 IsEmpty]: Start isEmpty. Operand 15232 states and 25214 transitions. [2025-02-05 17:55:31,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-02-05 17:55:31,576 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:55:31,576 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 17:55:31,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-05 17:55:31,576 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:55:31,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:55:31,577 INFO L85 PathProgramCache]: Analyzing trace with hash 226623128, now seen corresponding path program 1 times [2025-02-05 17:55:31,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:55:31,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169155786] [2025-02-05 17:55:31,578 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:55:31,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:55:31,586 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-02-05 17:55:31,590 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-02-05 17:55:31,590 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:55:31,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:55:31,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:55:31,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:55:31,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169155786] [2025-02-05 17:55:31,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169155786] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:55:31,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:55:31,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:55:31,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163783376] [2025-02-05 17:55:31,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:55:31,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:55:31,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:55:31,656 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:55:31,656 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:55:31,656 INFO L87 Difference]: Start difference. First operand 15232 states and 25214 transitions. Second operand has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:55:32,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:55:32,375 INFO L93 Difference]: Finished difference Result 34364 states and 58592 transitions. [2025-02-05 17:55:32,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:55:32,375 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 168 [2025-02-05 17:55:32,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:55:32,432 INFO L225 Difference]: With dead ends: 34364 [2025-02-05 17:55:32,432 INFO L226 Difference]: Without dead ends: 19152 [2025-02-05 17:55:32,456 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-02-05 17:55:32,457 INFO L435 NwaCegarLoop]: 435 mSDtfsCounter, 777 mSDsluCounter, 724 mSDsCounter, 0 mSdLazyCounter, 420 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 796 SdHoareTripleChecker+Valid, 1159 SdHoareTripleChecker+Invalid, 454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 17:55:32,457 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [796 Valid, 1159 Invalid, 454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 420 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 17:55:32,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19152 states. [2025-02-05 17:55:32,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19152 to 15232. [2025-02-05 17:55:32,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15232 states, 14154 states have (on average 1.612618341104988) internal successors, (22825), 14368 states have internal predecessors, (22825), 667 states have call successors, (667), 199 states have call predecessors, (667), 410 states have return successors, (1689), 696 states have call predecessors, (1689), 665 states have call successors, (1689) [2025-02-05 17:55:32,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15232 states to 15232 states and 25181 transitions. [2025-02-05 17:55:32,938 INFO L78 Accepts]: Start accepts. Automaton has 15232 states and 25181 transitions. Word has length 168 [2025-02-05 17:55:32,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:55:32,939 INFO L471 AbstractCegarLoop]: Abstraction has 15232 states and 25181 transitions. [2025-02-05 17:55:32,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:55:32,939 INFO L276 IsEmpty]: Start isEmpty. Operand 15232 states and 25181 transitions. [2025-02-05 17:55:32,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-02-05 17:55:32,945 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:55:32,945 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 17:55:32,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-05 17:55:32,946 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:55:32,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:55:32,947 INFO L85 PathProgramCache]: Analyzing trace with hash 261447065, now seen corresponding path program 1 times [2025-02-05 17:55:32,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:55:32,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748096551] [2025-02-05 17:55:32,947 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:55:32,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:55:33,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-02-05 17:55:33,020 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-02-05 17:55:33,021 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:55:33,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:55:33,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:55:33,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:55:33,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748096551] [2025-02-05 17:55:33,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748096551] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:55:33,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:55:33,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:55:33,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438052809] [2025-02-05 17:55:33,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:55:33,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:55:33,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:55:33,098 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:55:33,098 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:55:33,099 INFO L87 Difference]: Start difference. First operand 15232 states and 25181 transitions. Second operand has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:55:34,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:55:34,714 INFO L93 Difference]: Finished difference Result 49442 states and 84499 transitions. [2025-02-05 17:55:34,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:55:34,714 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 168 [2025-02-05 17:55:34,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:55:34,829 INFO L225 Difference]: With dead ends: 49442 [2025-02-05 17:55:34,829 INFO L226 Difference]: Without dead ends: 34230 [2025-02-05 17:55:34,869 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-02-05 17:55:34,870 INFO L435 NwaCegarLoop]: 758 mSDtfsCounter, 1054 mSDsluCounter, 2348 mSDsCounter, 0 mSdLazyCounter, 1031 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1073 SdHoareTripleChecker+Valid, 3106 SdHoareTripleChecker+Invalid, 1064 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1031 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 17:55:34,870 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1073 Valid, 3106 Invalid, 1064 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1031 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 17:55:34,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34230 states. [2025-02-05 17:55:36,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34230 to 33676. [2025-02-05 17:55:36,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33676 states, 31312 states have (on average 1.646365610628513) internal successors, (51551), 31980 states have internal predecessors, (51551), 1307 states have call successors, (1307), 391 states have call predecessors, (1307), 1056 states have return successors, (5401), 1368 states have call predecessors, (5401), 1305 states have call successors, (5401) [2025-02-05 17:55:36,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33676 states to 33676 states and 58259 transitions. [2025-02-05 17:55:36,474 INFO L78 Accepts]: Start accepts. Automaton has 33676 states and 58259 transitions. Word has length 168 [2025-02-05 17:55:36,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:55:36,474 INFO L471 AbstractCegarLoop]: Abstraction has 33676 states and 58259 transitions. [2025-02-05 17:55:36,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:55:36,475 INFO L276 IsEmpty]: Start isEmpty. Operand 33676 states and 58259 transitions. [2025-02-05 17:55:36,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-02-05 17:55:36,485 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:55:36,485 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 17:55:36,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-05 17:55:36,485 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:55:36,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:55:36,486 INFO L85 PathProgramCache]: Analyzing trace with hash -1677092232, now seen corresponding path program 1 times [2025-02-05 17:55:36,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:55:36,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487942446] [2025-02-05 17:55:36,486 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:55:36,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:55:36,497 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-02-05 17:55:36,501 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-02-05 17:55:36,501 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:55:36,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:55:36,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:55:36,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:55:36,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487942446] [2025-02-05 17:55:36,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487942446] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:55:36,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:55:36,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:55:36,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628132975] [2025-02-05 17:55:36,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:55:36,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:55:36,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:55:36,589 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:55:36,589 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:55:36,589 INFO L87 Difference]: Start difference. First operand 33676 states and 58259 transitions. Second operand has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:55:39,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:55:39,769 INFO L93 Difference]: Finished difference Result 111748 states and 202335 transitions. [2025-02-05 17:55:39,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:55:39,770 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 168 [2025-02-05 17:55:39,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:55:40,103 INFO L225 Difference]: With dead ends: 111748 [2025-02-05 17:55:40,103 INFO L226 Difference]: Without dead ends: 78092 [2025-02-05 17:55:40,208 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-02-05 17:55:40,208 INFO L435 NwaCegarLoop]: 755 mSDtfsCounter, 1049 mSDsluCounter, 2339 mSDsCounter, 0 mSdLazyCounter, 1031 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1068 SdHoareTripleChecker+Valid, 3094 SdHoareTripleChecker+Invalid, 1064 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1031 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 17:55:40,209 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1068 Valid, 3094 Invalid, 1064 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1031 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 17:55:40,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78092 states. [2025-02-05 17:55:43,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78092 to 77125. [2025-02-05 17:55:43,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77125 states, 71703 states have (on average 1.682426118851373) internal successors, (120635), 73765 states have internal predecessors, (120635), 2587 states have call successors, (2587), 775 states have call predecessors, (2587), 2834 states have return successors, (18969), 2712 states have call predecessors, (18969), 2585 states have call successors, (18969) [2025-02-05 17:55:43,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77125 states to 77125 states and 142191 transitions. [2025-02-05 17:55:43,840 INFO L78 Accepts]: Start accepts. Automaton has 77125 states and 142191 transitions. Word has length 168 [2025-02-05 17:55:43,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:55:43,840 INFO L471 AbstractCegarLoop]: Abstraction has 77125 states and 142191 transitions. [2025-02-05 17:55:43,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:55:43,840 INFO L276 IsEmpty]: Start isEmpty. Operand 77125 states and 142191 transitions. [2025-02-05 17:55:43,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-02-05 17:55:43,884 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:55:43,884 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 17:55:43,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-02-05 17:55:43,885 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:55:43,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:55:43,885 INFO L85 PathProgramCache]: Analyzing trace with hash 1169868217, now seen corresponding path program 1 times [2025-02-05 17:55:43,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:55:43,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028563858] [2025-02-05 17:55:43,885 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:55:43,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:55:43,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-02-05 17:55:43,912 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-02-05 17:55:43,912 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:55:43,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:55:44,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:55:44,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:55:44,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028563858] [2025-02-05 17:55:44,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028563858] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:55:44,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:55:44,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:55:44,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695022444] [2025-02-05 17:55:44,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:55:44,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:55:44,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:55:44,026 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:55:44,026 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:55:44,026 INFO L87 Difference]: Start difference. First operand 77125 states and 142191 transitions. Second operand has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:55:51,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:55:51,007 INFO L93 Difference]: Finished difference Result 271581 states and 528378 transitions. [2025-02-05 17:55:51,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:55:51,008 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 168 [2025-02-05 17:55:51,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:55:51,755 INFO L225 Difference]: With dead ends: 271581 [2025-02-05 17:55:51,755 INFO L226 Difference]: Without dead ends: 194476 [2025-02-05 17:55:51,980 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-02-05 17:55:51,980 INFO L435 NwaCegarLoop]: 750 mSDtfsCounter, 1388 mSDsluCounter, 2319 mSDsCounter, 0 mSdLazyCounter, 1034 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1419 SdHoareTripleChecker+Valid, 3069 SdHoareTripleChecker+Invalid, 1070 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 1034 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 17:55:51,982 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1419 Valid, 3069 Invalid, 1070 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 1034 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 17:55:52,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194476 states.