./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 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/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/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0b8de634f132d76c1b6698e4c3a5f12df478fc7c8b9ceb30d48afc80707f7564 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 05:15:46,833 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 05:15:46,921 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 05:15:46,930 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 05:15:46,930 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 05:15:46,961 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 05:15:46,963 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 05:15:46,963 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 05:15:46,964 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 05:15:46,965 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 05:15:46,966 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 05:15:46,966 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 05:15:46,967 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 05:15:46,969 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 05:15:46,969 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 05:15:46,970 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 05:15:46,970 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 05:15:46,970 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 05:15:46,970 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 05:15:46,971 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 05:15:46,971 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 05:15:46,971 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 05:15:46,972 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 05:15:46,972 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 05:15:46,972 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 05:15:46,972 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 05:15:46,973 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 05:15:46,973 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 05:15:46,973 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 05:15:46,974 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 05:15:46,974 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 05:15:46,974 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 05:15:46,974 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 05:15:46,975 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 05:15:46,975 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 05:15:46,975 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 05:15:46,975 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 05:15:46,976 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 05:15:46,976 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 05:15:46,976 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 05:15:46,976 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 05:15:46,977 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 05:15:46,977 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/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/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-14 05:15:47,226 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 05:15:47,250 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 05:15:47,253 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 05:15:47,255 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 05:15:47,255 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 05:15:47,256 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-14 05:15:48,672 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 05:15:48,919 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 05:15:48,921 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-14 05:15:48,939 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3439ae916/a9efd2ec7a5249cea86b29dfbed96e77/FLAGb75adc760 [2024-10-14 05:15:48,955 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3439ae916/a9efd2ec7a5249cea86b29dfbed96e77 [2024-10-14 05:15:48,957 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 05:15:48,958 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 05:15:48,959 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 05:15:48,959 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 05:15:48,968 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 05:15:48,968 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 05:15:48" (1/1) ... [2024-10-14 05:15:48,969 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2bc14553 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:15:48, skipping insertion in model container [2024-10-14 05:15:48,970 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 05:15:48" (1/1) ... [2024-10-14 05:15:49,046 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 05:15:49,208 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-14 05:15:49,277 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-14 05:15:49,384 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 05:15:49,401 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 05:15:49,414 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-14 05:15:49,439 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-14 05:15:49,477 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 05:15:49,513 INFO L204 MainTranslator]: Completed translation [2024-10-14 05:15:49,513 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:15:49 WrapperNode [2024-10-14 05:15:49,513 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 05:15:49,515 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 05:15:49,515 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 05:15:49,516 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 05:15:49,523 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:15:49" (1/1) ... [2024-10-14 05:15:49,543 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:15:49" (1/1) ... [2024-10-14 05:15:49,602 INFO L138 Inliner]: procedures = 77, calls = 95, calls flagged for inlining = 45, calls inlined = 45, statements flattened = 1052 [2024-10-14 05:15:49,602 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 05:15:49,603 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 05:15:49,603 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 05:15:49,603 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 05:15:49,617 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:15:49" (1/1) ... [2024-10-14 05:15:49,617 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:15:49" (1/1) ... [2024-10-14 05:15:49,626 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:15:49" (1/1) ... [2024-10-14 05:15:49,661 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-14 05:15:49,661 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:15:49" (1/1) ... [2024-10-14 05:15:49,662 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:15:49" (1/1) ... [2024-10-14 05:15:49,680 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:15:49" (1/1) ... [2024-10-14 05:15:49,702 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:15:49" (1/1) ... [2024-10-14 05:15:49,705 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:15:49" (1/1) ... [2024-10-14 05:15:49,709 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:15:49" (1/1) ... [2024-10-14 05:15:49,715 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 05:15:49,716 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 05:15:49,716 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 05:15:49,716 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 05:15:49,717 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:15:49" (1/1) ... [2024-10-14 05:15:49,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 05:15:49,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 05:15:49,765 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 05:15:49,767 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 05:15:49,805 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 05:15:49,806 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-10-14 05:15:49,806 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-10-14 05:15:49,806 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2024-10-14 05:15:49,807 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2024-10-14 05:15:49,808 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2024-10-14 05:15:49,808 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2024-10-14 05:15:49,808 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2024-10-14 05:15:49,808 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2024-10-14 05:15:49,808 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2024-10-14 05:15:49,808 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2024-10-14 05:15:49,808 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2024-10-14 05:15:49,808 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2024-10-14 05:15:49,809 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2024-10-14 05:15:49,809 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2024-10-14 05:15:49,809 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2024-10-14 05:15:49,809 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2024-10-14 05:15:49,809 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2024-10-14 05:15:49,809 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2024-10-14 05:15:49,809 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2024-10-14 05:15:49,809 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2024-10-14 05:15:49,809 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2024-10-14 05:15:49,810 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2024-10-14 05:15:49,810 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 05:15:49,810 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2024-10-14 05:15:49,810 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2024-10-14 05:15:49,810 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2024-10-14 05:15:49,810 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2024-10-14 05:15:49,810 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 05:15:49,810 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 05:15:49,810 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2024-10-14 05:15:49,810 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2024-10-14 05:15:49,811 INFO L130 BoogieDeclarations]: Found specification of procedure error2 [2024-10-14 05:15:49,811 INFO L138 BoogieDeclarations]: Found implementation of procedure error2 [2024-10-14 05:15:49,944 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 05:15:49,948 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 05:15:50,724 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##56: assume !(1 == ~q_free~0); [2024-10-14 05:15:50,725 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-14 05:15:50,971 INFO L? ?]: Removed 128 outVars from TransFormulas that were not future-live. [2024-10-14 05:15:50,971 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 05:15:51,056 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 05:15:51,056 INFO L314 CfgBuilder]: Removed 18 assume(true) statements. [2024-10-14 05:15:51,057 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 05:15:51 BoogieIcfgContainer [2024-10-14 05:15:51,057 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 05:15:51,059 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 05:15:51,061 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 05:15:51,065 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 05:15:51,065 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 05:15:48" (1/3) ... [2024-10-14 05:15:51,066 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5df21e9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 05:15:51, skipping insertion in model container [2024-10-14 05:15:51,066 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:15:49" (2/3) ... [2024-10-14 05:15:51,067 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5df21e9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 05:15:51, skipping insertion in model container [2024-10-14 05:15:51,067 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 05:15:51" (3/3) ... [2024-10-14 05:15:51,069 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_3.cil+token_ring.11.cil-1.c [2024-10-14 05:15:51,086 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 05:15:51,087 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-14 05:15:51,183 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 05:15:51,191 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;@2e92c406, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 05:15:51,191 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-14 05:15:51,198 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-14 05:15:51,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-14 05:15:51,212 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:15:51,213 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-14 05:15:51,214 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:15:51,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:15:51,220 INFO L85 PathProgramCache]: Analyzing trace with hash 677889946, now seen corresponding path program 1 times [2024-10-14 05:15:51,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:15:51,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891261812] [2024-10-14 05:15:51,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:15:51,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:15:51,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:51,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:15:51,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:51,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 05:15:51,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:51,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 05:15:51,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:51,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 05:15:51,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:51,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 05:15:51,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:51,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 05:15:51,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:51,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 05:15:51,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:51,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-14 05:15:51,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:15:51,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891261812] [2024-10-14 05:15:51,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891261812] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:15:51,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:15:51,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-14 05:15:51,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649226530] [2024-10-14 05:15:51,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:15:51,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 05:15:51,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:15:51,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 05:15:51,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-14 05:15:51,975 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-14 05:15:53,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:15:53,703 INFO L93 Difference]: Finished difference Result 987 states and 1641 transitions. [2024-10-14 05:15:53,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 05:15:53,706 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-14 05:15:53,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:15:53,721 INFO L225 Difference]: With dead ends: 987 [2024-10-14 05:15:53,722 INFO L226 Difference]: Without dead ends: 569 [2024-10-14 05:15:53,729 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2024-10-14 05:15:53,732 INFO L432 NwaCegarLoop]: 357 mSDtfsCounter, 823 mSDsluCounter, 1426 mSDsCounter, 0 mSdLazyCounter, 1532 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s 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.4s IncrementalHoareTripleChecker+Time [2024-10-14 05:15:53,733 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.4s Time] [2024-10-14 05:15:53,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2024-10-14 05:15:53,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 532. [2024-10-14 05:15:53,850 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-14 05:15:53,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 831 transitions. [2024-10-14 05:15:53,856 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 831 transitions. Word has length 57 [2024-10-14 05:15:53,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:15:53,857 INFO L471 AbstractCegarLoop]: Abstraction has 532 states and 831 transitions. [2024-10-14 05:15:53,857 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-14 05:15:53,858 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 831 transitions. [2024-10-14 05:15:53,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-14 05:15:53,861 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:15:53,861 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-14 05:15:53,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 05:15:53,862 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:15:53,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:15:53,863 INFO L85 PathProgramCache]: Analyzing trace with hash -1266102822, now seen corresponding path program 1 times [2024-10-14 05:15:53,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:15:53,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654060362] [2024-10-14 05:15:53,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:15:53,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:15:53,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:54,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:15:54,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:54,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 05:15:54,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:54,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 05:15:54,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:54,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 05:15:54,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:54,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 05:15:54,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:54,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 05:15:54,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:54,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 05:15:54,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:54,113 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-14 05:15:54,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:15:54,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654060362] [2024-10-14 05:15:54,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654060362] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:15:54,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:15:54,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-14 05:15:54,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901155848] [2024-10-14 05:15:54,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:15:54,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 05:15:54,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:15:54,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 05:15:54,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-14 05:15:54,119 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-14 05:15:55,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:15:55,726 INFO L93 Difference]: Finished difference Result 893 states and 1361 transitions. [2024-10-14 05:15:55,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-14 05:15:55,727 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-14 05:15:55,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:15:55,732 INFO L225 Difference]: With dead ends: 893 [2024-10-14 05:15:55,732 INFO L226 Difference]: Without dead ends: 705 [2024-10-14 05:15:55,733 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2024-10-14 05:15:55,734 INFO L432 NwaCegarLoop]: 397 mSDtfsCounter, 1322 mSDsluCounter, 1678 mSDsCounter, 0 mSdLazyCounter, 1904 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1355 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.3s IncrementalHoareTripleChecker+Time [2024-10-14 05:15:55,735 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1355 Valid, 2075 Invalid, 2030 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 1904 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-14 05:15:55,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 705 states. [2024-10-14 05:15:55,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 705 to 633. [2024-10-14 05:15:55,794 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-14 05:15:55,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 633 states and 980 transitions. [2024-10-14 05:15:55,800 INFO L78 Accepts]: Start accepts. Automaton has 633 states and 980 transitions. Word has length 57 [2024-10-14 05:15:55,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:15:55,800 INFO L471 AbstractCegarLoop]: Abstraction has 633 states and 980 transitions. [2024-10-14 05:15:55,801 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-14 05:15:55,801 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 980 transitions. [2024-10-14 05:15:55,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-14 05:15:55,808 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:15:55,808 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-14 05:15:55,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 05:15:55,809 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:15:55,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:15:55,809 INFO L85 PathProgramCache]: Analyzing trace with hash -372616484, now seen corresponding path program 1 times [2024-10-14 05:15:55,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:15:55,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773827170] [2024-10-14 05:15:55,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:15:55,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:15:55,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:55,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:15:55,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:55,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 05:15:55,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:55,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 05:15:55,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:55,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 05:15:55,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:55,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 05:15:55,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:55,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 05:15:56,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:56,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 05:15:56,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:56,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-14 05:15:56,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:15:56,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773827170] [2024-10-14 05:15:56,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773827170] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:15:56,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:15:56,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-14 05:15:56,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598322991] [2024-10-14 05:15:56,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:15:56,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-14 05:15:56,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:15:56,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-14 05:15:56,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-10-14 05:15:56,012 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-14 05:15:58,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:15:58,267 INFO L93 Difference]: Finished difference Result 2031 states and 3030 transitions. [2024-10-14 05:15:58,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-10-14 05:15:58,273 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-14 05:15:58,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:15:58,284 INFO L225 Difference]: With dead ends: 2031 [2024-10-14 05:15:58,284 INFO L226 Difference]: Without dead ends: 1730 [2024-10-14 05:15:58,287 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 336 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=257, Invalid=1075, Unknown=0, NotChecked=0, Total=1332 [2024-10-14 05:15:58,288 INFO L432 NwaCegarLoop]: 405 mSDtfsCounter, 3931 mSDsluCounter, 1571 mSDsCounter, 0 mSdLazyCounter, 2028 mSolverCounterSat, 682 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s 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.7s IncrementalHoareTripleChecker+Time [2024-10-14 05:15:58,288 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.7s Time] [2024-10-14 05:15:58,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1730 states. [2024-10-14 05:15:58,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1730 to 1597. [2024-10-14 05:15:58,404 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-14 05:15:58,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1597 states to 1597 states and 2278 transitions. [2024-10-14 05:15:58,415 INFO L78 Accepts]: Start accepts. Automaton has 1597 states and 2278 transitions. Word has length 57 [2024-10-14 05:15:58,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:15:58,416 INFO L471 AbstractCegarLoop]: Abstraction has 1597 states and 2278 transitions. [2024-10-14 05:15:58,416 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-14 05:15:58,416 INFO L276 IsEmpty]: Start isEmpty. Operand 1597 states and 2278 transitions. [2024-10-14 05:15:58,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-14 05:15:58,418 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:15:58,418 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-14 05:15:58,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 05:15:58,418 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:15:58,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:15:58,419 INFO L85 PathProgramCache]: Analyzing trace with hash 872387731, now seen corresponding path program 1 times [2024-10-14 05:15:58,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:15:58,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604916513] [2024-10-14 05:15:58,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:15:58,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:15:58,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:58,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:15:58,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:58,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 05:15:58,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:58,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 05:15:58,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:58,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 05:15:58,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:58,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 05:15:58,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:58,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 05:15:58,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:58,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-14 05:15:58,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:58,642 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-14 05:15:58,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:15:58,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604916513] [2024-10-14 05:15:58,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604916513] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:15:58,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:15:58,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 05:15:58,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616111010] [2024-10-14 05:15:58,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:15:58,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 05:15:58,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:15:58,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 05:15:58,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-14 05:15:58,649 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-14 05:16:00,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:16:00,026 INFO L93 Difference]: Finished difference Result 2978 states and 4202 transitions. [2024-10-14 05:16:00,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 05:16:00,027 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-14 05:16:00,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:16:00,036 INFO L225 Difference]: With dead ends: 2978 [2024-10-14 05:16:00,037 INFO L226 Difference]: Without dead ends: 1719 [2024-10-14 05:16:00,040 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-14 05:16:00,041 INFO L432 NwaCegarLoop]: 358 mSDtfsCounter, 881 mSDsluCounter, 1811 mSDsCounter, 0 mSdLazyCounter, 2026 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s 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, 1.1s IncrementalHoareTripleChecker+Time [2024-10-14 05:16:00,042 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [882 Valid, 2169 Invalid, 2166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 2026 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-14 05:16:00,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1719 states. [2024-10-14 05:16:00,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1719 to 1629. [2024-10-14 05:16:00,135 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-14 05:16:00,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1629 states to 1629 states and 2304 transitions. [2024-10-14 05:16:00,145 INFO L78 Accepts]: Start accepts. Automaton has 1629 states and 2304 transitions. Word has length 58 [2024-10-14 05:16:00,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:16:00,147 INFO L471 AbstractCegarLoop]: Abstraction has 1629 states and 2304 transitions. [2024-10-14 05:16:00,147 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-14 05:16:00,147 INFO L276 IsEmpty]: Start isEmpty. Operand 1629 states and 2304 transitions. [2024-10-14 05:16:00,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-14 05:16:00,149 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:16:00,149 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-14 05:16:00,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 05:16:00,150 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:16:00,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:16:00,150 INFO L85 PathProgramCache]: Analyzing trace with hash 800001173, now seen corresponding path program 1 times [2024-10-14 05:16:00,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:16:00,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949037842] [2024-10-14 05:16:00,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:16:00,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:16:00,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:00,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:16:00,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:00,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 05:16:00,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:00,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 05:16:00,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:00,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 05:16:00,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:00,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 05:16:00,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:00,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 05:16:00,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:00,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-14 05:16:00,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:00,280 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-14 05:16:00,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:16:00,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949037842] [2024-10-14 05:16:00,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949037842] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:16:00,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:16:00,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-14 05:16:00,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578044064] [2024-10-14 05:16:00,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:16:00,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-14 05:16:00,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:16:00,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-14 05:16:00,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-10-14 05:16:00,282 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-14 05:16:02,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:16:02,375 INFO L93 Difference]: Finished difference Result 4888 states and 6865 transitions. [2024-10-14 05:16:02,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-10-14 05:16:02,376 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-14 05:16:02,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:16:02,388 INFO L225 Difference]: With dead ends: 4888 [2024-10-14 05:16:02,388 INFO L226 Difference]: Without dead ends: 1999 [2024-10-14 05:16:02,397 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 340 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=257, Invalid=1075, Unknown=0, NotChecked=0, Total=1332 [2024-10-14 05:16:02,399 INFO L432 NwaCegarLoop]: 408 mSDtfsCounter, 4069 mSDsluCounter, 1608 mSDsCounter, 0 mSdLazyCounter, 1918 mSolverCounterSat, 718 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s 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.5s IncrementalHoareTripleChecker+Time [2024-10-14 05:16:02,399 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.5s Time] [2024-10-14 05:16:02,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1999 states. [2024-10-14 05:16:02,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1999 to 1843. [2024-10-14 05:16:02,526 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-14 05:16:02,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1843 states to 1843 states and 2519 transitions. [2024-10-14 05:16:02,538 INFO L78 Accepts]: Start accepts. Automaton has 1843 states and 2519 transitions. Word has length 58 [2024-10-14 05:16:02,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:16:02,539 INFO L471 AbstractCegarLoop]: Abstraction has 1843 states and 2519 transitions. [2024-10-14 05:16:02,539 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-14 05:16:02,539 INFO L276 IsEmpty]: Start isEmpty. Operand 1843 states and 2519 transitions. [2024-10-14 05:16:02,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-14 05:16:02,541 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:16:02,541 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-14 05:16:02,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 05:16:02,542 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:16:02,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:16:02,542 INFO L85 PathProgramCache]: Analyzing trace with hash 940212068, now seen corresponding path program 1 times [2024-10-14 05:16:02,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:16:02,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432642193] [2024-10-14 05:16:02,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:16:02,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:16:02,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:02,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:16:02,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:02,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 05:16:02,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:02,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 05:16:02,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:02,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 05:16:02,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:02,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 05:16:02,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:02,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 05:16:02,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:02,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 05:16:02,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:02,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 05:16:02,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:02,721 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-14 05:16:02,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:16:02,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432642193] [2024-10-14 05:16:02,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432642193] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:16:02,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:16:02,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 05:16:02,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462454524] [2024-10-14 05:16:02,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:16:02,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 05:16:02,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:16:02,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 05:16:02,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-14 05:16:02,724 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-14 05:16:04,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:16:04,013 INFO L93 Difference]: Finished difference Result 3512 states and 4757 transitions. [2024-10-14 05:16:04,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-14 05:16:04,014 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-14 05:16:04,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:16:04,027 INFO L225 Difference]: With dead ends: 3512 [2024-10-14 05:16:04,027 INFO L226 Difference]: Without dead ends: 2007 [2024-10-14 05:16:04,030 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-14 05:16:04,032 INFO L432 NwaCegarLoop]: 352 mSDtfsCounter, 585 mSDsluCounter, 2059 mSDsCounter, 0 mSdLazyCounter, 2082 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s 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, 1.0s IncrementalHoareTripleChecker+Time [2024-10-14 05:16:04,033 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [587 Valid, 2411 Invalid, 2174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 2082 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-14 05:16:04,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2007 states. [2024-10-14 05:16:04,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2007 to 1891. [2024-10-14 05:16:04,149 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-14 05:16:04,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1891 states to 1891 states and 2561 transitions. [2024-10-14 05:16:04,163 INFO L78 Accepts]: Start accepts. Automaton has 1891 states and 2561 transitions. Word has length 80 [2024-10-14 05:16:04,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:16:04,164 INFO L471 AbstractCegarLoop]: Abstraction has 1891 states and 2561 transitions. [2024-10-14 05:16:04,164 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-14 05:16:04,164 INFO L276 IsEmpty]: Start isEmpty. Operand 1891 states and 2561 transitions. [2024-10-14 05:16:04,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-14 05:16:04,165 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:16:04,165 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-14 05:16:04,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 05:16:04,165 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:16:04,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:16:04,166 INFO L85 PathProgramCache]: Analyzing trace with hash -1426482526, now seen corresponding path program 1 times [2024-10-14 05:16:04,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:16:04,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564714575] [2024-10-14 05:16:04,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:16:04,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:16:04,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:04,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:16:04,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:04,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 05:16:04,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:04,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 05:16:04,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:04,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 05:16:04,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:04,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 05:16:04,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:04,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 05:16:04,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:04,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 05:16:04,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:04,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 05:16:04,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:04,391 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-14 05:16:04,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:16:04,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564714575] [2024-10-14 05:16:04,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564714575] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:16:04,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:16:04,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-14 05:16:04,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036017767] [2024-10-14 05:16:04,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:16:04,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 05:16:04,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:16:04,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 05:16:04,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-14 05:16:04,395 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-14 05:16:05,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:16:05,654 INFO L93 Difference]: Finished difference Result 3290 states and 4397 transitions. [2024-10-14 05:16:05,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-14 05:16:05,655 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-14 05:16:05,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:16:05,666 INFO L225 Difference]: With dead ends: 3290 [2024-10-14 05:16:05,667 INFO L226 Difference]: Without dead ends: 1958 [2024-10-14 05:16:05,670 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-14 05:16:05,671 INFO L432 NwaCegarLoop]: 342 mSDtfsCounter, 1327 mSDsluCounter, 1493 mSDsCounter, 0 mSdLazyCounter, 1715 mSolverCounterSat, 145 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1358 SdHoareTripleChecker+Valid, 1835 SdHoareTripleChecker+Invalid, 1860 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 145 IncrementalHoareTripleChecker+Valid, 1715 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-14 05:16:05,672 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1358 Valid, 1835 Invalid, 1860 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [145 Valid, 1715 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-14 05:16:05,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1958 states. [2024-10-14 05:16:05,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1958 to 1683. [2024-10-14 05:16:05,803 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-14 05:16:05,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1683 states to 1683 states and 2288 transitions. [2024-10-14 05:16:05,811 INFO L78 Accepts]: Start accepts. Automaton has 1683 states and 2288 transitions. Word has length 80 [2024-10-14 05:16:05,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:16:05,811 INFO L471 AbstractCegarLoop]: Abstraction has 1683 states and 2288 transitions. [2024-10-14 05:16:05,812 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-14 05:16:05,812 INFO L276 IsEmpty]: Start isEmpty. Operand 1683 states and 2288 transitions. [2024-10-14 05:16:05,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-14 05:16:05,813 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:16:05,813 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-14 05:16:05,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 05:16:05,813 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:16:05,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:16:05,814 INFO L85 PathProgramCache]: Analyzing trace with hash -1002835804, now seen corresponding path program 1 times [2024-10-14 05:16:05,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:16:05,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056922438] [2024-10-14 05:16:05,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:16:05,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:16:05,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:05,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:16:05,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:05,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 05:16:05,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:05,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 05:16:05,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:05,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 05:16:05,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:05,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 05:16:05,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:05,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 05:16:05,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:05,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 05:16:05,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:05,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 05:16:05,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:05,930 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-14 05:16:05,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:16:05,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056922438] [2024-10-14 05:16:05,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056922438] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:16:05,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:16:05,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 05:16:05,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82678521] [2024-10-14 05:16:05,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:16:05,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 05:16:05,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:16:05,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 05:16:05,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:16:05,932 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-14 05:16:06,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:16:06,807 INFO L93 Difference]: Finished difference Result 4583 states and 6148 transitions. [2024-10-14 05:16:06,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-14 05:16:06,807 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-14 05:16:06,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:16:06,825 INFO L225 Difference]: With dead ends: 4583 [2024-10-14 05:16:06,826 INFO L226 Difference]: Without dead ends: 3239 [2024-10-14 05:16:06,831 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-14 05:16:06,832 INFO L432 NwaCegarLoop]: 348 mSDtfsCounter, 1563 mSDsluCounter, 925 mSDsCounter, 0 mSdLazyCounter, 811 mSolverCounterSat, 185 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1596 SdHoareTripleChecker+Valid, 1273 SdHoareTripleChecker+Invalid, 996 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 185 IncrementalHoareTripleChecker+Valid, 811 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-14 05:16:06,833 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1596 Valid, 1273 Invalid, 996 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [185 Valid, 811 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-14 05:16:06,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3239 states. [2024-10-14 05:16:07,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3239 to 3029. [2024-10-14 05:16:07,074 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-14 05:16:07,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3029 states to 3029 states and 4037 transitions. [2024-10-14 05:16:07,086 INFO L78 Accepts]: Start accepts. Automaton has 3029 states and 4037 transitions. Word has length 80 [2024-10-14 05:16:07,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:16:07,087 INFO L471 AbstractCegarLoop]: Abstraction has 3029 states and 4037 transitions. [2024-10-14 05:16:07,087 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-14 05:16:07,087 INFO L276 IsEmpty]: Start isEmpty. Operand 3029 states and 4037 transitions. [2024-10-14 05:16:07,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-14 05:16:07,088 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:16:07,088 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-14 05:16:07,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 05:16:07,089 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:16:07,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:16:07,089 INFO L85 PathProgramCache]: Analyzing trace with hash -925935006, now seen corresponding path program 1 times [2024-10-14 05:16:07,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:16:07,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802268844] [2024-10-14 05:16:07,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:16:07,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:16:07,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:07,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:16:07,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:07,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 05:16:07,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:07,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 05:16:07,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:07,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 05:16:07,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:07,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 05:16:07,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:07,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 05:16:07,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:07,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 05:16:07,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:07,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 05:16:07,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:07,160 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-14 05:16:07,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:16:07,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802268844] [2024-10-14 05:16:07,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802268844] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:16:07,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:16:07,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 05:16:07,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676171657] [2024-10-14 05:16:07,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:16:07,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 05:16:07,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:16:07,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 05:16:07,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 05:16:07,163 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-14 05:16:07,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:16:07,868 INFO L93 Difference]: Finished difference Result 4486 states and 5894 transitions. [2024-10-14 05:16:07,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 05:16:07,869 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-14 05:16:07,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:16:07,880 INFO L225 Difference]: With dead ends: 4486 [2024-10-14 05:16:07,880 INFO L226 Difference]: Without dead ends: 1796 [2024-10-14 05:16:07,886 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-14 05:16:07,887 INFO L432 NwaCegarLoop]: 347 mSDtfsCounter, 982 mSDsluCounter, 780 mSDsCounter, 0 mSdLazyCounter, 798 mSolverCounterSat, 147 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 997 SdHoareTripleChecker+Valid, 1127 SdHoareTripleChecker+Invalid, 945 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 147 IncrementalHoareTripleChecker+Valid, 798 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 05:16:07,887 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [997 Valid, 1127 Invalid, 945 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [147 Valid, 798 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 05:16:07,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1796 states. [2024-10-14 05:16:08,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1796 to 1683. [2024-10-14 05:16:08,039 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-14 05:16:08,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1683 states to 1683 states and 2251 transitions. [2024-10-14 05:16:08,049 INFO L78 Accepts]: Start accepts. Automaton has 1683 states and 2251 transitions. Word has length 80 [2024-10-14 05:16:08,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:16:08,050 INFO L471 AbstractCegarLoop]: Abstraction has 1683 states and 2251 transitions. [2024-10-14 05:16:08,050 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-14 05:16:08,051 INFO L276 IsEmpty]: Start isEmpty. Operand 1683 states and 2251 transitions. [2024-10-14 05:16:08,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-14 05:16:08,052 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:16:08,052 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-14 05:16:08,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 05:16:08,052 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:16:08,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:16:08,053 INFO L85 PathProgramCache]: Analyzing trace with hash 2113907548, now seen corresponding path program 1 times [2024-10-14 05:16:08,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:16:08,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333227970] [2024-10-14 05:16:08,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:16:08,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:16:08,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:08,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:16:08,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:08,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 05:16:08,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:08,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 05:16:08,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:08,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 05:16:08,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:08,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 05:16:08,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:08,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 05:16:08,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:08,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 05:16:08,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:08,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-14 05:16:08,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:08,216 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-14 05:16:08,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:16:08,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333227970] [2024-10-14 05:16:08,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333227970] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:16:08,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:16:08,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 05:16:08,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114010045] [2024-10-14 05:16:08,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:16:08,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 05:16:08,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:16:08,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 05:16:08,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-10-14 05:16:08,219 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-14 05:16:09,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:16:09,851 INFO L93 Difference]: Finished difference Result 3904 states and 5137 transitions. [2024-10-14 05:16:09,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-14 05:16:09,852 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-14 05:16:09,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:16:09,866 INFO L225 Difference]: With dead ends: 3904 [2024-10-14 05:16:09,866 INFO L226 Difference]: Without dead ends: 2419 [2024-10-14 05:16:09,870 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=210, Invalid=720, Unknown=0, NotChecked=0, Total=930 [2024-10-14 05:16:09,871 INFO L432 NwaCegarLoop]: 354 mSDtfsCounter, 2300 mSDsluCounter, 1530 mSDsCounter, 0 mSdLazyCounter, 1778 mSolverCounterSat, 451 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2342 SdHoareTripleChecker+Valid, 1884 SdHoareTripleChecker+Invalid, 2229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 451 IncrementalHoareTripleChecker+Valid, 1778 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-14 05:16:09,871 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2342 Valid, 1884 Invalid, 2229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [451 Valid, 1778 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-14 05:16:09,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2419 states. [2024-10-14 05:16:10,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2419 to 2255. [2024-10-14 05:16:10,077 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-14 05:16:10,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2255 states to 2255 states and 2952 transitions. [2024-10-14 05:16:10,088 INFO L78 Accepts]: Start accepts. Automaton has 2255 states and 2952 transitions. Word has length 81 [2024-10-14 05:16:10,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:16:10,089 INFO L471 AbstractCegarLoop]: Abstraction has 2255 states and 2952 transitions. [2024-10-14 05:16:10,089 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-14 05:16:10,089 INFO L276 IsEmpty]: Start isEmpty. Operand 2255 states and 2952 transitions. [2024-10-14 05:16:10,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-10-14 05:16:10,092 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:16:10,092 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-14 05:16:10,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-14 05:16:10,092 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:16:10,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:16:10,094 INFO L85 PathProgramCache]: Analyzing trace with hash -1713696190, now seen corresponding path program 1 times [2024-10-14 05:16:10,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:16:10,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457276935] [2024-10-14 05:16:10,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:16:10,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:16:10,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:10,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:16:10,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:10,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 05:16:10,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:10,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 05:16:10,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:10,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 05:16:10,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:10,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 05:16:10,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:10,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 05:16:10,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:10,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 05:16:10,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:10,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-14 05:16:10,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:10,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 05:16:10,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:10,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 05:16:10,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:10,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-14 05:16:10,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:10,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 05:16:10,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:10,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 05:16:10,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:10,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-14 05:16:10,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:10,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-14 05:16:10,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:10,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-14 05:16:10,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:10,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-14 05:16:10,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:10,282 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-14 05:16:10,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:16:10,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457276935] [2024-10-14 05:16:10,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457276935] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 05:16:10,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [203379792] [2024-10-14 05:16:10,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:16:10,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 05:16:10,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 05:16:10,285 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 05:16:10,287 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-14 05:16:10,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:10,436 INFO L255 TraceCheckSpWp]: Trace formula consists of 587 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-14 05:16:10,446 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 05:16:10,582 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-14 05:16:10,583 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 05:16:10,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [203379792] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:16:10,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 05:16:10,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2024-10-14 05:16:10,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608609833] [2024-10-14 05:16:10,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:16:10,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 05:16:10,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:16:10,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 05:16:10,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-10-14 05:16:10,585 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-14 05:16:10,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:16:10,883 INFO L93 Difference]: Finished difference Result 5851 states and 7451 transitions. [2024-10-14 05:16:10,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 05:16:10,883 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-14 05:16:10,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:16:10,905 INFO L225 Difference]: With dead ends: 5851 [2024-10-14 05:16:10,906 INFO L226 Difference]: Without dead ends: 4005 [2024-10-14 05:16:10,911 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-10-14 05:16:10,912 INFO L432 NwaCegarLoop]: 625 mSDtfsCounter, 57 mSDsluCounter, 604 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-14 05:16:10,912 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-14 05:16:10,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4005 states. [2024-10-14 05:16:11,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4005 to 3965. [2024-10-14 05:16:11,347 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-14 05:16:11,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3965 states to 3965 states and 5021 transitions. [2024-10-14 05:16:11,365 INFO L78 Accepts]: Start accepts. Automaton has 3965 states and 5021 transitions. Word has length 145 [2024-10-14 05:16:11,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:16:11,367 INFO L471 AbstractCegarLoop]: Abstraction has 3965 states and 5021 transitions. [2024-10-14 05:16:11,367 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-14 05:16:11,367 INFO L276 IsEmpty]: Start isEmpty. Operand 3965 states and 5021 transitions. [2024-10-14 05:16:11,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-10-14 05:16:11,370 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:16:11,370 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-14 05:16:11,389 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-14 05:16:11,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-10-14 05:16:11,571 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:16:11,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:16:11,572 INFO L85 PathProgramCache]: Analyzing trace with hash -1910721648, now seen corresponding path program 1 times [2024-10-14 05:16:11,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:16:11,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351660994] [2024-10-14 05:16:11,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:16:11,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:16:11,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:11,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:16:11,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:11,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 05:16:11,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:11,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 05:16:11,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:11,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-14 05:16:11,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:11,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-14 05:16:11,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:11,784 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-14 05:16:11,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:16:11,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351660994] [2024-10-14 05:16:11,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351660994] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:16:11,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:16:11,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 05:16:11,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489302358] [2024-10-14 05:16:11,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:16:11,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 05:16:11,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:16:11,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 05:16:11,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 05:16:11,786 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-14 05:16:13,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:16:13,992 INFO L93 Difference]: Finished difference Result 4405 states and 5755 transitions. [2024-10-14 05:16:13,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 05:16:13,993 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-14 05:16:13,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:16:14,012 INFO L225 Difference]: With dead ends: 4405 [2024-10-14 05:16:14,012 INFO L226 Difference]: Without dead ends: 4085 [2024-10-14 05:16:14,014 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-10-14 05:16:14,015 INFO L432 NwaCegarLoop]: 363 mSDtfsCounter, 1016 mSDsluCounter, 479 mSDsCounter, 0 mSdLazyCounter, 1149 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s 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.2s IncrementalHoareTripleChecker+Time [2024-10-14 05:16:14,015 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.2s Time] [2024-10-14 05:16:14,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4085 states. [2024-10-14 05:16:14,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4085 to 3965. [2024-10-14 05:16:14,951 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-14 05:16:14,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3965 states to 3965 states and 5020 transitions. [2024-10-14 05:16:14,964 INFO L78 Accepts]: Start accepts. Automaton has 3965 states and 5020 transitions. Word has length 152 [2024-10-14 05:16:14,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:16:14,964 INFO L471 AbstractCegarLoop]: Abstraction has 3965 states and 5020 transitions. [2024-10-14 05:16:14,964 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-14 05:16:14,965 INFO L276 IsEmpty]: Start isEmpty. Operand 3965 states and 5020 transitions. [2024-10-14 05:16:14,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-10-14 05:16:14,967 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:16:14,967 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-14 05:16:14,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-14 05:16:14,967 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:16:14,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:16:14,967 INFO L85 PathProgramCache]: Analyzing trace with hash 1973635282, now seen corresponding path program 1 times [2024-10-14 05:16:14,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:16:14,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125942883] [2024-10-14 05:16:14,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:16:14,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:16:14,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:15,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:16:15,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:15,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 05:16:15,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:15,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 05:16:15,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:15,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-14 05:16:15,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:15,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-14 05:16:15,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:15,233 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-14 05:16:15,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:16:15,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125942883] [2024-10-14 05:16:15,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125942883] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:16:15,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:16:15,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 05:16:15,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040128030] [2024-10-14 05:16:15,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:16:15,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 05:16:15,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:16:15,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 05:16:15,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 05:16:15,236 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-14 05:16:18,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:16:18,511 INFO L93 Difference]: Finished difference Result 4848 states and 6496 transitions. [2024-10-14 05:16:18,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 05:16:18,511 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-14 05:16:18,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:16:18,531 INFO L225 Difference]: With dead ends: 4848 [2024-10-14 05:16:18,532 INFO L226 Difference]: Without dead ends: 4535 [2024-10-14 05:16:18,534 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-10-14 05:16:18,534 INFO L432 NwaCegarLoop]: 321 mSDtfsCounter, 1610 mSDsluCounter, 915 mSDsCounter, 0 mSdLazyCounter, 2319 mSolverCounterSat, 152 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s 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, 2.2s IncrementalHoareTripleChecker+Time [2024-10-14 05:16:18,535 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1640 Valid, 1236 Invalid, 2471 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [152 Valid, 2319 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-14 05:16:18,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4535 states. [2024-10-14 05:16:19,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4535 to 4294. [2024-10-14 05:16:19,353 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-14 05:16:19,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4294 states to 4294 states and 5562 transitions. [2024-10-14 05:16:19,366 INFO L78 Accepts]: Start accepts. Automaton has 4294 states and 5562 transitions. Word has length 152 [2024-10-14 05:16:19,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:16:19,367 INFO L471 AbstractCegarLoop]: Abstraction has 4294 states and 5562 transitions. [2024-10-14 05:16:19,367 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-14 05:16:19,367 INFO L276 IsEmpty]: Start isEmpty. Operand 4294 states and 5562 transitions. [2024-10-14 05:16:19,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-10-14 05:16:19,370 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:16:19,370 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-14 05:16:19,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-14 05:16:19,370 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:16:19,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:16:19,371 INFO L85 PathProgramCache]: Analyzing trace with hash -1784366130, now seen corresponding path program 1 times [2024-10-14 05:16:19,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:16:19,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608743210] [2024-10-14 05:16:19,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:16:19,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:16:19,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:19,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:16:19,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:19,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 05:16:19,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:19,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 05:16:19,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:19,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-14 05:16:19,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:19,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-14 05:16:19,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:19,668 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-14 05:16:19,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:16:19,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608743210] [2024-10-14 05:16:19,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608743210] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:16:19,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:16:19,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 05:16:19,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119338480] [2024-10-14 05:16:19,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:16:19,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 05:16:19,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:16:19,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 05:16:19,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:16:19,671 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-14 05:16:23,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:16:23,394 INFO L93 Difference]: Finished difference Result 5643 states and 7818 transitions. [2024-10-14 05:16:23,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 05:16:23,395 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-14 05:16:23,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:16:23,413 INFO L225 Difference]: With dead ends: 5643 [2024-10-14 05:16:23,413 INFO L226 Difference]: Without dead ends: 5001 [2024-10-14 05:16:23,417 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-14 05:16:23,417 INFO L432 NwaCegarLoop]: 373 mSDtfsCounter, 1742 mSDsluCounter, 1239 mSDsCounter, 0 mSdLazyCounter, 3284 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s 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.4s IncrementalHoareTripleChecker+Time [2024-10-14 05:16:23,418 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.4s Time] [2024-10-14 05:16:23,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5001 states. [2024-10-14 05:16:24,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5001 to 4598. [2024-10-14 05:16:24,356 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-14 05:16:24,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4598 states to 4598 states and 6053 transitions. [2024-10-14 05:16:24,371 INFO L78 Accepts]: Start accepts. Automaton has 4598 states and 6053 transitions. Word has length 152 [2024-10-14 05:16:24,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:16:24,371 INFO L471 AbstractCegarLoop]: Abstraction has 4598 states and 6053 transitions. [2024-10-14 05:16:24,372 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-14 05:16:24,373 INFO L276 IsEmpty]: Start isEmpty. Operand 4598 states and 6053 transitions. [2024-10-14 05:16:24,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-10-14 05:16:24,375 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:16:24,375 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-14 05:16:24,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-14 05:16:24,376 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:16:24,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:16:24,376 INFO L85 PathProgramCache]: Analyzing trace with hash 1965728592, now seen corresponding path program 1 times [2024-10-14 05:16:24,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:16:24,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971500733] [2024-10-14 05:16:24,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:16:24,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:16:24,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:24,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:16:24,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:24,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 05:16:24,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:24,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 05:16:24,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:24,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-14 05:16:24,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:24,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-14 05:16:24,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:24,645 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-14 05:16:24,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:16:24,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971500733] [2024-10-14 05:16:24,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971500733] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:16:24,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:16:24,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 05:16:24,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877446255] [2024-10-14 05:16:24,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:16:24,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 05:16:24,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:16:24,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 05:16:24,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:16:24,647 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-14 05:16:28,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:16:28,405 INFO L93 Difference]: Finished difference Result 6807 states and 9743 transitions. [2024-10-14 05:16:28,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 05:16:28,406 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-14 05:16:28,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:16:28,429 INFO L225 Difference]: With dead ends: 6807 [2024-10-14 05:16:28,429 INFO L226 Difference]: Without dead ends: 5861 [2024-10-14 05:16:28,436 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-14 05:16:28,437 INFO L432 NwaCegarLoop]: 515 mSDtfsCounter, 1653 mSDsluCounter, 1703 mSDsCounter, 0 mSdLazyCounter, 3712 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s 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.5s IncrementalHoareTripleChecker+Time [2024-10-14 05:16:28,437 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.5s Time] [2024-10-14 05:16:28,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5861 states. [2024-10-14 05:16:29,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5861 to 5210. [2024-10-14 05:16:29,159 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-14 05:16:29,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5210 states to 5210 states and 7046 transitions. [2024-10-14 05:16:29,173 INFO L78 Accepts]: Start accepts. Automaton has 5210 states and 7046 transitions. Word has length 152 [2024-10-14 05:16:29,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:16:29,173 INFO L471 AbstractCegarLoop]: Abstraction has 5210 states and 7046 transitions. [2024-10-14 05:16:29,174 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-14 05:16:29,174 INFO L276 IsEmpty]: Start isEmpty. Operand 5210 states and 7046 transitions. [2024-10-14 05:16:29,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-10-14 05:16:29,176 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:16:29,176 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-14 05:16:29,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-14 05:16:29,177 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:16:29,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:16:29,177 INFO L85 PathProgramCache]: Analyzing trace with hash 1017676626, now seen corresponding path program 1 times [2024-10-14 05:16:29,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:16:29,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822892968] [2024-10-14 05:16:29,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:16:29,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:16:29,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:29,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:16:29,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:29,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 05:16:29,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:29,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 05:16:29,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:29,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-14 05:16:29,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:29,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-14 05:16:29,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:29,506 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-14 05:16:29,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:16:29,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822892968] [2024-10-14 05:16:29,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822892968] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:16:29,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:16:29,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 05:16:29,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772342076] [2024-10-14 05:16:29,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:16:29,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 05:16:29,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:16:29,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 05:16:29,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:16:29,508 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-14 05:16:33,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:16:33,923 INFO L93 Difference]: Finished difference Result 9045 states and 13424 transitions. [2024-10-14 05:16:33,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 05:16:33,924 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-14 05:16:33,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:16:33,949 INFO L225 Difference]: With dead ends: 9045 [2024-10-14 05:16:33,950 INFO L226 Difference]: Without dead ends: 7487 [2024-10-14 05:16:33,958 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-14 05:16:33,959 INFO L432 NwaCegarLoop]: 515 mSDtfsCounter, 1648 mSDsluCounter, 1703 mSDsCounter, 0 mSdLazyCounter, 3695 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s 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.9s IncrementalHoareTripleChecker+Time [2024-10-14 05:16:33,959 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.9s Time] [2024-10-14 05:16:33,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7487 states. [2024-10-14 05:16:34,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7487 to 6435. [2024-10-14 05:16:34,744 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-14 05:16:34,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6435 states to 6435 states and 9038 transitions. [2024-10-14 05:16:34,766 INFO L78 Accepts]: Start accepts. Automaton has 6435 states and 9038 transitions. Word has length 152 [2024-10-14 05:16:34,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:16:34,768 INFO L471 AbstractCegarLoop]: Abstraction has 6435 states and 9038 transitions. [2024-10-14 05:16:34,768 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-14 05:16:34,768 INFO L276 IsEmpty]: Start isEmpty. Operand 6435 states and 9038 transitions. [2024-10-14 05:16:34,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-10-14 05:16:34,773 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:16:34,773 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-14 05:16:34,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-14 05:16:34,774 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:16:34,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:16:34,774 INFO L85 PathProgramCache]: Analyzing trace with hash 432904976, now seen corresponding path program 1 times [2024-10-14 05:16:34,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:16:34,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236378753] [2024-10-14 05:16:34,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:16:34,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:16:34,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:34,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:16:34,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:34,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 05:16:34,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:34,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 05:16:35,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:35,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-14 05:16:35,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:35,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-14 05:16:35,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:35,017 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-14 05:16:35,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:16:35,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236378753] [2024-10-14 05:16:35,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236378753] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:16:35,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:16:35,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 05:16:35,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665970397] [2024-10-14 05:16:35,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:16:35,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 05:16:35,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:16:35,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 05:16:35,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:16:35,019 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-14 05:16:39,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:16:39,245 INFO L93 Difference]: Finished difference Result 13520 states and 20802 transitions. [2024-10-14 05:16:39,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 05:16:39,246 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-14 05:16:39,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:16:39,278 INFO L225 Difference]: With dead ends: 13520 [2024-10-14 05:16:39,278 INFO L226 Difference]: Without dead ends: 10737 [2024-10-14 05:16:39,291 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-14 05:16:39,292 INFO L432 NwaCegarLoop]: 515 mSDtfsCounter, 1647 mSDsluCounter, 1703 mSDsCounter, 0 mSdLazyCounter, 3682 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s 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.6s IncrementalHoareTripleChecker+Time [2024-10-14 05:16:39,292 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.6s Time] [2024-10-14 05:16:39,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10737 states. [2024-10-14 05:16:40,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10737 to 8892. [2024-10-14 05:16:40,335 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-14 05:16:40,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8892 states to 8892 states and 13050 transitions. [2024-10-14 05:16:40,371 INFO L78 Accepts]: Start accepts. Automaton has 8892 states and 13050 transitions. Word has length 152 [2024-10-14 05:16:40,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:16:40,372 INFO L471 AbstractCegarLoop]: Abstraction has 8892 states and 13050 transitions. [2024-10-14 05:16:40,372 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-14 05:16:40,372 INFO L276 IsEmpty]: Start isEmpty. Operand 8892 states and 13050 transitions. [2024-10-14 05:16:40,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-10-14 05:16:40,378 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:16:40,379 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-14 05:16:40,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-14 05:16:40,379 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:16:40,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:16:40,380 INFO L85 PathProgramCache]: Analyzing trace with hash -1600622, now seen corresponding path program 1 times [2024-10-14 05:16:40,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:16:40,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060851172] [2024-10-14 05:16:40,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:16:40,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:16:40,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:40,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:16:40,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:40,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 05:16:40,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:40,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 05:16:40,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:40,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-14 05:16:40,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:40,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-14 05:16:40,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:40,639 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-14 05:16:40,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:16:40,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060851172] [2024-10-14 05:16:40,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060851172] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:16:40,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:16:40,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 05:16:40,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914083741] [2024-10-14 05:16:40,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:16:40,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 05:16:40,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:16:40,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 05:16:40,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:16:40,642 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-14 05:16:44,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:16:44,916 INFO L93 Difference]: Finished difference Result 22471 states and 35620 transitions. [2024-10-14 05:16:44,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 05:16:44,916 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-14 05:16:44,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:16:44,982 INFO L225 Difference]: With dead ends: 22471 [2024-10-14 05:16:44,982 INFO L226 Difference]: Without dead ends: 17231 [2024-10-14 05:16:45,008 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-14 05:16:45,008 INFO L432 NwaCegarLoop]: 515 mSDtfsCounter, 1646 mSDsluCounter, 1703 mSDsCounter, 0 mSdLazyCounter, 3669 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s 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.5s IncrementalHoareTripleChecker+Time [2024-10-14 05:16:45,009 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.5s Time] [2024-10-14 05:16:45,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17231 states. [2024-10-14 05:16:46,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17231 to 13821. [2024-10-14 05:16:46,345 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-14 05:16:46,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13821 states to 13821 states and 21150 transitions. [2024-10-14 05:16:46,395 INFO L78 Accepts]: Start accepts. Automaton has 13821 states and 21150 transitions. Word has length 152 [2024-10-14 05:16:46,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:16:46,396 INFO L471 AbstractCegarLoop]: Abstraction has 13821 states and 21150 transitions. [2024-10-14 05:16:46,396 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-14 05:16:46,396 INFO L276 IsEmpty]: Start isEmpty. Operand 13821 states and 21150 transitions. [2024-10-14 05:16:46,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-10-14 05:16:46,404 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:16:46,404 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-14 05:16:46,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-14 05:16:46,405 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:16:46,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:16:46,405 INFO L85 PathProgramCache]: Analyzing trace with hash -431258928, now seen corresponding path program 1 times [2024-10-14 05:16:46,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:16:46,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097480937] [2024-10-14 05:16:46,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:16:46,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:16:46,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:46,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:16:46,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:46,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 05:16:46,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:46,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 05:16:46,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:46,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-14 05:16:46,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:46,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-14 05:16:46,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:46,644 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-14 05:16:46,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:16:46,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097480937] [2024-10-14 05:16:46,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097480937] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:16:46,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:16:46,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 05:16:46,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564213036] [2024-10-14 05:16:46,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:16:46,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 05:16:46,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:16:46,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 05:16:46,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:16:46,647 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-14 05:16:51,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:16:51,917 INFO L93 Difference]: Finished difference Result 40374 states and 65450 transitions. [2024-10-14 05:16:51,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 05:16:51,917 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-14 05:16:51,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:16:52,026 INFO L225 Difference]: With dead ends: 40374 [2024-10-14 05:16:52,026 INFO L226 Difference]: Without dead ends: 30205 [2024-10-14 05:16:52,067 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-14 05:16:52,068 INFO L432 NwaCegarLoop]: 515 mSDtfsCounter, 1645 mSDsluCounter, 1703 mSDsCounter, 0 mSdLazyCounter, 3656 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s 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.6s IncrementalHoareTripleChecker+Time [2024-10-14 05:16:52,068 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.6s Time] [2024-10-14 05:16:52,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30205 states. [2024-10-14 05:16:53,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30205 to 23710. [2024-10-14 05:16:53,798 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-14 05:16:53,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23710 states to 23710 states and 37558 transitions. [2024-10-14 05:16:53,860 INFO L78 Accepts]: Start accepts. Automaton has 23710 states and 37558 transitions. Word has length 152 [2024-10-14 05:16:53,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:16:53,861 INFO L471 AbstractCegarLoop]: Abstraction has 23710 states and 37558 transitions. [2024-10-14 05:16:53,861 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-14 05:16:53,861 INFO L276 IsEmpty]: Start isEmpty. Operand 23710 states and 37558 transitions. [2024-10-14 05:16:53,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-10-14 05:16:53,877 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:16:53,878 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-14 05:16:53,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-14 05:16:53,878 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:16:53,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:16:53,879 INFO L85 PathProgramCache]: Analyzing trace with hash -1137855534, now seen corresponding path program 1 times [2024-10-14 05:16:53,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:16:53,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40972178] [2024-10-14 05:16:53,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:16:53,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:16:53,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:53,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:16:53,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:54,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 05:16:54,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:54,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 05:16:54,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:54,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-14 05:16:54,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:54,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-14 05:16:54,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:16:54,125 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-14 05:16:54,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:16:54,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40972178] [2024-10-14 05:16:54,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40972178] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:16:54,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:16:54,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 05:16:54,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006077397] [2024-10-14 05:16:54,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:16:54,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 05:16:54,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:16:54,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 05:16:54,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:16:54,128 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-14 05:17:00,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:17:00,513 INFO L93 Difference]: Finished difference Result 76181 states and 125712 transitions. [2024-10-14 05:17:00,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 05:17:00,513 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-14 05:17:00,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:17:00,757 INFO L225 Difference]: With dead ends: 76181 [2024-10-14 05:17:00,757 INFO L226 Difference]: Without dead ends: 56123 [2024-10-14 05:17:00,835 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-14 05:17:00,836 INFO L432 NwaCegarLoop]: 515 mSDtfsCounter, 1644 mSDsluCounter, 1703 mSDsCounter, 0 mSdLazyCounter, 3643 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s 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.5s IncrementalHoareTripleChecker+Time [2024-10-14 05:17:00,836 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.5s Time] [2024-10-14 05:17:00,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56123 states.