./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.10.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.10.cil-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5fa3500dbb7b48d33bda6025d194df10b5d868e3a16ab8452fef68790ebc5c6f --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 16:24:08,540 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 16:24:08,587 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 16:24:08,591 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 16:24:08,591 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 16:24:08,611 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 16:24:08,614 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 16:24:08,614 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 16:24:08,614 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 16:24:08,614 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 16:24:08,615 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 16:24:08,615 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 16:24:08,615 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 16:24:08,616 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 16:24:08,616 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 16:24:08,616 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 16:24:08,616 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 16:24:08,616 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 16:24:08,616 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 16:24:08,616 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 16:24:08,617 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 16:24:08,617 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 16:24:08,617 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 16:24:08,617 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 16:24:08,617 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 16:24:08,617 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 16:24:08,617 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 16:24:08,617 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 16:24:08,617 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 16:24:08,617 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 16:24:08,617 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 16:24:08,617 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 16:24:08,618 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 16:24:08,618 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 16:24:08,618 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 16:24:08,618 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 16:24:08,618 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 16:24:08,618 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 16:24:08,619 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 16:24:08,619 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 16:24:08,619 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 16:24:08,619 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 16:24:08,619 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 16:24:08,619 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5fa3500dbb7b48d33bda6025d194df10b5d868e3a16ab8452fef68790ebc5c6f [2025-03-03 16:24:08,831 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 16:24:08,838 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 16:24:08,839 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 16:24:08,841 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 16:24:08,841 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 16:24:08,842 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.10.cil-1.c [2025-03-03 16:24:09,973 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/84e853667/791337a64ae5462482c70f74e3e20ef7/FLAGfd65689d0 [2025-03-03 16:24:10,283 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 16:24:10,284 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.10.cil-1.c [2025-03-03 16:24:10,301 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/84e853667/791337a64ae5462482c70f74e3e20ef7/FLAGfd65689d0 [2025-03-03 16:24:10,556 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/84e853667/791337a64ae5462482c70f74e3e20ef7 [2025-03-03 16:24:10,558 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 16:24:10,559 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 16:24:10,559 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 16:24:10,560 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 16:24:10,562 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 16:24:10,563 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 04:24:10" (1/1) ... [2025-03-03 16:24:10,563 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a76e81a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:24:10, skipping insertion in model container [2025-03-03 16:24:10,563 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 04:24:10" (1/1) ... [2025-03-03 16:24:10,589 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 16:24:10,695 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.10.cil-1.c[911,924] [2025-03-03 16:24:10,735 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.10.cil-1.c[8416,8429] [2025-03-03 16:24:10,805 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 16:24:10,816 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 16:24:10,826 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.10.cil-1.c[911,924] [2025-03-03 16:24:10,844 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.10.cil-1.c[8416,8429] [2025-03-03 16:24:10,879 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 16:24:10,902 INFO L204 MainTranslator]: Completed translation [2025-03-03 16:24:10,903 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:24:10 WrapperNode [2025-03-03 16:24:10,903 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 16:24:10,903 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 16:24:10,904 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 16:24:10,904 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 16:24:10,907 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:24:10" (1/1) ... [2025-03-03 16:24:10,918 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:24:10" (1/1) ... [2025-03-03 16:24:10,949 INFO L138 Inliner]: procedures = 75, calls = 92, calls flagged for inlining = 43, calls inlined = 43, statements flattened = 941 [2025-03-03 16:24:10,949 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 16:24:10,950 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 16:24:10,950 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 16:24:10,950 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 16:24:10,956 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:24:10" (1/1) ... [2025-03-03 16:24:10,956 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:24:10" (1/1) ... [2025-03-03 16:24:10,959 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:24:10" (1/1) ... [2025-03-03 16:24:10,971 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 16:24:10,972 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:24:10" (1/1) ... [2025-03-03 16:24:10,972 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:24:10" (1/1) ... [2025-03-03 16:24:10,985 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:24:10" (1/1) ... [2025-03-03 16:24:10,988 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:24:10" (1/1) ... [2025-03-03 16:24:10,993 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:24:10" (1/1) ... [2025-03-03 16:24:10,995 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:24:10" (1/1) ... [2025-03-03 16:24:11,001 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 16:24:11,001 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 16:24:11,002 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 16:24:11,002 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 16:24:11,003 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:24:10" (1/1) ... [2025-03-03 16:24:11,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 16:24:11,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:24:11,033 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 16:24:11,041 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 16:24:11,061 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 16:24:11,061 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-03-03 16:24:11,061 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-03-03 16:24:11,061 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2025-03-03 16:24:11,061 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2025-03-03 16:24:11,062 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2025-03-03 16:24:11,062 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2025-03-03 16:24:11,062 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2025-03-03 16:24:11,062 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2025-03-03 16:24:11,062 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2025-03-03 16:24:11,062 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2025-03-03 16:24:11,062 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2025-03-03 16:24:11,062 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2025-03-03 16:24:11,062 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2025-03-03 16:24:11,062 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2025-03-03 16:24:11,062 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2025-03-03 16:24:11,062 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2025-03-03 16:24:11,062 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2025-03-03 16:24:11,062 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2025-03-03 16:24:11,062 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2025-03-03 16:24:11,062 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2025-03-03 16:24:11,062 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2025-03-03 16:24:11,062 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2025-03-03 16:24:11,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 16:24:11,062 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2025-03-03 16:24:11,062 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2025-03-03 16:24:11,062 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2025-03-03 16:24:11,062 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2025-03-03 16:24:11,062 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 16:24:11,062 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 16:24:11,062 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2025-03-03 16:24:11,062 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2025-03-03 16:24:11,063 INFO L130 BoogieDeclarations]: Found specification of procedure error2 [2025-03-03 16:24:11,063 INFO L138 BoogieDeclarations]: Found implementation of procedure error2 [2025-03-03 16:24:11,170 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 16:24:11,171 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 16:24:11,904 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L225: do_read_c_~a~0#1 := ~a_t~0; [2025-03-03 16:24:11,904 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L226: assume 1 == ~q_free~0;~c_dr_st~0 := 2;~c_dr_pc~0 := 2;~a_t~0 := do_read_c_~a~0#1; [2025-03-03 16:24:11,904 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L226: assume !(1 == ~q_free~0); [2025-03-03 16:24:12,040 INFO L? ?]: Removed 122 outVars from TransFormulas that were not future-live. [2025-03-03 16:24:12,041 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 16:24:12,059 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 16:24:12,060 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 16:24:12,060 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 04:24:12 BoogieIcfgContainer [2025-03-03 16:24:12,060 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 16:24:12,062 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 16:24:12,063 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 16:24:12,066 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 16:24:12,066 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 04:24:10" (1/3) ... [2025-03-03 16:24:12,066 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f69917f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 04:24:12, skipping insertion in model container [2025-03-03 16:24:12,066 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:24:10" (2/3) ... [2025-03-03 16:24:12,067 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f69917f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 04:24:12, skipping insertion in model container [2025-03-03 16:24:12,067 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 04:24:12" (3/3) ... [2025-03-03 16:24:12,068 INFO L128 eAbstractionObserver]: Analyzing ICFG pc_sfifo_3.cil+token_ring.10.cil-1.c [2025-03-03 16:24:12,077 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 16:24:12,080 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pc_sfifo_3.cil+token_ring.10.cil-1.c that has 16 procedures, 481 locations, 1 initial locations, 17 loop locations, and 2 error locations. [2025-03-03 16:24:12,122 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 16:24:12,129 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;@4730b29f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 16:24:12,129 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-03 16:24:12,133 INFO L276 IsEmpty]: Start isEmpty. Operand has 481 states, 421 states have (on average 1.5581947743467934) internal successors, (656), 429 states have internal predecessors, (656), 42 states have call successors, (42), 15 states have call predecessors, (42), 15 states have return successors, (42), 40 states have call predecessors, (42), 42 states have call successors, (42) [2025-03-03 16:24:12,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-03 16:24:12,138 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:24:12,139 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-03-03 16:24:12,139 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:24:12,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:24:12,142 INFO L85 PathProgramCache]: Analyzing trace with hash 326558397, now seen corresponding path program 1 times [2025-03-03 16:24:12,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:24:12,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406823696] [2025-03-03 16:24:12,147 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:24:12,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:24:12,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-03 16:24:12,243 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-03 16:24:12,244 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:24:12,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:24:12,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:24:12,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:24:12,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406823696] [2025-03-03 16:24:12,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406823696] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:24:12,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:24:12,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 16:24:12,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593145380] [2025-03-03 16:24:12,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:24:12,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 16:24:12,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:24:12,605 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 16:24:12,606 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 16:24:12,609 INFO L87 Difference]: Start difference. First operand has 481 states, 421 states have (on average 1.5581947743467934) internal successors, (656), 429 states have internal predecessors, (656), 42 states have call successors, (42), 15 states have call predecessors, (42), 15 states have return successors, (42), 40 states have call predecessors, (42), 42 states have call successors, (42) 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-03-03 16:24:13,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:24:13,424 INFO L93 Difference]: Finished difference Result 1056 states and 1621 transitions. [2025-03-03 16:24:13,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 16:24:13,429 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-03-03 16:24:13,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:24:13,441 INFO L225 Difference]: With dead ends: 1056 [2025-03-03 16:24:13,444 INFO L226 Difference]: Without dead ends: 591 [2025-03-03 16:24:13,448 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-03-03 16:24:13,450 INFO L435 NwaCegarLoop]: 440 mSDtfsCounter, 483 mSDsluCounter, 1134 mSDsCounter, 0 mSdLazyCounter, 1006 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 492 SdHoareTripleChecker+Valid, 1574 SdHoareTripleChecker+Invalid, 1069 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 1006 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 16:24:13,450 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [492 Valid, 1574 Invalid, 1069 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 1006 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 16:24:13,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2025-03-03 16:24:13,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 584. [2025-03-03 16:24:13,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 584 states, 505 states have (on average 1.497029702970297) internal successors, (756), 512 states have internal predecessors, (756), 55 states have call successors, (55), 22 states have call predecessors, (55), 22 states have return successors, (56), 52 states have call predecessors, (56), 51 states have call successors, (56) [2025-03-03 16:24:13,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 867 transitions. [2025-03-03 16:24:13,511 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 867 transitions. Word has length 65 [2025-03-03 16:24:13,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:24:13,512 INFO L471 AbstractCegarLoop]: Abstraction has 584 states and 867 transitions. [2025-03-03 16:24:13,512 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-03-03 16:24:13,512 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 867 transitions. [2025-03-03 16:24:13,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-03 16:24:13,514 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:24:13,514 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-03-03 16:24:13,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 16:24:13,515 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:24:13,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:24:13,515 INFO L85 PathProgramCache]: Analyzing trace with hash -981480931, now seen corresponding path program 1 times [2025-03-03 16:24:13,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:24:13,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728466360] [2025-03-03 16:24:13,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:24:13,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:24:13,531 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-03 16:24:13,537 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-03 16:24:13,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:24:13,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:24:13,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:24:13,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:24:13,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728466360] [2025-03-03 16:24:13,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728466360] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:24:13,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:24:13,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:24:13,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732904632] [2025-03-03 16:24:13,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:24:13,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:24:13,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:24:13,690 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:24:13,690 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:24:13,690 INFO L87 Difference]: Start difference. First operand 584 states and 867 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-03-03 16:24:14,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:24:14,524 INFO L93 Difference]: Finished difference Result 957 states and 1388 transitions. [2025-03-03 16:24:14,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 16:24:14,524 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-03-03 16:24:14,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:24:14,532 INFO L225 Difference]: With dead ends: 957 [2025-03-03 16:24:14,532 INFO L226 Difference]: Without dead ends: 744 [2025-03-03 16:24:14,533 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-03-03 16:24:14,533 INFO L435 NwaCegarLoop]: 486 mSDtfsCounter, 1009 mSDsluCounter, 1367 mSDsCounter, 0 mSdLazyCounter, 1321 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1040 SdHoareTripleChecker+Valid, 1853 SdHoareTripleChecker+Invalid, 1387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 1321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 16:24:14,535 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1040 Valid, 1853 Invalid, 1387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 1321 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 16:24:14,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 744 states. [2025-03-03 16:24:14,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 744 to 698. [2025-03-03 16:24:14,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 698 states, 597 states have (on average 1.4807370184254607) internal successors, (884), 606 states have internal predecessors, (884), 68 states have call successors, (68), 29 states have call predecessors, (68), 31 states have return successors, (77), 66 states have call predecessors, (77), 64 states have call successors, (77) [2025-03-03 16:24:14,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 698 states and 1029 transitions. [2025-03-03 16:24:14,585 INFO L78 Accepts]: Start accepts. Automaton has 698 states and 1029 transitions. Word has length 65 [2025-03-03 16:24:14,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:24:14,585 INFO L471 AbstractCegarLoop]: Abstraction has 698 states and 1029 transitions. [2025-03-03 16:24:14,585 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-03-03 16:24:14,585 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 1029 transitions. [2025-03-03 16:24:14,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-03 16:24:14,587 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:24:14,587 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-03-03 16:24:14,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 16:24:14,587 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:24:14,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:24:14,589 INFO L85 PathProgramCache]: Analyzing trace with hash 151709662, now seen corresponding path program 1 times [2025-03-03 16:24:14,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:24:14,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545115408] [2025-03-03 16:24:14,589 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:24:14,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:24:14,599 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-03 16:24:14,607 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-03 16:24:14,607 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:24:14,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:24:14,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:24:14,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:24:14,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545115408] [2025-03-03 16:24:14,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545115408] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:24:14,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:24:14,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 16:24:14,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651411101] [2025-03-03 16:24:14,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:24:14,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 16:24:14,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:24:14,708 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 16:24:14,708 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-03 16:24:14,708 INFO L87 Difference]: Start difference. First operand 698 states and 1029 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 7 states have internal predecessors, (50), 5 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) [2025-03-03 16:24:15,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:24:15,875 INFO L93 Difference]: Finished difference Result 2160 states and 3093 transitions. [2025-03-03 16:24:15,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-03 16:24:15,876 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), 5 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) Word has length 65 [2025-03-03 16:24:15,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:24:15,883 INFO L225 Difference]: With dead ends: 2160 [2025-03-03 16:24:15,883 INFO L226 Difference]: Without dead ends: 1821 [2025-03-03 16:24:15,884 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=292, Unknown=0, NotChecked=0, Total=380 [2025-03-03 16:24:15,885 INFO L435 NwaCegarLoop]: 500 mSDtfsCounter, 3167 mSDsluCounter, 1580 mSDsCounter, 0 mSdLazyCounter, 1482 mSolverCounterSat, 492 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3185 SdHoareTripleChecker+Valid, 2080 SdHoareTripleChecker+Invalid, 1974 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 492 IncrementalHoareTripleChecker+Valid, 1482 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 16:24:15,885 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3185 Valid, 2080 Invalid, 1974 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [492 Valid, 1482 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 16:24:15,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1821 states. [2025-03-03 16:24:15,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1821 to 1768. [2025-03-03 16:24:15,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1768 states, 1462 states have (on average 1.3987688098495212) internal successors, (2045), 1486 states have internal predecessors, (2045), 178 states have call successors, (178), 112 states have call predecessors, (178), 126 states have return successors, (210), 172 states have call predecessors, (210), 174 states have call successors, (210) [2025-03-03 16:24:15,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1768 states to 1768 states and 2433 transitions. [2025-03-03 16:24:15,991 INFO L78 Accepts]: Start accepts. Automaton has 1768 states and 2433 transitions. Word has length 65 [2025-03-03 16:24:15,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:24:15,991 INFO L471 AbstractCegarLoop]: Abstraction has 1768 states and 2433 transitions. [2025-03-03 16:24:15,991 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), 5 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) [2025-03-03 16:24:15,991 INFO L276 IsEmpty]: Start isEmpty. Operand 1768 states and 2433 transitions. [2025-03-03 16:24:15,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-03 16:24:15,992 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:24:15,992 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-03-03 16:24:15,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 16:24:15,993 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:24:15,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:24:15,993 INFO L85 PathProgramCache]: Analyzing trace with hash -1925746639, now seen corresponding path program 1 times [2025-03-03 16:24:15,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:24:15,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6618328] [2025-03-03 16:24:15,993 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:24:15,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:24:16,000 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-03 16:24:16,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-03 16:24:16,005 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:24:16,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:24:16,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-03-03 16:24:16,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:24:16,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6618328] [2025-03-03 16:24:16,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6618328] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:24:16,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:24:16,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:24:16,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217699052] [2025-03-03 16:24:16,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:24:16,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:24:16,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:24:16,061 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:24:16,061 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:24:16,061 INFO L87 Difference]: Start difference. First operand 1768 states and 2433 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-03-03 16:24:16,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:24:16,178 INFO L93 Difference]: Finished difference Result 3211 states and 4381 transitions. [2025-03-03 16:24:16,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 16:24:16,179 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-03-03 16:24:16,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:24:16,189 INFO L225 Difference]: With dead ends: 3211 [2025-03-03 16:24:16,189 INFO L226 Difference]: Without dead ends: 1808 [2025-03-03 16:24:16,192 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-03-03 16:24:16,194 INFO L435 NwaCegarLoop]: 704 mSDtfsCounter, 0 mSDsluCounter, 2810 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3514 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:24:16,195 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3514 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:24:16,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1808 states. [2025-03-03 16:24:16,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1808 to 1808. [2025-03-03 16:24:16,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1808 states, 1494 states have (on average 1.3862115127175367) internal successors, (2071), 1518 states have internal predecessors, (2071), 178 states have call successors, (178), 112 states have call predecessors, (178), 134 states have return successors, (218), 180 states have call predecessors, (218), 174 states have call successors, (218) [2025-03-03 16:24:16,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1808 states to 1808 states and 2467 transitions. [2025-03-03 16:24:16,283 INFO L78 Accepts]: Start accepts. Automaton has 1808 states and 2467 transitions. Word has length 66 [2025-03-03 16:24:16,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:24:16,284 INFO L471 AbstractCegarLoop]: Abstraction has 1808 states and 2467 transitions. [2025-03-03 16:24:16,284 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-03-03 16:24:16,284 INFO L276 IsEmpty]: Start isEmpty. Operand 1808 states and 2467 transitions. [2025-03-03 16:24:16,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-03 16:24:16,285 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:24:16,285 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-03-03 16:24:16,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 16:24:16,285 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:24:16,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:24:16,286 INFO L85 PathProgramCache]: Analyzing trace with hash -292942640, now seen corresponding path program 1 times [2025-03-03 16:24:16,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:24:16,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180286682] [2025-03-03 16:24:16,286 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:24:16,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:24:16,293 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-03 16:24:16,298 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-03 16:24:16,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:24:16,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:24:16,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:24:16,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:24:16,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180286682] [2025-03-03 16:24:16,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180286682] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:24:16,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:24:16,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 16:24:16,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858767768] [2025-03-03 16:24:16,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:24:16,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 16:24:16,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:24:16,398 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 16:24:16,398 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-03 16:24:16,398 INFO L87 Difference]: Start difference. First operand 1808 states and 2467 transitions. Second operand has 8 states, 8 states have (on average 6.375) internal successors, (51), 7 states have internal predecessors, (51), 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-03-03 16:24:17,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:24:17,517 INFO L93 Difference]: Finished difference Result 5244 states and 7101 transitions. [2025-03-03 16:24:17,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-03 16:24:17,517 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 7 states have internal predecessors, (51), 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 66 [2025-03-03 16:24:17,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:24:17,526 INFO L225 Difference]: With dead ends: 5244 [2025-03-03 16:24:17,526 INFO L226 Difference]: Without dead ends: 2074 [2025-03-03 16:24:17,532 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=292, Unknown=0, NotChecked=0, Total=380 [2025-03-03 16:24:17,532 INFO L435 NwaCegarLoop]: 502 mSDtfsCounter, 3248 mSDsluCounter, 1607 mSDsCounter, 0 mSdLazyCounter, 1407 mSolverCounterSat, 498 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3266 SdHoareTripleChecker+Valid, 2109 SdHoareTripleChecker+Invalid, 1905 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 498 IncrementalHoareTripleChecker+Valid, 1407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 16:24:17,533 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3266 Valid, 2109 Invalid, 1905 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [498 Valid, 1407 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 16:24:17,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2074 states. [2025-03-03 16:24:17,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2074 to 2004. [2025-03-03 16:24:17,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2004 states, 1618 states have (on average 1.3485784919653894) internal successors, (2182), 1644 states have internal predecessors, (2182), 218 states have call successors, (218), 140 states have call predecessors, (218), 166 states have return successors, (264), 222 states have call predecessors, (264), 214 states have call successors, (264) [2025-03-03 16:24:17,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2004 states to 2004 states and 2664 transitions. [2025-03-03 16:24:17,625 INFO L78 Accepts]: Start accepts. Automaton has 2004 states and 2664 transitions. Word has length 66 [2025-03-03 16:24:17,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:24:17,625 INFO L471 AbstractCegarLoop]: Abstraction has 2004 states and 2664 transitions. [2025-03-03 16:24:17,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 7 states have internal predecessors, (51), 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-03-03 16:24:17,626 INFO L276 IsEmpty]: Start isEmpty. Operand 2004 states and 2664 transitions. [2025-03-03 16:24:17,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-03 16:24:17,627 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:24:17,627 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:24:17,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 16:24:17,627 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:24:17,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:24:17,628 INFO L85 PathProgramCache]: Analyzing trace with hash 1742055331, now seen corresponding path program 1 times [2025-03-03 16:24:17,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:24:17,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731002750] [2025-03-03 16:24:17,628 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:24:17,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:24:17,639 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-03 16:24:17,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-03 16:24:17,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:24:17,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:24:17,710 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-03 16:24:17,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:24:17,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731002750] [2025-03-03 16:24:17,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731002750] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:24:17,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:24:17,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:24:17,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685793640] [2025-03-03 16:24:17,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:24:17,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:24:17,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:24:17,712 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:24:17,712 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:24:17,712 INFO L87 Difference]: Start difference. First operand 2004 states and 2664 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 5 states have internal predecessors, (63), 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-03-03 16:24:17,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:24:17,796 INFO L93 Difference]: Finished difference Result 3703 states and 4875 transitions. [2025-03-03 16:24:17,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 16:24:17,796 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 5 states have internal predecessors, (63), 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 92 [2025-03-03 16:24:17,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:24:17,805 INFO L225 Difference]: With dead ends: 3703 [2025-03-03 16:24:17,805 INFO L226 Difference]: Without dead ends: 2064 [2025-03-03 16:24:17,809 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-03-03 16:24:17,809 INFO L435 NwaCegarLoop]: 694 mSDtfsCounter, 0 mSDsluCounter, 2771 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3465 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-03-03 16:24:17,810 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3465 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:24:17,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2064 states. [2025-03-03 16:24:17,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2064 to 2064. [2025-03-03 16:24:17,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2064 states, 1666 states have (on average 1.3349339735894359) internal successors, (2224), 1692 states have internal predecessors, (2224), 218 states have call successors, (218), 140 states have call predecessors, (218), 178 states have return successors, (276), 234 states have call predecessors, (276), 214 states have call successors, (276) [2025-03-03 16:24:17,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2064 states to 2064 states and 2718 transitions. [2025-03-03 16:24:17,916 INFO L78 Accepts]: Start accepts. Automaton has 2064 states and 2718 transitions. Word has length 92 [2025-03-03 16:24:17,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:24:17,916 INFO L471 AbstractCegarLoop]: Abstraction has 2064 states and 2718 transitions. [2025-03-03 16:24:17,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 5 states have internal predecessors, (63), 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-03-03 16:24:17,916 INFO L276 IsEmpty]: Start isEmpty. Operand 2064 states and 2718 transitions. [2025-03-03 16:24:17,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-03 16:24:17,917 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:24:17,918 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:24:17,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 16:24:17,918 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:24:17,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:24:17,918 INFO L85 PathProgramCache]: Analyzing trace with hash -2114902462, now seen corresponding path program 1 times [2025-03-03 16:24:17,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:24:17,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210373915] [2025-03-03 16:24:17,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:24:17,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:24:17,926 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-03 16:24:17,930 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-03 16:24:17,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:24:17,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:24:18,090 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-03 16:24:18,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:24:18,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210373915] [2025-03-03 16:24:18,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210373915] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:24:18,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:24:18,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:24:18,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638751182] [2025-03-03 16:24:18,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:24:18,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:24:18,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:24:18,092 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:24:18,092 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:24:18,092 INFO L87 Difference]: Start difference. First operand 2064 states and 2718 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 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-03-03 16:24:18,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:24:18,833 INFO L93 Difference]: Finished difference Result 3512 states and 4557 transitions. [2025-03-03 16:24:18,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 16:24:18,833 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), 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 92 [2025-03-03 16:24:18,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:24:18,843 INFO L225 Difference]: With dead ends: 3512 [2025-03-03 16:24:18,843 INFO L226 Difference]: Without dead ends: 2052 [2025-03-03 16:24:18,846 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-03-03 16:24:18,847 INFO L435 NwaCegarLoop]: 417 mSDtfsCounter, 1008 mSDsluCounter, 1179 mSDsCounter, 0 mSdLazyCounter, 1247 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1039 SdHoareTripleChecker+Valid, 1596 SdHoareTripleChecker+Invalid, 1324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 1247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 16:24:18,848 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1039 Valid, 1596 Invalid, 1324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 1247 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 16:24:18,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2052 states. [2025-03-03 16:24:18,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2052 to 1842. [2025-03-03 16:24:18,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1842 states, 1497 states have (on average 1.3393453573814296) internal successors, (2005), 1518 states have internal predecessors, (2005), 190 states have call successors, (190), 121 states have call predecessors, (190), 153 states have return successors, (236), 204 states have call predecessors, (236), 186 states have call successors, (236) [2025-03-03 16:24:18,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1842 states to 1842 states and 2431 transitions. [2025-03-03 16:24:18,937 INFO L78 Accepts]: Start accepts. Automaton has 1842 states and 2431 transitions. Word has length 92 [2025-03-03 16:24:18,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:24:18,937 INFO L471 AbstractCegarLoop]: Abstraction has 1842 states and 2431 transitions. [2025-03-03 16:24:18,937 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), 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-03-03 16:24:18,937 INFO L276 IsEmpty]: Start isEmpty. Operand 1842 states and 2431 transitions. [2025-03-03 16:24:18,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-03 16:24:18,940 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:24:18,940 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:24:18,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 16:24:18,941 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:24:18,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:24:18,941 INFO L85 PathProgramCache]: Analyzing trace with hash -2122661821, now seen corresponding path program 1 times [2025-03-03 16:24:18,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:24:18,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363569110] [2025-03-03 16:24:18,941 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:24:18,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:24:18,949 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-03 16:24:18,954 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-03 16:24:18,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:24:18,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:24:18,992 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-03 16:24:18,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:24:18,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363569110] [2025-03-03 16:24:18,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363569110] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:24:18,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:24:18,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 16:24:18,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298384854] [2025-03-03 16:24:18,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:24:18,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 16:24:18,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:24:18,993 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 16:24:18,993 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 16:24:18,994 INFO L87 Difference]: Start difference. First operand 1842 states and 2431 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 4 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2025-03-03 16:24:19,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:24:19,490 INFO L93 Difference]: Finished difference Result 4794 states and 6261 transitions. [2025-03-03 16:24:19,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 16:24:19,490 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 4 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 92 [2025-03-03 16:24:19,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:24:19,506 INFO L225 Difference]: With dead ends: 4794 [2025-03-03 16:24:19,506 INFO L226 Difference]: Without dead ends: 3318 [2025-03-03 16:24:19,509 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-03-03 16:24:19,510 INFO L435 NwaCegarLoop]: 399 mSDtfsCounter, 935 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 446 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 964 SdHoareTripleChecker+Valid, 807 SdHoareTripleChecker+Invalid, 514 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 446 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 16:24:19,510 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [964 Valid, 807 Invalid, 514 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 446 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 16:24:19,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3318 states. [2025-03-03 16:24:19,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3318 to 3318. [2025-03-03 16:24:19,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3318 states, 2653 states have (on average 1.2966453071993969) internal successors, (3440), 2703 states have internal predecessors, (3440), 351 states have call successors, (351), 234 states have call predecessors, (351), 312 states have return successors, (519), 383 states have call predecessors, (519), 347 states have call successors, (519) [2025-03-03 16:24:19,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3318 states to 3318 states and 4310 transitions. [2025-03-03 16:24:19,646 INFO L78 Accepts]: Start accepts. Automaton has 3318 states and 4310 transitions. Word has length 92 [2025-03-03 16:24:19,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:24:19,647 INFO L471 AbstractCegarLoop]: Abstraction has 3318 states and 4310 transitions. [2025-03-03 16:24:19,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 4 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2025-03-03 16:24:19,647 INFO L276 IsEmpty]: Start isEmpty. Operand 3318 states and 4310 transitions. [2025-03-03 16:24:19,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-03 16:24:19,648 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:24:19,649 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:24:19,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 16:24:19,649 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:24:19,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:24:19,649 INFO L85 PathProgramCache]: Analyzing trace with hash -1339282846, now seen corresponding path program 1 times [2025-03-03 16:24:19,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:24:19,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67903127] [2025-03-03 16:24:19,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:24:19,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:24:19,657 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-03 16:24:19,659 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-03 16:24:19,660 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:24:19,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:24:19,681 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-03 16:24:19,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:24:19,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67903127] [2025-03-03 16:24:19,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67903127] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:24:19,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:24:19,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:24:19,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908599025] [2025-03-03 16:24:19,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:24:19,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:24:19,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:24:19,682 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:24:19,682 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:24:19,682 INFO L87 Difference]: Start difference. First operand 3318 states and 4310 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 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-03-03 16:24:19,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:24:19,769 INFO L93 Difference]: Finished difference Result 4794 states and 6141 transitions. [2025-03-03 16:24:19,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:24:19,771 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 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 92 [2025-03-03 16:24:19,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:24:19,780 INFO L225 Difference]: With dead ends: 4794 [2025-03-03 16:24:19,780 INFO L226 Difference]: Without dead ends: 1842 [2025-03-03 16:24:19,785 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-03-03 16:24:19,786 INFO L435 NwaCegarLoop]: 693 mSDtfsCounter, 141 mSDsluCounter, 547 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 1240 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-03-03 16:24:19,786 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 1240 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:24:19,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1842 states. [2025-03-03 16:24:19,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1842 to 1842. [2025-03-03 16:24:19,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1842 states, 1497 states have (on average 1.314629258517034) internal successors, (1968), 1518 states have internal predecessors, (1968), 190 states have call successors, (190), 121 states have call predecessors, (190), 153 states have return successors, (236), 204 states have call predecessors, (236), 186 states have call successors, (236) [2025-03-03 16:24:19,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1842 states to 1842 states and 2394 transitions. [2025-03-03 16:24:19,864 INFO L78 Accepts]: Start accepts. Automaton has 1842 states and 2394 transitions. Word has length 92 [2025-03-03 16:24:19,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:24:19,865 INFO L471 AbstractCegarLoop]: Abstraction has 1842 states and 2394 transitions. [2025-03-03 16:24:19,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 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-03-03 16:24:19,865 INFO L276 IsEmpty]: Start isEmpty. Operand 1842 states and 2394 transitions. [2025-03-03 16:24:19,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-03 16:24:19,866 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:24:19,866 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:24:19,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 16:24:19,867 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:24:19,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:24:19,867 INFO L85 PathProgramCache]: Analyzing trace with hash -648926598, now seen corresponding path program 1 times [2025-03-03 16:24:19,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:24:19,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869159703] [2025-03-03 16:24:19,867 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:24:19,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:24:19,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-03 16:24:19,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-03 16:24:19,880 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:24:19,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:24:19,957 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 16:24:19,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:24:19,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869159703] [2025-03-03 16:24:19,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869159703] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:24:19,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:24:19,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 16:24:19,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394286159] [2025-03-03 16:24:19,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:24:19,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 16:24:19,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:24:19,958 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 16:24:19,958 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 16:24:19,959 INFO L87 Difference]: Start difference. First operand 1842 states and 2394 transitions. Second operand has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 4 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-03 16:24:21,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:24:21,143 INFO L93 Difference]: Finished difference Result 4191 states and 5375 transitions. [2025-03-03 16:24:21,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-03 16:24:21,144 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 4 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 93 [2025-03-03 16:24:21,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:24:21,158 INFO L225 Difference]: With dead ends: 4191 [2025-03-03 16:24:21,158 INFO L226 Difference]: Without dead ends: 2564 [2025-03-03 16:24:21,162 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=257, Unknown=0, NotChecked=0, Total=342 [2025-03-03 16:24:21,163 INFO L435 NwaCegarLoop]: 482 mSDtfsCounter, 1661 mSDsluCounter, 1629 mSDsCounter, 0 mSdLazyCounter, 1656 mSolverCounterSat, 292 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1696 SdHoareTripleChecker+Valid, 2111 SdHoareTripleChecker+Invalid, 1948 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 292 IncrementalHoareTripleChecker+Valid, 1656 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 16:24:21,164 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1696 Valid, 2111 Invalid, 1948 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [292 Valid, 1656 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 16:24:21,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2564 states. [2025-03-03 16:24:21,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2564 to 2443. [2025-03-03 16:24:21,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2443 states, 1952 states have (on average 1.2792008196721312) internal successors, (2497), 1982 states have internal predecessors, (2497), 261 states have call successors, (261), 171 states have call predecessors, (261), 228 states have return successors, (341), 291 states have call predecessors, (341), 257 states have call successors, (341) [2025-03-03 16:24:21,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2443 states to 2443 states and 3099 transitions. [2025-03-03 16:24:21,296 INFO L78 Accepts]: Start accepts. Automaton has 2443 states and 3099 transitions. Word has length 93 [2025-03-03 16:24:21,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:24:21,296 INFO L471 AbstractCegarLoop]: Abstraction has 2443 states and 3099 transitions. [2025-03-03 16:24:21,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 4 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-03 16:24:21,299 INFO L276 IsEmpty]: Start isEmpty. Operand 2443 states and 3099 transitions. [2025-03-03 16:24:21,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-03-03 16:24:21,301 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:24:21,301 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 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, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:24:21,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 16:24:21,301 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:24:21,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:24:21,302 INFO L85 PathProgramCache]: Analyzing trace with hash 1962908412, now seen corresponding path program 1 times [2025-03-03 16:24:21,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:24:21,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902804776] [2025-03-03 16:24:21,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:24:21,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:24:21,314 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-03 16:24:21,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-03 16:24:21,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:24:21,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:24:21,460 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 23 proven. 12 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2025-03-03 16:24:21,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:24:21,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902804776] [2025-03-03 16:24:21,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902804776] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:24:21,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [348751723] [2025-03-03 16:24:21,460 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:24:21,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:24:21,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:24:21,463 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 16:24:21,465 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 16:24:21,530 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-03 16:24:21,581 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-03 16:24:21,581 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:24:21,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:24:21,584 INFO L256 TraceCheckSpWp]: Trace formula consists of 599 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 16:24:21,592 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:24:21,718 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-03-03 16:24:21,718 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 16:24:21,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [348751723] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:24:21,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 16:24:21,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2025-03-03 16:24:21,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616036493] [2025-03-03 16:24:21,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:24:21,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:24:21,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:24:21,719 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:24:21,720 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-03 16:24:21,720 INFO L87 Difference]: Start difference. First operand 2443 states and 3099 transitions. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-03 16:24:21,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:24:21,863 INFO L93 Difference]: Finished difference Result 6372 states and 7896 transitions. [2025-03-03 16:24:21,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:24:21,863 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 164 [2025-03-03 16:24:21,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:24:21,880 INFO L225 Difference]: With dead ends: 6372 [2025-03-03 16:24:21,880 INFO L226 Difference]: Without dead ends: 4372 [2025-03-03 16:24:21,885 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-03 16:24:21,886 INFO L435 NwaCegarLoop]: 696 mSDtfsCounter, 61 mSDsluCounter, 672 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 1368 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:24:21,886 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 1368 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:24:21,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4372 states. [2025-03-03 16:24:22,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4372 to 4340. [2025-03-03 16:24:22,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4340 states, 3432 states have (on average 1.2465034965034965) internal successors, (4278), 3487 states have internal predecessors, (4278), 468 states have call successors, (468), 334 states have call predecessors, (468), 438 states have return successors, (604), 520 states have call predecessors, (604), 464 states have call successors, (604) [2025-03-03 16:24:22,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4340 states to 4340 states and 5350 transitions. [2025-03-03 16:24:22,114 INFO L78 Accepts]: Start accepts. Automaton has 4340 states and 5350 transitions. Word has length 164 [2025-03-03 16:24:22,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:24:22,115 INFO L471 AbstractCegarLoop]: Abstraction has 4340 states and 5350 transitions. [2025-03-03 16:24:22,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-03 16:24:22,115 INFO L276 IsEmpty]: Start isEmpty. Operand 4340 states and 5350 transitions. [2025-03-03 16:24:22,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-03-03 16:24:22,116 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:24:22,117 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] [2025-03-03 16:24:22,126 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-03 16:24:22,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-03 16:24:22,317 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:24:22,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:24:22,318 INFO L85 PathProgramCache]: Analyzing trace with hash 782641471, now seen corresponding path program 1 times [2025-03-03 16:24:22,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:24:22,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104949018] [2025-03-03 16:24:22,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:24:22,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:24:22,333 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-03-03 16:24:22,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-03-03 16:24:22,339 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:24:22,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:24:22,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:24:22,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:24:22,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104949018] [2025-03-03 16:24:22,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104949018] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:24:22,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:24:22,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:24:22,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413173303] [2025-03-03 16:24:22,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:24:22,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:24:22,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:24:22,386 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:24:22,387 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:24:22,387 INFO L87 Difference]: Start difference. First operand 4340 states and 5350 transitions. Second operand has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 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-03-03 16:24:22,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:24:22,535 INFO L93 Difference]: Finished difference Result 4685 states and 5879 transitions. [2025-03-03 16:24:22,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:24:22,539 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 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 157 [2025-03-03 16:24:22,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:24:22,557 INFO L225 Difference]: With dead ends: 4685 [2025-03-03 16:24:22,557 INFO L226 Difference]: Without dead ends: 4340 [2025-03-03 16:24:22,559 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-03-03 16:24:22,560 INFO L435 NwaCegarLoop]: 691 mSDtfsCounter, 536 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 536 SdHoareTripleChecker+Valid, 837 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-03-03 16:24:22,560 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [536 Valid, 837 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:24:22,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4340 states. [2025-03-03 16:24:22,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4340 to 4340. [2025-03-03 16:24:22,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4340 states, 3432 states have (on average 1.246212121212121) internal successors, (4277), 3487 states have internal predecessors, (4277), 468 states have call successors, (468), 334 states have call predecessors, (468), 438 states have return successors, (604), 520 states have call predecessors, (604), 464 states have call successors, (604) [2025-03-03 16:24:22,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4340 states to 4340 states and 5349 transitions. [2025-03-03 16:24:22,741 INFO L78 Accepts]: Start accepts. Automaton has 4340 states and 5349 transitions. Word has length 157 [2025-03-03 16:24:22,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:24:22,741 INFO L471 AbstractCegarLoop]: Abstraction has 4340 states and 5349 transitions. [2025-03-03 16:24:22,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 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-03-03 16:24:22,742 INFO L276 IsEmpty]: Start isEmpty. Operand 4340 states and 5349 transitions. [2025-03-03 16:24:22,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-03-03 16:24:22,744 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:24:22,744 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] [2025-03-03 16:24:22,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 16:24:22,744 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:24:22,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:24:22,744 INFO L85 PathProgramCache]: Analyzing trace with hash 613497696, now seen corresponding path program 1 times [2025-03-03 16:24:22,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:24:22,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223885091] [2025-03-03 16:24:22,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:24:22,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:24:22,755 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-03-03 16:24:22,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-03-03 16:24:22,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:24:22,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:24:22,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:24:22,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:24:22,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223885091] [2025-03-03 16:24:22,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223885091] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:24:22,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:24:22,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 16:24:22,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712658506] [2025-03-03 16:24:22,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:24:22,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 16:24:22,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:24:22,865 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 16:24:22,865 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 16:24:22,865 INFO L87 Difference]: Start difference. First operand 4340 states and 5349 transitions. Second operand has 5 states, 5 states have (on average 29.2) internal successors, (146), 4 states have internal predecessors, (146), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:24:23,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:24:23,670 INFO L93 Difference]: Finished difference Result 5056 states and 6463 transitions. [2025-03-03 16:24:23,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 16:24:23,671 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 4 states have internal predecessors, (146), 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 157 [2025-03-03 16:24:23,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:24:23,686 INFO L225 Difference]: With dead ends: 5056 [2025-03-03 16:24:23,687 INFO L226 Difference]: Without dead ends: 4718 [2025-03-03 16:24:23,689 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:24:23,690 INFO L435 NwaCegarLoop]: 505 mSDtfsCounter, 1201 mSDsluCounter, 1227 mSDsCounter, 0 mSdLazyCounter, 723 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1231 SdHoareTripleChecker+Valid, 1732 SdHoareTripleChecker+Invalid, 801 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 723 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 16:24:23,690 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1231 Valid, 1732 Invalid, 801 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 723 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 16:24:23,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4718 states. [2025-03-03 16:24:23,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4718 to 4691. [2025-03-03 16:24:23,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4691 states, 3757 states have (on average 1.2730902315677401) internal successors, (4783), 3813 states have internal predecessors, (4783), 487 states have call successors, (487), 340 states have call predecessors, (487), 445 states have return successors, (624), 539 states have call predecessors, (624), 483 states have call successors, (624) [2025-03-03 16:24:23,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4691 states to 4691 states and 5894 transitions. [2025-03-03 16:24:23,903 INFO L78 Accepts]: Start accepts. Automaton has 4691 states and 5894 transitions. Word has length 157 [2025-03-03 16:24:23,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:24:23,904 INFO L471 AbstractCegarLoop]: Abstraction has 4691 states and 5894 transitions. [2025-03-03 16:24:23,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 4 states have internal predecessors, (146), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:24:23,904 INFO L276 IsEmpty]: Start isEmpty. Operand 4691 states and 5894 transitions. [2025-03-03 16:24:23,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-03-03 16:24:23,907 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:24:23,907 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] [2025-03-03 16:24:23,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 16:24:23,908 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:24:23,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:24:23,908 INFO L85 PathProgramCache]: Analyzing trace with hash -1200968354, now seen corresponding path program 1 times [2025-03-03 16:24:23,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:24:23,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543335548] [2025-03-03 16:24:23,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:24:23,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:24:23,917 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-03-03 16:24:23,920 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-03-03 16:24:23,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:24:23,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:24:24,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:24:24,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:24:24,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543335548] [2025-03-03 16:24:24,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543335548] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:24:24,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:24:24,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:24:24,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532661558] [2025-03-03 16:24:24,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:24:24,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:24:24,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:24:24,042 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:24:24,042 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:24:24,042 INFO L87 Difference]: Start difference. First operand 4691 states and 5894 transitions. Second operand has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:24:24,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:24:24,937 INFO L93 Difference]: Finished difference Result 5823 states and 7674 transitions. [2025-03-03 16:24:24,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 16:24:24,938 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 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 157 [2025-03-03 16:24:24,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:24:24,960 INFO L225 Difference]: With dead ends: 5823 [2025-03-03 16:24:24,960 INFO L226 Difference]: Without dead ends: 5134 [2025-03-03 16:24:24,963 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 16:24:24,963 INFO L435 NwaCegarLoop]: 809 mSDtfsCounter, 1206 mSDsluCounter, 2444 mSDsCounter, 0 mSdLazyCounter, 1218 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1236 SdHoareTripleChecker+Valid, 3253 SdHoareTripleChecker+Invalid, 1272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 1218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 16:24:24,964 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1236 Valid, 3253 Invalid, 1272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 1218 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 16:24:24,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5134 states. [2025-03-03 16:24:25,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5134 to 5019. [2025-03-03 16:24:25,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5019 states, 4059 states have (on average 1.2916974624291697) internal successors, (5243), 4116 states have internal predecessors, (5243), 506 states have call successors, (506), 346 states have call predecessors, (506), 452 states have return successors, (646), 559 states have call predecessors, (646), 502 states have call successors, (646) [2025-03-03 16:24:25,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5019 states to 5019 states and 6395 transitions. [2025-03-03 16:24:25,210 INFO L78 Accepts]: Start accepts. Automaton has 5019 states and 6395 transitions. Word has length 157 [2025-03-03 16:24:25,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:24:25,211 INFO L471 AbstractCegarLoop]: Abstraction has 5019 states and 6395 transitions. [2025-03-03 16:24:25,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:24:25,211 INFO L276 IsEmpty]: Start isEmpty. Operand 5019 states and 6395 transitions. [2025-03-03 16:24:25,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-03-03 16:24:25,213 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:24:25,213 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] [2025-03-03 16:24:25,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 16:24:25,213 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:24:25,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:24:25,214 INFO L85 PathProgramCache]: Analyzing trace with hash 1645992095, now seen corresponding path program 1 times [2025-03-03 16:24:25,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:24:25,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286216934] [2025-03-03 16:24:25,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:24:25,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:24:25,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-03-03 16:24:25,227 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-03-03 16:24:25,227 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:24:25,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:24:25,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:24:25,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:24:25,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286216934] [2025-03-03 16:24:25,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286216934] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:24:25,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:24:25,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:24:25,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631257578] [2025-03-03 16:24:25,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:24:25,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:24:25,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:24:25,345 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:24:25,345 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:24:25,345 INFO L87 Difference]: Start difference. First operand 5019 states and 6395 transitions. Second operand has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:24:26,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:24:26,369 INFO L93 Difference]: Finished difference Result 6865 states and 9292 transitions. [2025-03-03 16:24:26,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 16:24:26,370 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 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 157 [2025-03-03 16:24:26,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:24:26,388 INFO L225 Difference]: With dead ends: 6865 [2025-03-03 16:24:26,388 INFO L226 Difference]: Without dead ends: 5848 [2025-03-03 16:24:26,393 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 16:24:26,393 INFO L435 NwaCegarLoop]: 805 mSDtfsCounter, 1201 mSDsluCounter, 2432 mSDsCounter, 0 mSdLazyCounter, 1218 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1231 SdHoareTripleChecker+Valid, 3237 SdHoareTripleChecker+Invalid, 1272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 1218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 16:24:26,394 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1231 Valid, 3237 Invalid, 1272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 1218 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 16:24:26,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5848 states. [2025-03-03 16:24:26,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5848 to 5716. [2025-03-03 16:24:26,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5716 states, 4702 states have (on average 1.32666950233943) internal successors, (6238), 4763 states have internal predecessors, (6238), 544 states have call successors, (544), 358 states have call predecessors, (544), 468 states have return successors, (696), 599 states have call predecessors, (696), 540 states have call successors, (696) [2025-03-03 16:24:26,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5716 states to 5716 states and 7478 transitions. [2025-03-03 16:24:26,737 INFO L78 Accepts]: Start accepts. Automaton has 5716 states and 7478 transitions. Word has length 157 [2025-03-03 16:24:26,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:24:26,739 INFO L471 AbstractCegarLoop]: Abstraction has 5716 states and 7478 transitions. [2025-03-03 16:24:26,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:24:26,739 INFO L276 IsEmpty]: Start isEmpty. Operand 5716 states and 7478 transitions. [2025-03-03 16:24:26,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-03-03 16:24:26,741 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:24:26,741 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] [2025-03-03 16:24:26,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 16:24:26,742 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:24:26,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:24:26,742 INFO L85 PathProgramCache]: Analyzing trace with hash -1310211778, now seen corresponding path program 1 times [2025-03-03 16:24:26,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:24:26,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037421034] [2025-03-03 16:24:26,743 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:24:26,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:24:26,755 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-03-03 16:24:26,760 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-03-03 16:24:26,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:24:26,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:24:26,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:24:26,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:24:26,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037421034] [2025-03-03 16:24:26,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037421034] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:24:26,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:24:26,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:24:26,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014264356] [2025-03-03 16:24:26,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:24:26,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:24:26,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:24:26,852 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:24:26,852 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:24:26,852 INFO L87 Difference]: Start difference. First operand 5716 states and 7478 transitions. Second operand has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:24:27,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:24:27,806 INFO L93 Difference]: Finished difference Result 9108 states and 12849 transitions. [2025-03-03 16:24:27,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 16:24:27,806 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 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 157 [2025-03-03 16:24:27,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:24:27,828 INFO L225 Difference]: With dead ends: 9108 [2025-03-03 16:24:27,828 INFO L226 Difference]: Without dead ends: 7394 [2025-03-03 16:24:27,834 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 16:24:27,835 INFO L435 NwaCegarLoop]: 802 mSDtfsCounter, 1196 mSDsluCounter, 2423 mSDsCounter, 0 mSdLazyCounter, 1218 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1226 SdHoareTripleChecker+Valid, 3225 SdHoareTripleChecker+Invalid, 1272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 1218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 16:24:27,835 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1226 Valid, 3225 Invalid, 1272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 1218 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 16:24:27,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7394 states. [2025-03-03 16:24:28,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7394 to 7227. [2025-03-03 16:24:28,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7227 states, 6099 states have (on average 1.38416133792425) internal successors, (8442), 6174 states have internal predecessors, (8442), 620 states have call successors, (620), 382 states have call predecessors, (620), 506 states have return successors, (820), 679 states have call predecessors, (820), 616 states have call successors, (820) [2025-03-03 16:24:28,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7227 states to 7227 states and 9882 transitions. [2025-03-03 16:24:28,195 INFO L78 Accepts]: Start accepts. Automaton has 7227 states and 9882 transitions. Word has length 157 [2025-03-03 16:24:28,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:24:28,195 INFO L471 AbstractCegarLoop]: Abstraction has 7227 states and 9882 transitions. [2025-03-03 16:24:28,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:24:28,195 INFO L276 IsEmpty]: Start isEmpty. Operand 7227 states and 9882 transitions. [2025-03-03 16:24:28,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-03-03 16:24:28,198 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:24:28,198 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] [2025-03-03 16:24:28,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 16:24:28,198 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:24:28,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:24:28,199 INFO L85 PathProgramCache]: Analyzing trace with hash -1128478529, now seen corresponding path program 1 times [2025-03-03 16:24:28,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:24:28,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308785729] [2025-03-03 16:24:28,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:24:28,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:24:28,207 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-03-03 16:24:28,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-03-03 16:24:28,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:24:28,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:24:28,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:24:28,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:24:28,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308785729] [2025-03-03 16:24:28,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308785729] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:24:28,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:24:28,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:24:28,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588556261] [2025-03-03 16:24:28,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:24:28,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:24:28,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:24:28,298 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:24:28,298 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:24:28,299 INFO L87 Difference]: Start difference. First operand 7227 states and 9882 transitions. Second operand has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:24:29,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:24:29,313 INFO L93 Difference]: Finished difference Result 14043 states and 20903 transitions. [2025-03-03 16:24:29,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 16:24:29,314 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 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 157 [2025-03-03 16:24:29,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:24:29,345 INFO L225 Difference]: With dead ends: 14043 [2025-03-03 16:24:29,346 INFO L226 Difference]: Without dead ends: 10818 [2025-03-03 16:24:29,354 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 16:24:29,355 INFO L435 NwaCegarLoop]: 799 mSDtfsCounter, 1191 mSDsluCounter, 2414 mSDsCounter, 0 mSdLazyCounter, 1218 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1221 SdHoareTripleChecker+Valid, 3213 SdHoareTripleChecker+Invalid, 1272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 1218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 16:24:29,355 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1221 Valid, 3213 Invalid, 1272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 1218 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 16:24:29,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10818 states. [2025-03-03 16:24:29,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10818 to 10582. [2025-03-03 16:24:29,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10582 states, 9208 states have (on average 1.4615551694178974) internal successors, (13458), 9329 states have internal predecessors, (13458), 772 states have call successors, (772), 430 states have call predecessors, (772), 600 states have return successors, (1164), 839 states have call predecessors, (1164), 768 states have call successors, (1164) [2025-03-03 16:24:29,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10582 states to 10582 states and 15394 transitions. [2025-03-03 16:24:29,921 INFO L78 Accepts]: Start accepts. Automaton has 10582 states and 15394 transitions. Word has length 157 [2025-03-03 16:24:29,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:24:29,921 INFO L471 AbstractCegarLoop]: Abstraction has 10582 states and 15394 transitions. [2025-03-03 16:24:29,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:24:29,922 INFO L276 IsEmpty]: Start isEmpty. Operand 10582 states and 15394 transitions. [2025-03-03 16:24:29,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-03-03 16:24:29,926 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:24:29,926 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] [2025-03-03 16:24:29,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 16:24:29,926 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:24:29,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:24:29,926 INFO L85 PathProgramCache]: Analyzing trace with hash -984068834, now seen corresponding path program 1 times [2025-03-03 16:24:29,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:24:29,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471522452] [2025-03-03 16:24:29,927 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:24:29,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:24:29,935 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-03-03 16:24:29,938 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-03-03 16:24:29,938 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:24:29,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:24:30,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:24:30,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:24:30,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471522452] [2025-03-03 16:24:30,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471522452] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:24:30,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:24:30,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 16:24:30,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132592346] [2025-03-03 16:24:30,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:24:30,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 16:24:30,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:24:30,020 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 16:24:30,020 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 16:24:30,020 INFO L87 Difference]: Start difference. First operand 10582 states and 15394 transitions. Second operand has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:24:30,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:24:30,799 INFO L93 Difference]: Finished difference Result 18656 states and 28986 transitions. [2025-03-03 16:24:30,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 16:24:30,799 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 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 157 [2025-03-03 16:24:30,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:24:30,834 INFO L225 Difference]: With dead ends: 18656 [2025-03-03 16:24:30,834 INFO L226 Difference]: Without dead ends: 12076 [2025-03-03 16:24:30,848 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:24:30,849 INFO L435 NwaCegarLoop]: 486 mSDtfsCounter, 910 mSDsluCounter, 805 mSDsCounter, 0 mSdLazyCounter, 560 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 940 SdHoareTripleChecker+Valid, 1291 SdHoareTripleChecker+Invalid, 615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 560 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 16:24:30,849 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [940 Valid, 1291 Invalid, 615 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 560 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 16:24:30,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12076 states. [2025-03-03 16:24:31,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12076 to 10582. [2025-03-03 16:24:31,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10582 states, 9208 states have (on average 1.459708948740226) internal successors, (13441), 9329 states have internal predecessors, (13441), 772 states have call successors, (772), 430 states have call predecessors, (772), 600 states have return successors, (1164), 839 states have call predecessors, (1164), 768 states have call successors, (1164) [2025-03-03 16:24:31,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10582 states to 10582 states and 15377 transitions. [2025-03-03 16:24:31,341 INFO L78 Accepts]: Start accepts. Automaton has 10582 states and 15377 transitions. Word has length 157 [2025-03-03 16:24:31,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:24:31,341 INFO L471 AbstractCegarLoop]: Abstraction has 10582 states and 15377 transitions. [2025-03-03 16:24:31,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:24:31,341 INFO L276 IsEmpty]: Start isEmpty. Operand 10582 states and 15377 transitions. [2025-03-03 16:24:31,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-03-03 16:24:31,347 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:24:31,347 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] [2025-03-03 16:24:31,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 16:24:31,347 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:24:31,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:24:31,348 INFO L85 PathProgramCache]: Analyzing trace with hash -1256505121, now seen corresponding path program 1 times [2025-03-03 16:24:31,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:24:31,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265121060] [2025-03-03 16:24:31,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:24:31,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:24:31,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-03-03 16:24:31,375 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-03-03 16:24:31,375 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:24:31,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:24:31,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:24:31,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:24:31,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265121060] [2025-03-03 16:24:31,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265121060] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:24:31,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:24:31,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 16:24:31,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764468598] [2025-03-03 16:24:31,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:24:31,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 16:24:31,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:24:31,448 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 16:24:31,448 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 16:24:31,449 INFO L87 Difference]: Start difference. First operand 10582 states and 15377 transitions. Second operand has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:24:32,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:24:32,254 INFO L93 Difference]: Finished difference Result 18573 states and 28786 transitions. [2025-03-03 16:24:32,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 16:24:32,254 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 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 157 [2025-03-03 16:24:32,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:24:32,290 INFO L225 Difference]: With dead ends: 18573 [2025-03-03 16:24:32,290 INFO L226 Difference]: Without dead ends: 11993 [2025-03-03 16:24:32,308 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:24:32,309 INFO L435 NwaCegarLoop]: 483 mSDtfsCounter, 907 mSDsluCounter, 800 mSDsCounter, 0 mSdLazyCounter, 560 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 937 SdHoareTripleChecker+Valid, 1283 SdHoareTripleChecker+Invalid, 615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 560 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 16:24:32,309 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [937 Valid, 1283 Invalid, 615 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 560 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 16:24:32,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11993 states. [2025-03-03 16:24:32,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11993 to 10582. [2025-03-03 16:24:32,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10582 states, 9208 states have (on average 1.4578627280625542) internal successors, (13424), 9329 states have internal predecessors, (13424), 772 states have call successors, (772), 430 states have call predecessors, (772), 600 states have return successors, (1164), 839 states have call predecessors, (1164), 768 states have call successors, (1164) [2025-03-03 16:24:32,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10582 states to 10582 states and 15360 transitions. [2025-03-03 16:24:32,956 INFO L78 Accepts]: Start accepts. Automaton has 10582 states and 15360 transitions. Word has length 157 [2025-03-03 16:24:32,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:24:32,956 INFO L471 AbstractCegarLoop]: Abstraction has 10582 states and 15360 transitions. [2025-03-03 16:24:32,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:24:32,957 INFO L276 IsEmpty]: Start isEmpty. Operand 10582 states and 15360 transitions. [2025-03-03 16:24:32,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-03-03 16:24:32,961 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:24:32,961 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] [2025-03-03 16:24:32,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-03 16:24:32,962 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:24:32,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:24:32,962 INFO L85 PathProgramCache]: Analyzing trace with hash 1228558590, now seen corresponding path program 1 times [2025-03-03 16:24:32,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:24:32,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241939024] [2025-03-03 16:24:32,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:24:32,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:24:32,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-03-03 16:24:32,980 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-03-03 16:24:32,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:24:32,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:24:33,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:24:33,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:24:33,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241939024] [2025-03-03 16:24:33,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241939024] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:24:33,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:24:33,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 16:24:33,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579879363] [2025-03-03 16:24:33,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:24:33,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 16:24:33,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:24:33,070 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 16:24:33,070 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 16:24:33,070 INFO L87 Difference]: Start difference. First operand 10582 states and 15360 transitions. Second operand has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:24:34,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:24:34,217 INFO L93 Difference]: Finished difference Result 18490 states and 28586 transitions. [2025-03-03 16:24:34,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 16:24:34,217 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 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 157 [2025-03-03 16:24:34,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:24:34,256 INFO L225 Difference]: With dead ends: 18490 [2025-03-03 16:24:34,257 INFO L226 Difference]: Without dead ends: 11910 [2025-03-03 16:24:34,272 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:24:34,274 INFO L435 NwaCegarLoop]: 480 mSDtfsCounter, 904 mSDsluCounter, 795 mSDsCounter, 0 mSdLazyCounter, 560 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 934 SdHoareTripleChecker+Valid, 1275 SdHoareTripleChecker+Invalid, 615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 560 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 16:24:34,274 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [934 Valid, 1275 Invalid, 615 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 560 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 16:24:34,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11910 states. [2025-03-03 16:24:34,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11910 to 10582. [2025-03-03 16:24:34,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10582 states, 9208 states have (on average 1.4560165073848828) internal successors, (13407), 9329 states have internal predecessors, (13407), 772 states have call successors, (772), 430 states have call predecessors, (772), 600 states have return successors, (1164), 839 states have call predecessors, (1164), 768 states have call successors, (1164) [2025-03-03 16:24:34,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10582 states to 10582 states and 15343 transitions. [2025-03-03 16:24:34,800 INFO L78 Accepts]: Start accepts. Automaton has 10582 states and 15343 transitions. Word has length 157 [2025-03-03 16:24:34,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:24:34,801 INFO L471 AbstractCegarLoop]: Abstraction has 10582 states and 15343 transitions. [2025-03-03 16:24:34,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:24:34,801 INFO L276 IsEmpty]: Start isEmpty. Operand 10582 states and 15343 transitions. [2025-03-03 16:24:34,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-03-03 16:24:34,805 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:24:34,805 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] [2025-03-03 16:24:34,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-03 16:24:34,805 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:24:34,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:24:34,806 INFO L85 PathProgramCache]: Analyzing trace with hash 754532607, now seen corresponding path program 1 times [2025-03-03 16:24:34,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:24:34,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582890733] [2025-03-03 16:24:34,806 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:24:34,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:24:34,813 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-03-03 16:24:34,816 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-03-03 16:24:34,816 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:24:34,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:24:34,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:24:34,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:24:34,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582890733] [2025-03-03 16:24:34,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582890733] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:24:34,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:24:34,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:24:34,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505232708] [2025-03-03 16:24:34,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:24:34,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:24:34,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:24:34,905 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:24:34,905 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:24:34,905 INFO L87 Difference]: Start difference. First operand 10582 states and 15343 transitions. Second operand has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:24:36,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:24:36,229 INFO L93 Difference]: Finished difference Result 24886 states and 39056 transitions. [2025-03-03 16:24:36,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 16:24:36,230 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 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 157 [2025-03-03 16:24:36,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:24:36,290 INFO L225 Difference]: With dead ends: 24886 [2025-03-03 16:24:36,290 INFO L226 Difference]: Without dead ends: 18306 [2025-03-03 16:24:36,305 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 16:24:36,306 INFO L435 NwaCegarLoop]: 781 mSDtfsCounter, 1162 mSDsluCounter, 2363 mSDsCounter, 0 mSdLazyCounter, 1218 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1192 SdHoareTripleChecker+Valid, 3144 SdHoareTripleChecker+Invalid, 1272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 1218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 16:24:36,306 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1192 Valid, 3144 Invalid, 1272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 1218 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 16:24:36,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18306 states. [2025-03-03 16:24:36,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18306 to 17994. [2025-03-03 16:24:37,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17994 states, 16074 states have (on average 1.5319771058852807) internal successors, (24625), 16341 states have internal predecessors, (24625), 1076 states have call successors, (1076), 526 states have call predecessors, (1076), 842 states have return successors, (2236), 1159 states have call predecessors, (2236), 1072 states have call successors, (2236) [2025-03-03 16:24:37,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17994 states to 17994 states and 27937 transitions. [2025-03-03 16:24:37,050 INFO L78 Accepts]: Start accepts. Automaton has 17994 states and 27937 transitions. Word has length 157 [2025-03-03 16:24:37,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:24:37,050 INFO L471 AbstractCegarLoop]: Abstraction has 17994 states and 27937 transitions. [2025-03-03 16:24:37,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:24:37,050 INFO L276 IsEmpty]: Start isEmpty. Operand 17994 states and 27937 transitions. [2025-03-03 16:24:37,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-03-03 16:24:37,056 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:24:37,056 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] [2025-03-03 16:24:37,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-03 16:24:37,056 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:24:37,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:24:37,057 INFO L85 PathProgramCache]: Analyzing trace with hash 462146782, now seen corresponding path program 1 times [2025-03-03 16:24:37,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:24:37,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430952552] [2025-03-03 16:24:37,057 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:24:37,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:24:37,113 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-03-03 16:24:37,116 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-03-03 16:24:37,116 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:24:37,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:24:37,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:24:37,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:24:37,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430952552] [2025-03-03 16:24:37,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430952552] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:24:37,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:24:37,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 16:24:37,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994841055] [2025-03-03 16:24:37,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:24:37,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 16:24:37,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:24:37,176 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 16:24:37,176 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 16:24:37,176 INFO L87 Difference]: Start difference. First operand 17994 states and 27937 transitions. Second operand has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:24:38,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:24:38,192 INFO L93 Difference]: Finished difference Result 35416 states and 58258 transitions. [2025-03-03 16:24:38,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 16:24:38,196 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 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 157 [2025-03-03 16:24:38,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:24:38,259 INFO L225 Difference]: With dead ends: 35416 [2025-03-03 16:24:38,259 INFO L226 Difference]: Without dead ends: 21424 [2025-03-03 16:24:38,294 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:24:38,298 INFO L435 NwaCegarLoop]: 475 mSDtfsCounter, 900 mSDsluCounter, 786 mSDsCounter, 0 mSdLazyCounter, 560 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 930 SdHoareTripleChecker+Valid, 1261 SdHoareTripleChecker+Invalid, 615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 560 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 16:24:38,300 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [930 Valid, 1261 Invalid, 615 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 560 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 16:24:38,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21424 states. [2025-03-03 16:24:39,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21424 to 17994. [2025-03-03 16:24:39,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17994 states, 16074 states have (on average 1.5299241010327236) internal successors, (24592), 16341 states have internal predecessors, (24592), 1076 states have call successors, (1076), 526 states have call predecessors, (1076), 842 states have return successors, (2236), 1159 states have call predecessors, (2236), 1072 states have call successors, (2236) [2025-03-03 16:24:39,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17994 states to 17994 states and 27904 transitions. [2025-03-03 16:24:39,712 INFO L78 Accepts]: Start accepts. Automaton has 17994 states and 27904 transitions. Word has length 157 [2025-03-03 16:24:39,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:24:39,712 INFO L471 AbstractCegarLoop]: Abstraction has 17994 states and 27904 transitions. [2025-03-03 16:24:39,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:24:39,713 INFO L276 IsEmpty]: Start isEmpty. Operand 17994 states and 27904 transitions. [2025-03-03 16:24:39,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-03-03 16:24:39,718 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:24:39,718 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] [2025-03-03 16:24:39,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-03 16:24:39,718 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:24:39,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:24:39,719 INFO L85 PathProgramCache]: Analyzing trace with hash -1902589665, now seen corresponding path program 1 times [2025-03-03 16:24:39,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:24:39,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554717493] [2025-03-03 16:24:39,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:24:39,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:24:39,729 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-03-03 16:24:39,735 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-03-03 16:24:39,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:24:39,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:24:39,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:24:39,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:24:39,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554717493] [2025-03-03 16:24:39,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554717493] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:24:39,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:24:39,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:24:39,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459286879] [2025-03-03 16:24:39,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:24:39,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:24:39,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:24:39,819 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:24:39,820 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:24:39,820 INFO L87 Difference]: Start difference. First operand 17994 states and 27904 transitions. Second operand has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:24:41,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:24:41,478 INFO L93 Difference]: Finished difference Result 49236 states and 82001 transitions. [2025-03-03 16:24:41,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 16:24:41,479 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 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 157 [2025-03-03 16:24:41,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:24:41,583 INFO L225 Difference]: With dead ends: 49236 [2025-03-03 16:24:41,583 INFO L226 Difference]: Without dead ends: 35244 [2025-03-03 16:24:41,622 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 16:24:41,622 INFO L435 NwaCegarLoop]: 773 mSDtfsCounter, 1149 mSDsluCounter, 2340 mSDsCounter, 0 mSdLazyCounter, 1218 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1179 SdHoareTripleChecker+Valid, 3113 SdHoareTripleChecker+Invalid, 1272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 1218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 16:24:41,622 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1179 Valid, 3113 Invalid, 1272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 1218 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 16:24:41,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35244 states. [2025-03-03 16:24:42,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35244 to 34762. [2025-03-03 16:24:42,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34762 states, 31588 states have (on average 1.5949727744713182) internal successors, (50382), 32309 states have internal predecessors, (50382), 1684 states have call successors, (1684), 718 states have call predecessors, (1684), 1488 states have return successors, (5916), 1799 states have call predecessors, (5916), 1680 states have call successors, (5916) [2025-03-03 16:24:43,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34762 states to 34762 states and 57982 transitions. [2025-03-03 16:24:43,067 INFO L78 Accepts]: Start accepts. Automaton has 34762 states and 57982 transitions. Word has length 157 [2025-03-03 16:24:43,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:24:43,068 INFO L471 AbstractCegarLoop]: Abstraction has 34762 states and 57982 transitions. [2025-03-03 16:24:43,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:24:43,068 INFO L276 IsEmpty]: Start isEmpty. Operand 34762 states and 57982 transitions. [2025-03-03 16:24:43,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-03-03 16:24:43,076 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:24:43,076 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] [2025-03-03 16:24:43,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-03 16:24:43,076 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:24:43,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:24:43,077 INFO L85 PathProgramCache]: Analyzing trace with hash -2117418818, now seen corresponding path program 1 times [2025-03-03 16:24:43,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:24:43,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156235796] [2025-03-03 16:24:43,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:24:43,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:24:43,084 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-03-03 16:24:43,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-03-03 16:24:43,087 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:24:43,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:24:43,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:24:43,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:24:43,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156235796] [2025-03-03 16:24:43,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156235796] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:24:43,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:24:43,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:24:43,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750630682] [2025-03-03 16:24:43,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:24:43,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:24:43,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:24:43,162 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:24:43,162 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:24:43,162 INFO L87 Difference]: Start difference. First operand 34762 states and 57982 transitions. Second operand has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:24:45,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:24:45,959 INFO L93 Difference]: Finished difference Result 110278 states and 196126 transitions. [2025-03-03 16:24:45,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 16:24:45,959 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 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 157 [2025-03-03 16:24:45,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:24:46,299 INFO L225 Difference]: With dead ends: 110278 [2025-03-03 16:24:46,299 INFO L226 Difference]: Without dead ends: 79518 [2025-03-03 16:24:46,403 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 16:24:46,404 INFO L435 NwaCegarLoop]: 768 mSDtfsCounter, 1458 mSDsluCounter, 2320 mSDsCounter, 0 mSdLazyCounter, 1221 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1499 SdHoareTripleChecker+Valid, 3088 SdHoareTripleChecker+Invalid, 1278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 1221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 16:24:46,404 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1499 Valid, 3088 Invalid, 1278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 1221 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 16:24:46,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79518 states. [2025-03-03 16:24:50,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79518 to 73695. [2025-03-03 16:24:50,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73695 states, 67591 states have (on average 1.649953396162211) internal successors, (111522), 69706 states have internal predecessors, (111522), 2836 states have call successors, (2836), 1102 states have call predecessors, (2836), 3266 states have return successors, (19356), 3015 states have call predecessors, (19356), 2832 states have call successors, (19356) [2025-03-03 16:24:50,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73695 states to 73695 states and 133714 transitions. [2025-03-03 16:24:50,536 INFO L78 Accepts]: Start accepts. Automaton has 73695 states and 133714 transitions. Word has length 157 [2025-03-03 16:24:50,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:24:50,537 INFO L471 AbstractCegarLoop]: Abstraction has 73695 states and 133714 transitions. [2025-03-03 16:24:50,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:24:50,537 INFO L276 IsEmpty]: Start isEmpty. Operand 73695 states and 133714 transitions. [2025-03-03 16:24:50,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-03-03 16:24:50,551 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:24:50,551 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] [2025-03-03 16:24:50,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-03 16:24:50,552 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:24:50,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:24:50,552 INFO L85 PathProgramCache]: Analyzing trace with hash -323233473, now seen corresponding path program 1 times [2025-03-03 16:24:50,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:24:50,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458636601] [2025-03-03 16:24:50,552 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:24:50,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:24:50,560 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-03-03 16:24:50,562 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-03-03 16:24:50,563 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:24:50,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:24:50,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:24:50,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:24:50,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458636601] [2025-03-03 16:24:50,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458636601] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:24:50,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:24:50,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:24:50,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400972257] [2025-03-03 16:24:50,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:24:50,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:24:50,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:24:50,632 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:24:50,632 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:24:50,632 INFO L87 Difference]: Start difference. First operand 73695 states and 133714 transitions. Second operand has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:24:58,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:24:58,024 INFO L93 Difference]: Finished difference Result 246799 states and 481240 transitions. [2025-03-03 16:24:58,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 16:24:58,024 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 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 157 [2025-03-03 16:24:58,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:24:58,887 INFO L225 Difference]: With dead ends: 246799 [2025-03-03 16:24:58,887 INFO L226 Difference]: Without dead ends: 177106 [2025-03-03 16:24:59,037 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 16:24:59,038 INFO L435 NwaCegarLoop]: 764 mSDtfsCounter, 1422 mSDsluCounter, 2308 mSDsCounter, 0 mSdLazyCounter, 1221 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1463 SdHoareTripleChecker+Valid, 3072 SdHoareTripleChecker+Invalid, 1278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 1221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 16:24:59,038 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1463 Valid, 3072 Invalid, 1278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 1221 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 16:24:59,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177106 states.