./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.12.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.12.cil-1.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 54640fbb6743a38bf41f3a8b2318fcad885a58c92146d7845af619d355e32c56 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 17:57:13,545 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 17:57:13,599 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 17:57:13,605 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 17:57:13,605 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 17:57:13,628 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 17:57:13,629 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 17:57:13,629 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 17:57:13,629 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 17:57:13,629 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 17:57:13,629 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 17:57:13,629 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 17:57:13,630 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 17:57:13,630 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 17:57:13,631 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 17:57:13,631 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 17:57:13,631 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 17:57:13,631 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 17:57:13,631 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 17:57:13,631 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 17:57:13,631 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 17:57:13,631 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 17:57:13,631 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 17:57:13,631 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 17:57:13,631 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 17:57:13,632 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 17:57:13,632 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 17:57:13,632 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 17:57:13,632 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 17:57:13,632 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 17:57:13,632 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 17:57:13,632 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 17:57:13,632 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 17:57:13,632 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 17:57:13,632 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 17:57:13,632 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 17:57:13,633 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 17:57:13,633 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 17:57:13,633 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 17:57:13,633 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 17:57:13,633 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 17:57:13,633 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 17:57:13,633 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 17:57:13,633 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 54640fbb6743a38bf41f3a8b2318fcad885a58c92146d7845af619d355e32c56 [2025-02-05 17:57:13,877 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 17:57:13,883 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 17:57:13,884 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 17:57:13,885 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 17:57:13,885 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 17:57:13,886 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.12.cil-1.c [2025-02-05 17:57:15,071 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e04e81d79/e2b2881e396c4101aececcb890209132/FLAG09df33e68 [2025-02-05 17:57:15,309 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 17:57:15,310 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.12.cil-1.c [2025-02-05 17:57:15,323 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e04e81d79/e2b2881e396c4101aececcb890209132/FLAG09df33e68 [2025-02-05 17:57:15,334 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e04e81d79/e2b2881e396c4101aececcb890209132 [2025-02-05 17:57:15,336 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 17:57:15,337 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 17:57:15,337 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 17:57:15,337 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 17:57:15,340 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 17:57:15,341 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 05:57:15" (1/1) ... [2025-02-05 17:57:15,342 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c2a9350 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:57:15, skipping insertion in model container [2025-02-05 17:57:15,342 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 05:57:15" (1/1) ... [2025-02-05 17:57:15,373 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 17:57:15,478 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.12.cil-1.c[911,924] [2025-02-05 17:57:15,526 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.12.cil-1.c[8416,8429] [2025-02-05 17:57:15,597 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 17:57:15,607 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 17:57:15,614 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.12.cil-1.c[911,924] [2025-02-05 17:57:15,638 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.12.cil-1.c[8416,8429] [2025-02-05 17:57:15,671 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 17:57:15,693 INFO L204 MainTranslator]: Completed translation [2025-02-05 17:57:15,693 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:57:15 WrapperNode [2025-02-05 17:57:15,695 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 17:57:15,695 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 17:57:15,696 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 17:57:15,696 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 17:57:15,700 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:57:15" (1/1) ... [2025-02-05 17:57:15,707 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:57:15" (1/1) ... [2025-02-05 17:57:15,735 INFO L138 Inliner]: procedures = 79, calls = 98, calls flagged for inlining = 47, calls inlined = 47, statements flattened = 1055 [2025-02-05 17:57:15,735 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 17:57:15,736 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 17:57:15,736 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 17:57:15,736 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 17:57:15,749 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:57:15" (1/1) ... [2025-02-05 17:57:15,752 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:57:15" (1/1) ... [2025-02-05 17:57:15,756 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:57:15" (1/1) ... [2025-02-05 17:57:15,781 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-05 17:57:15,782 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:57:15" (1/1) ... [2025-02-05 17:57:15,782 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:57:15" (1/1) ... [2025-02-05 17:57:15,792 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:57:15" (1/1) ... [2025-02-05 17:57:15,800 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:57:15" (1/1) ... [2025-02-05 17:57:15,802 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:57:15" (1/1) ... [2025-02-05 17:57:15,808 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:57:15" (1/1) ... [2025-02-05 17:57:15,815 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 17:57:15,815 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 17:57:15,816 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 17:57:15,816 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 17:57:15,816 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:57:15" (1/1) ... [2025-02-05 17:57:15,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 17:57:15,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:57:15,843 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 17:57:15,846 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 17:57:15,864 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 17:57:15,864 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-02-05 17:57:15,864 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-02-05 17:57:15,864 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2025-02-05 17:57:15,864 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2025-02-05 17:57:15,864 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2025-02-05 17:57:15,864 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2025-02-05 17:57:15,864 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2025-02-05 17:57:15,864 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2025-02-05 17:57:15,865 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2025-02-05 17:57:15,865 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2025-02-05 17:57:15,865 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2025-02-05 17:57:15,865 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2025-02-05 17:57:15,865 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2025-02-05 17:57:15,865 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2025-02-05 17:57:15,865 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2025-02-05 17:57:15,865 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2025-02-05 17:57:15,865 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2025-02-05 17:57:15,865 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2025-02-05 17:57:15,865 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2025-02-05 17:57:15,865 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2025-02-05 17:57:15,865 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2025-02-05 17:57:15,865 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2025-02-05 17:57:15,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 17:57:15,865 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2025-02-05 17:57:15,865 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2025-02-05 17:57:15,865 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2025-02-05 17:57:15,865 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2025-02-05 17:57:15,865 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 17:57:15,865 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 17:57:15,865 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2025-02-05 17:57:15,865 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2025-02-05 17:57:15,865 INFO L130 BoogieDeclarations]: Found specification of procedure error2 [2025-02-05 17:57:15,865 INFO L138 BoogieDeclarations]: Found implementation of procedure error2 [2025-02-05 17:57:15,971 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 17:57:15,973 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 17:57:16,619 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L225: do_read_c_~a~0#1 := ~a_t~0; [2025-02-05 17:57:16,619 INFO L1309 $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-02-05 17:57:16,619 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L226: assume !(1 == ~q_free~0); [2025-02-05 17:57:16,797 INFO L? ?]: Removed 134 outVars from TransFormulas that were not future-live. [2025-02-05 17:57:16,797 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 17:57:16,816 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 17:57:16,817 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 17:57:16,818 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 05:57:16 BoogieIcfgContainer [2025-02-05 17:57:16,818 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 17:57:16,820 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 17:57:16,820 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 17:57:16,825 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 17:57:16,825 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 05:57:15" (1/3) ... [2025-02-05 17:57:16,825 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@796cb1e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 05:57:16, skipping insertion in model container [2025-02-05 17:57:16,825 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:57:15" (2/3) ... [2025-02-05 17:57:16,826 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@796cb1e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 05:57:16, skipping insertion in model container [2025-02-05 17:57:16,826 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 05:57:16" (3/3) ... [2025-02-05 17:57:16,826 INFO L128 eAbstractionObserver]: Analyzing ICFG pc_sfifo_3.cil+token_ring.12.cil-1.c [2025-02-05 17:57:16,837 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 17:57:16,839 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pc_sfifo_3.cil+token_ring.12.cil-1.c that has 16 procedures, 535 locations, 1 initial locations, 19 loop locations, and 2 error locations. [2025-02-05 17:57:16,890 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 17:57:16,898 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;@543e54fc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 17:57:16,899 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-02-05 17:57:16,905 INFO L276 IsEmpty]: Start isEmpty. Operand has 536 states, 473 states have (on average 1.5644820295983086) internal successors, (740), 482 states have internal predecessors, (740), 44 states have call successors, (44), 15 states have call predecessors, (44), 15 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) [2025-02-05 17:57:16,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-02-05 17:57:16,913 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:57:16,914 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:57:16,914 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:57:16,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:57:16,920 INFO L85 PathProgramCache]: Analyzing trace with hash 2073597953, now seen corresponding path program 1 times [2025-02-05 17:57:16,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:57:16,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13396576] [2025-02-05 17:57:16,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:57:16,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:57:17,015 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-02-05 17:57:17,052 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-02-05 17:57:17,053 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:57:17,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:57:17,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:57:17,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:57:17,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13396576] [2025-02-05 17:57:17,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13396576] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:57:17,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:57:17,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:57:17,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996475561] [2025-02-05 17:57:17,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:57:17,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:57:17,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:57:17,378 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:57:17,378 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:57:17,381 INFO L87 Difference]: Start difference. First operand has 536 states, 473 states have (on average 1.5644820295983086) internal successors, (740), 482 states have internal predecessors, (740), 44 states have call successors, (44), 15 states have call predecessors, (44), 15 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-02-05 17:57:18,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:57:18,247 INFO L93 Difference]: Finished difference Result 1165 states and 1793 transitions. [2025-02-05 17:57:18,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 17:57:18,249 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2025-02-05 17:57:18,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:57:18,262 INFO L225 Difference]: With dead ends: 1165 [2025-02-05 17:57:18,262 INFO L226 Difference]: Without dead ends: 645 [2025-02-05 17:57:18,268 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:57:18,271 INFO L435 NwaCegarLoop]: 486 mSDtfsCounter, 523 mSDsluCounter, 1262 mSDsCounter, 0 mSdLazyCounter, 1134 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 532 SdHoareTripleChecker+Valid, 1748 SdHoareTripleChecker+Invalid, 1199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 1134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 17:57:18,271 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [532 Valid, 1748 Invalid, 1199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 1134 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 17:57:18,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 645 states. [2025-02-05 17:57:18,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 645 to 638. [2025-02-05 17:57:18,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 638 states, 557 states have (on average 1.5008976660682227) internal successors, (836), 564 states have internal predecessors, (836), 57 states have call successors, (57), 22 states have call predecessors, (57), 22 states have return successors, (58), 54 states have call predecessors, (58), 53 states have call successors, (58) [2025-02-05 17:57:18,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 951 transitions. [2025-02-05 17:57:18,328 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 951 transitions. Word has length 65 [2025-02-05 17:57:18,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:57:18,328 INFO L471 AbstractCegarLoop]: Abstraction has 638 states and 951 transitions. [2025-02-05 17:57:18,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-02-05 17:57:18,328 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 951 transitions. [2025-02-05 17:57:18,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-02-05 17:57:18,332 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:57:18,332 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:57:18,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 17:57:18,332 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:57:18,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:57:18,333 INFO L85 PathProgramCache]: Analyzing trace with hash 765558625, now seen corresponding path program 1 times [2025-02-05 17:57:18,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:57:18,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453669943] [2025-02-05 17:57:18,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:57:18,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:57:18,346 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-02-05 17:57:18,352 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-02-05 17:57:18,353 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:57:18,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:57:18,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:57:18,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:57:18,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453669943] [2025-02-05 17:57:18,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453669943] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:57:18,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:57:18,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:57:18,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26876230] [2025-02-05 17:57:18,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:57:18,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:57:18,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:57:18,504 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:57:18,504 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:57:18,505 INFO L87 Difference]: Start difference. First operand 638 states and 951 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-02-05 17:57:19,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:57:19,407 INFO L93 Difference]: Finished difference Result 1011 states and 1469 transitions. [2025-02-05 17:57:19,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:57:19,408 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2025-02-05 17:57:19,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:57:19,415 INFO L225 Difference]: With dead ends: 1011 [2025-02-05 17:57:19,417 INFO L226 Difference]: Without dead ends: 798 [2025-02-05 17:57:19,418 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-05 17:57:19,419 INFO L435 NwaCegarLoop]: 528 mSDtfsCounter, 1132 mSDsluCounter, 1486 mSDsCounter, 0 mSdLazyCounter, 1445 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1167 SdHoareTripleChecker+Valid, 2014 SdHoareTripleChecker+Invalid, 1513 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 1445 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 17:57:19,419 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1167 Valid, 2014 Invalid, 1513 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 1445 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 17:57:19,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 798 states. [2025-02-05 17:57:19,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 798 to 752. [2025-02-05 17:57:19,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 752 states, 649 states have (on average 1.4838212634822805) internal successors, (963), 658 states have internal predecessors, (963), 70 states have call successors, (70), 29 states have call predecessors, (70), 31 states have return successors, (79), 68 states have call predecessors, (79), 66 states have call successors, (79) [2025-02-05 17:57:19,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 752 states to 752 states and 1112 transitions. [2025-02-05 17:57:19,474 INFO L78 Accepts]: Start accepts. Automaton has 752 states and 1112 transitions. Word has length 65 [2025-02-05 17:57:19,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:57:19,474 INFO L471 AbstractCegarLoop]: Abstraction has 752 states and 1112 transitions. [2025-02-05 17:57:19,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-02-05 17:57:19,475 INFO L276 IsEmpty]: Start isEmpty. Operand 752 states and 1112 transitions. [2025-02-05 17:57:19,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-02-05 17:57:19,481 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:57:19,481 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:57:19,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 17:57:19,481 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:57:19,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:57:19,482 INFO L85 PathProgramCache]: Analyzing trace with hash 1898749218, now seen corresponding path program 1 times [2025-02-05 17:57:19,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:57:19,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713709219] [2025-02-05 17:57:19,482 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:57:19,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:57:19,499 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-02-05 17:57:19,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-02-05 17:57:19,503 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:57:19,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:57:19,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:57:19,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:57:19,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713709219] [2025-02-05 17:57:19,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713709219] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:57:19,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:57:19,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 17:57:19,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150839005] [2025-02-05 17:57:19,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:57:19,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 17:57:19,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:57:19,622 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 17:57:19,622 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-05 17:57:19,622 INFO L87 Difference]: Start difference. First operand 752 states and 1112 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-02-05 17:57:20,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:57:20,847 INFO L93 Difference]: Finished difference Result 2196 states and 3149 transitions. [2025-02-05 17:57:20,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-05 17:57:20,848 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-02-05 17:57:20,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:57:20,856 INFO L225 Difference]: With dead ends: 2196 [2025-02-05 17:57:20,856 INFO L226 Difference]: Without dead ends: 1857 [2025-02-05 17:57:20,858 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-02-05 17:57:20,859 INFO L435 NwaCegarLoop]: 537 mSDtfsCounter, 3481 mSDsluCounter, 1684 mSDsCounter, 0 mSdLazyCounter, 1567 mSolverCounterSat, 503 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3499 SdHoareTripleChecker+Valid, 2221 SdHoareTripleChecker+Invalid, 2070 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 503 IncrementalHoareTripleChecker+Valid, 1567 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:57:20,859 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3499 Valid, 2221 Invalid, 2070 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [503 Valid, 1567 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-05 17:57:20,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1857 states. [2025-02-05 17:57:20,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1857 to 1810. [2025-02-05 17:57:20,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1810 states, 1502 states have (on average 1.404127829560586) internal successors, (2109), 1526 states have internal predecessors, (2109), 180 states have call successors, (180), 112 states have call predecessors, (180), 126 states have return successors, (212), 174 states have call predecessors, (212), 176 states have call successors, (212) [2025-02-05 17:57:20,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1810 states to 1810 states and 2501 transitions. [2025-02-05 17:57:20,935 INFO L78 Accepts]: Start accepts. Automaton has 1810 states and 2501 transitions. Word has length 65 [2025-02-05 17:57:20,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:57:20,935 INFO L471 AbstractCegarLoop]: Abstraction has 1810 states and 2501 transitions. [2025-02-05 17:57:20,935 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-02-05 17:57:20,935 INFO L276 IsEmpty]: Start isEmpty. Operand 1810 states and 2501 transitions. [2025-02-05 17:57:20,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-02-05 17:57:20,937 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:57:20,937 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:57:20,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 17:57:20,937 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:57:20,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:57:20,937 INFO L85 PathProgramCache]: Analyzing trace with hash -874576785, now seen corresponding path program 1 times [2025-02-05 17:57:20,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:57:20,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267608010] [2025-02-05 17:57:20,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:57:20,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:57:20,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-02-05 17:57:20,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-02-05 17:57:20,948 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:57:20,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:57:21,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:57:21,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:57:21,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267608010] [2025-02-05 17:57:21,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267608010] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:57:21,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:57:21,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:57:21,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779554104] [2025-02-05 17:57:21,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:57:21,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:57:21,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:57:21,030 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:57:21,030 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:57:21,031 INFO L87 Difference]: Start difference. First operand 1810 states and 2501 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-05 17:57:21,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:57:21,107 INFO L93 Difference]: Finished difference Result 3241 states and 4431 transitions. [2025-02-05 17:57:21,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 17:57:21,107 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 66 [2025-02-05 17:57:21,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:57:21,117 INFO L225 Difference]: With dead ends: 3241 [2025-02-05 17:57:21,117 INFO L226 Difference]: Without dead ends: 1850 [2025-02-05 17:57:21,120 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:57:21,121 INFO L435 NwaCegarLoop]: 789 mSDtfsCounter, 0 mSDsluCounter, 3150 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3939 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-02-05 17:57:21,122 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3939 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:57:21,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1850 states. [2025-02-05 17:57:21,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1850 to 1850. [2025-02-05 17:57:21,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1850 states, 1534 states have (on average 1.3917861799217732) internal successors, (2135), 1558 states have internal predecessors, (2135), 180 states have call successors, (180), 112 states have call predecessors, (180), 134 states have return successors, (220), 182 states have call predecessors, (220), 176 states have call successors, (220) [2025-02-05 17:57:21,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1850 states to 1850 states and 2535 transitions. [2025-02-05 17:57:21,213 INFO L78 Accepts]: Start accepts. Automaton has 1850 states and 2535 transitions. Word has length 66 [2025-02-05 17:57:21,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:57:21,213 INFO L471 AbstractCegarLoop]: Abstraction has 1850 states and 2535 transitions. [2025-02-05 17:57:21,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-05 17:57:21,214 INFO L276 IsEmpty]: Start isEmpty. Operand 1850 states and 2535 transitions. [2025-02-05 17:57:21,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-02-05 17:57:21,215 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:57:21,215 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:57:21,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 17:57:21,215 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:57:21,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:57:21,216 INFO L85 PathProgramCache]: Analyzing trace with hash 758227214, now seen corresponding path program 1 times [2025-02-05 17:57:21,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:57:21,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333312016] [2025-02-05 17:57:21,216 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:57:21,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:57:21,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-02-05 17:57:21,230 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-02-05 17:57:21,230 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:57:21,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:57:21,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:57:21,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:57:21,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333312016] [2025-02-05 17:57:21,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333312016] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:57:21,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:57:21,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 17:57:21,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489812740] [2025-02-05 17:57:21,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:57:21,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 17:57:21,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:57:21,329 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 17:57:21,329 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-05 17:57:21,329 INFO L87 Difference]: Start difference. First operand 1850 states and 2535 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-02-05 17:57:22,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:57:22,530 INFO L93 Difference]: Finished difference Result 5122 states and 6918 transitions. [2025-02-05 17:57:22,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-05 17:57:22,531 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-02-05 17:57:22,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:57:22,540 INFO L225 Difference]: With dead ends: 5122 [2025-02-05 17:57:22,541 INFO L226 Difference]: Without dead ends: 2054 [2025-02-05 17:57:22,546 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-02-05 17:57:22,547 INFO L435 NwaCegarLoop]: 543 mSDtfsCounter, 3497 mSDsluCounter, 1720 mSDsCounter, 0 mSdLazyCounter, 1547 mSolverCounterSat, 496 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3515 SdHoareTripleChecker+Valid, 2263 SdHoareTripleChecker+Invalid, 2043 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 496 IncrementalHoareTripleChecker+Valid, 1547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-05 17:57:22,548 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3515 Valid, 2263 Invalid, 2043 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [496 Valid, 1547 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-05 17:57:22,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2054 states. [2025-02-05 17:57:22,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2054 to 1995. [2025-02-05 17:57:22,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1995 states, 1616 states have (on average 1.3496287128712872) internal successors, (2181), 1642 states have internal predecessors, (2181), 214 states have call successors, (214), 134 states have call predecessors, (214), 163 states have return successors, (255), 221 states have call predecessors, (255), 210 states have call successors, (255) [2025-02-05 17:57:22,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1995 states to 1995 states and 2650 transitions. [2025-02-05 17:57:22,624 INFO L78 Accepts]: Start accepts. Automaton has 1995 states and 2650 transitions. Word has length 66 [2025-02-05 17:57:22,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:57:22,625 INFO L471 AbstractCegarLoop]: Abstraction has 1995 states and 2650 transitions. [2025-02-05 17:57:22,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-02-05 17:57:22,625 INFO L276 IsEmpty]: Start isEmpty. Operand 1995 states and 2650 transitions. [2025-02-05 17:57:22,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-02-05 17:57:22,627 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:57:22,627 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-02-05 17:57:22,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 17:57:22,627 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:57:22,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:57:22,628 INFO L85 PathProgramCache]: Analyzing trace with hash 1219280673, now seen corresponding path program 1 times [2025-02-05 17:57:22,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:57:22,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299334728] [2025-02-05 17:57:22,628 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:57:22,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:57:22,635 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-02-05 17:57:22,639 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-02-05 17:57:22,639 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:57:22,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:57:22,693 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-02-05 17:57:22,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:57:22,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299334728] [2025-02-05 17:57:22,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299334728] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:57:22,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:57:22,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:57:22,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040797741] [2025-02-05 17:57:22,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:57:22,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:57:22,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:57:22,695 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:57:22,695 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:57:22,695 INFO L87 Difference]: Start difference. First operand 1995 states and 2650 transitions. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-05 17:57:22,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:57:22,783 INFO L93 Difference]: Finished difference Result 3631 states and 4761 transitions. [2025-02-05 17:57:22,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 17:57:22,784 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 5 states have internal predecessors, (65), 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 108 [2025-02-05 17:57:22,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:57:22,794 INFO L225 Difference]: With dead ends: 3631 [2025-02-05 17:57:22,794 INFO L226 Difference]: Without dead ends: 2055 [2025-02-05 17:57:22,797 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:57:22,798 INFO L435 NwaCegarLoop]: 779 mSDtfsCounter, 0 mSDsluCounter, 3111 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3890 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:57:22,798 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3890 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:57:22,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2055 states. [2025-02-05 17:57:22,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2055 to 2055. [2025-02-05 17:57:22,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2055 states, 1664 states have (on average 1.3359375) internal successors, (2223), 1690 states have internal predecessors, (2223), 214 states have call successors, (214), 134 states have call predecessors, (214), 175 states have return successors, (267), 233 states have call predecessors, (267), 210 states have call successors, (267) [2025-02-05 17:57:22,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2055 states to 2055 states and 2704 transitions. [2025-02-05 17:57:22,869 INFO L78 Accepts]: Start accepts. Automaton has 2055 states and 2704 transitions. Word has length 108 [2025-02-05 17:57:22,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:57:22,869 INFO L471 AbstractCegarLoop]: Abstraction has 2055 states and 2704 transitions. [2025-02-05 17:57:22,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-05 17:57:22,869 INFO L276 IsEmpty]: Start isEmpty. Operand 2055 states and 2704 transitions. [2025-02-05 17:57:22,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-02-05 17:57:22,871 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:57:22,871 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-02-05 17:57:22,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 17:57:22,871 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:57:22,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:57:22,872 INFO L85 PathProgramCache]: Analyzing trace with hash -2121457728, now seen corresponding path program 1 times [2025-02-05 17:57:22,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:57:22,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429742804] [2025-02-05 17:57:22,872 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:57:22,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:57:22,879 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-02-05 17:57:22,882 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-02-05 17:57:22,882 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:57:22,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:57:23,043 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-02-05 17:57:23,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:57:23,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429742804] [2025-02-05 17:57:23,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429742804] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:57:23,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:57:23,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:57:23,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846903321] [2025-02-05 17:57:23,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:57:23,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:57:23,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:57:23,044 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:57:23,044 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:57:23,045 INFO L87 Difference]: Start difference. First operand 2055 states and 2704 transitions. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-02-05 17:57:23,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:57:23,960 INFO L93 Difference]: Finished difference Result 3440 states and 4444 transitions. [2025-02-05 17:57:23,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-05 17:57:23,961 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 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 108 [2025-02-05 17:57:23,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:57:23,970 INFO L225 Difference]: With dead ends: 3440 [2025-02-05 17:57:23,970 INFO L226 Difference]: Without dead ends: 2043 [2025-02-05 17:57:23,974 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-02-05 17:57:23,975 INFO L435 NwaCegarLoop]: 460 mSDtfsCounter, 1135 mSDsluCounter, 1301 mSDsCounter, 0 mSdLazyCounter, 1368 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1168 SdHoareTripleChecker+Valid, 1761 SdHoareTripleChecker+Invalid, 1447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 1368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 17:57:23,975 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1168 Valid, 1761 Invalid, 1447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 1368 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 17:57:23,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2043 states. [2025-02-05 17:57:24,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2043 to 1833. [2025-02-05 17:57:24,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1833 states, 1495 states have (on average 1.3411371237458194) internal successors, (2005), 1516 states have internal predecessors, (2005), 186 states have call successors, (186), 115 states have call predecessors, (186), 150 states have return successors, (227), 203 states have call predecessors, (227), 182 states have call successors, (227) [2025-02-05 17:57:24,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1833 states to 1833 states and 2418 transitions. [2025-02-05 17:57:24,045 INFO L78 Accepts]: Start accepts. Automaton has 1833 states and 2418 transitions. Word has length 108 [2025-02-05 17:57:24,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:57:24,046 INFO L471 AbstractCegarLoop]: Abstraction has 1833 states and 2418 transitions. [2025-02-05 17:57:24,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-02-05 17:57:24,046 INFO L276 IsEmpty]: Start isEmpty. Operand 1833 states and 2418 transitions. [2025-02-05 17:57:24,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-02-05 17:57:24,047 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:57:24,048 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-02-05 17:57:24,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 17:57:24,048 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:57:24,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:57:24,048 INFO L85 PathProgramCache]: Analyzing trace with hash -817063999, now seen corresponding path program 1 times [2025-02-05 17:57:24,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:57:24,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860491094] [2025-02-05 17:57:24,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:57:24,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:57:24,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-02-05 17:57:24,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-02-05 17:57:24,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:57:24,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:57:24,128 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-02-05 17:57:24,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:57:24,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860491094] [2025-02-05 17:57:24,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860491094] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:57:24,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:57:24,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 17:57:24,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146718097] [2025-02-05 17:57:24,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:57:24,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 17:57:24,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:57:24,130 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 17:57:24,130 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 17:57:24,130 INFO L87 Difference]: Start difference. First operand 1833 states and 2418 transitions. Second operand has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 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-02-05 17:57:24,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:57:24,627 INFO L93 Difference]: Finished difference Result 4662 states and 6050 transitions. [2025-02-05 17:57:24,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 17:57:24,627 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 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 108 [2025-02-05 17:57:24,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:57:24,642 INFO L225 Difference]: With dead ends: 4662 [2025-02-05 17:57:24,642 INFO L226 Difference]: Without dead ends: 3249 [2025-02-05 17:57:24,647 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:57:24,649 INFO L435 NwaCegarLoop]: 441 mSDtfsCounter, 1058 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 490 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1089 SdHoareTripleChecker+Valid, 888 SdHoareTripleChecker+Invalid, 560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 490 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 17:57:24,649 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1089 Valid, 888 Invalid, 560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 490 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 17:57:24,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3249 states. [2025-02-05 17:57:24,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3249 to 3249. [2025-02-05 17:57:24,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3249 states, 2600 states have (on average 1.2961538461538462) internal successors, (3370), 2650 states have internal predecessors, (3370), 341 states have call successors, (341), 222 states have call predecessors, (341), 306 states have return successors, (496), 379 states have call predecessors, (496), 337 states have call successors, (496) [2025-02-05 17:57:24,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3249 states to 3249 states and 4207 transitions. [2025-02-05 17:57:24,809 INFO L78 Accepts]: Start accepts. Automaton has 3249 states and 4207 transitions. Word has length 108 [2025-02-05 17:57:24,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:57:24,810 INFO L471 AbstractCegarLoop]: Abstraction has 3249 states and 4207 transitions. [2025-02-05 17:57:24,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 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-02-05 17:57:24,810 INFO L276 IsEmpty]: Start isEmpty. Operand 3249 states and 4207 transitions. [2025-02-05 17:57:24,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-02-05 17:57:24,813 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:57:24,813 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-02-05 17:57:24,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 17:57:24,814 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:57:24,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:57:24,814 INFO L85 PathProgramCache]: Analyzing trace with hash -1770265632, now seen corresponding path program 1 times [2025-02-05 17:57:24,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:57:24,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163279343] [2025-02-05 17:57:24,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:57:24,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:57:24,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-02-05 17:57:24,825 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-02-05 17:57:24,825 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:57:24,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:57:24,847 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-02-05 17:57:24,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:57:24,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163279343] [2025-02-05 17:57:24,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163279343] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:57:24,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:57:24,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:57:24,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799909163] [2025-02-05 17:57:24,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:57:24,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:57:24,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:57:24,849 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:57:24,849 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:57:24,849 INFO L87 Difference]: Start difference. First operand 3249 states and 4207 transitions. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-02-05 17:57:24,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:57:24,906 INFO L93 Difference]: Finished difference Result 4662 states and 5945 transitions. [2025-02-05 17:57:24,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:57:24,906 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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 108 [2025-02-05 17:57:24,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:57:24,916 INFO L225 Difference]: With dead ends: 4662 [2025-02-05 17:57:24,916 INFO L226 Difference]: Without dead ends: 1833 [2025-02-05 17:57:24,921 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:57:24,925 INFO L435 NwaCegarLoop]: 778 mSDtfsCounter, 140 mSDsluCounter, 633 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 1411 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:57:24,925 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 1411 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:57:24,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1833 states. [2025-02-05 17:57:25,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1833 to 1833. [2025-02-05 17:57:25,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1833 states, 1495 states have (on average 1.3204013377926422) internal successors, (1974), 1516 states have internal predecessors, (1974), 186 states have call successors, (186), 115 states have call predecessors, (186), 150 states have return successors, (227), 203 states have call predecessors, (227), 182 states have call successors, (227) [2025-02-05 17:57:25,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1833 states to 1833 states and 2387 transitions. [2025-02-05 17:57:25,023 INFO L78 Accepts]: Start accepts. Automaton has 1833 states and 2387 transitions. Word has length 108 [2025-02-05 17:57:25,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:57:25,023 INFO L471 AbstractCegarLoop]: Abstraction has 1833 states and 2387 transitions. [2025-02-05 17:57:25,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-02-05 17:57:25,024 INFO L276 IsEmpty]: Start isEmpty. Operand 1833 states and 2387 transitions. [2025-02-05 17:57:25,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-02-05 17:57:25,026 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:57:25,026 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-02-05 17:57:25,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 17:57:25,026 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:57:25,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:57:25,027 INFO L85 PathProgramCache]: Analyzing trace with hash -1099038527, now seen corresponding path program 1 times [2025-02-05 17:57:25,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:57:25,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370239914] [2025-02-05 17:57:25,027 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:57:25,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:57:25,035 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-02-05 17:57:25,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-02-05 17:57:25,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:57:25,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:57:25,120 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 27 proven. 3 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-02-05 17:57:25,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:57:25,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370239914] [2025-02-05 17:57:25,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370239914] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 17:57:25,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1117237011] [2025-02-05 17:57:25,121 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:57:25,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 17:57:25,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:57:25,123 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 17:57:25,125 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 17:57:25,186 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-02-05 17:57:25,224 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-02-05 17:57:25,224 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:57:25,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:57:25,227 INFO L256 TraceCheckSpWp]: Trace formula consists of 487 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 17:57:25,232 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 17:57:25,328 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-05 17:57:25,329 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 17:57:25,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1117237011] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:57:25,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 17:57:25,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2025-02-05 17:57:25,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439149935] [2025-02-05 17:57:25,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:57:25,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:57:25,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:57:25,331 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:57:25,331 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-05 17:57:25,331 INFO L87 Difference]: Start difference. First operand 1833 states and 2387 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-02-05 17:57:25,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:57:25,350 INFO L93 Difference]: Finished difference Result 1919 states and 2487 transitions. [2025-02-05 17:57:25,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:57:25,351 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 110 [2025-02-05 17:57:25,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:57:25,354 INFO L225 Difference]: With dead ends: 1919 [2025-02-05 17:57:25,354 INFO L226 Difference]: Without dead ends: 411 [2025-02-05 17:57:25,357 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-05 17:57:25,357 INFO L435 NwaCegarLoop]: 745 mSDtfsCounter, 45 mSDsluCounter, 633 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 1378 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:57:25,357 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 1378 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:57:25,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2025-02-05 17:57:25,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 411. [2025-02-05 17:57:25,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 411 states, 376 states have (on average 1.5425531914893618) internal successors, (580), 378 states have internal predecessors, (580), 28 states have call successors, (28), 7 states have call predecessors, (28), 6 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-02-05 17:57:25,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 634 transitions. [2025-02-05 17:57:25,371 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 634 transitions. Word has length 110 [2025-02-05 17:57:25,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:57:25,372 INFO L471 AbstractCegarLoop]: Abstraction has 411 states and 634 transitions. [2025-02-05 17:57:25,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-02-05 17:57:25,373 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 634 transitions. [2025-02-05 17:57:25,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-02-05 17:57:25,374 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:57:25,374 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:57:25,382 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-05 17:57:25,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-02-05 17:57:25,576 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:57:25,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:57:25,577 INFO L85 PathProgramCache]: Analyzing trace with hash -1471031412, now seen corresponding path program 1 times [2025-02-05 17:57:25,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:57:25,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877281855] [2025-02-05 17:57:25,577 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:57:25,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:57:25,587 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-02-05 17:57:25,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-02-05 17:57:25,593 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:57:25,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:57:25,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:57:25,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:57:25,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877281855] [2025-02-05 17:57:25,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877281855] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:57:25,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:57:25,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:57:25,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506259575] [2025-02-05 17:57:25,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:57:25,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:57:25,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:57:25,641 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:57:25,641 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:57:25,641 INFO L87 Difference]: Start difference. First operand 411 states and 634 transitions. Second operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:57:25,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:57:25,654 INFO L93 Difference]: Finished difference Result 815 states and 1259 transitions. [2025-02-05 17:57:25,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:57:25,655 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 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 179 [2025-02-05 17:57:25,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:57:25,658 INFO L225 Difference]: With dead ends: 815 [2025-02-05 17:57:25,658 INFO L226 Difference]: Without dead ends: 411 [2025-02-05 17:57:25,659 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:57:25,659 INFO L435 NwaCegarLoop]: 632 mSDtfsCounter, 627 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 627 SdHoareTripleChecker+Valid, 633 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:57:25,659 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [627 Valid, 633 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:57:25,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2025-02-05 17:57:25,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 411. [2025-02-05 17:57:25,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 411 states, 376 states have (on average 1.5398936170212767) internal successors, (579), 378 states have internal predecessors, (579), 28 states have call successors, (28), 7 states have call predecessors, (28), 6 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-02-05 17:57:25,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 633 transitions. [2025-02-05 17:57:25,669 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 633 transitions. Word has length 179 [2025-02-05 17:57:25,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:57:25,669 INFO L471 AbstractCegarLoop]: Abstraction has 411 states and 633 transitions. [2025-02-05 17:57:25,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:57:25,670 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 633 transitions. [2025-02-05 17:57:25,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-02-05 17:57:25,671 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:57:25,671 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:57:25,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 17:57:25,671 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:57:25,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:57:25,671 INFO L85 PathProgramCache]: Analyzing trace with hash 352155851, now seen corresponding path program 1 times [2025-02-05 17:57:25,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:57:25,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842575953] [2025-02-05 17:57:25,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:57:25,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:57:25,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-02-05 17:57:25,684 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-02-05 17:57:25,684 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:57:25,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:57:25,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:57:25,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:57:25,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842575953] [2025-02-05 17:57:25,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842575953] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:57:25,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:57:25,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:57:25,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91838099] [2025-02-05 17:57:25,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:57:25,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:57:25,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:57:25,733 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:57:25,733 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:57:25,734 INFO L87 Difference]: Start difference. First operand 411 states and 633 transitions. Second operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:57:25,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:57:25,746 INFO L93 Difference]: Finished difference Result 807 states and 1242 transitions. [2025-02-05 17:57:25,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:57:25,746 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 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 179 [2025-02-05 17:57:25,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:57:25,749 INFO L225 Difference]: With dead ends: 807 [2025-02-05 17:57:25,749 INFO L226 Difference]: Without dead ends: 411 [2025-02-05 17:57:25,750 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:57:25,750 INFO L435 NwaCegarLoop]: 631 mSDtfsCounter, 618 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 618 SdHoareTripleChecker+Valid, 632 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:57:25,750 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [618 Valid, 632 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:57:25,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2025-02-05 17:57:25,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 411. [2025-02-05 17:57:25,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 411 states, 376 states have (on average 1.5372340425531914) internal successors, (578), 378 states have internal predecessors, (578), 28 states have call successors, (28), 7 states have call predecessors, (28), 6 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-02-05 17:57:25,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 632 transitions. [2025-02-05 17:57:25,766 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 632 transitions. Word has length 179 [2025-02-05 17:57:25,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:57:25,767 INFO L471 AbstractCegarLoop]: Abstraction has 411 states and 632 transitions. [2025-02-05 17:57:25,767 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:57:25,767 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 632 transitions. [2025-02-05 17:57:25,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-02-05 17:57:25,768 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:57:25,768 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:57:25,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 17:57:25,769 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:57:25,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:57:25,769 INFO L85 PathProgramCache]: Analyzing trace with hash 102877450, now seen corresponding path program 1 times [2025-02-05 17:57:25,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:57:25,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052019267] [2025-02-05 17:57:25,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:57:25,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:57:25,781 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-02-05 17:57:25,785 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-02-05 17:57:25,785 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:57:25,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:57:25,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:57:25,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:57:25,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052019267] [2025-02-05 17:57:25,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052019267] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:57:25,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:57:25,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:57:25,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310670971] [2025-02-05 17:57:25,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:57:25,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:57:25,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:57:25,882 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:57:25,882 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:57:25,883 INFO L87 Difference]: Start difference. First operand 411 states and 632 transitions. Second operand has 5 states, 5 states have (on average 33.6) internal successors, (168), 4 states have internal predecessors, (168), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:57:26,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:57:26,403 INFO L93 Difference]: Finished difference Result 1239 states and 1926 transitions. [2025-02-05 17:57:26,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 17:57:26,403 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 4 states have internal predecessors, (168), 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 179 [2025-02-05 17:57:26,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:57:26,407 INFO L225 Difference]: With dead ends: 1239 [2025-02-05 17:57:26,407 INFO L226 Difference]: Without dead ends: 849 [2025-02-05 17:57:26,408 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:57:26,409 INFO L435 NwaCegarLoop]: 498 mSDtfsCounter, 1190 mSDsluCounter, 1285 mSDsCounter, 0 mSdLazyCounter, 637 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1210 SdHoareTripleChecker+Valid, 1783 SdHoareTripleChecker+Invalid, 697 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 637 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 17:57:26,409 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1210 Valid, 1783 Invalid, 697 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 637 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 17:57:26,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 849 states. [2025-02-05 17:57:26,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 849 to 818. [2025-02-05 17:57:26,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 818 states, 755 states have (on average 1.5496688741721854) internal successors, (1170), 758 states have internal predecessors, (1170), 49 states have call successors, (49), 13 states have call predecessors, (49), 13 states have return successors, (48), 47 states have call predecessors, (48), 47 states have call successors, (48) [2025-02-05 17:57:26,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 818 states to 818 states and 1267 transitions. [2025-02-05 17:57:26,435 INFO L78 Accepts]: Start accepts. Automaton has 818 states and 1267 transitions. Word has length 179 [2025-02-05 17:57:26,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:57:26,435 INFO L471 AbstractCegarLoop]: Abstraction has 818 states and 1267 transitions. [2025-02-05 17:57:26,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 4 states have internal predecessors, (168), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:57:26,435 INFO L276 IsEmpty]: Start isEmpty. Operand 818 states and 1267 transitions. [2025-02-05 17:57:26,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-02-05 17:57:26,436 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:57:26,437 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:57:26,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 17:57:26,437 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:57:26,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:57:26,437 INFO L85 PathProgramCache]: Analyzing trace with hash 1557491208, now seen corresponding path program 1 times [2025-02-05 17:57:26,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:57:26,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556190218] [2025-02-05 17:57:26,437 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:57:26,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:57:26,449 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-02-05 17:57:26,453 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-02-05 17:57:26,454 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:57:26,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:57:26,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:57:26,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:57:26,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556190218] [2025-02-05 17:57:26,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556190218] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:57:26,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:57:26,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:57:26,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839018677] [2025-02-05 17:57:26,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:57:26,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:57:26,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:57:26,601 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:57:26,601 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:57:26,601 INFO L87 Difference]: Start difference. First operand 818 states and 1267 transitions. Second operand has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:57:27,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:57:27,329 INFO L93 Difference]: Finished difference Result 2130 states and 3341 transitions. [2025-02-05 17:57:27,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:57:27,329 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 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 179 [2025-02-05 17:57:27,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:57:27,334 INFO L225 Difference]: With dead ends: 2130 [2025-02-05 17:57:27,334 INFO L226 Difference]: Without dead ends: 1333 [2025-02-05 17:57:27,336 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-05 17:57:27,337 INFO L435 NwaCegarLoop]: 852 mSDtfsCounter, 1199 mSDsluCounter, 2637 mSDsCounter, 0 mSdLazyCounter, 1097 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1219 SdHoareTripleChecker+Valid, 3489 SdHoareTripleChecker+Invalid, 1131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1097 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 17:57:27,337 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1219 Valid, 3489 Invalid, 1131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1097 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 17:57:27,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1333 states. [2025-02-05 17:57:27,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1333 to 1198. [2025-02-05 17:57:27,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1198 states, 1107 states have (on average 1.5429087624209576) internal successors, (1708), 1111 states have internal predecessors, (1708), 70 states have call successors, (70), 19 states have call predecessors, (70), 20 states have return successors, (72), 69 states have call predecessors, (72), 68 states have call successors, (72) [2025-02-05 17:57:27,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1198 states to 1198 states and 1850 transitions. [2025-02-05 17:57:27,372 INFO L78 Accepts]: Start accepts. Automaton has 1198 states and 1850 transitions. Word has length 179 [2025-02-05 17:57:27,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:57:27,372 INFO L471 AbstractCegarLoop]: Abstraction has 1198 states and 1850 transitions. [2025-02-05 17:57:27,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:57:27,373 INFO L276 IsEmpty]: Start isEmpty. Operand 1198 states and 1850 transitions. [2025-02-05 17:57:27,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-02-05 17:57:27,374 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:57:27,374 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:57:27,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 17:57:27,374 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:57:27,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:57:27,375 INFO L85 PathProgramCache]: Analyzing trace with hash 672755401, now seen corresponding path program 1 times [2025-02-05 17:57:27,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:57:27,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078449844] [2025-02-05 17:57:27,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:57:27,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:57:27,385 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-02-05 17:57:27,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-02-05 17:57:27,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:57:27,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:57:27,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:57:27,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:57:27,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078449844] [2025-02-05 17:57:27,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078449844] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:57:27,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:57:27,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:57:27,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151997208] [2025-02-05 17:57:27,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:57:27,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:57:27,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:57:27,512 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:57:27,512 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:57:27,512 INFO L87 Difference]: Start difference. First operand 1198 states and 1850 transitions. Second operand has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:57:28,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:57:28,193 INFO L93 Difference]: Finished difference Result 3340 states and 5229 transitions. [2025-02-05 17:57:28,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:57:28,194 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 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 179 [2025-02-05 17:57:28,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:57:28,200 INFO L225 Difference]: With dead ends: 3340 [2025-02-05 17:57:28,201 INFO L226 Difference]: Without dead ends: 2163 [2025-02-05 17:57:28,204 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-05 17:57:28,204 INFO L435 NwaCegarLoop]: 848 mSDtfsCounter, 1194 mSDsluCounter, 2625 mSDsCounter, 0 mSdLazyCounter, 1097 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1214 SdHoareTripleChecker+Valid, 3473 SdHoareTripleChecker+Invalid, 1131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1097 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 17:57:28,205 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1214 Valid, 3473 Invalid, 1131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1097 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 17:57:28,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2163 states. [2025-02-05 17:57:28,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2163 to 2007. [2025-02-05 17:57:28,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2007 states, 1858 states have (on average 1.547362755651238) internal successors, (2875), 1866 states have internal predecessors, (2875), 112 states have call successors, (112), 31 states have call predecessors, (112), 36 states have return successors, (126), 113 states have call predecessors, (126), 110 states have call successors, (126) [2025-02-05 17:57:28,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2007 states to 2007 states and 3113 transitions. [2025-02-05 17:57:28,260 INFO L78 Accepts]: Start accepts. Automaton has 2007 states and 3113 transitions. Word has length 179 [2025-02-05 17:57:28,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:57:28,262 INFO L471 AbstractCegarLoop]: Abstraction has 2007 states and 3113 transitions. [2025-02-05 17:57:28,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:57:28,263 INFO L276 IsEmpty]: Start isEmpty. Operand 2007 states and 3113 transitions. [2025-02-05 17:57:28,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-02-05 17:57:28,264 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:57:28,265 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:57:28,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 17:57:28,265 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:57:28,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:57:28,265 INFO L85 PathProgramCache]: Analyzing trace with hash 367120872, now seen corresponding path program 1 times [2025-02-05 17:57:28,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:57:28,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791480450] [2025-02-05 17:57:28,266 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:57:28,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:57:28,280 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-02-05 17:57:28,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-02-05 17:57:28,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:57:28,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:57:28,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:57:28,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:57:28,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791480450] [2025-02-05 17:57:28,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791480450] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:57:28,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:57:28,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:57:28,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600873206] [2025-02-05 17:57:28,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:57:28,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:57:28,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:57:28,396 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:57:28,396 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:57:28,396 INFO L87 Difference]: Start difference. First operand 2007 states and 3113 transitions. Second operand has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:57:29,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:57:29,145 INFO L93 Difference]: Finished difference Result 5951 states and 9390 transitions. [2025-02-05 17:57:29,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:57:29,146 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 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 179 [2025-02-05 17:57:29,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:57:29,159 INFO L225 Difference]: With dead ends: 5951 [2025-02-05 17:57:29,159 INFO L226 Difference]: Without dead ends: 3965 [2025-02-05 17:57:29,162 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-05 17:57:29,162 INFO L435 NwaCegarLoop]: 845 mSDtfsCounter, 1189 mSDsluCounter, 2616 mSDsCounter, 0 mSdLazyCounter, 1097 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1209 SdHoareTripleChecker+Valid, 3461 SdHoareTripleChecker+Invalid, 1131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1097 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 17:57:29,162 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1209 Valid, 3461 Invalid, 1131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1097 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 17:57:29,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3965 states. [2025-02-05 17:57:29,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3965 to 3766. [2025-02-05 17:57:29,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3766 states, 3495 states have (on average 1.565379113018598) internal successors, (5471), 3517 states have internal predecessors, (5471), 196 states have call successors, (196), 55 states have call predecessors, (196), 74 states have return successors, (258), 201 states have call predecessors, (258), 194 states have call successors, (258) [2025-02-05 17:57:29,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3766 states to 3766 states and 5925 transitions. [2025-02-05 17:57:29,263 INFO L78 Accepts]: Start accepts. Automaton has 3766 states and 5925 transitions. Word has length 179 [2025-02-05 17:57:29,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:57:29,264 INFO L471 AbstractCegarLoop]: Abstraction has 3766 states and 5925 transitions. [2025-02-05 17:57:29,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:57:29,264 INFO L276 IsEmpty]: Start isEmpty. Operand 3766 states and 5925 transitions. [2025-02-05 17:57:29,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-02-05 17:57:29,267 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:57:29,267 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:57:29,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 17:57:29,267 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:57:29,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:57:29,268 INFO L85 PathProgramCache]: Analyzing trace with hash -335474967, now seen corresponding path program 1 times [2025-02-05 17:57:29,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:57:29,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665794802] [2025-02-05 17:57:29,268 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:57:29,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:57:29,281 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-02-05 17:57:29,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-02-05 17:57:29,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:57:29,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:57:29,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:57:29,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:57:29,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665794802] [2025-02-05 17:57:29,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665794802] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:57:29,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:57:29,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:57:29,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607047505] [2025-02-05 17:57:29,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:57:29,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:57:29,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:57:29,388 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:57:29,388 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:57:29,388 INFO L87 Difference]: Start difference. First operand 3766 states and 5925 transitions. Second operand has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:57:30,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:57:30,116 INFO L93 Difference]: Finished difference Result 11718 states and 18844 transitions. [2025-02-05 17:57:30,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:57:30,116 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 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 179 [2025-02-05 17:57:30,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:57:30,146 INFO L225 Difference]: With dead ends: 11718 [2025-02-05 17:57:30,147 INFO L226 Difference]: Without dead ends: 7973 [2025-02-05 17:57:30,153 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-05 17:57:30,154 INFO L435 NwaCegarLoop]: 842 mSDtfsCounter, 1184 mSDsluCounter, 2607 mSDsCounter, 0 mSdLazyCounter, 1097 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1204 SdHoareTripleChecker+Valid, 3449 SdHoareTripleChecker+Invalid, 1131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1097 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 17:57:30,154 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1204 Valid, 3449 Invalid, 1131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1097 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 17:57:30,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7973 states. [2025-02-05 17:57:30,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7973 to 7689. [2025-02-05 17:57:30,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7689 states, 7156 states have (on average 1.5951648965902738) internal successors, (11415), 7224 states have internal predecessors, (11415), 364 states have call successors, (364), 103 states have call predecessors, (364), 168 states have return successors, (618), 377 states have call predecessors, (618), 362 states have call successors, (618) [2025-02-05 17:57:30,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7689 states to 7689 states and 12397 transitions. [2025-02-05 17:57:30,361 INFO L78 Accepts]: Start accepts. Automaton has 7689 states and 12397 transitions. Word has length 179 [2025-02-05 17:57:30,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:57:30,362 INFO L471 AbstractCegarLoop]: Abstraction has 7689 states and 12397 transitions. [2025-02-05 17:57:30,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:57:30,362 INFO L276 IsEmpty]: Start isEmpty. Operand 7689 states and 12397 transitions. [2025-02-05 17:57:30,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-02-05 17:57:30,366 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:57:30,366 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:57:30,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 17:57:30,367 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:57:30,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:57:30,368 INFO L85 PathProgramCache]: Analyzing trace with hash 611691976, now seen corresponding path program 1 times [2025-02-05 17:57:30,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:57:30,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92526507] [2025-02-05 17:57:30,368 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:57:30,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:57:30,378 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-02-05 17:57:30,383 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-02-05 17:57:30,383 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:57:30,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:57:30,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:57:30,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:57:30,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92526507] [2025-02-05 17:57:30,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92526507] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:57:30,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:57:30,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:57:30,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59477595] [2025-02-05 17:57:30,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:57:30,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:57:30,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:57:30,494 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:57:30,494 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:57:30,494 INFO L87 Difference]: Start difference. First operand 7689 states and 12397 transitions. Second operand has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:57:30,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:57:30,985 INFO L93 Difference]: Finished difference Result 17183 states and 28455 transitions. [2025-02-05 17:57:30,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:57:30,986 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 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 179 [2025-02-05 17:57:30,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:57:31,012 INFO L225 Difference]: With dead ends: 17183 [2025-02-05 17:57:31,012 INFO L226 Difference]: Without dead ends: 9515 [2025-02-05 17:57:31,028 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:57:31,029 INFO L435 NwaCegarLoop]: 479 mSDtfsCounter, 847 mSDsluCounter, 799 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 867 SdHoareTripleChecker+Valid, 1278 SdHoareTripleChecker+Invalid, 483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 17:57:31,029 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [867 Valid, 1278 Invalid, 483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 17:57:31,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9515 states. [2025-02-05 17:57:31,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9515 to 7689. [2025-02-05 17:57:31,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7689 states, 7156 states have (on average 1.592789267747345) internal successors, (11398), 7224 states have internal predecessors, (11398), 364 states have call successors, (364), 103 states have call predecessors, (364), 168 states have return successors, (618), 377 states have call predecessors, (618), 362 states have call successors, (618) [2025-02-05 17:57:31,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7689 states to 7689 states and 12380 transitions. [2025-02-05 17:57:31,298 INFO L78 Accepts]: Start accepts. Automaton has 7689 states and 12380 transitions. Word has length 179 [2025-02-05 17:57:31,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:57:31,298 INFO L471 AbstractCegarLoop]: Abstraction has 7689 states and 12380 transitions. [2025-02-05 17:57:31,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:57:31,298 INFO L276 IsEmpty]: Start isEmpty. Operand 7689 states and 12380 transitions. [2025-02-05 17:57:31,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-02-05 17:57:31,301 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:57:31,301 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:57:31,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-05 17:57:31,302 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:57:31,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:57:31,302 INFO L85 PathProgramCache]: Analyzing trace with hash 1334982409, now seen corresponding path program 1 times [2025-02-05 17:57:31,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:57:31,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121071180] [2025-02-05 17:57:31,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:57:31,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:57:31,312 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-02-05 17:57:31,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-02-05 17:57:31,319 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:57:31,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:57:31,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:57:31,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:57:31,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121071180] [2025-02-05 17:57:31,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121071180] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:57:31,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:57:31,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:57:31,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152317844] [2025-02-05 17:57:31,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:57:31,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:57:31,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:57:31,407 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:57:31,407 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:57:31,407 INFO L87 Difference]: Start difference. First operand 7689 states and 12380 transitions. Second operand has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:57:31,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:57:31,922 INFO L93 Difference]: Finished difference Result 17100 states and 28255 transitions. [2025-02-05 17:57:31,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:57:31,922 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 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 179 [2025-02-05 17:57:31,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:57:31,949 INFO L225 Difference]: With dead ends: 17100 [2025-02-05 17:57:31,950 INFO L226 Difference]: Without dead ends: 9432 [2025-02-05 17:57:31,966 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:57:31,966 INFO L435 NwaCegarLoop]: 476 mSDtfsCounter, 844 mSDsluCounter, 794 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 864 SdHoareTripleChecker+Valid, 1270 SdHoareTripleChecker+Invalid, 483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 17:57:31,966 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [864 Valid, 1270 Invalid, 483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 17:57:31,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9432 states. [2025-02-05 17:57:32,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9432 to 7689. [2025-02-05 17:57:32,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7689 states, 7156 states have (on average 1.590413638904416) internal successors, (11381), 7224 states have internal predecessors, (11381), 364 states have call successors, (364), 103 states have call predecessors, (364), 168 states have return successors, (618), 377 states have call predecessors, (618), 362 states have call successors, (618) [2025-02-05 17:57:32,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7689 states to 7689 states and 12363 transitions. [2025-02-05 17:57:32,312 INFO L78 Accepts]: Start accepts. Automaton has 7689 states and 12363 transitions. Word has length 179 [2025-02-05 17:57:32,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:57:32,312 INFO L471 AbstractCegarLoop]: Abstraction has 7689 states and 12363 transitions. [2025-02-05 17:57:32,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:57:32,313 INFO L276 IsEmpty]: Start isEmpty. Operand 7689 states and 12363 transitions. [2025-02-05 17:57:32,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-02-05 17:57:32,316 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:57:32,316 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:57:32,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-05 17:57:32,318 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:57:32,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:57:32,318 INFO L85 PathProgramCache]: Analyzing trace with hash -1274084952, now seen corresponding path program 1 times [2025-02-05 17:57:32,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:57:32,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719316360] [2025-02-05 17:57:32,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:57:32,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:57:32,327 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-02-05 17:57:32,330 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-02-05 17:57:32,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:57:32,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:57:32,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:57:32,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:57:32,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719316360] [2025-02-05 17:57:32,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719316360] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:57:32,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:57:32,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:57:32,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784908043] [2025-02-05 17:57:32,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:57:32,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:57:32,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:57:32,403 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:57:32,403 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:57:32,403 INFO L87 Difference]: Start difference. First operand 7689 states and 12363 transitions. Second operand has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:57:32,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:57:32,838 INFO L93 Difference]: Finished difference Result 17017 states and 28055 transitions. [2025-02-05 17:57:32,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:57:32,844 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 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 179 [2025-02-05 17:57:32,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:57:32,868 INFO L225 Difference]: With dead ends: 17017 [2025-02-05 17:57:32,869 INFO L226 Difference]: Without dead ends: 9349 [2025-02-05 17:57:32,882 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:57:32,882 INFO L435 NwaCegarLoop]: 473 mSDtfsCounter, 841 mSDsluCounter, 789 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 861 SdHoareTripleChecker+Valid, 1262 SdHoareTripleChecker+Invalid, 483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 17:57:32,882 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [861 Valid, 1262 Invalid, 483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 17:57:32,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9349 states. [2025-02-05 17:57:33,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9349 to 7689. [2025-02-05 17:57:33,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7689 states, 7156 states have (on average 1.5880380100614868) internal successors, (11364), 7224 states have internal predecessors, (11364), 364 states have call successors, (364), 103 states have call predecessors, (364), 168 states have return successors, (618), 377 states have call predecessors, (618), 362 states have call successors, (618) [2025-02-05 17:57:33,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7689 states to 7689 states and 12346 transitions. [2025-02-05 17:57:33,105 INFO L78 Accepts]: Start accepts. Automaton has 7689 states and 12346 transitions. Word has length 179 [2025-02-05 17:57:33,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:57:33,105 INFO L471 AbstractCegarLoop]: Abstraction has 7689 states and 12346 transitions. [2025-02-05 17:57:33,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:57:33,105 INFO L276 IsEmpty]: Start isEmpty. Operand 7689 states and 12346 transitions. [2025-02-05 17:57:33,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-02-05 17:57:33,109 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:57:33,109 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:57:33,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-05 17:57:33,109 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:57:33,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:57:33,110 INFO L85 PathProgramCache]: Analyzing trace with hash -1081153751, now seen corresponding path program 1 times [2025-02-05 17:57:33,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:57:33,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515379115] [2025-02-05 17:57:33,110 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:57:33,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:57:33,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-02-05 17:57:33,122 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-02-05 17:57:33,122 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:57:33,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:57:33,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:57:33,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:57:33,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515379115] [2025-02-05 17:57:33,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515379115] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:57:33,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:57:33,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:57:33,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236813980] [2025-02-05 17:57:33,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:57:33,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:57:33,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:57:33,204 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:57:33,204 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:57:33,204 INFO L87 Difference]: Start difference. First operand 7689 states and 12346 transitions. Second operand has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:57:34,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:57:34,177 INFO L93 Difference]: Finished difference Result 24513 states and 40373 transitions. [2025-02-05 17:57:34,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:57:34,177 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 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 179 [2025-02-05 17:57:34,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:57:34,274 INFO L225 Difference]: With dead ends: 24513 [2025-02-05 17:57:34,274 INFO L226 Difference]: Without dead ends: 16845 [2025-02-05 17:57:34,285 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-05 17:57:34,285 INFO L435 NwaCegarLoop]: 824 mSDtfsCounter, 1155 mSDsluCounter, 2556 mSDsCounter, 0 mSdLazyCounter, 1097 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1175 SdHoareTripleChecker+Valid, 3380 SdHoareTripleChecker+Invalid, 1131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1097 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 17:57:34,286 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1175 Valid, 3380 Invalid, 1131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1097 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 17:57:34,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16845 states. [2025-02-05 17:57:34,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16845 to 16453. [2025-02-05 17:57:34,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16453 states, 15342 states have (on average 1.6210402815799765) internal successors, (24870), 15556 states have internal predecessors, (24870), 700 states have call successors, (700), 199 states have call predecessors, (700), 410 states have return successors, (1722), 729 states have call predecessors, (1722), 698 states have call successors, (1722) [2025-02-05 17:57:34,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16453 states to 16453 states and 27292 transitions. [2025-02-05 17:57:34,826 INFO L78 Accepts]: Start accepts. Automaton has 16453 states and 27292 transitions. Word has length 179 [2025-02-05 17:57:34,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:57:34,826 INFO L471 AbstractCegarLoop]: Abstraction has 16453 states and 27292 transitions. [2025-02-05 17:57:34,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:57:34,826 INFO L276 IsEmpty]: Start isEmpty. Operand 16453 states and 27292 transitions. [2025-02-05 17:57:34,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-02-05 17:57:34,833 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:57:34,834 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:57:34,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-05 17:57:34,834 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:57:34,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:57:34,834 INFO L85 PathProgramCache]: Analyzing trace with hash -1213477496, now seen corresponding path program 1 times [2025-02-05 17:57:34,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:57:34,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155829579] [2025-02-05 17:57:34,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:57:34,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:57:34,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-02-05 17:57:34,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-02-05 17:57:34,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:57:34,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:57:34,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:57:34,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:57:34,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155829579] [2025-02-05 17:57:34,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155829579] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:57:34,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:57:34,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:57:34,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152156082] [2025-02-05 17:57:34,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:57:34,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:57:34,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:57:34,941 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:57:34,941 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:57:34,941 INFO L87 Difference]: Start difference. First operand 16453 states and 27292 transitions. Second operand has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:57:35,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:57:35,849 INFO L93 Difference]: Finished difference Result 37295 states and 63727 transitions. [2025-02-05 17:57:35,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:57:35,852 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 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 179 [2025-02-05 17:57:35,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:57:35,912 INFO L225 Difference]: With dead ends: 37295 [2025-02-05 17:57:35,912 INFO L226 Difference]: Without dead ends: 20863 [2025-02-05 17:57:35,935 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:57:35,936 INFO L435 NwaCegarLoop]: 468 mSDtfsCounter, 837 mSDsluCounter, 780 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 857 SdHoareTripleChecker+Valid, 1248 SdHoareTripleChecker+Invalid, 483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 17:57:35,936 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [857 Valid, 1248 Invalid, 483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 17:57:35,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20863 states. [2025-02-05 17:57:36,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20863 to 16453. [2025-02-05 17:57:36,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16453 states, 15342 states have (on average 1.6188893234258896) internal successors, (24837), 15556 states have internal predecessors, (24837), 700 states have call successors, (700), 199 states have call predecessors, (700), 410 states have return successors, (1722), 729 states have call predecessors, (1722), 698 states have call successors, (1722) [2025-02-05 17:57:36,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16453 states to 16453 states and 27259 transitions. [2025-02-05 17:57:36,422 INFO L78 Accepts]: Start accepts. Automaton has 16453 states and 27259 transitions. Word has length 179 [2025-02-05 17:57:36,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:57:36,422 INFO L471 AbstractCegarLoop]: Abstraction has 16453 states and 27259 transitions. [2025-02-05 17:57:36,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:57:36,422 INFO L276 IsEmpty]: Start isEmpty. Operand 16453 states and 27259 transitions. [2025-02-05 17:57:36,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-02-05 17:57:36,477 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:57:36,477 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:57:36,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-05 17:57:36,477 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:57:36,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:57:36,478 INFO L85 PathProgramCache]: Analyzing trace with hash -247914679, now seen corresponding path program 1 times [2025-02-05 17:57:36,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:57:36,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671878440] [2025-02-05 17:57:36,478 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:57:36,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:57:36,486 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-02-05 17:57:36,490 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-02-05 17:57:36,490 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:57:36,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:57:36,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:57:36,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:57:36,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671878440] [2025-02-05 17:57:36,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671878440] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:57:36,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:57:36,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:57:36,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602948398] [2025-02-05 17:57:36,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:57:36,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:57:36,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:57:36,575 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:57:36,575 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:57:36,575 INFO L87 Difference]: Start difference. First operand 16453 states and 27259 transitions. Second operand has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:57:38,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:57:38,013 INFO L93 Difference]: Finished difference Result 53631 states and 91798 transitions. [2025-02-05 17:57:38,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:57:38,013 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 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 179 [2025-02-05 17:57:38,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:57:38,139 INFO L225 Difference]: With dead ends: 53631 [2025-02-05 17:57:38,140 INFO L226 Difference]: Without dead ends: 37199 [2025-02-05 17:57:38,184 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-05 17:57:38,185 INFO L435 NwaCegarLoop]: 816 mSDtfsCounter, 1142 mSDsluCounter, 2533 mSDsCounter, 0 mSdLazyCounter, 1097 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1162 SdHoareTripleChecker+Valid, 3349 SdHoareTripleChecker+Invalid, 1131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1097 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 17:57:38,185 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1162 Valid, 3349 Invalid, 1131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1097 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 17:57:38,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37199 states. [2025-02-05 17:57:39,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37199 to 36573. [2025-02-05 17:57:39,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36573 states, 34144 states have (on average 1.654727038425492) internal successors, (56499), 34812 states have internal predecessors, (56499), 1372 states have call successors, (1372), 391 states have call predecessors, (1372), 1056 states have return successors, (5466), 1433 states have call predecessors, (5466), 1370 states have call successors, (5466) [2025-02-05 17:57:39,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36573 states to 36573 states and 63337 transitions. [2025-02-05 17:57:39,926 INFO L78 Accepts]: Start accepts. Automaton has 36573 states and 63337 transitions. Word has length 179 [2025-02-05 17:57:39,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:57:39,927 INFO L471 AbstractCegarLoop]: Abstraction has 36573 states and 63337 transitions. [2025-02-05 17:57:39,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:57:39,927 INFO L276 IsEmpty]: Start isEmpty. Operand 36573 states and 63337 transitions. [2025-02-05 17:57:39,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-02-05 17:57:39,936 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:57:39,936 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:57:40,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-05 17:57:40,038 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:57:40,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:57:40,038 INFO L85 PathProgramCache]: Analyzing trace with hash -909504152, now seen corresponding path program 1 times [2025-02-05 17:57:40,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:57:40,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234010166] [2025-02-05 17:57:40,038 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:57:40,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:57:40,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-02-05 17:57:40,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-02-05 17:57:40,052 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:57:40,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:57:40,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:57:40,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:57:40,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234010166] [2025-02-05 17:57:40,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234010166] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:57:40,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:57:40,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:57:40,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872398448] [2025-02-05 17:57:40,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:57:40,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:57:40,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:57:40,136 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:57:40,136 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:57:40,136 INFO L87 Difference]: Start difference. First operand 36573 states and 63337 transitions. Second operand has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:57:42,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:57:42,653 INFO L93 Difference]: Finished difference Result 122001 states and 220706 transitions. [2025-02-05 17:57:42,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:57:42,653 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 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 179 [2025-02-05 17:57:42,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:57:42,961 INFO L225 Difference]: With dead ends: 122001 [2025-02-05 17:57:42,962 INFO L226 Difference]: Without dead ends: 85449 [2025-02-05 17:57:43,057 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-05 17:57:43,058 INFO L435 NwaCegarLoop]: 813 mSDtfsCounter, 1137 mSDsluCounter, 2524 mSDsCounter, 0 mSdLazyCounter, 1097 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1157 SdHoareTripleChecker+Valid, 3337 SdHoareTripleChecker+Invalid, 1131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1097 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 17:57:43,059 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1157 Valid, 3337 Invalid, 1131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1097 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 17:57:43,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85449 states. [2025-02-05 17:57:46,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85449 to 84346. [2025-02-05 17:57:46,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84346 states, 78795 states have (on average 1.6929881337648327) internal successors, (133399), 80857 states have internal predecessors, (133399), 2716 states have call successors, (2716), 775 states have call predecessors, (2716), 2834 states have return successors, (19098), 2841 states have call predecessors, (19098), 2714 states have call successors, (19098) [2025-02-05 17:57:47,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84346 states to 84346 states and 155213 transitions. [2025-02-05 17:57:47,044 INFO L78 Accepts]: Start accepts. Automaton has 84346 states and 155213 transitions. Word has length 179 [2025-02-05 17:57:47,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:57:47,045 INFO L471 AbstractCegarLoop]: Abstraction has 84346 states and 155213 transitions. [2025-02-05 17:57:47,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:57:47,045 INFO L276 IsEmpty]: Start isEmpty. Operand 84346 states and 155213 transitions. [2025-02-05 17:57:47,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-02-05 17:57:47,081 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:57:47,082 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:57:47,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-05 17:57:47,082 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:57:47,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:57:47,082 INFO L85 PathProgramCache]: Analyzing trace with hash 38985577, now seen corresponding path program 1 times [2025-02-05 17:57:47,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:57:47,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007846379] [2025-02-05 17:57:47,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:57:47,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:57:47,095 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-02-05 17:57:47,099 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-02-05 17:57:47,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:57:47,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:57:47,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:57:47,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:57:47,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007846379] [2025-02-05 17:57:47,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007846379] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:57:47,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:57:47,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:57:47,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79637473] [2025-02-05 17:57:47,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:57:47,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:57:47,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:57:47,166 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:57:47,166 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:57:47,166 INFO L87 Difference]: Start difference. First operand 84346 states and 155213 transitions. Second operand has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:57:51,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:57:51,989 INFO L93 Difference]: Finished difference Result 201506 states and 386139 transitions. [2025-02-05 17:57:51,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:57:51,990 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 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 179 [2025-02-05 17:57:51,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:57:52,492 INFO L225 Difference]: With dead ends: 201506 [2025-02-05 17:57:52,492 INFO L226 Difference]: Without dead ends: 117181 [2025-02-05 17:57:52,715 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:57:52,717 INFO L435 NwaCegarLoop]: 461 mSDtfsCounter, 832 mSDsluCounter, 767 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 852 SdHoareTripleChecker+Valid, 1228 SdHoareTripleChecker+Invalid, 483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 17:57:52,717 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [852 Valid, 1228 Invalid, 483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 17:57:52,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117181 states. [2025-02-05 17:57:56,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117181 to 84346. [2025-02-05 17:57:56,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84346 states, 78795 states have (on average 1.6913509740465766) internal successors, (133270), 80857 states have internal predecessors, (133270), 2716 states have call successors, (2716), 775 states have call predecessors, (2716), 2834 states have return successors, (19098), 2841 states have call predecessors, (19098), 2714 states have call successors, (19098) [2025-02-05 17:57:56,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84346 states to 84346 states and 155084 transitions. [2025-02-05 17:57:56,544 INFO L78 Accepts]: Start accepts. Automaton has 84346 states and 155084 transitions. Word has length 179 [2025-02-05 17:57:56,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:57:56,544 INFO L471 AbstractCegarLoop]: Abstraction has 84346 states and 155084 transitions. [2025-02-05 17:57:56,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:57:56,544 INFO L276 IsEmpty]: Start isEmpty. Operand 84346 states and 155084 transitions. [2025-02-05 17:57:56,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-02-05 17:57:56,559 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:57:56,560 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:57:56,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-02-05 17:57:56,560 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:57:56,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:57:56,560 INFO L85 PathProgramCache]: Analyzing trace with hash 208129352, now seen corresponding path program 1 times [2025-02-05 17:57:56,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:57:56,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333810825] [2025-02-05 17:57:56,560 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:57:56,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:57:56,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-02-05 17:57:56,574 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-02-05 17:57:56,575 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:57:56,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:57:56,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:57:56,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:57:56,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333810825] [2025-02-05 17:57:56,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333810825] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:57:56,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:57:56,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:57:56,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063857132] [2025-02-05 17:57:56,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:57:56,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:57:56,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:57:56,654 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:57:56,654 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:57:56,654 INFO L87 Difference]: Start difference. First operand 84346 states and 155084 transitions. Second operand has 6 states, 6 states have (on average 28.0) internal successors, (168), 5 states have internal predecessors, (168), 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)