./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.11.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.11.cil-1.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 0b8de634f132d76c1b6698e4c3a5f12df478fc7c8b9ceb30d48afc80707f7564 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 05:06:59,736 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 05:06:59,811 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 05:06:59,814 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 05:06:59,814 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 05:06:59,835 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 05:06:59,837 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 05:06:59,837 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 05:06:59,838 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 05:06:59,838 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 05:06:59,839 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 05:06:59,839 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 05:06:59,840 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 05:06:59,840 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 05:06:59,840 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 05:06:59,842 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 05:06:59,842 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 05:06:59,842 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 05:06:59,842 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 05:06:59,843 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 05:06:59,843 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 05:06:59,845 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 05:06:59,845 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 05:06:59,845 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 05:06:59,845 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 05:06:59,845 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 05:06:59,846 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 05:06:59,846 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 05:06:59,846 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 05:06:59,846 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 05:06:59,846 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 05:06:59,846 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 05:06:59,846 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 05:06:59,847 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 05:06:59,847 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 05:06:59,847 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 05:06:59,847 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 05:06:59,847 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 05:06:59,847 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 05:06:59,847 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 05:06:59,847 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 05:06:59,849 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 05:06:59,849 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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-clean/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 -> 0b8de634f132d76c1b6698e4c3a5f12df478fc7c8b9ceb30d48afc80707f7564 [2024-10-11 05:07:00,050 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 05:07:00,068 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 05:07:00,071 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 05:07:00,072 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 05:07:00,072 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 05:07:00,073 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.11.cil-1.c [2024-10-11 05:07:01,295 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 05:07:01,475 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 05:07:01,476 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.11.cil-1.c [2024-10-11 05:07:01,492 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/c700fed40/bac387f63e7a4f609d097b3a2069781e/FLAG6b395fe3f [2024-10-11 05:07:01,505 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/c700fed40/bac387f63e7a4f609d097b3a2069781e [2024-10-11 05:07:01,507 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 05:07:01,508 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 05:07:01,511 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 05:07:01,511 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 05:07:01,516 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 05:07:01,516 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:07:01" (1/1) ... [2024-10-11 05:07:01,517 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6713bbbf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:07:01, skipping insertion in model container [2024-10-11 05:07:01,518 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:07:01" (1/1) ... [2024-10-11 05:07:01,558 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 05:07:01,698 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.11.cil-1.c[911,924] [2024-10-11 05:07:01,810 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.11.cil-1.c[8416,8429] [2024-10-11 05:07:01,881 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 05:07:01,891 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 05:07:01,899 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.11.cil-1.c[911,924] [2024-10-11 05:07:01,912 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.11.cil-1.c[8416,8429] [2024-10-11 05:07:01,950 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 05:07:01,980 INFO L204 MainTranslator]: Completed translation [2024-10-11 05:07:01,980 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:07:01 WrapperNode [2024-10-11 05:07:01,980 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 05:07:01,981 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 05:07:01,981 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 05:07:01,981 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 05:07:01,987 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:07:01" (1/1) ... [2024-10-11 05:07:01,999 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:07:01" (1/1) ... [2024-10-11 05:07:02,049 INFO L138 Inliner]: procedures = 77, calls = 95, calls flagged for inlining = 45, calls inlined = 45, statements flattened = 1052 [2024-10-11 05:07:02,051 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 05:07:02,051 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 05:07:02,051 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 05:07:02,052 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 05:07:02,060 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:07:01" (1/1) ... [2024-10-11 05:07:02,060 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:07:01" (1/1) ... [2024-10-11 05:07:02,066 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:07:01" (1/1) ... [2024-10-11 05:07:02,089 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]. [2024-10-11 05:07:02,090 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:07:01" (1/1) ... [2024-10-11 05:07:02,090 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:07:01" (1/1) ... [2024-10-11 05:07:02,105 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:07:01" (1/1) ... [2024-10-11 05:07:02,127 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:07:01" (1/1) ... [2024-10-11 05:07:02,130 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:07:01" (1/1) ... [2024-10-11 05:07:02,133 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:07:01" (1/1) ... [2024-10-11 05:07:02,136 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 05:07:02,137 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 05:07:02,137 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 05:07:02,137 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 05:07:02,138 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:07:01" (1/1) ... [2024-10-11 05:07:02,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 05:07:02,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 05:07:02,169 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 05:07:02,173 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 05:07:02,208 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 05:07:02,209 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-10-11 05:07:02,209 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-10-11 05:07:02,209 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2024-10-11 05:07:02,209 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2024-10-11 05:07:02,209 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2024-10-11 05:07:02,209 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2024-10-11 05:07:02,209 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2024-10-11 05:07:02,209 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2024-10-11 05:07:02,209 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2024-10-11 05:07:02,210 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2024-10-11 05:07:02,210 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2024-10-11 05:07:02,210 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2024-10-11 05:07:02,210 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2024-10-11 05:07:02,210 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2024-10-11 05:07:02,210 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2024-10-11 05:07:02,210 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2024-10-11 05:07:02,210 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2024-10-11 05:07:02,210 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2024-10-11 05:07:02,211 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2024-10-11 05:07:02,211 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2024-10-11 05:07:02,211 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2024-10-11 05:07:02,211 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2024-10-11 05:07:02,211 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 05:07:02,211 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2024-10-11 05:07:02,211 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2024-10-11 05:07:02,211 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2024-10-11 05:07:02,211 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2024-10-11 05:07:02,211 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 05:07:02,212 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 05:07:02,212 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2024-10-11 05:07:02,212 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2024-10-11 05:07:02,212 INFO L130 BoogieDeclarations]: Found specification of procedure error2 [2024-10-11 05:07:02,212 INFO L138 BoogieDeclarations]: Found implementation of procedure error2 [2024-10-11 05:07:02,314 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 05:07:02,317 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 05:07:02,924 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##56: assume !(1 == ~q_free~0); [2024-10-11 05:07:02,924 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##55: assume 1 == ~q_free~0;~c_dr_st~0 := 2;~c_dr_pc~0 := 2;~a_t~0 := do_read_c_~a~0#1; [2024-10-11 05:07:03,107 INFO L? ?]: Removed 128 outVars from TransFormulas that were not future-live. [2024-10-11 05:07:03,107 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 05:07:03,167 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 05:07:03,168 INFO L314 CfgBuilder]: Removed 18 assume(true) statements. [2024-10-11 05:07:03,169 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:07:03 BoogieIcfgContainer [2024-10-11 05:07:03,169 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 05:07:03,171 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 05:07:03,171 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 05:07:03,173 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 05:07:03,174 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 05:07:01" (1/3) ... [2024-10-11 05:07:03,174 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53dbaf33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:07:03, skipping insertion in model container [2024-10-11 05:07:03,174 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:07:01" (2/3) ... [2024-10-11 05:07:03,174 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53dbaf33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:07:03, skipping insertion in model container [2024-10-11 05:07:03,175 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:07:03" (3/3) ... [2024-10-11 05:07:03,176 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_3.cil+token_ring.11.cil-1.c [2024-10-11 05:07:03,189 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 05:07:03,189 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-11 05:07:03,253 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 05:07:03,258 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;@f881bd2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 05:07:03,258 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-11 05:07:03,264 INFO L276 IsEmpty]: Start isEmpty. Operand has 437 states, 376 states have (on average 1.7154255319148937) internal successors, (645), 384 states have internal predecessors, (645), 43 states have call successors, (43), 15 states have call predecessors, (43), 15 states have return successors, (43), 41 states have call predecessors, (43), 43 states have call successors, (43) [2024-10-11 05:07:03,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-11 05:07:03,272 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:07:03,272 INFO L215 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] [2024-10-11 05:07:03,273 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:07:03,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:07:03,276 INFO L85 PathProgramCache]: Analyzing trace with hash 677889946, now seen corresponding path program 1 times [2024-10-11 05:07:03,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:07:03,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892112] [2024-10-11 05:07:03,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:07:03,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:07:03,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:03,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:07:03,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:03,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:07:03,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:03,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:07:03,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:03,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:07:03,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:03,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 05:07:03,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:03,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 05:07:03,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:03,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:07:03,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:03,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:07:03,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:07:03,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892112] [2024-10-11 05:07:03,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892112] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:07:03,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:07:03,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 05:07:03,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588331105] [2024-10-11 05:07:03,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:07:03,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 05:07:03,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:07:03,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 05:07:03,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-11 05:07:03,789 INFO L87 Difference]: Start difference. First operand has 437 states, 376 states have (on average 1.7154255319148937) internal successors, (645), 384 states have internal predecessors, (645), 43 states have call successors, (43), 15 states have call predecessors, (43), 15 states have return successors, (43), 41 states have call predecessors, (43), 43 states have call successors, (43) Second operand has 8 states, 8 states have (on average 5.25) internal successors, (42), 5 states have internal predecessors, (42), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-11 05:07:05,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:07:05,094 INFO L93 Difference]: Finished difference Result 987 states and 1641 transitions. [2024-10-11 05:07:05,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 05:07:05,103 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 5 states have internal predecessors, (42), 3 states have call successors, (8), 5 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 57 [2024-10-11 05:07:05,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:07:05,115 INFO L225 Difference]: With dead ends: 987 [2024-10-11 05:07:05,116 INFO L226 Difference]: Without dead ends: 569 [2024-10-11 05:07:05,121 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2024-10-11 05:07:05,124 INFO L432 NwaCegarLoop]: 357 mSDtfsCounter, 823 mSDsluCounter, 1426 mSDsCounter, 0 mSdLazyCounter, 1532 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 830 SdHoareTripleChecker+Valid, 1783 SdHoareTripleChecker+Invalid, 1664 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 1532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-11 05:07:05,125 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [830 Valid, 1783 Invalid, 1664 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 1532 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-11 05:07:05,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2024-10-11 05:07:05,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 532. [2024-10-11 05:07:05,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 532 states, 452 states have (on average 1.5884955752212389) internal successors, (718), 459 states have internal predecessors, (718), 56 states have call successors, (56), 22 states have call predecessors, (56), 22 states have return successors, (57), 53 states have call predecessors, (57), 52 states have call successors, (57) [2024-10-11 05:07:05,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 831 transitions. [2024-10-11 05:07:05,213 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 831 transitions. Word has length 57 [2024-10-11 05:07:05,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:07:05,213 INFO L471 AbstractCegarLoop]: Abstraction has 532 states and 831 transitions. [2024-10-11 05:07:05,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 5 states have internal predecessors, (42), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-11 05:07:05,214 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 831 transitions. [2024-10-11 05:07:05,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-11 05:07:05,217 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:07:05,218 INFO L215 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] [2024-10-11 05:07:05,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 05:07:05,218 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:07:05,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:07:05,219 INFO L85 PathProgramCache]: Analyzing trace with hash -1266102822, now seen corresponding path program 1 times [2024-10-11 05:07:05,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:07:05,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987765062] [2024-10-11 05:07:05,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:07:05,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:07:05,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:05,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:07:05,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:05,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:07:05,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:05,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:07:05,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:05,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:07:05,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:05,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 05:07:05,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:05,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 05:07:05,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:05,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:07:05,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:05,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:07:05,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:07:05,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987765062] [2024-10-11 05:07:05,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987765062] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:07:05,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:07:05,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 05:07:05,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075712110] [2024-10-11 05:07:05,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:07:05,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 05:07:05,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:07:05,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 05:07:05,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 05:07:05,423 INFO L87 Difference]: Start difference. First operand 532 states and 831 transitions. Second operand has 8 states, 8 states have (on average 5.25) internal successors, (42), 6 states have internal predecessors, (42), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-11 05:07:06,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:07:06,643 INFO L93 Difference]: Finished difference Result 893 states and 1361 transitions. [2024-10-11 05:07:06,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-11 05:07:06,644 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 6 states have internal predecessors, (42), 3 states have call successors, (8), 5 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 57 [2024-10-11 05:07:06,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:07:06,648 INFO L225 Difference]: With dead ends: 893 [2024-10-11 05:07:06,648 INFO L226 Difference]: Without dead ends: 705 [2024-10-11 05:07:06,649 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2024-10-11 05:07:06,650 INFO L432 NwaCegarLoop]: 397 mSDtfsCounter, 1322 mSDsluCounter, 1678 mSDsCounter, 0 mSdLazyCounter, 1904 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1354 SdHoareTripleChecker+Valid, 2075 SdHoareTripleChecker+Invalid, 2030 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 1904 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-11 05:07:06,651 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1354 Valid, 2075 Invalid, 2030 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 1904 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-11 05:07:06,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 705 states. [2024-10-11 05:07:06,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 705 to 633. [2024-10-11 05:07:06,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 633 states, 531 states have (on average 1.5687382297551788) internal successors, (833), 540 states have internal predecessors, (833), 69 states have call successors, (69), 29 states have call predecessors, (69), 31 states have return successors, (78), 67 states have call predecessors, (78), 65 states have call successors, (78) [2024-10-11 05:07:06,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 633 states and 980 transitions. [2024-10-11 05:07:06,688 INFO L78 Accepts]: Start accepts. Automaton has 633 states and 980 transitions. Word has length 57 [2024-10-11 05:07:06,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:07:06,688 INFO L471 AbstractCegarLoop]: Abstraction has 633 states and 980 transitions. [2024-10-11 05:07:06,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 6 states have internal predecessors, (42), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-11 05:07:06,689 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 980 transitions. [2024-10-11 05:07:06,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-11 05:07:06,690 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:07:06,690 INFO L215 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] [2024-10-11 05:07:06,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 05:07:06,691 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:07:06,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:07:06,691 INFO L85 PathProgramCache]: Analyzing trace with hash -372616484, now seen corresponding path program 1 times [2024-10-11 05:07:06,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:07:06,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291878007] [2024-10-11 05:07:06,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:07:06,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:07:06,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:06,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:07:06,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:06,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:07:06,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:06,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:07:06,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:06,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:07:06,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:06,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 05:07:06,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:06,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 05:07:06,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:06,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:07:06,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:06,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:07:06,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:07:06,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291878007] [2024-10-11 05:07:06,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291878007] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:07:06,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:07:06,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 05:07:06,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397056001] [2024-10-11 05:07:06,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:07:06,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 05:07:06,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:07:06,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 05:07:06,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-10-11 05:07:06,844 INFO L87 Difference]: Start difference. First operand 633 states and 980 transitions. Second operand has 10 states, 9 states have (on average 4.666666666666667) internal successors, (42), 7 states have internal predecessors, (42), 5 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) [2024-10-11 05:07:08,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:07:08,429 INFO L93 Difference]: Finished difference Result 2031 states and 3030 transitions. [2024-10-11 05:07:08,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-10-11 05:07:08,430 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.666666666666667) internal successors, (42), 7 states have internal predecessors, (42), 5 states have call successors, (8), 5 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 57 [2024-10-11 05:07:08,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:07:08,440 INFO L225 Difference]: With dead ends: 2031 [2024-10-11 05:07:08,441 INFO L226 Difference]: Without dead ends: 1730 [2024-10-11 05:07:08,443 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 336 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=257, Invalid=1075, Unknown=0, NotChecked=0, Total=1332 [2024-10-11 05:07:08,444 INFO L432 NwaCegarLoop]: 405 mSDtfsCounter, 3931 mSDsluCounter, 1571 mSDsCounter, 0 mSdLazyCounter, 2028 mSolverCounterSat, 682 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3949 SdHoareTripleChecker+Valid, 1976 SdHoareTripleChecker+Invalid, 2710 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 682 IncrementalHoareTripleChecker+Valid, 2028 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-11 05:07:08,446 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3949 Valid, 1976 Invalid, 2710 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [682 Valid, 2028 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-11 05:07:08,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1730 states. [2024-10-11 05:07:08,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1730 to 1597. [2024-10-11 05:07:08,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1597 states, 1290 states have (on average 1.4635658914728682) internal successors, (1888), 1314 states have internal predecessors, (1888), 179 states have call successors, (179), 112 states have call predecessors, (179), 126 states have return successors, (211), 173 states have call predecessors, (211), 175 states have call successors, (211) [2024-10-11 05:07:08,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1597 states to 1597 states and 2278 transitions. [2024-10-11 05:07:08,564 INFO L78 Accepts]: Start accepts. Automaton has 1597 states and 2278 transitions. Word has length 57 [2024-10-11 05:07:08,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:07:08,565 INFO L471 AbstractCegarLoop]: Abstraction has 1597 states and 2278 transitions. [2024-10-11 05:07:08,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.666666666666667) internal successors, (42), 7 states have internal predecessors, (42), 5 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) [2024-10-11 05:07:08,565 INFO L276 IsEmpty]: Start isEmpty. Operand 1597 states and 2278 transitions. [2024-10-11 05:07:08,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-11 05:07:08,568 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:07:08,568 INFO L215 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] [2024-10-11 05:07:08,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 05:07:08,569 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:07:08,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:07:08,569 INFO L85 PathProgramCache]: Analyzing trace with hash 872387731, now seen corresponding path program 1 times [2024-10-11 05:07:08,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:07:08,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953245675] [2024-10-11 05:07:08,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:07:08,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:07:08,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:08,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:07:08,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:08,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:07:08,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:08,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:07:08,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:08,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:07:08,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:08,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:07:08,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:08,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 05:07:08,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:08,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 05:07:08,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:08,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:07:08,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:07:08,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953245675] [2024-10-11 05:07:08,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953245675] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:07:08,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:07:08,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 05:07:08,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406497536] [2024-10-11 05:07:08,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:07:08,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 05:07:08,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:07:08,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 05:07:08,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-11 05:07:08,699 INFO L87 Difference]: Start difference. First operand 1597 states and 2278 transitions. Second operand has 9 states, 8 states have (on average 5.375) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 05:07:09,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:07:09,760 INFO L93 Difference]: Finished difference Result 2978 states and 4202 transitions. [2024-10-11 05:07:09,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 05:07:09,760 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.375) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (8), 5 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 58 [2024-10-11 05:07:09,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:07:09,771 INFO L225 Difference]: With dead ends: 2978 [2024-10-11 05:07:09,771 INFO L226 Difference]: Without dead ends: 1719 [2024-10-11 05:07:09,776 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2024-10-11 05:07:09,779 INFO L432 NwaCegarLoop]: 358 mSDtfsCounter, 881 mSDsluCounter, 1811 mSDsCounter, 0 mSdLazyCounter, 2026 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 882 SdHoareTripleChecker+Valid, 2169 SdHoareTripleChecker+Invalid, 2166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 2026 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 05:07:09,779 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [882 Valid, 2169 Invalid, 2166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 2026 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 05:07:09,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1719 states. [2024-10-11 05:07:09,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1719 to 1629. [2024-10-11 05:07:09,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1629 states, 1314 states have (on average 1.4505327245053272) internal successors, (1906), 1338 states have internal predecessors, (1906), 179 states have call successors, (179), 112 states have call predecessors, (179), 134 states have return successors, (219), 181 states have call predecessors, (219), 175 states have call successors, (219) [2024-10-11 05:07:09,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1629 states to 1629 states and 2304 transitions. [2024-10-11 05:07:09,862 INFO L78 Accepts]: Start accepts. Automaton has 1629 states and 2304 transitions. Word has length 58 [2024-10-11 05:07:09,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:07:09,863 INFO L471 AbstractCegarLoop]: Abstraction has 1629 states and 2304 transitions. [2024-10-11 05:07:09,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.375) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 05:07:09,864 INFO L276 IsEmpty]: Start isEmpty. Operand 1629 states and 2304 transitions. [2024-10-11 05:07:09,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-11 05:07:09,865 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:07:09,865 INFO L215 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] [2024-10-11 05:07:09,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 05:07:09,866 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:07:09,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:07:09,866 INFO L85 PathProgramCache]: Analyzing trace with hash 800001173, now seen corresponding path program 1 times [2024-10-11 05:07:09,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:07:09,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540894335] [2024-10-11 05:07:09,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:07:09,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:07:09,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:09,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:07:09,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:09,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:07:09,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:09,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:07:09,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:09,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:07:09,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:09,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:07:09,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:09,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 05:07:10,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:10,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 05:07:10,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:10,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:07:10,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:07:10,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540894335] [2024-10-11 05:07:10,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540894335] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:07:10,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:07:10,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 05:07:10,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086190497] [2024-10-11 05:07:10,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:07:10,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 05:07:10,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:07:10,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 05:07:10,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-10-11 05:07:10,012 INFO L87 Difference]: Start difference. First operand 1629 states and 2304 transitions. Second operand has 10 states, 9 states have (on average 4.777777777777778) internal successors, (43), 7 states have internal predecessors, (43), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2024-10-11 05:07:11,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:07:11,650 INFO L93 Difference]: Finished difference Result 4888 states and 6865 transitions. [2024-10-11 05:07:11,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-10-11 05:07:11,651 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.777777777777778) internal successors, (43), 7 states have internal predecessors, (43), 4 states have call successors, (8), 5 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 58 [2024-10-11 05:07:11,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:07:11,660 INFO L225 Difference]: With dead ends: 4888 [2024-10-11 05:07:11,660 INFO L226 Difference]: Without dead ends: 1999 [2024-10-11 05:07:11,665 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 340 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=257, Invalid=1075, Unknown=0, NotChecked=0, Total=1332 [2024-10-11 05:07:11,666 INFO L432 NwaCegarLoop]: 408 mSDtfsCounter, 4069 mSDsluCounter, 1608 mSDsCounter, 0 mSdLazyCounter, 1918 mSolverCounterSat, 718 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4087 SdHoareTripleChecker+Valid, 2016 SdHoareTripleChecker+Invalid, 2636 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 718 IncrementalHoareTripleChecker+Valid, 1918 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-11 05:07:11,666 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4087 Valid, 2016 Invalid, 2636 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [718 Valid, 1918 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-11 05:07:11,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1999 states. [2024-10-11 05:07:11,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1999 to 1843. [2024-10-11 05:07:11,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1843 states, 1456 states have (on average 1.397664835164835) internal successors, (2035), 1482 states have internal predecessors, (2035), 219 states have call successors, (219), 140 states have call predecessors, (219), 166 states have return successors, (265), 223 states have call predecessors, (265), 215 states have call successors, (265) [2024-10-11 05:07:11,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1843 states to 1843 states and 2519 transitions. [2024-10-11 05:07:11,757 INFO L78 Accepts]: Start accepts. Automaton has 1843 states and 2519 transitions. Word has length 58 [2024-10-11 05:07:11,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:07:11,757 INFO L471 AbstractCegarLoop]: Abstraction has 1843 states and 2519 transitions. [2024-10-11 05:07:11,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.777777777777778) internal successors, (43), 7 states have internal predecessors, (43), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2024-10-11 05:07:11,757 INFO L276 IsEmpty]: Start isEmpty. Operand 1843 states and 2519 transitions. [2024-10-11 05:07:11,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-11 05:07:11,758 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:07:11,758 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:07:11,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 05:07:11,759 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:07:11,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:07:11,759 INFO L85 PathProgramCache]: Analyzing trace with hash 940212068, now seen corresponding path program 1 times [2024-10-11 05:07:11,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:07:11,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224955422] [2024-10-11 05:07:11,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:07:11,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:07:11,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:11,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:07:11,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:11,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:07:11,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:11,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:07:11,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:11,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:07:11,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:11,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:07:11,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:11,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 05:07:11,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:11,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 05:07:11,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:11,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 05:07:11,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:11,858 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-11 05:07:11,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:07:11,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224955422] [2024-10-11 05:07:11,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224955422] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:07:11,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:07:11,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 05:07:11,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160857901] [2024-10-11 05:07:11,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:07:11,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 05:07:11,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:07:11,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 05:07:11,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-11 05:07:11,861 INFO L87 Difference]: Start difference. First operand 1843 states and 2519 transitions. Second operand has 9 states, 8 states have (on average 6.625) internal successors, (53), 5 states have internal predecessors, (53), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 05:07:12,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:07:12,926 INFO L93 Difference]: Finished difference Result 3512 states and 4757 transitions. [2024-10-11 05:07:12,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 05:07:12,926 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.625) internal successors, (53), 5 states have internal predecessors, (53), 2 states have call successors, (8), 5 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 80 [2024-10-11 05:07:12,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:07:12,935 INFO L225 Difference]: With dead ends: 3512 [2024-10-11 05:07:12,935 INFO L226 Difference]: Without dead ends: 2007 [2024-10-11 05:07:12,938 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2024-10-11 05:07:12,939 INFO L432 NwaCegarLoop]: 352 mSDtfsCounter, 585 mSDsluCounter, 2059 mSDsCounter, 0 mSdLazyCounter, 2082 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 587 SdHoareTripleChecker+Valid, 2411 SdHoareTripleChecker+Invalid, 2174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 2082 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 05:07:12,939 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [587 Valid, 2411 Invalid, 2174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 2082 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 05:07:12,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2007 states. [2024-10-11 05:07:13,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2007 to 1891. [2024-10-11 05:07:13,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1891 states, 1492 states have (on average 1.3840482573726542) internal successors, (2065), 1518 states have internal predecessors, (2065), 219 states have call successors, (219), 140 states have call predecessors, (219), 178 states have return successors, (277), 235 states have call predecessors, (277), 215 states have call successors, (277) [2024-10-11 05:07:13,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1891 states to 1891 states and 2561 transitions. [2024-10-11 05:07:13,045 INFO L78 Accepts]: Start accepts. Automaton has 1891 states and 2561 transitions. Word has length 80 [2024-10-11 05:07:13,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:07:13,046 INFO L471 AbstractCegarLoop]: Abstraction has 1891 states and 2561 transitions. [2024-10-11 05:07:13,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.625) internal successors, (53), 5 states have internal predecessors, (53), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 05:07:13,046 INFO L276 IsEmpty]: Start isEmpty. Operand 1891 states and 2561 transitions. [2024-10-11 05:07:13,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-11 05:07:13,047 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:07:13,047 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:07:13,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 05:07:13,047 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:07:13,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:07:13,048 INFO L85 PathProgramCache]: Analyzing trace with hash -1426482526, now seen corresponding path program 1 times [2024-10-11 05:07:13,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:07:13,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582609414] [2024-10-11 05:07:13,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:07:13,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:07:13,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:13,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:07:13,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:13,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:07:13,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:13,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:07:13,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:13,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:07:13,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:13,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:07:13,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:13,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 05:07:13,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:13,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 05:07:13,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:13,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 05:07:13,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:13,195 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-11 05:07:13,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:07:13,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582609414] [2024-10-11 05:07:13,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582609414] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:07:13,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:07:13,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 05:07:13,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043481296] [2024-10-11 05:07:13,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:07:13,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 05:07:13,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:07:13,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 05:07:13,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 05:07:13,199 INFO L87 Difference]: Start difference. First operand 1891 states and 2561 transitions. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 6 states have internal predecessors, (53), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-11 05:07:14,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:07:14,130 INFO L93 Difference]: Finished difference Result 3290 states and 4397 transitions. [2024-10-11 05:07:14,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-11 05:07:14,131 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 6 states have internal predecessors, (53), 3 states have call successors, (8), 5 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 80 [2024-10-11 05:07:14,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:07:14,139 INFO L225 Difference]: With dead ends: 3290 [2024-10-11 05:07:14,139 INFO L226 Difference]: Without dead ends: 1958 [2024-10-11 05:07:14,141 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=277, Unknown=0, NotChecked=0, Total=380 [2024-10-11 05:07:14,142 INFO L432 NwaCegarLoop]: 342 mSDtfsCounter, 1327 mSDsluCounter, 1493 mSDsCounter, 0 mSdLazyCounter, 1708 mSolverCounterSat, 145 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1358 SdHoareTripleChecker+Valid, 1835 SdHoareTripleChecker+Invalid, 1853 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 145 IncrementalHoareTripleChecker+Valid, 1708 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 05:07:14,142 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1358 Valid, 1835 Invalid, 1853 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [145 Valid, 1708 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 05:07:14,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1958 states. [2024-10-11 05:07:14,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1958 to 1683. [2024-10-11 05:07:14,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1683 states, 1337 states have (on average 1.3911742707554227) internal successors, (1860), 1358 states have internal predecessors, (1860), 191 states have call successors, (191), 121 states have call predecessors, (191), 153 states have return successors, (237), 205 states have call predecessors, (237), 187 states have call successors, (237) [2024-10-11 05:07:14,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1683 states to 1683 states and 2288 transitions. [2024-10-11 05:07:14,235 INFO L78 Accepts]: Start accepts. Automaton has 1683 states and 2288 transitions. Word has length 80 [2024-10-11 05:07:14,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:07:14,236 INFO L471 AbstractCegarLoop]: Abstraction has 1683 states and 2288 transitions. [2024-10-11 05:07:14,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 6 states have internal predecessors, (53), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-11 05:07:14,236 INFO L276 IsEmpty]: Start isEmpty. Operand 1683 states and 2288 transitions. [2024-10-11 05:07:14,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-11 05:07:14,237 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:07:14,237 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:07:14,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 05:07:14,237 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:07:14,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:07:14,238 INFO L85 PathProgramCache]: Analyzing trace with hash -1002835804, now seen corresponding path program 1 times [2024-10-11 05:07:14,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:07:14,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149310709] [2024-10-11 05:07:14,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:07:14,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:07:14,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:14,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:07:14,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:14,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:07:14,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:14,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:07:14,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:14,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:07:14,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:14,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:07:14,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:14,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 05:07:14,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:14,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 05:07:14,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:14,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 05:07:14,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:14,328 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 05:07:14,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:07:14,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149310709] [2024-10-11 05:07:14,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149310709] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:07:14,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:07:14,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:07:14,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205949702] [2024-10-11 05:07:14,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:07:14,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:07:14,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:07:14,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:07:14,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:07:14,330 INFO L87 Difference]: Start difference. First operand 1683 states and 2288 transitions. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 4 states have internal predecessors, (60), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2024-10-11 05:07:15,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:07:15,113 INFO L93 Difference]: Finished difference Result 4583 states and 6148 transitions. [2024-10-11 05:07:15,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 05:07:15,114 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 4 states have internal predecessors, (60), 4 states have call successors, (9), 5 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 80 [2024-10-11 05:07:15,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:07:15,126 INFO L225 Difference]: With dead ends: 4583 [2024-10-11 05:07:15,127 INFO L226 Difference]: Without dead ends: 3239 [2024-10-11 05:07:15,129 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2024-10-11 05:07:15,130 INFO L432 NwaCegarLoop]: 353 mSDtfsCounter, 1563 mSDsluCounter, 943 mSDsCounter, 0 mSdLazyCounter, 807 mSolverCounterSat, 185 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1596 SdHoareTripleChecker+Valid, 1296 SdHoareTripleChecker+Invalid, 992 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 185 IncrementalHoareTripleChecker+Valid, 807 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 05:07:15,130 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1596 Valid, 1296 Invalid, 992 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [185 Valid, 807 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 05:07:15,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3239 states. [2024-10-11 05:07:15,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3239 to 3029. [2024-10-11 05:07:15,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3029 states, 2363 states have (on average 1.33939906898011) internal successors, (3165), 2413 states have internal predecessors, (3165), 352 states have call successors, (352), 234 states have call predecessors, (352), 312 states have return successors, (520), 384 states have call predecessors, (520), 348 states have call successors, (520) [2024-10-11 05:07:15,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3029 states to 3029 states and 4037 transitions. [2024-10-11 05:07:15,298 INFO L78 Accepts]: Start accepts. Automaton has 3029 states and 4037 transitions. Word has length 80 [2024-10-11 05:07:15,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:07:15,298 INFO L471 AbstractCegarLoop]: Abstraction has 3029 states and 4037 transitions. [2024-10-11 05:07:15,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 4 states have internal predecessors, (60), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2024-10-11 05:07:15,298 INFO L276 IsEmpty]: Start isEmpty. Operand 3029 states and 4037 transitions. [2024-10-11 05:07:15,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-11 05:07:15,300 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:07:15,300 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:07:15,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 05:07:15,300 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:07:15,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:07:15,301 INFO L85 PathProgramCache]: Analyzing trace with hash -925935006, now seen corresponding path program 1 times [2024-10-11 05:07:15,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:07:15,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924464726] [2024-10-11 05:07:15,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:07:15,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:07:15,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:15,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:07:15,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:15,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:07:15,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:15,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:07:15,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:15,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:07:15,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:15,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:07:15,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:15,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 05:07:15,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:15,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 05:07:15,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:15,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 05:07:15,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:15,356 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-11 05:07:15,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:07:15,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924464726] [2024-10-11 05:07:15,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924464726] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:07:15,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:07:15,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 05:07:15,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248913906] [2024-10-11 05:07:15,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:07:15,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 05:07:15,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:07:15,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 05:07:15,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:07:15,358 INFO L87 Difference]: Start difference. First operand 3029 states and 4037 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 3 states have internal predecessors, (53), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-11 05:07:15,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:07:15,979 INFO L93 Difference]: Finished difference Result 4486 states and 5894 transitions. [2024-10-11 05:07:15,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 05:07:15,980 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 3 states have internal predecessors, (53), 3 states have call successors, (8), 5 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 80 [2024-10-11 05:07:15,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:07:15,987 INFO L225 Difference]: With dead ends: 4486 [2024-10-11 05:07:15,987 INFO L226 Difference]: Without dead ends: 1796 [2024-10-11 05:07:15,990 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-10-11 05:07:15,991 INFO L432 NwaCegarLoop]: 346 mSDtfsCounter, 982 mSDsluCounter, 780 mSDsCounter, 0 mSdLazyCounter, 796 mSolverCounterSat, 147 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 998 SdHoareTripleChecker+Valid, 1126 SdHoareTripleChecker+Invalid, 943 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 147 IncrementalHoareTripleChecker+Valid, 796 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 05:07:15,991 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [998 Valid, 1126 Invalid, 943 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [147 Valid, 796 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 05:07:15,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1796 states. [2024-10-11 05:07:16,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1796 to 1683. [2024-10-11 05:07:16,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1683 states, 1337 states have (on average 1.363500373971578) internal successors, (1823), 1358 states have internal predecessors, (1823), 191 states have call successors, (191), 121 states have call predecessors, (191), 153 states have return successors, (237), 205 states have call predecessors, (237), 187 states have call successors, (237) [2024-10-11 05:07:16,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1683 states to 1683 states and 2251 transitions. [2024-10-11 05:07:16,068 INFO L78 Accepts]: Start accepts. Automaton has 1683 states and 2251 transitions. Word has length 80 [2024-10-11 05:07:16,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:07:16,069 INFO L471 AbstractCegarLoop]: Abstraction has 1683 states and 2251 transitions. [2024-10-11 05:07:16,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 3 states have internal predecessors, (53), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-11 05:07:16,069 INFO L276 IsEmpty]: Start isEmpty. Operand 1683 states and 2251 transitions. [2024-10-11 05:07:16,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-11 05:07:16,070 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:07:16,070 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:07:16,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 05:07:16,070 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:07:16,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:07:16,070 INFO L85 PathProgramCache]: Analyzing trace with hash 2113907548, now seen corresponding path program 1 times [2024-10-11 05:07:16,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:07:16,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627714974] [2024-10-11 05:07:16,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:07:16,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:07:16,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:16,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:07:16,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:16,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:07:16,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:16,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:07:16,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:16,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:07:16,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:16,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:07:16,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:16,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 05:07:16,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:16,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 05:07:16,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:16,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 05:07:16,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:16,162 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 05:07:16,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:07:16,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627714974] [2024-10-11 05:07:16,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627714974] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:07:16,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:07:16,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 05:07:16,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556238636] [2024-10-11 05:07:16,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:07:16,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 05:07:16,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:07:16,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 05:07:16,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-10-11 05:07:16,163 INFO L87 Difference]: Start difference. First operand 1683 states and 2251 transitions. Second operand has 9 states, 9 states have (on average 7.0) internal successors, (63), 6 states have internal predecessors, (63), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-11 05:07:17,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:07:17,465 INFO L93 Difference]: Finished difference Result 3904 states and 5137 transitions. [2024-10-11 05:07:17,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-11 05:07:17,465 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 6 states have internal predecessors, (63), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 81 [2024-10-11 05:07:17,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:07:17,476 INFO L225 Difference]: With dead ends: 3904 [2024-10-11 05:07:17,476 INFO L226 Difference]: Without dead ends: 2419 [2024-10-11 05:07:17,479 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=210, Invalid=720, Unknown=0, NotChecked=0, Total=930 [2024-10-11 05:07:17,480 INFO L432 NwaCegarLoop]: 354 mSDtfsCounter, 2300 mSDsluCounter, 1530 mSDsCounter, 0 mSdLazyCounter, 1777 mSolverCounterSat, 452 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2342 SdHoareTripleChecker+Valid, 1884 SdHoareTripleChecker+Invalid, 2229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 452 IncrementalHoareTripleChecker+Valid, 1777 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 05:07:17,481 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2342 Valid, 1884 Invalid, 2229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [452 Valid, 1777 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 05:07:17,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2419 states. [2024-10-11 05:07:17,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2419 to 2255. [2024-10-11 05:07:17,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2255 states, 1755 states have (on average 1.3196581196581196) internal successors, (2316), 1784 states have internal predecessors, (2316), 268 states have call successors, (268), 169 states have call predecessors, (268), 230 states have return successors, (368), 303 states have call predecessors, (368), 264 states have call successors, (368) [2024-10-11 05:07:17,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2255 states to 2255 states and 2952 transitions. [2024-10-11 05:07:17,682 INFO L78 Accepts]: Start accepts. Automaton has 2255 states and 2952 transitions. Word has length 81 [2024-10-11 05:07:17,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:07:17,682 INFO L471 AbstractCegarLoop]: Abstraction has 2255 states and 2952 transitions. [2024-10-11 05:07:17,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 6 states have internal predecessors, (63), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-11 05:07:17,683 INFO L276 IsEmpty]: Start isEmpty. Operand 2255 states and 2952 transitions. [2024-10-11 05:07:17,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-10-11 05:07:17,684 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:07:17,684 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:07:17,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 05:07:17,684 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:07:17,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:07:17,685 INFO L85 PathProgramCache]: Analyzing trace with hash -1713696190, now seen corresponding path program 1 times [2024-10-11 05:07:17,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:07:17,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556554177] [2024-10-11 05:07:17,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:07:17,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:07:17,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:17,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:07:17,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:17,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:07:17,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:17,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:07:17,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:17,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:07:17,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:17,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:07:17,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:17,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 05:07:17,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:17,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 05:07:17,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:17,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 05:07:17,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:17,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 05:07:17,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:17,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 05:07:17,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:17,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 05:07:17,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:17,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:07:17,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:17,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 05:07:17,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:17,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-11 05:07:17,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:17,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 05:07:17,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:17,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 05:07:17,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:17,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 05:07:17,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:17,806 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 20 proven. 6 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-10-11 05:07:17,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:07:17,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556554177] [2024-10-11 05:07:17,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556554177] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 05:07:17,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1997872453] [2024-10-11 05:07:17,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:07:17,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 05:07:17,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 05:07:17,808 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 05:07:17,809 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 05:07:17,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:17,921 INFO L255 TraceCheckSpWp]: Trace formula consists of 587 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 05:07:17,928 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 05:07:18,031 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-10-11 05:07:18,031 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 05:07:18,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1997872453] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:07:18,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 05:07:18,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2024-10-11 05:07:18,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096639884] [2024-10-11 05:07:18,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:07:18,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 05:07:18,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:07:18,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 05:07:18,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-10-11 05:07:18,033 INFO L87 Difference]: Start difference. First operand 2255 states and 2952 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-11 05:07:18,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:07:18,289 INFO L93 Difference]: Finished difference Result 5851 states and 7451 transitions. [2024-10-11 05:07:18,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 05:07:18,290 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 145 [2024-10-11 05:07:18,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:07:18,303 INFO L225 Difference]: With dead ends: 5851 [2024-10-11 05:07:18,304 INFO L226 Difference]: Without dead ends: 4005 [2024-10-11 05:07:18,308 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-10-11 05:07:18,308 INFO L432 NwaCegarLoop]: 625 mSDtfsCounter, 57 mSDsluCounter, 604 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 1229 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 05:07:18,308 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 1229 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 05:07:18,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4005 states. [2024-10-11 05:07:18,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4005 to 3965. [2024-10-11 05:07:18,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3965 states, 3052 states have (on average 1.281127129750983) internal successors, (3910), 3104 states have internal predecessors, (3910), 475 states have call successors, (475), 330 states have call predecessors, (475), 436 states have return successors, (636), 532 states have call predecessors, (636), 471 states have call successors, (636) [2024-10-11 05:07:18,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3965 states to 3965 states and 5021 transitions. [2024-10-11 05:07:18,559 INFO L78 Accepts]: Start accepts. Automaton has 3965 states and 5021 transitions. Word has length 145 [2024-10-11 05:07:18,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:07:18,559 INFO L471 AbstractCegarLoop]: Abstraction has 3965 states and 5021 transitions. [2024-10-11 05:07:18,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-11 05:07:18,560 INFO L276 IsEmpty]: Start isEmpty. Operand 3965 states and 5021 transitions. [2024-10-11 05:07:18,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-10-11 05:07:18,562 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:07:18,562 INFO L215 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] [2024-10-11 05:07:18,577 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 05:07:18,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-10-11 05:07:18,767 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:07:18,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:07:18,767 INFO L85 PathProgramCache]: Analyzing trace with hash -1910721648, now seen corresponding path program 1 times [2024-10-11 05:07:18,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:07:18,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946806801] [2024-10-11 05:07:18,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:07:18,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:07:18,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:18,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:07:18,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:18,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 05:07:18,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:18,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 05:07:18,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:18,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 05:07:18,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:18,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-11 05:07:18,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:18,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:07:18,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:07:18,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946806801] [2024-10-11 05:07:18,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946806801] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:07:18,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:07:18,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 05:07:18,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574651768] [2024-10-11 05:07:18,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:07:18,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 05:07:18,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:07:18,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 05:07:18,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:07:18,914 INFO L87 Difference]: Start difference. First operand 3965 states and 5021 transitions. Second operand has 5 states, 5 states have (on average 28.2) internal successors, (141), 3 states have internal predecessors, (141), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:07:20,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:07:20,811 INFO L93 Difference]: Finished difference Result 4405 states and 5755 transitions. [2024-10-11 05:07:20,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 05:07:20,811 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.2) internal successors, (141), 3 states have internal predecessors, (141), 2 states have call successors, (6), 4 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 152 [2024-10-11 05:07:20,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:07:20,824 INFO L225 Difference]: With dead ends: 4405 [2024-10-11 05:07:20,824 INFO L226 Difference]: Without dead ends: 4085 [2024-10-11 05:07:20,825 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-10-11 05:07:20,826 INFO L432 NwaCegarLoop]: 363 mSDtfsCounter, 1016 mSDsluCounter, 479 mSDsCounter, 0 mSdLazyCounter, 1149 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1039 SdHoareTripleChecker+Valid, 842 SdHoareTripleChecker+Invalid, 1243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 1149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-11 05:07:20,826 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1039 Valid, 842 Invalid, 1243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 1149 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-11 05:07:20,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4085 states. [2024-10-11 05:07:21,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4085 to 3965. [2024-10-11 05:07:21,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3965 states, 3052 states have (on average 1.280799475753604) internal successors, (3909), 3104 states have internal predecessors, (3909), 475 states have call successors, (475), 330 states have call predecessors, (475), 436 states have return successors, (636), 532 states have call predecessors, (636), 471 states have call successors, (636) [2024-10-11 05:07:21,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3965 states to 3965 states and 5020 transitions. [2024-10-11 05:07:21,355 INFO L78 Accepts]: Start accepts. Automaton has 3965 states and 5020 transitions. Word has length 152 [2024-10-11 05:07:21,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:07:21,356 INFO L471 AbstractCegarLoop]: Abstraction has 3965 states and 5020 transitions. [2024-10-11 05:07:21,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.2) internal successors, (141), 3 states have internal predecessors, (141), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:07:21,356 INFO L276 IsEmpty]: Start isEmpty. Operand 3965 states and 5020 transitions. [2024-10-11 05:07:21,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-10-11 05:07:21,357 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:07:21,358 INFO L215 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] [2024-10-11 05:07:21,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 05:07:21,358 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:07:21,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:07:21,358 INFO L85 PathProgramCache]: Analyzing trace with hash 1973635282, now seen corresponding path program 1 times [2024-10-11 05:07:21,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:07:21,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794054095] [2024-10-11 05:07:21,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:07:21,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:07:21,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:21,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:07:21,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:21,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 05:07:21,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:21,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 05:07:21,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:21,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 05:07:21,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:21,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-11 05:07:21,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:21,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:07:21,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:07:21,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794054095] [2024-10-11 05:07:21,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794054095] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:07:21,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:07:21,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 05:07:21,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226821008] [2024-10-11 05:07:21,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:07:21,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 05:07:21,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:07:21,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 05:07:21,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:07:21,601 INFO L87 Difference]: Start difference. First operand 3965 states and 5020 transitions. Second operand has 6 states, 6 states have (on average 23.5) internal successors, (141), 4 states have internal predecessors, (141), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:07:24,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:07:24,194 INFO L93 Difference]: Finished difference Result 4848 states and 6496 transitions. [2024-10-11 05:07:24,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 05:07:24,195 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 23.5) internal successors, (141), 4 states have internal predecessors, (141), 2 states have call successors, (6), 4 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 152 [2024-10-11 05:07:24,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:07:24,207 INFO L225 Difference]: With dead ends: 4848 [2024-10-11 05:07:24,207 INFO L226 Difference]: Without dead ends: 4535 [2024-10-11 05:07:24,208 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-10-11 05:07:24,209 INFO L432 NwaCegarLoop]: 321 mSDtfsCounter, 1610 mSDsluCounter, 915 mSDsCounter, 0 mSdLazyCounter, 2319 mSolverCounterSat, 152 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1640 SdHoareTripleChecker+Valid, 1236 SdHoareTripleChecker+Invalid, 2471 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 152 IncrementalHoareTripleChecker+Valid, 2319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-11 05:07:24,209 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1640 Valid, 1236 Invalid, 2471 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [152 Valid, 2319 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-11 05:07:24,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4535 states. [2024-10-11 05:07:24,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4535 to 4294. [2024-10-11 05:07:24,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4294 states, 3354 states have (on average 1.3142516398330353) internal successors, (4408), 3407 states have internal predecessors, (4408), 495 states have call successors, (495), 336 states have call predecessors, (495), 443 states have return successors, (659), 552 states have call predecessors, (659), 491 states have call successors, (659) [2024-10-11 05:07:24,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4294 states to 4294 states and 5562 transitions. [2024-10-11 05:07:24,934 INFO L78 Accepts]: Start accepts. Automaton has 4294 states and 5562 transitions. Word has length 152 [2024-10-11 05:07:24,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:07:24,934 INFO L471 AbstractCegarLoop]: Abstraction has 4294 states and 5562 transitions. [2024-10-11 05:07:24,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.5) internal successors, (141), 4 states have internal predecessors, (141), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:07:24,935 INFO L276 IsEmpty]: Start isEmpty. Operand 4294 states and 5562 transitions. [2024-10-11 05:07:24,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-10-11 05:07:24,937 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:07:24,937 INFO L215 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] [2024-10-11 05:07:24,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 05:07:24,937 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:07:24,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:07:24,938 INFO L85 PathProgramCache]: Analyzing trace with hash -1784366130, now seen corresponding path program 1 times [2024-10-11 05:07:24,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:07:24,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849184583] [2024-10-11 05:07:24,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:07:24,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:07:24,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:24,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:07:24,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:25,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 05:07:25,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:25,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 05:07:25,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:25,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 05:07:25,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:25,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-11 05:07:25,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:25,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:07:25,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:07:25,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849184583] [2024-10-11 05:07:25,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849184583] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:07:25,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:07:25,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:07:25,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629161062] [2024-10-11 05:07:25,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:07:25,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:07:25,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:07:25,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:07:25,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:07:25,134 INFO L87 Difference]: Start difference. First operand 4294 states and 5562 transitions. Second operand has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:07:28,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:07:28,387 INFO L93 Difference]: Finished difference Result 5643 states and 7818 transitions. [2024-10-11 05:07:28,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 05:07:28,389 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 2 states have call successors, (6), 4 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 152 [2024-10-11 05:07:28,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:07:28,406 INFO L225 Difference]: With dead ends: 5643 [2024-10-11 05:07:28,406 INFO L226 Difference]: Without dead ends: 5001 [2024-10-11 05:07:28,409 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-11 05:07:28,410 INFO L432 NwaCegarLoop]: 373 mSDtfsCounter, 1742 mSDsluCounter, 1239 mSDsCounter, 0 mSdLazyCounter, 3284 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1772 SdHoareTripleChecker+Valid, 1612 SdHoareTripleChecker+Invalid, 3421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 3284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-11 05:07:28,410 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1772 Valid, 1612 Invalid, 3421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 3284 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-11 05:07:28,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5001 states. [2024-10-11 05:07:29,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5001 to 4598. [2024-10-11 05:07:29,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4598 states, 3631 states have (on average 1.3376480308454972) internal successors, (4857), 3685 states have internal predecessors, (4857), 515 states have call successors, (515), 342 states have call predecessors, (515), 450 states have return successors, (681), 573 states have call predecessors, (681), 511 states have call successors, (681) [2024-10-11 05:07:29,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4598 states to 4598 states and 6053 transitions. [2024-10-11 05:07:29,118 INFO L78 Accepts]: Start accepts. Automaton has 4598 states and 6053 transitions. Word has length 152 [2024-10-11 05:07:29,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:07:29,119 INFO L471 AbstractCegarLoop]: Abstraction has 4598 states and 6053 transitions. [2024-10-11 05:07:29,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:07:29,119 INFO L276 IsEmpty]: Start isEmpty. Operand 4598 states and 6053 transitions. [2024-10-11 05:07:29,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-10-11 05:07:29,121 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:07:29,121 INFO L215 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] [2024-10-11 05:07:29,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 05:07:29,122 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:07:29,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:07:29,122 INFO L85 PathProgramCache]: Analyzing trace with hash 1965728592, now seen corresponding path program 1 times [2024-10-11 05:07:29,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:07:29,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308645967] [2024-10-11 05:07:29,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:07:29,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:07:29,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:29,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:07:29,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:29,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 05:07:29,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:29,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 05:07:29,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:29,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 05:07:29,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:29,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-11 05:07:29,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:29,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:07:29,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:07:29,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308645967] [2024-10-11 05:07:29,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308645967] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:07:29,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:07:29,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:07:29,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258915775] [2024-10-11 05:07:29,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:07:29,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:07:29,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:07:29,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:07:29,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:07:29,355 INFO L87 Difference]: Start difference. First operand 4598 states and 6053 transitions. Second operand has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:07:32,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:07:32,578 INFO L93 Difference]: Finished difference Result 6807 states and 9743 transitions. [2024-10-11 05:07:32,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 05:07:32,578 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 2 states have call successors, (6), 4 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 152 [2024-10-11 05:07:32,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:07:32,594 INFO L225 Difference]: With dead ends: 6807 [2024-10-11 05:07:32,595 INFO L226 Difference]: Without dead ends: 5861 [2024-10-11 05:07:32,597 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-11 05:07:32,598 INFO L432 NwaCegarLoop]: 515 mSDtfsCounter, 1653 mSDsluCounter, 1703 mSDsCounter, 0 mSdLazyCounter, 3712 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1683 SdHoareTripleChecker+Valid, 2218 SdHoareTripleChecker+Invalid, 3817 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 3712 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-11 05:07:32,598 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1683 Valid, 2218 Invalid, 3817 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 3712 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-11 05:07:32,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5861 states. [2024-10-11 05:07:33,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5861 to 5210. [2024-10-11 05:07:33,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5210 states, 4189 states have (on average 1.3755072809739795) internal successors, (5762), 4245 states have internal predecessors, (5762), 555 states have call successors, (555), 354 states have call predecessors, (555), 464 states have return successors, (729), 615 states have call predecessors, (729), 551 states have call successors, (729) [2024-10-11 05:07:33,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5210 states to 5210 states and 7046 transitions. [2024-10-11 05:07:33,202 INFO L78 Accepts]: Start accepts. Automaton has 5210 states and 7046 transitions. Word has length 152 [2024-10-11 05:07:33,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:07:33,202 INFO L471 AbstractCegarLoop]: Abstraction has 5210 states and 7046 transitions. [2024-10-11 05:07:33,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:07:33,203 INFO L276 IsEmpty]: Start isEmpty. Operand 5210 states and 7046 transitions. [2024-10-11 05:07:33,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-10-11 05:07:33,205 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:07:33,205 INFO L215 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] [2024-10-11 05:07:33,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 05:07:33,205 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:07:33,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:07:33,206 INFO L85 PathProgramCache]: Analyzing trace with hash 1017676626, now seen corresponding path program 1 times [2024-10-11 05:07:33,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:07:33,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97941670] [2024-10-11 05:07:33,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:07:33,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:07:33,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:33,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:07:33,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:33,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 05:07:33,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:33,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 05:07:33,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:33,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 05:07:33,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:33,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-11 05:07:33,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:33,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:07:33,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:07:33,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97941670] [2024-10-11 05:07:33,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97941670] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:07:33,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:07:33,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:07:33,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480515187] [2024-10-11 05:07:33,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:07:33,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:07:33,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:07:33,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:07:33,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:07:33,393 INFO L87 Difference]: Start difference. First operand 5210 states and 7046 transitions. Second operand has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:07:37,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:07:37,195 INFO L93 Difference]: Finished difference Result 9045 states and 13424 transitions. [2024-10-11 05:07:37,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 05:07:37,195 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 2 states have call successors, (6), 4 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 152 [2024-10-11 05:07:37,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:07:37,212 INFO L225 Difference]: With dead ends: 9045 [2024-10-11 05:07:37,212 INFO L226 Difference]: Without dead ends: 7487 [2024-10-11 05:07:37,216 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-11 05:07:37,217 INFO L432 NwaCegarLoop]: 515 mSDtfsCounter, 1648 mSDsluCounter, 1703 mSDsCounter, 0 mSdLazyCounter, 3695 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1678 SdHoareTripleChecker+Valid, 2218 SdHoareTripleChecker+Invalid, 3801 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 3695 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-10-11 05:07:37,217 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1678 Valid, 2218 Invalid, 3801 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 3695 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-10-11 05:07:37,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7487 states. [2024-10-11 05:07:37,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7487 to 6435. [2024-10-11 05:07:37,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6435 states, 5306 states have (on average 1.427063701470034) internal successors, (7572), 5366 states have internal predecessors, (7572), 635 states have call successors, (635), 378 states have call predecessors, (635), 492 states have return successors, (831), 699 states have call predecessors, (831), 631 states have call successors, (831) [2024-10-11 05:07:37,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6435 states to 6435 states and 9038 transitions. [2024-10-11 05:07:37,894 INFO L78 Accepts]: Start accepts. Automaton has 6435 states and 9038 transitions. Word has length 152 [2024-10-11 05:07:37,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:07:37,894 INFO L471 AbstractCegarLoop]: Abstraction has 6435 states and 9038 transitions. [2024-10-11 05:07:37,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:07:37,895 INFO L276 IsEmpty]: Start isEmpty. Operand 6435 states and 9038 transitions. [2024-10-11 05:07:37,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-10-11 05:07:37,897 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:07:37,898 INFO L215 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] [2024-10-11 05:07:37,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 05:07:37,898 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:07:37,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:07:37,898 INFO L85 PathProgramCache]: Analyzing trace with hash 432904976, now seen corresponding path program 1 times [2024-10-11 05:07:37,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:07:37,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279259345] [2024-10-11 05:07:37,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:07:37,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:07:37,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:37,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:07:37,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:38,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 05:07:38,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:38,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 05:07:38,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:38,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 05:07:38,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:38,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-11 05:07:38,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:38,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:07:38,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:07:38,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279259345] [2024-10-11 05:07:38,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279259345] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:07:38,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:07:38,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:07:38,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476024295] [2024-10-11 05:07:38,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:07:38,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:07:38,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:07:38,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:07:38,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:07:38,088 INFO L87 Difference]: Start difference. First operand 6435 states and 9038 transitions. Second operand has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:07:41,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:07:41,782 INFO L93 Difference]: Finished difference Result 13520 states and 20802 transitions. [2024-10-11 05:07:41,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 05:07:41,783 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 2 states have call successors, (6), 4 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 152 [2024-10-11 05:07:41,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:07:41,812 INFO L225 Difference]: With dead ends: 13520 [2024-10-11 05:07:41,813 INFO L226 Difference]: Without dead ends: 10737 [2024-10-11 05:07:41,821 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-11 05:07:41,821 INFO L432 NwaCegarLoop]: 515 mSDtfsCounter, 1647 mSDsluCounter, 1703 mSDsCounter, 0 mSdLazyCounter, 3682 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1677 SdHoareTripleChecker+Valid, 2218 SdHoareTripleChecker+Invalid, 3788 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 3682 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-11 05:07:41,822 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1677 Valid, 2218 Invalid, 3788 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 3682 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-11 05:07:41,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10737 states. [2024-10-11 05:07:42,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10737 to 8892. [2024-10-11 05:07:42,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8892 states, 7547 states have (on average 1.484298396713926) internal successors, (11202), 7615 states have internal predecessors, (11202), 795 states have call successors, (795), 426 states have call predecessors, (795), 548 states have return successors, (1053), 867 states have call predecessors, (1053), 791 states have call successors, (1053) [2024-10-11 05:07:42,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8892 states to 8892 states and 13050 transitions. [2024-10-11 05:07:42,634 INFO L78 Accepts]: Start accepts. Automaton has 8892 states and 13050 transitions. Word has length 152 [2024-10-11 05:07:42,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:07:42,635 INFO L471 AbstractCegarLoop]: Abstraction has 8892 states and 13050 transitions. [2024-10-11 05:07:42,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:07:42,635 INFO L276 IsEmpty]: Start isEmpty. Operand 8892 states and 13050 transitions. [2024-10-11 05:07:42,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-10-11 05:07:42,640 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:07:42,640 INFO L215 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] [2024-10-11 05:07:42,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 05:07:42,641 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:07:42,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:07:42,641 INFO L85 PathProgramCache]: Analyzing trace with hash -1600622, now seen corresponding path program 1 times [2024-10-11 05:07:42,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:07:42,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670764688] [2024-10-11 05:07:42,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:07:42,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:07:42,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:42,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:07:42,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:42,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 05:07:42,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:42,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 05:07:42,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:42,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 05:07:42,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:42,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-11 05:07:42,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:42,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:07:42,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:07:42,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670764688] [2024-10-11 05:07:42,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670764688] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:07:42,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:07:42,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:07:42,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227318903] [2024-10-11 05:07:42,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:07:42,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:07:42,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:07:42,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:07:42,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:07:42,831 INFO L87 Difference]: Start difference. First operand 8892 states and 13050 transitions. Second operand has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:07:46,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:07:46,438 INFO L93 Difference]: Finished difference Result 22471 states and 35620 transitions. [2024-10-11 05:07:46,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 05:07:46,439 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 2 states have call successors, (6), 4 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 152 [2024-10-11 05:07:46,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:07:46,482 INFO L225 Difference]: With dead ends: 22471 [2024-10-11 05:07:46,482 INFO L226 Difference]: Without dead ends: 17231 [2024-10-11 05:07:46,496 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-11 05:07:46,497 INFO L432 NwaCegarLoop]: 515 mSDtfsCounter, 1646 mSDsluCounter, 1703 mSDsCounter, 0 mSdLazyCounter, 3669 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1676 SdHoareTripleChecker+Valid, 2218 SdHoareTripleChecker+Invalid, 3775 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 3669 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-11 05:07:46,497 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1676 Valid, 2218 Invalid, 3775 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 3669 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-11 05:07:46,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17231 states. [2024-10-11 05:07:47,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17231 to 13821. [2024-10-11 05:07:47,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13821 states, 12044 states have (on average 1.5347060777150447) internal successors, (18484), 12128 states have internal predecessors, (18484), 1115 states have call successors, (1115), 522 states have call predecessors, (1115), 660 states have return successors, (1551), 1203 states have call predecessors, (1551), 1111 states have call successors, (1551) [2024-10-11 05:07:47,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13821 states to 13821 states and 21150 transitions. [2024-10-11 05:07:47,773 INFO L78 Accepts]: Start accepts. Automaton has 13821 states and 21150 transitions. Word has length 152 [2024-10-11 05:07:47,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:07:47,773 INFO L471 AbstractCegarLoop]: Abstraction has 13821 states and 21150 transitions. [2024-10-11 05:07:47,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:07:47,773 INFO L276 IsEmpty]: Start isEmpty. Operand 13821 states and 21150 transitions. [2024-10-11 05:07:47,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-10-11 05:07:47,780 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:07:47,780 INFO L215 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] [2024-10-11 05:07:47,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-11 05:07:47,780 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:07:47,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:07:47,781 INFO L85 PathProgramCache]: Analyzing trace with hash -431258928, now seen corresponding path program 1 times [2024-10-11 05:07:47,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:07:47,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991779934] [2024-10-11 05:07:47,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:07:47,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:07:47,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:47,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:07:47,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:47,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 05:07:47,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:47,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 05:07:47,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:47,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 05:07:47,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:47,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-11 05:07:47,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:47,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:07:47,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:07:47,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991779934] [2024-10-11 05:07:47,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991779934] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:07:47,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:07:47,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:07:47,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084086345] [2024-10-11 05:07:47,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:07:47,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:07:47,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:07:47,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:07:47,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:07:47,973 INFO L87 Difference]: Start difference. First operand 13821 states and 21150 transitions. Second operand has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:07:52,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:07:52,155 INFO L93 Difference]: Finished difference Result 40374 states and 65450 transitions. [2024-10-11 05:07:52,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 05:07:52,156 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 2 states have call successors, (6), 4 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 152 [2024-10-11 05:07:52,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:07:52,230 INFO L225 Difference]: With dead ends: 40374 [2024-10-11 05:07:52,230 INFO L226 Difference]: Without dead ends: 30205 [2024-10-11 05:07:52,253 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-11 05:07:52,253 INFO L432 NwaCegarLoop]: 515 mSDtfsCounter, 1645 mSDsluCounter, 1703 mSDsCounter, 0 mSdLazyCounter, 3656 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1675 SdHoareTripleChecker+Valid, 2218 SdHoareTripleChecker+Invalid, 3762 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 3656 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-11 05:07:52,253 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1675 Valid, 2218 Invalid, 3762 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 3656 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-11 05:07:52,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30205 states. [2024-10-11 05:07:54,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30205 to 23710. [2024-10-11 05:07:54,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23710 states, 21069 states have (on average 1.570743746736912) internal successors, (33094), 21185 states have internal predecessors, (33094), 1755 states have call successors, (1755), 714 states have call predecessors, (1755), 884 states have return successors, (2709), 1875 states have call predecessors, (2709), 1751 states have call successors, (2709) [2024-10-11 05:07:54,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23710 states to 23710 states and 37558 transitions. [2024-10-11 05:07:54,089 INFO L78 Accepts]: Start accepts. Automaton has 23710 states and 37558 transitions. Word has length 152 [2024-10-11 05:07:54,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:07:54,089 INFO L471 AbstractCegarLoop]: Abstraction has 23710 states and 37558 transitions. [2024-10-11 05:07:54,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:07:54,090 INFO L276 IsEmpty]: Start isEmpty. Operand 23710 states and 37558 transitions. [2024-10-11 05:07:54,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-10-11 05:07:54,101 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:07:54,101 INFO L215 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] [2024-10-11 05:07:54,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-11 05:07:54,101 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:07:54,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:07:54,101 INFO L85 PathProgramCache]: Analyzing trace with hash -1137855534, now seen corresponding path program 1 times [2024-10-11 05:07:54,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:07:54,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731951170] [2024-10-11 05:07:54,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:07:54,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:07:54,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:54,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:07:54,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:54,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 05:07:54,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:54,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 05:07:54,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:54,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 05:07:54,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:54,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-11 05:07:54,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:54,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:07:54,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:07:54,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731951170] [2024-10-11 05:07:54,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731951170] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:07:54,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:07:54,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:07:54,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837978707] [2024-10-11 05:07:54,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:07:54,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:07:54,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:07:54,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:07:54,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:07:54,286 INFO L87 Difference]: Start difference. First operand 23710 states and 37558 transitions. Second operand has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:07:59,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:07:59,622 INFO L93 Difference]: Finished difference Result 76181 states and 125712 transitions. [2024-10-11 05:07:59,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 05:07:59,623 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 2 states have call successors, (6), 4 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 152 [2024-10-11 05:07:59,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:07:59,806 INFO L225 Difference]: With dead ends: 76181 [2024-10-11 05:07:59,806 INFO L226 Difference]: Without dead ends: 56123 [2024-10-11 05:07:59,865 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-11 05:07:59,866 INFO L432 NwaCegarLoop]: 515 mSDtfsCounter, 1644 mSDsluCounter, 1703 mSDsCounter, 0 mSdLazyCounter, 3643 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1674 SdHoareTripleChecker+Valid, 2218 SdHoareTripleChecker+Invalid, 3749 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 3643 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-11 05:07:59,867 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1674 Valid, 2218 Invalid, 3749 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 3643 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-11 05:07:59,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56123 states. [2024-10-11 05:08:02,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56123 to 43551. [2024-10-11 05:08:03,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43551 states, 39182 states have (on average 1.5927721913123374) internal successors, (62408), 39362 states have internal predecessors, (62408), 3035 states have call successors, (3035), 1098 states have call predecessors, (3035), 1332 states have return successors, (5511), 3219 states have call predecessors, (5511), 3031 states have call successors, (5511) [2024-10-11 05:08:03,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43551 states to 43551 states and 70954 transitions. [2024-10-11 05:08:03,336 INFO L78 Accepts]: Start accepts. Automaton has 43551 states and 70954 transitions. Word has length 152 [2024-10-11 05:08:03,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:08:03,336 INFO L471 AbstractCegarLoop]: Abstraction has 43551 states and 70954 transitions. [2024-10-11 05:08:03,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:08:03,337 INFO L276 IsEmpty]: Start isEmpty. Operand 43551 states and 70954 transitions. [2024-10-11 05:08:03,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-10-11 05:08:03,358 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:08:03,358 INFO L215 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] [2024-10-11 05:08:03,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-11 05:08:03,358 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:08:03,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:08:03,359 INFO L85 PathProgramCache]: Analyzing trace with hash -190817648, now seen corresponding path program 1 times [2024-10-11 05:08:03,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:08:03,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163376436] [2024-10-11 05:08:03,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:08:03,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:08:03,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:08:03,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:08:03,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:08:03,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 05:08:03,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:08:03,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 05:08:03,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:08:03,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 05:08:03,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:08:03,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-11 05:08:03,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:08:03,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:08:03,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:08:03,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163376436] [2024-10-11 05:08:03,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163376436] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:08:03,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:08:03,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:08:03,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179360557] [2024-10-11 05:08:03,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:08:03,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:08:03,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:08:03,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:08:03,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:08:03,535 INFO L87 Difference]: Start difference. First operand 43551 states and 70954 transitions. Second operand has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:08:11,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:08:11,982 INFO L93 Difference]: Finished difference Result 147796 states and 248086 transitions. [2024-10-11 05:08:11,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 05:08:11,983 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 2 states have call successors, (6), 4 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 152 [2024-10-11 05:08:11,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:08:12,333 INFO L225 Difference]: With dead ends: 147796 [2024-10-11 05:08:12,333 INFO L226 Difference]: Without dead ends: 107897 [2024-10-11 05:08:12,441 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-11 05:08:12,442 INFO L432 NwaCegarLoop]: 319 mSDtfsCounter, 1739 mSDsluCounter, 1184 mSDsCounter, 0 mSdLazyCounter, 3040 mSolverCounterSat, 152 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1769 SdHoareTripleChecker+Valid, 1503 SdHoareTripleChecker+Invalid, 3192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 152 IncrementalHoareTripleChecker+Valid, 3040 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-11 05:08:12,443 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1769 Valid, 1503 Invalid, 3192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [152 Valid, 3040 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-11 05:08:12,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107897 states. [2024-10-11 05:08:17,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107897 to 83360. [2024-10-11 05:08:18,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83360 states, 75535 states have (on average 1.604898391474151) internal successors, (121226), 75843 states have internal predecessors, (121226), 5595 states have call successors, (5595), 1866 states have call predecessors, (5595), 2228 states have return successors, (12573), 5907 states have call predecessors, (12573), 5591 states have call successors, (12573) [2024-10-11 05:08:18,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83360 states to 83360 states and 139394 transitions. [2024-10-11 05:08:18,415 INFO L78 Accepts]: Start accepts. Automaton has 83360 states and 139394 transitions. Word has length 152 [2024-10-11 05:08:18,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:08:18,416 INFO L471 AbstractCegarLoop]: Abstraction has 83360 states and 139394 transitions. [2024-10-11 05:08:18,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:08:18,416 INFO L276 IsEmpty]: Start isEmpty. Operand 83360 states and 139394 transitions. [2024-10-11 05:08:18,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-10-11 05:08:18,463 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:08:18,463 INFO L215 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] [2024-10-11 05:08:18,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-11 05:08:18,463 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:08:18,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:08:18,463 INFO L85 PathProgramCache]: Analyzing trace with hash 671015954, now seen corresponding path program 1 times [2024-10-11 05:08:18,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:08:18,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332784525] [2024-10-11 05:08:18,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:08:18,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:08:18,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:08:18,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:08:18,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:08:18,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 05:08:18,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:08:18,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 05:08:18,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:08:18,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 05:08:18,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:08:18,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-11 05:08:18,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:08:18,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:08:18,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:08:18,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332784525] [2024-10-11 05:08:18,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332784525] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:08:18,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:08:18,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:08:18,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895592809] [2024-10-11 05:08:18,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:08:18,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:08:18,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:08:18,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:08:18,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:08:18,934 INFO L87 Difference]: Start difference. First operand 83360 states and 139394 transitions. Second operand has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5)