./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.01.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.01.cil-1.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8ff0a322ea14915785d13405f40f59a899d91f6127d01ad0d503cb7ec027b40c --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 05:05:41,630 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 05:05:41,716 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 05:05:41,722 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 05:05:41,723 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 05:05:41,756 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 05:05:41,757 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 05:05:41,757 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 05:05:41,758 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 05:05:41,759 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 05:05:41,759 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 05:05:41,760 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 05:05:41,761 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 05:05:41,764 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 05:05:41,765 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 05:05:41,765 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 05:05:41,765 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 05:05:41,765 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 05:05:41,766 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 05:05:41,766 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 05:05:41,766 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 05:05:41,767 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 05:05:41,767 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 05:05:41,767 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 05:05:41,767 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 05:05:41,768 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 05:05:41,768 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 05:05:41,768 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 05:05:41,768 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 05:05:41,769 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 05:05:41,769 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 05:05:41,769 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 05:05:41,769 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 05:05:41,778 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 05:05:41,779 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 05:05:41,780 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 05:05:41,780 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 05:05:41,780 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 05:05:41,781 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 05:05:41,781 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 05:05:41,781 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 05:05:41,782 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 05:05:41,782 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8ff0a322ea14915785d13405f40f59a899d91f6127d01ad0d503cb7ec027b40c [2024-10-11 05:05:42,034 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 05:05:42,061 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 05:05:42,064 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 05:05:42,065 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 05:05:42,066 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 05:05:42,067 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.01.cil-1.c [2024-10-11 05:05:43,566 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 05:05:43,815 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 05:05:43,817 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.01.cil-1.c [2024-10-11 05:05:43,834 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/3f935c4b2/95a5cd089f7a4a9e8fabeae439f7488e/FLAGe4c736a1b [2024-10-11 05:05:43,851 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/3f935c4b2/95a5cd089f7a4a9e8fabeae439f7488e [2024-10-11 05:05:43,854 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 05:05:43,855 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 05:05:43,859 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 05:05:43,860 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 05:05:43,865 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 05:05:43,866 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:05:43" (1/1) ... [2024-10-11 05:05:43,867 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a522650 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:05:43, skipping insertion in model container [2024-10-11 05:05:43,869 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:05:43" (1/1) ... [2024-10-11 05:05:43,915 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 05:05:44,113 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.01.cil-1.c[911,924] [2024-10-11 05:05:44,176 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.01.cil-1.c[8416,8429] [2024-10-11 05:05:44,223 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 05:05:44,240 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 05:05:44,258 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.01.cil-1.c[911,924] [2024-10-11 05:05:44,287 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.01.cil-1.c[8416,8429] [2024-10-11 05:05:44,306 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 05:05:44,332 INFO L204 MainTranslator]: Completed translation [2024-10-11 05:05:44,333 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:05:44 WrapperNode [2024-10-11 05:05:44,333 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 05:05:44,335 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 05:05:44,335 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 05:05:44,335 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 05:05:44,343 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:05:44" (1/1) ... [2024-10-11 05:05:44,355 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:05:44" (1/1) ... [2024-10-11 05:05:44,393 INFO L138 Inliner]: procedures = 57, calls = 64, calls flagged for inlining = 26, calls inlined = 26, statements flattened = 446 [2024-10-11 05:05:44,393 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 05:05:44,394 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 05:05:44,394 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 05:05:44,395 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 05:05:44,414 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:05:44" (1/1) ... [2024-10-11 05:05:44,414 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:05:44" (1/1) ... [2024-10-11 05:05:44,417 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:05:44" (1/1) ... [2024-10-11 05:05:44,447 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 05:05:44,448 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:05:44" (1/1) ... [2024-10-11 05:05:44,448 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:05:44" (1/1) ... [2024-10-11 05:05:44,456 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:05:44" (1/1) ... [2024-10-11 05:05:44,468 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:05:44" (1/1) ... [2024-10-11 05:05:44,470 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:05:44" (1/1) ... [2024-10-11 05:05:44,472 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:05:44" (1/1) ... [2024-10-11 05:05:44,480 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 05:05:44,481 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 05:05:44,481 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 05:05:44,482 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 05:05:44,482 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:05:44" (1/1) ... [2024-10-11 05:05:44,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 05:05:44,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 05:05:44,523 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 05:05:44,527 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 05:05:44,576 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 05:05:44,576 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-10-11 05:05:44,577 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-10-11 05:05:44,577 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2024-10-11 05:05:44,577 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2024-10-11 05:05:44,577 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2024-10-11 05:05:44,577 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2024-10-11 05:05:44,578 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2024-10-11 05:05:44,578 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2024-10-11 05:05:44,578 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2024-10-11 05:05:44,578 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2024-10-11 05:05:44,578 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2024-10-11 05:05:44,579 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2024-10-11 05:05:44,579 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2024-10-11 05:05:44,579 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2024-10-11 05:05:44,579 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2024-10-11 05:05:44,579 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2024-10-11 05:05:44,579 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2024-10-11 05:05:44,580 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2024-10-11 05:05:44,580 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2024-10-11 05:05:44,580 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2024-10-11 05:05:44,580 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2024-10-11 05:05:44,580 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2024-10-11 05:05:44,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 05:05:44,581 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2024-10-11 05:05:44,581 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2024-10-11 05:05:44,581 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2024-10-11 05:05:44,581 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2024-10-11 05:05:44,581 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 05:05:44,582 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 05:05:44,582 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2024-10-11 05:05:44,582 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2024-10-11 05:05:44,684 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 05:05:44,687 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 05:05:45,151 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##56: assume !(1 == ~q_free~0); [2024-10-11 05:05:45,151 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##55: assume 1 == ~q_free~0;~c_dr_st~0 := 2;~c_dr_pc~0 := 2;~a_t~0 := do_read_c_~a~0#1; [2024-10-11 05:05:45,243 INFO L? ?]: Removed 64 outVars from TransFormulas that were not future-live. [2024-10-11 05:05:45,244 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 05:05:45,295 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 05:05:45,296 INFO L314 CfgBuilder]: Removed 8 assume(true) statements. [2024-10-11 05:05:45,298 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:05:45 BoogieIcfgContainer [2024-10-11 05:05:45,298 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 05:05:45,301 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 05:05:45,301 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 05:05:45,308 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 05:05:45,309 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 05:05:43" (1/3) ... [2024-10-11 05:05:45,309 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52097115 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:05:45, skipping insertion in model container [2024-10-11 05:05:45,310 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:05:44" (2/3) ... [2024-10-11 05:05:45,310 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52097115 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:05:45, skipping insertion in model container [2024-10-11 05:05:45,310 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:05:45" (3/3) ... [2024-10-11 05:05:45,311 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_3.cil+token_ring.01.cil-1.c [2024-10-11 05:05:45,329 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 05:05:45,330 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-11 05:05:45,471 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 05:05:45,479 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;@76d54775, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 05:05:45,480 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-11 05:05:45,485 INFO L276 IsEmpty]: Start isEmpty. Operand has 199 states, 151 states have (on average 1.6225165562913908) internal successors, (245), 157 states have internal predecessors, (245), 31 states have call successors, (31), 14 states have call predecessors, (31), 14 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2024-10-11 05:05:45,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-10-11 05:05:45,499 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:05:45,500 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] [2024-10-11 05:05:45,500 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:05:45,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:05:45,507 INFO L85 PathProgramCache]: Analyzing trace with hash 635992734, now seen corresponding path program 1 times [2024-10-11 05:05:45,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:05:45,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415385192] [2024-10-11 05:05:45,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:05:45,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:05:45,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:45,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:05:45,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:45,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 05:05:45,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:45,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 05:05:45,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:45,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 05:05:45,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:46,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 05:05:46,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:46,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:05:46,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:05:46,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415385192] [2024-10-11 05:05:46,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415385192] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:05:46,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:05:46,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 05:05:46,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992819314] [2024-10-11 05:05:46,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:05:46,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 05:05:46,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:05:46,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 05:05:46,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:05:46,051 INFO L87 Difference]: Start difference. First operand has 199 states, 151 states have (on average 1.6225165562913908) internal successors, (245), 157 states have internal predecessors, (245), 31 states have call successors, (31), 14 states have call predecessors, (31), 14 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:05:47,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:05:47,069 INFO L93 Difference]: Finished difference Result 507 states and 787 transitions. [2024-10-11 05:05:47,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 05:05:47,072 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 51 [2024-10-11 05:05:47,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:05:47,087 INFO L225 Difference]: With dead ends: 507 [2024-10-11 05:05:47,087 INFO L226 Difference]: Without dead ends: 317 [2024-10-11 05:05:47,091 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-10-11 05:05:47,095 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 524 mSDsluCounter, 395 mSDsCounter, 0 mSdLazyCounter, 668 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 544 SdHoareTripleChecker+Valid, 553 SdHoareTripleChecker+Invalid, 772 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 668 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 05:05:47,096 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [544 Valid, 553 Invalid, 772 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 668 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 05:05:47,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2024-10-11 05:05:47,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 278. [2024-10-11 05:05:47,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 215 states have (on average 1.4930232558139536) internal successors, (321), 220 states have internal predecessors, (321), 41 states have call successors, (41), 20 states have call predecessors, (41), 20 states have return successors, (42), 39 states have call predecessors, (42), 39 states have call successors, (42) [2024-10-11 05:05:47,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 404 transitions. [2024-10-11 05:05:47,214 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 404 transitions. Word has length 51 [2024-10-11 05:05:47,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:05:47,215 INFO L471 AbstractCegarLoop]: Abstraction has 278 states and 404 transitions. [2024-10-11 05:05:47,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:05:47,216 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 404 transitions. [2024-10-11 05:05:47,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-10-11 05:05:47,220 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:05:47,220 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] [2024-10-11 05:05:47,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 05:05:47,221 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:05:47,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:05:47,222 INFO L85 PathProgramCache]: Analyzing trace with hash 1482341282, now seen corresponding path program 1 times [2024-10-11 05:05:47,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:05:47,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601011277] [2024-10-11 05:05:47,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:05:47,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:05:47,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:47,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:05:47,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:47,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 05:05:47,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:47,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 05:05:47,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:47,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 05:05:47,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:47,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 05:05:47,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:47,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:05:47,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:05:47,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601011277] [2024-10-11 05:05:47,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601011277] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:05:47,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:05:47,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:05:47,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445935358] [2024-10-11 05:05:47,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:05:47,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:05:47,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:05:47,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:05:47,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:05:47,434 INFO L87 Difference]: Start difference. First operand 278 states and 404 transitions. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:05:48,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:05:48,484 INFO L93 Difference]: Finished difference Result 588 states and 856 transitions. [2024-10-11 05:05:48,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 05:05:48,486 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 51 [2024-10-11 05:05:48,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:05:48,493 INFO L225 Difference]: With dead ends: 588 [2024-10-11 05:05:48,495 INFO L226 Difference]: Without dead ends: 418 [2024-10-11 05:05:48,497 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-11 05:05:48,501 INFO L432 NwaCegarLoop]: 203 mSDtfsCounter, 510 mSDsluCounter, 601 mSDsCounter, 0 mSdLazyCounter, 1037 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 530 SdHoareTripleChecker+Valid, 804 SdHoareTripleChecker+Invalid, 1116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 1037 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 05:05:48,501 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [530 Valid, 804 Invalid, 1116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 1037 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 05:05:48,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2024-10-11 05:05:48,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 357. [2024-10-11 05:05:48,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 277 states have (on average 1.48014440433213) internal successors, (410), 283 states have internal predecessors, (410), 51 states have call successors, (51), 26 states have call predecessors, (51), 27 states have return successors, (54), 50 states have call predecessors, (54), 49 states have call successors, (54) [2024-10-11 05:05:48,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 515 transitions. [2024-10-11 05:05:48,579 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 515 transitions. Word has length 51 [2024-10-11 05:05:48,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:05:48,579 INFO L471 AbstractCegarLoop]: Abstraction has 357 states and 515 transitions. [2024-10-11 05:05:48,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:05:48,580 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 515 transitions. [2024-10-11 05:05:48,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-10-11 05:05:48,582 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:05:48,582 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] [2024-10-11 05:05:48,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 05:05:48,583 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:05:48,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:05:48,583 INFO L85 PathProgramCache]: Analyzing trace with hash 110533984, now seen corresponding path program 1 times [2024-10-11 05:05:48,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:05:48,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392954524] [2024-10-11 05:05:48,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:05:48,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:05:48,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:48,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:05:48,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:48,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 05:05:48,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:48,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 05:05:48,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:48,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 05:05:48,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:48,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 05:05:48,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:48,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:05:48,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:05:48,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392954524] [2024-10-11 05:05:48,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392954524] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:05:48,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:05:48,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:05:48,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911928604] [2024-10-11 05:05:48,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:05:48,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:05:48,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:05:48,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:05:48,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:05:48,718 INFO L87 Difference]: Start difference. First operand 357 states and 515 transitions. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:05:49,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:05:49,771 INFO L93 Difference]: Finished difference Result 898 states and 1297 transitions. [2024-10-11 05:05:49,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 05:05:49,772 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 51 [2024-10-11 05:05:49,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:05:49,777 INFO L225 Difference]: With dead ends: 898 [2024-10-11 05:05:49,778 INFO L226 Difference]: Without dead ends: 649 [2024-10-11 05:05:49,779 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-11 05:05:49,781 INFO L432 NwaCegarLoop]: 199 mSDtfsCounter, 522 mSDsluCounter, 596 mSDsCounter, 0 mSdLazyCounter, 1114 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 541 SdHoareTripleChecker+Valid, 795 SdHoareTripleChecker+Invalid, 1198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 1114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 05:05:49,781 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [541 Valid, 795 Invalid, 1198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 1114 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 05:05:49,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2024-10-11 05:05:49,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 512. [2024-10-11 05:05:49,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 512 states, 400 states have (on average 1.4675) internal successors, (587), 408 states have internal predecessors, (587), 69 states have call successors, (69), 38 states have call predecessors, (69), 41 states have return successors, (80), 70 states have call predecessors, (80), 67 states have call successors, (80) [2024-10-11 05:05:49,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 736 transitions. [2024-10-11 05:05:49,868 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 736 transitions. Word has length 51 [2024-10-11 05:05:49,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:05:49,868 INFO L471 AbstractCegarLoop]: Abstraction has 512 states and 736 transitions. [2024-10-11 05:05:49,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:05:49,869 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 736 transitions. [2024-10-11 05:05:49,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-10-11 05:05:49,871 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:05:49,871 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] [2024-10-11 05:05:49,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 05:05:49,872 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:05:49,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:05:49,872 INFO L85 PathProgramCache]: Analyzing trace with hash -1734833182, now seen corresponding path program 1 times [2024-10-11 05:05:49,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:05:49,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493865618] [2024-10-11 05:05:49,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:05:49,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:05:49,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:49,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:05:49,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:49,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 05:05:49,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:49,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 05:05:49,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:49,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 05:05:49,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:49,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 05:05:49,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:49,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:05:49,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:05:49,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493865618] [2024-10-11 05:05:49,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493865618] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:05:49,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:05:49,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 05:05:49,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693782299] [2024-10-11 05:05:49,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:05:49,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 05:05:49,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:05:49,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 05:05:49,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:05:49,974 INFO L87 Difference]: Start difference. First operand 512 states and 736 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:05:50,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:05:50,523 INFO L93 Difference]: Finished difference Result 998 states and 1456 transitions. [2024-10-11 05:05:50,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 05:05:50,524 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 51 [2024-10-11 05:05:50,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:05:50,528 INFO L225 Difference]: With dead ends: 998 [2024-10-11 05:05:50,529 INFO L226 Difference]: Without dead ends: 595 [2024-10-11 05:05:50,530 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-10-11 05:05:50,531 INFO L432 NwaCegarLoop]: 169 mSDtfsCounter, 211 mSDsluCounter, 467 mSDsCounter, 0 mSdLazyCounter, 599 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 636 SdHoareTripleChecker+Invalid, 665 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 599 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 05:05:50,532 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 636 Invalid, 665 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 599 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 05:05:50,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2024-10-11 05:05:50,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 522. [2024-10-11 05:05:50,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 522 states, 410 states have (on average 1.4560975609756097) internal successors, (597), 418 states have internal predecessors, (597), 69 states have call successors, (69), 38 states have call predecessors, (69), 41 states have return successors, (80), 70 states have call predecessors, (80), 67 states have call successors, (80) [2024-10-11 05:05:50,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 746 transitions. [2024-10-11 05:05:50,580 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 746 transitions. Word has length 51 [2024-10-11 05:05:50,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:05:50,581 INFO L471 AbstractCegarLoop]: Abstraction has 522 states and 746 transitions. [2024-10-11 05:05:50,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:05:50,581 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 746 transitions. [2024-10-11 05:05:50,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-10-11 05:05:50,583 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:05:50,583 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] [2024-10-11 05:05:50,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 05:05:50,583 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:05:50,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:05:50,585 INFO L85 PathProgramCache]: Analyzing trace with hash -1712200928, now seen corresponding path program 1 times [2024-10-11 05:05:50,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:05:50,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689755346] [2024-10-11 05:05:50,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:05:50,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:05:50,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:50,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:05:50,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:50,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 05:05:50,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:50,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 05:05:50,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:50,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 05:05:50,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:50,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 05:05:50,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:50,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:05:50,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:05:50,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689755346] [2024-10-11 05:05:50,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689755346] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:05:50,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:05:50,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:05:50,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311585509] [2024-10-11 05:05:50,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:05:50,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:05:50,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:05:50,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:05:50,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:05:50,721 INFO L87 Difference]: Start difference. First operand 522 states and 746 transitions. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:05:51,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:05:51,990 INFO L93 Difference]: Finished difference Result 2263 states and 3353 transitions. [2024-10-11 05:05:51,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-11 05:05:51,991 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 51 [2024-10-11 05:05:51,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:05:52,003 INFO L225 Difference]: With dead ends: 2263 [2024-10-11 05:05:52,004 INFO L226 Difference]: Without dead ends: 1850 [2024-10-11 05:05:52,007 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2024-10-11 05:05:52,011 INFO L432 NwaCegarLoop]: 230 mSDtfsCounter, 953 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 876 mSolverCounterSat, 256 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 968 SdHoareTripleChecker+Valid, 683 SdHoareTripleChecker+Invalid, 1132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 256 IncrementalHoareTripleChecker+Valid, 876 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 05:05:52,012 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [968 Valid, 683 Invalid, 1132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [256 Valid, 876 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 05:05:52,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1850 states. [2024-10-11 05:05:52,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1850 to 1610. [2024-10-11 05:05:52,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1610 states, 1255 states have (on average 1.4119521912350597) internal successors, (1772), 1290 states have internal predecessors, (1772), 210 states have call successors, (210), 128 states have call predecessors, (210), 143 states have return successors, (305), 196 states have call predecessors, (305), 208 states have call successors, (305) [2024-10-11 05:05:52,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1610 states to 1610 states and 2287 transitions. [2024-10-11 05:05:52,145 INFO L78 Accepts]: Start accepts. Automaton has 1610 states and 2287 transitions. Word has length 51 [2024-10-11 05:05:52,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:05:52,145 INFO L471 AbstractCegarLoop]: Abstraction has 1610 states and 2287 transitions. [2024-10-11 05:05:52,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:05:52,146 INFO L276 IsEmpty]: Start isEmpty. Operand 1610 states and 2287 transitions. [2024-10-11 05:05:52,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-11 05:05:52,147 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:05:52,147 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:05:52,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 05:05:52,148 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:05:52,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:05:52,149 INFO L85 PathProgramCache]: Analyzing trace with hash 1245975289, now seen corresponding path program 1 times [2024-10-11 05:05:52,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:05:52,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325661519] [2024-10-11 05:05:52,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:05:52,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:05:52,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:52,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:05:52,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:52,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:05:52,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:52,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:05:52,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:52,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:05:52,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:52,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 05:05:52,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:52,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 05:05:52,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:52,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:05:52,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:52,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:05:52,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:05:52,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325661519] [2024-10-11 05:05:52,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325661519] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:05:52,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:05:52,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 05:05:52,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296104258] [2024-10-11 05:05:52,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:05:52,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 05:05:52,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:05:52,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 05:05:52,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-11 05:05:52,289 INFO L87 Difference]: Start difference. First operand 1610 states and 2287 transitions. Second operand has 8 states, 8 states have (on average 5.25) internal successors, (42), 5 states have internal predecessors, (42), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-11 05:05:53,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:05:53,184 INFO L93 Difference]: Finished difference Result 1842 states and 2634 transitions. [2024-10-11 05:05:53,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 05:05:53,184 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 5 states have internal predecessors, (42), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 57 [2024-10-11 05:05:53,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:05:53,195 INFO L225 Difference]: With dead ends: 1842 [2024-10-11 05:05:53,195 INFO L226 Difference]: Without dead ends: 1748 [2024-10-11 05:05:53,199 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2024-10-11 05:05:53,200 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 593 mSDsluCounter, 560 mSDsCounter, 0 mSdLazyCounter, 737 mSolverCounterSat, 159 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 600 SdHoareTripleChecker+Valid, 724 SdHoareTripleChecker+Invalid, 896 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 159 IncrementalHoareTripleChecker+Valid, 737 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 05:05:53,200 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [600 Valid, 724 Invalid, 896 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [159 Valid, 737 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 05:05:53,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1748 states. [2024-10-11 05:05:53,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1748 to 1711. [2024-10-11 05:05:53,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1711 states, 1334 states have (on average 1.4152923538230884) internal successors, (1888), 1371 states have internal predecessors, (1888), 223 states have call successors, (223), 135 states have call predecessors, (223), 152 states have return successors, (323), 210 states have call predecessors, (323), 221 states have call successors, (323) [2024-10-11 05:05:53,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1711 states to 1711 states and 2434 transitions. [2024-10-11 05:05:53,376 INFO L78 Accepts]: Start accepts. Automaton has 1711 states and 2434 transitions. Word has length 57 [2024-10-11 05:05:53,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:05:53,376 INFO L471 AbstractCegarLoop]: Abstraction has 1711 states and 2434 transitions. [2024-10-11 05:05:53,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 5 states have internal predecessors, (42), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-11 05:05:53,377 INFO L276 IsEmpty]: Start isEmpty. Operand 1711 states and 2434 transitions. [2024-10-11 05:05:53,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-11 05:05:53,379 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:05:53,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] [2024-10-11 05:05:53,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 05:05:53,379 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:05:53,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:05:53,380 INFO L85 PathProgramCache]: Analyzing trace with hash -698017479, now seen corresponding path program 1 times [2024-10-11 05:05:53,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:05:53,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310167322] [2024-10-11 05:05:53,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:05:53,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:05:53,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:53,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:05:53,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:53,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:05:53,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:53,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:05:53,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:53,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:05:53,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:53,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 05:05:53,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:53,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 05:05:53,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:53,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:05:53,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:53,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:05:53,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:05:53,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310167322] [2024-10-11 05:05:53,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310167322] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:05:53,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:05:53,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 05:05:53,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515670513] [2024-10-11 05:05:53,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:05:53,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 05:05:53,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:05:53,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 05:05:53,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 05:05:53,538 INFO L87 Difference]: Start difference. First operand 1711 states and 2434 transitions. Second operand has 8 states, 8 states have (on average 5.25) internal successors, (42), 6 states have internal predecessors, (42), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-11 05:05:54,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:05:54,714 INFO L93 Difference]: Finished difference Result 2072 states and 2964 transitions. [2024-10-11 05:05:54,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-11 05:05:54,714 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 6 states have internal predecessors, (42), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 57 [2024-10-11 05:05:54,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:05:54,724 INFO L225 Difference]: With dead ends: 2072 [2024-10-11 05:05:54,724 INFO L226 Difference]: Without dead ends: 1884 [2024-10-11 05:05:54,726 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-11 05:05:54,727 INFO L432 NwaCegarLoop]: 216 mSDtfsCounter, 557 mSDsluCounter, 833 mSDsCounter, 0 mSdLazyCounter, 1105 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 579 SdHoareTripleChecker+Valid, 1049 SdHoareTripleChecker+Invalid, 1210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 1105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 05:05:54,728 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [579 Valid, 1049 Invalid, 1210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 1105 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 05:05:54,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1884 states. [2024-10-11 05:05:54,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1884 to 1812. [2024-10-11 05:05:54,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1812 states, 1413 states have (on average 1.4175513092710545) internal successors, (2003), 1452 states have internal predecessors, (2003), 236 states have call successors, (236), 142 states have call predecessors, (236), 161 states have return successors, (344), 224 states have call predecessors, (344), 234 states have call successors, (344) [2024-10-11 05:05:54,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1812 states to 1812 states and 2583 transitions. [2024-10-11 05:05:54,910 INFO L78 Accepts]: Start accepts. Automaton has 1812 states and 2583 transitions. Word has length 57 [2024-10-11 05:05:54,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:05:54,911 INFO L471 AbstractCegarLoop]: Abstraction has 1812 states and 2583 transitions. [2024-10-11 05:05:54,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 6 states have internal predecessors, (42), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-11 05:05:54,911 INFO L276 IsEmpty]: Start isEmpty. Operand 1812 states and 2583 transitions. [2024-10-11 05:05:54,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-11 05:05:54,913 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:05:54,913 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:05:54,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 05:05:54,913 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:05:54,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:05:54,914 INFO L85 PathProgramCache]: Analyzing trace with hash 195468859, now seen corresponding path program 1 times [2024-10-11 05:05:54,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:05:54,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049489531] [2024-10-11 05:05:54,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:05:54,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:05:54,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:54,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:05:54,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:54,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:05:54,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:54,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:05:54,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:55,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:05:55,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:55,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 05:05:55,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:55,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 05:05:55,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:55,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:05:55,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:55,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:05:55,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:05:55,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049489531] [2024-10-11 05:05:55,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049489531] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:05:55,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:05:55,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:05:55,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087605555] [2024-10-11 05:05:55,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:05:55,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:05:55,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:05:55,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:05:55,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:05:55,027 INFO L87 Difference]: Start difference. First operand 1812 states and 2583 transitions. Second operand has 7 states, 7 states have (on average 6.0) internal successors, (42), 4 states have internal predecessors, (42), 4 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2024-10-11 05:05:55,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:05:55,921 INFO L93 Difference]: Finished difference Result 2418 states and 3459 transitions. [2024-10-11 05:05:55,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 05:05:55,922 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 4 states have internal predecessors, (42), 4 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) Word has length 57 [2024-10-11 05:05:55,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:05:55,934 INFO L225 Difference]: With dead ends: 2418 [2024-10-11 05:05:55,935 INFO L226 Difference]: Without dead ends: 2135 [2024-10-11 05:05:55,937 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2024-10-11 05:05:55,938 INFO L432 NwaCegarLoop]: 223 mSDtfsCounter, 646 mSDsluCounter, 545 mSDsCounter, 0 mSdLazyCounter, 787 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 681 SdHoareTripleChecker+Valid, 768 SdHoareTripleChecker+Invalid, 899 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 787 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 05:05:55,939 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [681 Valid, 768 Invalid, 899 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 787 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 05:05:55,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2135 states. [2024-10-11 05:05:56,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2135 to 2064. [2024-10-11 05:05:56,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2064 states, 1610 states have (on average 1.4167701863354036) internal successors, (2281), 1653 states have internal predecessors, (2281), 266 states have call successors, (266), 163 states have call predecessors, (266), 186 states have return successors, (382), 254 states have call predecessors, (382), 264 states have call successors, (382) [2024-10-11 05:05:56,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2064 states to 2064 states and 2929 transitions. [2024-10-11 05:05:56,131 INFO L78 Accepts]: Start accepts. Automaton has 2064 states and 2929 transitions. Word has length 57 [2024-10-11 05:05:56,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:05:56,131 INFO L471 AbstractCegarLoop]: Abstraction has 2064 states and 2929 transitions. [2024-10-11 05:05:56,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 4 states have internal predecessors, (42), 4 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2024-10-11 05:05:56,132 INFO L276 IsEmpty]: Start isEmpty. Operand 2064 states and 2929 transitions. [2024-10-11 05:05:56,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-11 05:05:56,133 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:05:56,134 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:05:56,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 05:05:56,134 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:05:56,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:05:56,135 INFO L85 PathProgramCache]: Analyzing trace with hash -1598588300, now seen corresponding path program 1 times [2024-10-11 05:05:56,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:05:56,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144410223] [2024-10-11 05:05:56,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:05:56,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:05:56,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:56,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:05:56,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:56,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:05:56,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:56,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:05:56,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:56,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:05:56,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:56,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:05:56,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:56,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 05:05:56,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:56,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 05:05:56,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:56,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:05:56,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:05:56,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144410223] [2024-10-11 05:05:56,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144410223] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:05:56,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:05:56,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 05:05:56,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263123253] [2024-10-11 05:05:56,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:05:56,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 05:05:56,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:05:56,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 05:05:56,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-11 05:05:56,299 INFO L87 Difference]: Start difference. First operand 2064 states and 2929 transitions. Second operand has 9 states, 8 states have (on average 5.375) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 05:05:57,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:05:57,114 INFO L93 Difference]: Finished difference Result 2666 states and 3790 transitions. [2024-10-11 05:05:57,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 05:05:57,114 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.375) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 58 [2024-10-11 05:05:57,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:05:57,131 INFO L225 Difference]: With dead ends: 2666 [2024-10-11 05:05:57,132 INFO L226 Difference]: Without dead ends: 2131 [2024-10-11 05:05:57,135 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2024-10-11 05:05:57,136 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 208 mSDsluCounter, 856 mSDsCounter, 0 mSdLazyCounter, 945 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 1024 SdHoareTripleChecker+Invalid, 1014 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 945 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 05:05:57,137 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 1024 Invalid, 1014 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 945 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 05:05:57,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2131 states. [2024-10-11 05:05:57,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2131 to 2076. [2024-10-11 05:05:57,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2076 states, 1619 states have (on average 1.4126003705991352) internal successors, (2287), 1662 states have internal predecessors, (2287), 266 states have call successors, (266), 163 states have call predecessors, (266), 189 states have return successors, (385), 257 states have call predecessors, (385), 264 states have call successors, (385) [2024-10-11 05:05:57,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2076 states to 2076 states and 2938 transitions. [2024-10-11 05:05:57,389 INFO L78 Accepts]: Start accepts. Automaton has 2076 states and 2938 transitions. Word has length 58 [2024-10-11 05:05:57,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:05:57,389 INFO L471 AbstractCegarLoop]: Abstraction has 2076 states and 2938 transitions. [2024-10-11 05:05:57,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.375) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 05:05:57,390 INFO L276 IsEmpty]: Start isEmpty. Operand 2076 states and 2938 transitions. [2024-10-11 05:05:57,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-11 05:05:57,391 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:05:57,392 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:05:57,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 05:05:57,392 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:05:57,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:05:57,392 INFO L85 PathProgramCache]: Analyzing trace with hash -1670974858, now seen corresponding path program 1 times [2024-10-11 05:05:57,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:05:57,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640625051] [2024-10-11 05:05:57,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:05:57,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:05:57,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:57,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:05:57,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:57,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:05:57,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:57,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:05:57,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:57,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:05:57,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:57,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:05:57,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:57,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 05:05:57,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:57,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 05:05:57,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:57,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:05:57,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:05:57,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640625051] [2024-10-11 05:05:57,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640625051] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:05:57,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:05:57,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 05:05:57,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074356249] [2024-10-11 05:05:57,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:05:57,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 05:05:57,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:05:57,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 05:05:57,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-10-11 05:05:57,546 INFO L87 Difference]: Start difference. First operand 2076 states and 2938 transitions. Second operand has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 6 states have internal predecessors, (43), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2024-10-11 05:05:59,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:05:59,499 INFO L93 Difference]: Finished difference Result 4075 states and 5853 transitions. [2024-10-11 05:05:59,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-10-11 05:05:59,500 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 6 states have internal predecessors, (43), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 58 [2024-10-11 05:05:59,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:05:59,514 INFO L225 Difference]: With dead ends: 4075 [2024-10-11 05:05:59,514 INFO L226 Difference]: Without dead ends: 2409 [2024-10-11 05:05:59,524 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 292 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=235, Invalid=887, Unknown=0, NotChecked=0, Total=1122 [2024-10-11 05:05:59,525 INFO L432 NwaCegarLoop]: 310 mSDtfsCounter, 1369 mSDsluCounter, 787 mSDsCounter, 0 mSdLazyCounter, 1487 mSolverCounterSat, 374 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1389 SdHoareTripleChecker+Valid, 1097 SdHoareTripleChecker+Invalid, 1861 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 374 IncrementalHoareTripleChecker+Valid, 1487 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-11 05:05:59,526 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1389 Valid, 1097 Invalid, 1861 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [374 Valid, 1487 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-11 05:05:59,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2409 states. [2024-10-11 05:05:59,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2409 to 2279. [2024-10-11 05:05:59,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2279 states, 1766 states have (on average 1.3963759909399773) internal successors, (2466), 1813 states have internal predecessors, (2466), 296 states have call successors, (296), 184 states have call predecessors, (296), 215 states have return successors, (434), 288 states have call predecessors, (434), 294 states have call successors, (434) [2024-10-11 05:05:59,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2279 states to 2279 states and 3196 transitions. [2024-10-11 05:05:59,771 INFO L78 Accepts]: Start accepts. Automaton has 2279 states and 3196 transitions. Word has length 58 [2024-10-11 05:05:59,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:05:59,771 INFO L471 AbstractCegarLoop]: Abstraction has 2279 states and 3196 transitions. [2024-10-11 05:05:59,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 6 states have internal predecessors, (43), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2024-10-11 05:05:59,772 INFO L276 IsEmpty]: Start isEmpty. Operand 2279 states and 3196 transitions. [2024-10-11 05:05:59,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-11 05:05:59,775 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:05:59,775 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] [2024-10-11 05:05:59,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 05:05:59,776 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:05:59,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:05:59,776 INFO L85 PathProgramCache]: Analyzing trace with hash -753332195, now seen corresponding path program 1 times [2024-10-11 05:05:59,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:05:59,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266227352] [2024-10-11 05:05:59,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:05:59,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:05:59,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:59,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:05:59,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:59,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:05:59,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:59,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:05:59,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:59,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:05:59,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:59,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:05:59,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:59,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 05:05:59,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:59,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 05:05:59,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:59,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:05:59,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:05:59,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266227352] [2024-10-11 05:05:59,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266227352] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:05:59,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:05:59,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 05:05:59,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298752246] [2024-10-11 05:05:59,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:05:59,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 05:05:59,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:05:59,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 05:05:59,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-11 05:05:59,898 INFO L87 Difference]: Start difference. First operand 2279 states and 3196 transitions. Second operand has 9 states, 8 states have (on average 5.5) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 05:06:00,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:06:00,740 INFO L93 Difference]: Finished difference Result 3154 states and 4421 transitions. [2024-10-11 05:06:00,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 05:06:00,741 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.5) internal successors, (44), 5 states have internal predecessors, (44), 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 59 [2024-10-11 05:06:00,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:06:00,758 INFO L225 Difference]: With dead ends: 3154 [2024-10-11 05:06:00,758 INFO L226 Difference]: Without dead ends: 2404 [2024-10-11 05:06:00,763 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2024-10-11 05:06:00,763 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 304 mSDsluCounter, 725 mSDsCounter, 0 mSdLazyCounter, 838 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 306 SdHoareTripleChecker+Valid, 886 SdHoareTripleChecker+Invalid, 943 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 838 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 05:06:00,764 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [306 Valid, 886 Invalid, 943 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 838 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 05:06:00,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2404 states. [2024-10-11 05:06:01,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2404 to 2315. [2024-10-11 05:06:01,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2315 states, 1793 states have (on average 1.3904071388733965) internal successors, (2493), 1840 states have internal predecessors, (2493), 296 states have call successors, (296), 184 states have call predecessors, (296), 224 states have return successors, (443), 297 states have call predecessors, (443), 294 states have call successors, (443) [2024-10-11 05:06:01,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2315 states to 2315 states and 3232 transitions. [2024-10-11 05:06:01,015 INFO L78 Accepts]: Start accepts. Automaton has 2315 states and 3232 transitions. Word has length 59 [2024-10-11 05:06:01,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:06:01,015 INFO L471 AbstractCegarLoop]: Abstraction has 2315 states and 3232 transitions. [2024-10-11 05:06:01,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.5) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 05:06:01,016 INFO L276 IsEmpty]: Start isEmpty. Operand 2315 states and 3232 transitions. [2024-10-11 05:06:01,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-11 05:06:01,021 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:06:01,021 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] [2024-10-11 05:06:01,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 05:06:01,021 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:06:01,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:06:01,022 INFO L85 PathProgramCache]: Analyzing trace with hash -612783585, now seen corresponding path program 1 times [2024-10-11 05:06:01,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:06:01,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933553957] [2024-10-11 05:06:01,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:06:01,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:06:01,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:01,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:06:01,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:01,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:06:01,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:01,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:06:01,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:01,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:06:01,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:01,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:06:01,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:01,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 05:06:01,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:01,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 05:06:01,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:01,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:06:01,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:06:01,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933553957] [2024-10-11 05:06:01,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933553957] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:06:01,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:06:01,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 05:06:01,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129898570] [2024-10-11 05:06:01,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:06:01,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 05:06:01,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:06:01,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 05:06:01,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 05:06:01,204 INFO L87 Difference]: Start difference. First operand 2315 states and 3232 transitions. Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-11 05:06:02,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:06:02,180 INFO L93 Difference]: Finished difference Result 3209 states and 4449 transitions. [2024-10-11 05:06:02,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-11 05:06:02,181 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 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 59 [2024-10-11 05:06:02,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:06:02,195 INFO L225 Difference]: With dead ends: 3209 [2024-10-11 05:06:02,196 INFO L226 Difference]: Without dead ends: 2503 [2024-10-11 05:06:02,199 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=277, Unknown=0, NotChecked=0, Total=380 [2024-10-11 05:06:02,200 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 562 mSDsluCounter, 577 mSDsCounter, 0 mSdLazyCounter, 923 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 583 SdHoareTripleChecker+Valid, 720 SdHoareTripleChecker+Invalid, 1054 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 923 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 05:06:02,200 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [583 Valid, 720 Invalid, 1054 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 923 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 05:06:02,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2503 states. [2024-10-11 05:06:02,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2503 to 2322. [2024-10-11 05:06:02,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2322 states, 1800 states have (on average 1.3877777777777778) internal successors, (2498), 1845 states have internal predecessors, (2498), 297 states have call successors, (297), 185 states have call predecessors, (297), 223 states have return successors, (439), 298 states have call predecessors, (439), 295 states have call successors, (439) [2024-10-11 05:06:02,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2322 states to 2322 states and 3234 transitions. [2024-10-11 05:06:02,435 INFO L78 Accepts]: Start accepts. Automaton has 2322 states and 3234 transitions. Word has length 59 [2024-10-11 05:06:02,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:06:02,435 INFO L471 AbstractCegarLoop]: Abstraction has 2322 states and 3234 transitions. [2024-10-11 05:06:02,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-11 05:06:02,436 INFO L276 IsEmpty]: Start isEmpty. Operand 2322 states and 3234 transitions. [2024-10-11 05:06:02,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-11 05:06:02,437 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:06:02,437 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] [2024-10-11 05:06:02,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 05:06:02,438 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:06:02,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:06:02,438 INFO L85 PathProgramCache]: Analyzing trace with hash -1430432035, now seen corresponding path program 1 times [2024-10-11 05:06:02,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:06:02,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400879555] [2024-10-11 05:06:02,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:06:02,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:06:02,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:02,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:06:02,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:02,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:06:02,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:02,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:06:02,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:02,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:06:02,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:02,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:06:02,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:02,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 05:06:02,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:02,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 05:06:02,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:02,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:06:02,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:06:02,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400879555] [2024-10-11 05:06:02,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400879555] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:06:02,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:06:02,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:06:02,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611754509] [2024-10-11 05:06:02,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:06:02,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:06:02,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:06:02,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:06:02,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:06:02,537 INFO L87 Difference]: Start difference. First operand 2322 states and 3234 transitions. Second operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 4 states have internal predecessors, (44), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-11 05:06:03,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:06:03,269 INFO L93 Difference]: Finished difference Result 4044 states and 5593 transitions. [2024-10-11 05:06:03,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 05:06:03,270 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 4 states have internal predecessors, (44), 4 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 59 [2024-10-11 05:06:03,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:06:03,288 INFO L225 Difference]: With dead ends: 4044 [2024-10-11 05:06:03,288 INFO L226 Difference]: Without dead ends: 3254 [2024-10-11 05:06:03,292 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2024-10-11 05:06:03,293 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 520 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 458 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 545 SdHoareTripleChecker+Valid, 590 SdHoareTripleChecker+Invalid, 581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 05:06:03,293 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [545 Valid, 590 Invalid, 581 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 458 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 05:06:03,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3254 states. [2024-10-11 05:06:03,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3254 to 3096. [2024-10-11 05:06:03,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3096 states, 2379 states have (on average 1.3669609079445144) internal successors, (3252), 2437 states have internal predecessors, (3252), 401 states have call successors, (401), 249 states have call predecessors, (401), 314 states have return successors, (629), 419 states have call predecessors, (629), 399 states have call successors, (629) [2024-10-11 05:06:03,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3096 states to 3096 states and 4282 transitions. [2024-10-11 05:06:03,724 INFO L78 Accepts]: Start accepts. Automaton has 3096 states and 4282 transitions. Word has length 59 [2024-10-11 05:06:03,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:06:03,725 INFO L471 AbstractCegarLoop]: Abstraction has 3096 states and 4282 transitions. [2024-10-11 05:06:03,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 4 states have internal predecessors, (44), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-11 05:06:03,725 INFO L276 IsEmpty]: Start isEmpty. Operand 3096 states and 4282 transitions. [2024-10-11 05:06:03,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-11 05:06:03,727 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:06:03,727 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] [2024-10-11 05:06:03,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 05:06:03,728 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:06:03,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:06:03,728 INFO L85 PathProgramCache]: Analyzing trace with hash 1175759513, now seen corresponding path program 1 times [2024-10-11 05:06:03,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:06:03,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545802145] [2024-10-11 05:06:03,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:06:03,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:06:03,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:03,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:06:03,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:03,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:06:03,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:03,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:06:03,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:03,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:06:03,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:03,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:06:03,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:03,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 05:06:03,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:03,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 05:06:03,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:03,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:06:03,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:06:03,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545802145] [2024-10-11 05:06:03,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545802145] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:06:03,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:06:03,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 05:06:03,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848507285] [2024-10-11 05:06:03,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:06:03,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 05:06:03,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:06:03,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 05:06:03,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:06:03,800 INFO L87 Difference]: Start difference. First operand 3096 states and 4282 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 3 states have internal predecessors, (45), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 05:06:04,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:06:04,403 INFO L93 Difference]: Finished difference Result 4678 states and 6497 transitions. [2024-10-11 05:06:04,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 05:06:04,403 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 3 states have internal predecessors, (45), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 60 [2024-10-11 05:06:04,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:06:04,414 INFO L225 Difference]: With dead ends: 4678 [2024-10-11 05:06:04,415 INFO L226 Difference]: Without dead ends: 1510 [2024-10-11 05:06:04,423 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2024-10-11 05:06:04,424 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 410 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 435 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 05:06:04,424 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [435 Valid, 441 Invalid, 358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 05:06:04,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1510 states. [2024-10-11 05:06:04,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1510 to 1510. [2024-10-11 05:06:04,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1510 states, 1179 states have (on average 1.4045801526717556) internal successors, (1656), 1211 states have internal predecessors, (1656), 194 states have call successors, (194), 120 states have call predecessors, (194), 136 states have return successors, (291), 182 states have call predecessors, (291), 194 states have call successors, (291) [2024-10-11 05:06:04,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1510 states to 1510 states and 2141 transitions. [2024-10-11 05:06:04,585 INFO L78 Accepts]: Start accepts. Automaton has 1510 states and 2141 transitions. Word has length 60 [2024-10-11 05:06:04,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:06:04,588 INFO L471 AbstractCegarLoop]: Abstraction has 1510 states and 2141 transitions. [2024-10-11 05:06:04,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 3 states have internal predecessors, (45), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 05:06:04,589 INFO L276 IsEmpty]: Start isEmpty. Operand 1510 states and 2141 transitions. [2024-10-11 05:06:04,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-10-11 05:06:04,591 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:06:04,591 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 05:06:04,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 05:06:04,592 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:06:04,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:06:04,592 INFO L85 PathProgramCache]: Analyzing trace with hash -85159151, now seen corresponding path program 1 times [2024-10-11 05:06:04,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:06:04,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248472049] [2024-10-11 05:06:04,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:06:04,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:06:04,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:04,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:06:04,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:04,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 05:06:04,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:04,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 05:06:04,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:04,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 05:06:04,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:04,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 05:06:04,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:04,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 05:06:04,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:04,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 05:06:04,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:04,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 05:06:04,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:04,686 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-10-11 05:06:04,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:06:04,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248472049] [2024-10-11 05:06:04,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248472049] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 05:06:04,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1136297467] [2024-10-11 05:06:04,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:06:04,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 05:06:04,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 05:06:04,689 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 05:06:04,690 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 05:06:04,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:04,794 INFO L255 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 05:06:04,804 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 05:06:04,833 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 05:06:04,833 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 05:06:04,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1136297467] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:06:04,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 05:06:04,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-10-11 05:06:04,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293289239] [2024-10-11 05:06:04,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:06:04,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 05:06:04,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:06:04,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 05:06:04,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:06:04,835 INFO L87 Difference]: Start difference. First operand 1510 states and 2141 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 05:06:05,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:06:05,046 INFO L93 Difference]: Finished difference Result 4347 states and 6205 transitions. [2024-10-11 05:06:05,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 05:06:05,047 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 83 [2024-10-11 05:06:05,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:06:05,065 INFO L225 Difference]: With dead ends: 4347 [2024-10-11 05:06:05,066 INFO L226 Difference]: Without dead ends: 1874 [2024-10-11 05:06:05,075 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:06:05,076 INFO L432 NwaCegarLoop]: 220 mSDtfsCounter, 107 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 05:06:05,076 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 338 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 05:06:05,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1874 states. [2024-10-11 05:06:05,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1874 to 1874. [2024-10-11 05:06:05,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1874 states, 1469 states have (on average 1.3989108236895849) internal successors, (2055), 1505 states have internal predecessors, (2055), 236 states have call successors, (236), 148 states have call predecessors, (236), 168 states have return successors, (355), 224 states have call predecessors, (355), 236 states have call successors, (355) [2024-10-11 05:06:05,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1874 states to 1874 states and 2646 transitions. [2024-10-11 05:06:05,254 INFO L78 Accepts]: Start accepts. Automaton has 1874 states and 2646 transitions. Word has length 83 [2024-10-11 05:06:05,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:06:05,256 INFO L471 AbstractCegarLoop]: Abstraction has 1874 states and 2646 transitions. [2024-10-11 05:06:05,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 05:06:05,257 INFO L276 IsEmpty]: Start isEmpty. Operand 1874 states and 2646 transitions. [2024-10-11 05:06:05,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-10-11 05:06:05,260 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:06:05,260 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2024-10-11 05:06:05,285 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 05:06:05,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-10-11 05:06:05,465 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:06:05,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:06:05,465 INFO L85 PathProgramCache]: Analyzing trace with hash 1245465491, now seen corresponding path program 1 times [2024-10-11 05:06:05,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:06:05,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641347608] [2024-10-11 05:06:05,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:06:05,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:06:05,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:05,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:06:05,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:05,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 05:06:05,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:05,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 05:06:05,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:05,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 05:06:05,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:05,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 05:06:05,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:05,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 05:06:05,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:05,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 05:06:05,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:05,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-11 05:06:05,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:05,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 05:06:05,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:05,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-11 05:06:05,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:05,570 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-10-11 05:06:05,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:06:05,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641347608] [2024-10-11 05:06:05,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641347608] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 05:06:05,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [528727835] [2024-10-11 05:06:05,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:06:05,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 05:06:05,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 05:06:05,573 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 05:06:05,575 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 05:06:05,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:05,685 INFO L255 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 05:06:05,688 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 05:06:05,792 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 05:06:05,792 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 05:06:05,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [528727835] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:06:05,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 05:06:05,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2024-10-11 05:06:05,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646516839] [2024-10-11 05:06:05,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:06:05,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 05:06:05,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:06:05,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 05:06:05,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:06:05,794 INFO L87 Difference]: Start difference. First operand 1874 states and 2646 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 2 states have internal predecessors, (75), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-11 05:06:06,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:06:06,043 INFO L93 Difference]: Finished difference Result 4478 states and 6389 transitions. [2024-10-11 05:06:06,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 05:06:06,044 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 2 states have internal predecessors, (75), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 106 [2024-10-11 05:06:06,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:06:06,064 INFO L225 Difference]: With dead ends: 4478 [2024-10-11 05:06:06,064 INFO L226 Difference]: Without dead ends: 2973 [2024-10-11 05:06:06,071 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:06:06,072 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 66 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 05:06:06,072 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 235 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 05:06:06,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2973 states. [2024-10-11 05:06:06,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2973 to 2946. [2024-10-11 05:06:06,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2946 states, 2316 states have (on average 1.3933506044905009) internal successors, (3227), 2369 states have internal predecessors, (3227), 364 states have call successors, (364), 233 states have call predecessors, (364), 265 states have return successors, (535), 347 states have call predecessors, (535), 364 states have call successors, (535) [2024-10-11 05:06:06,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2946 states to 2946 states and 4126 transitions. [2024-10-11 05:06:06,452 INFO L78 Accepts]: Start accepts. Automaton has 2946 states and 4126 transitions. Word has length 106 [2024-10-11 05:06:06,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:06:06,453 INFO L471 AbstractCegarLoop]: Abstraction has 2946 states and 4126 transitions. [2024-10-11 05:06:06,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 2 states have internal predecessors, (75), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-11 05:06:06,453 INFO L276 IsEmpty]: Start isEmpty. Operand 2946 states and 4126 transitions. [2024-10-11 05:06:06,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-11 05:06:06,461 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:06:06,461 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-10-11 05:06:06,481 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 05:06:06,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-10-11 05:06:06,662 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:06:06,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:06:06,663 INFO L85 PathProgramCache]: Analyzing trace with hash -818577926, now seen corresponding path program 1 times [2024-10-11 05:06:06,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:06:06,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725754198] [2024-10-11 05:06:06,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:06:06,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:06:06,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:06,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:06:06,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:06,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 05:06:06,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:06,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 05:06:06,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:06,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 05:06:06,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:06,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 05:06:06,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:06,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 05:06:06,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:06,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 05:06:06,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:06,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 05:06:06,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:06,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 05:06:06,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:06,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 05:06:06,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:06,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 05:06:06,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:06,787 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2024-10-11 05:06:06,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:06:06,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725754198] [2024-10-11 05:06:06,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725754198] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 05:06:06,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [718728257] [2024-10-11 05:06:06,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:06:06,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 05:06:06,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 05:06:06,790 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 05:06:06,792 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 05:06:06,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:06,894 INFO L255 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 05:06:06,897 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 05:06:06,932 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-10-11 05:06:06,934 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 05:06:06,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [718728257] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:06:06,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 05:06:06,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-10-11 05:06:06,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328748638] [2024-10-11 05:06:06,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:06:06,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 05:06:06,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:06:06,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 05:06:06,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:06:06,937 INFO L87 Difference]: Start difference. First operand 2946 states and 4126 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2024-10-11 05:06:07,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:06:07,219 INFO L93 Difference]: Finished difference Result 6308 states and 8930 transitions. [2024-10-11 05:06:07,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 05:06:07,220 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) Word has length 121 [2024-10-11 05:06:07,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:06:07,242 INFO L225 Difference]: With dead ends: 6308 [2024-10-11 05:06:07,242 INFO L226 Difference]: Without dead ends: 3370 [2024-10-11 05:06:07,252 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:06:07,253 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 111 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 05:06:07,253 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 142 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 05:06:07,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3370 states. [2024-10-11 05:06:07,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3370 to 3275. [2024-10-11 05:06:07,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3275 states, 2620 states have (on average 1.3198473282442749) internal successors, (3458), 2668 states have internal predecessors, (3458), 360 states have call successors, (360), 259 states have call predecessors, (360), 294 states have return successors, (517), 351 states have call predecessors, (517), 360 states have call successors, (517) [2024-10-11 05:06:07,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3275 states to 3275 states and 4335 transitions. [2024-10-11 05:06:07,536 INFO L78 Accepts]: Start accepts. Automaton has 3275 states and 4335 transitions. Word has length 121 [2024-10-11 05:06:07,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:06:07,536 INFO L471 AbstractCegarLoop]: Abstraction has 3275 states and 4335 transitions. [2024-10-11 05:06:07,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2024-10-11 05:06:07,537 INFO L276 IsEmpty]: Start isEmpty. Operand 3275 states and 4335 transitions. [2024-10-11 05:06:07,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-11 05:06:07,543 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:06:07,543 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-10-11 05:06:07,562 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 05:06:07,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 05:06:07,748 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:06:07,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:06:07,749 INFO L85 PathProgramCache]: Analyzing trace with hash -179793447, now seen corresponding path program 2 times [2024-10-11 05:06:07,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:06:07,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472891637] [2024-10-11 05:06:07,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:06:07,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:06:07,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:07,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:06:07,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:07,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 05:06:07,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:07,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 05:06:07,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:07,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 05:06:07,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:07,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 05:06:07,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:07,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 05:06:07,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:07,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 05:06:07,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:07,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 05:06:07,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:07,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 05:06:07,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:07,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 05:06:07,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:07,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 05:06:07,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:07,847 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2024-10-11 05:06:07,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:06:07,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472891637] [2024-10-11 05:06:07,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472891637] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 05:06:07,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [518240879] [2024-10-11 05:06:07,848 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 05:06:07,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 05:06:07,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 05:06:07,850 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 05:06:07,852 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 05:06:07,925 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-11 05:06:07,925 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 05:06:07,927 INFO L255 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 05:06:07,930 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 05:06:07,958 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2024-10-11 05:06:07,959 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 05:06:07,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [518240879] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:06:07,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 05:06:07,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 6 [2024-10-11 05:06:07,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459673000] [2024-10-11 05:06:07,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:06:07,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 05:06:07,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:06:07,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 05:06:07,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:06:07,964 INFO L87 Difference]: Start difference. First operand 3275 states and 4335 transitions. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-11 05:06:08,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:06:08,294 INFO L93 Difference]: Finished difference Result 6561 states and 8878 transitions. [2024-10-11 05:06:08,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 05:06:08,294 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 121 [2024-10-11 05:06:08,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:06:08,312 INFO L225 Difference]: With dead ends: 6561 [2024-10-11 05:06:08,312 INFO L226 Difference]: Without dead ends: 3295 [2024-10-11 05:06:08,322 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:06:08,323 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 0 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 05:06:08,323 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 355 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 05:06:08,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3295 states. [2024-10-11 05:06:08,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3295 to 3295. [2024-10-11 05:06:08,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3295 states, 2640 states have (on average 1.2965909090909091) internal successors, (3423), 2688 states have internal predecessors, (3423), 360 states have call successors, (360), 259 states have call predecessors, (360), 294 states have return successors, (517), 351 states have call predecessors, (517), 360 states have call successors, (517) [2024-10-11 05:06:08,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3295 states to 3295 states and 4300 transitions. [2024-10-11 05:06:08,609 INFO L78 Accepts]: Start accepts. Automaton has 3295 states and 4300 transitions. Word has length 121 [2024-10-11 05:06:08,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:06:08,609 INFO L471 AbstractCegarLoop]: Abstraction has 3295 states and 4300 transitions. [2024-10-11 05:06:08,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-11 05:06:08,609 INFO L276 IsEmpty]: Start isEmpty. Operand 3295 states and 4300 transitions. [2024-10-11 05:06:08,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-11 05:06:08,615 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:06:08,615 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-10-11 05:06:08,633 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-11 05:06:08,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-10-11 05:06:08,816 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:06:08,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:06:08,816 INFO L85 PathProgramCache]: Analyzing trace with hash -633846563, now seen corresponding path program 1 times [2024-10-11 05:06:08,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:06:08,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892364284] [2024-10-11 05:06:08,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:06:08,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:06:08,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:08,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:06:08,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:08,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 05:06:08,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:08,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 05:06:08,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:08,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 05:06:08,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:08,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 05:06:08,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:08,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 05:06:08,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:08,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 05:06:08,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:08,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 05:06:08,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:08,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 05:06:09,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:09,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 05:06:09,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:09,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 05:06:09,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:09,023 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-10-11 05:06:09,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:06:09,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892364284] [2024-10-11 05:06:09,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892364284] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:06:09,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:06:09,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 05:06:09,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463044982] [2024-10-11 05:06:09,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:06:09,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 05:06:09,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:06:09,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 05:06:09,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 05:06:09,027 INFO L87 Difference]: Start difference. First operand 3295 states and 4300 transitions. Second operand has 8 states, 8 states have (on average 7.875) internal successors, (63), 6 states have internal predecessors, (63), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-11 05:06:09,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:06:09,845 INFO L93 Difference]: Finished difference Result 5147 states and 6673 transitions. [2024-10-11 05:06:09,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-11 05:06:09,846 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 6 states have internal predecessors, (63), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 121 [2024-10-11 05:06:09,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:06:09,861 INFO L225 Difference]: With dead ends: 5147 [2024-10-11 05:06:09,861 INFO L226 Difference]: Without dead ends: 3103 [2024-10-11 05:06:09,867 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=246, Unknown=0, NotChecked=0, Total=342 [2024-10-11 05:06:09,868 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 310 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 533 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 320 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 593 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 533 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 05:06:09,868 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [320 Valid, 375 Invalid, 593 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 533 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 05:06:09,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3103 states. [2024-10-11 05:06:10,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3103 to 2681. [2024-10-11 05:06:10,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2681 states, 2147 states have (on average 1.2817885421518398) internal successors, (2752), 2184 states have internal predecessors, (2752), 294 states have call successors, (294), 209 states have call predecessors, (294), 239 states have return successors, (399), 289 states have call predecessors, (399), 294 states have call successors, (399) [2024-10-11 05:06:10,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2681 states to 2681 states and 3445 transitions. [2024-10-11 05:06:10,242 INFO L78 Accepts]: Start accepts. Automaton has 2681 states and 3445 transitions. Word has length 121 [2024-10-11 05:06:10,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:06:10,243 INFO L471 AbstractCegarLoop]: Abstraction has 2681 states and 3445 transitions. [2024-10-11 05:06:10,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 6 states have internal predecessors, (63), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-11 05:06:10,243 INFO L276 IsEmpty]: Start isEmpty. Operand 2681 states and 3445 transitions. [2024-10-11 05:06:10,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-11 05:06:10,247 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:06:10,247 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-10-11 05:06:10,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-11 05:06:10,247 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:06:10,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:06:10,248 INFO L85 PathProgramCache]: Analyzing trace with hash 1243216667, now seen corresponding path program 1 times [2024-10-11 05:06:10,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:06:10,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246760207] [2024-10-11 05:06:10,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:06:10,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:06:10,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:10,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:06:10,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:10,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 05:06:10,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:10,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 05:06:10,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:10,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 05:06:10,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:10,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 05:06:10,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:10,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 05:06:10,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:10,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 05:06:10,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:10,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 05:06:10,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:10,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 05:06:10,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:10,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 05:06:10,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:10,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 05:06:10,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:10,449 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-10-11 05:06:10,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:06:10,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246760207] [2024-10-11 05:06:10,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246760207] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:06:10,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:06:10,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 05:06:10,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402774269] [2024-10-11 05:06:10,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:06:10,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 05:06:10,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:06:10,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 05:06:10,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 05:06:10,453 INFO L87 Difference]: Start difference. First operand 2681 states and 3445 transitions. Second operand has 8 states, 8 states have (on average 7.875) internal successors, (63), 6 states have internal predecessors, (63), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-11 05:06:11,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:06:11,180 INFO L93 Difference]: Finished difference Result 4840 states and 6212 transitions. [2024-10-11 05:06:11,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 05:06:11,181 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 6 states have internal predecessors, (63), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 121 [2024-10-11 05:06:11,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:06:11,189 INFO L225 Difference]: With dead ends: 4840 [2024-10-11 05:06:11,190 INFO L226 Difference]: Without dead ends: 2784 [2024-10-11 05:06:11,194 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=221, Unknown=0, NotChecked=0, Total=306 [2024-10-11 05:06:11,194 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 296 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 583 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 304 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 643 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 05:06:11,195 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [304 Valid, 397 Invalid, 643 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 583 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 05:06:11,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2784 states. [2024-10-11 05:06:11,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2784 to 2348. [2024-10-11 05:06:11,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2348 states, 1883 states have (on average 1.2867764206054169) internal successors, (2423), 1909 states have internal predecessors, (2423), 260 states have call successors, (260), 183 states have call predecessors, (260), 204 states have return successors, (343), 256 states have call predecessors, (343), 260 states have call successors, (343) [2024-10-11 05:06:11,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2348 states to 2348 states and 3026 transitions. [2024-10-11 05:06:11,397 INFO L78 Accepts]: Start accepts. Automaton has 2348 states and 3026 transitions. Word has length 121 [2024-10-11 05:06:11,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:06:11,398 INFO L471 AbstractCegarLoop]: Abstraction has 2348 states and 3026 transitions. [2024-10-11 05:06:11,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 6 states have internal predecessors, (63), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-11 05:06:11,398 INFO L276 IsEmpty]: Start isEmpty. Operand 2348 states and 3026 transitions. [2024-10-11 05:06:11,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-11 05:06:11,400 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:06:11,401 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-10-11 05:06:11,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-11 05:06:11,401 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:06:11,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:06:11,402 INFO L85 PathProgramCache]: Analyzing trace with hash 472483101, now seen corresponding path program 1 times [2024-10-11 05:06:11,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:06:11,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460976478] [2024-10-11 05:06:11,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:06:11,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:06:11,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:11,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:06:11,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:11,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 05:06:11,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:11,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 05:06:11,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:11,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 05:06:11,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:11,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 05:06:11,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:11,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 05:06:11,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:11,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 05:06:11,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:11,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 05:06:11,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:11,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 05:06:11,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:11,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 05:06:11,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:11,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 05:06:11,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:11,512 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 10 proven. 24 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-10-11 05:06:11,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:06:11,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460976478] [2024-10-11 05:06:11,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460976478] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 05:06:11,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [151314389] [2024-10-11 05:06:11,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:06:11,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 05:06:11,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 05:06:11,517 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 05:06:11,519 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-11 05:06:11,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:11,609 INFO L255 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 05:06:11,612 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 05:06:11,623 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-11 05:06:11,627 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 05:06:11,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [151314389] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:06:11,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 05:06:11,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 6 [2024-10-11 05:06:11,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238352509] [2024-10-11 05:06:11,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:06:11,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 05:06:11,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:06:11,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 05:06:11,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:06:11,631 INFO L87 Difference]: Start difference. First operand 2348 states and 3026 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-11 05:06:11,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:06:11,855 INFO L93 Difference]: Finished difference Result 4747 states and 6152 transitions. [2024-10-11 05:06:11,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 05:06:11,856 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) Word has length 121 [2024-10-11 05:06:11,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:06:11,867 INFO L225 Difference]: With dead ends: 4747 [2024-10-11 05:06:11,867 INFO L226 Difference]: Without dead ends: 2409 [2024-10-11 05:06:11,872 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:06:11,873 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 112 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 05:06:11,873 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 235 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 05:06:11,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2409 states. [2024-10-11 05:06:12,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2409 to 2327. [2024-10-11 05:06:12,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2327 states, 1862 states have (on average 1.2561761546723953) internal successors, (2339), 1888 states have internal predecessors, (2339), 260 states have call successors, (260), 183 states have call predecessors, (260), 204 states have return successors, (343), 256 states have call predecessors, (343), 260 states have call successors, (343) [2024-10-11 05:06:12,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2327 states to 2327 states and 2942 transitions. [2024-10-11 05:06:12,080 INFO L78 Accepts]: Start accepts. Automaton has 2327 states and 2942 transitions. Word has length 121 [2024-10-11 05:06:12,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:06:12,081 INFO L471 AbstractCegarLoop]: Abstraction has 2327 states and 2942 transitions. [2024-10-11 05:06:12,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-11 05:06:12,082 INFO L276 IsEmpty]: Start isEmpty. Operand 2327 states and 2942 transitions. [2024-10-11 05:06:12,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-11 05:06:12,086 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:06:12,086 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-10-11 05:06:12,103 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-11 05:06:12,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 05:06:12,287 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:06:12,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:06:12,288 INFO L85 PathProgramCache]: Analyzing trace with hash -1804669548, now seen corresponding path program 1 times [2024-10-11 05:06:12,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:06:12,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599706456] [2024-10-11 05:06:12,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:06:12,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:06:12,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:12,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:06:12,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:12,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 05:06:12,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:12,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 05:06:12,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:12,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 05:06:12,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:12,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 05:06:12,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:12,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 05:06:12,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:12,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 05:06:12,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:12,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 05:06:12,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:12,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 05:06:12,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:12,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 05:06:12,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:12,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 05:06:12,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:12,395 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 22 proven. 2 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-10-11 05:06:12,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:06:12,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599706456] [2024-10-11 05:06:12,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599706456] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 05:06:12,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [310323054] [2024-10-11 05:06:12,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:06:12,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 05:06:12,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 05:06:12,398 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 05:06:12,400 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-11 05:06:12,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:12,491 INFO L255 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 05:06:12,494 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 05:06:12,514 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-10-11 05:06:12,515 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 05:06:12,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [310323054] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:06:12,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 05:06:12,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2024-10-11 05:06:12,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656738810] [2024-10-11 05:06:12,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:06:12,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 05:06:12,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:06:12,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 05:06:12,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 05:06:12,517 INFO L87 Difference]: Start difference. First operand 2327 states and 2942 transitions. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2024-10-11 05:06:12,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:06:12,813 INFO L93 Difference]: Finished difference Result 6798 states and 8593 transitions. [2024-10-11 05:06:12,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 05:06:12,814 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 122 [2024-10-11 05:06:12,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:06:12,833 INFO L225 Difference]: With dead ends: 6798 [2024-10-11 05:06:12,833 INFO L226 Difference]: Without dead ends: 4481 [2024-10-11 05:06:12,840 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 05:06:12,841 INFO L432 NwaCegarLoop]: 204 mSDtfsCounter, 105 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 05:06:12,841 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 318 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 05:06:12,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4481 states. [2024-10-11 05:06:13,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4481 to 4247. [2024-10-11 05:06:13,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4247 states, 3402 states have (on average 1.2404467960023515) internal successors, (4220), 3453 states have internal predecessors, (4220), 472 states have call successors, (472), 337 states have call predecessors, (472), 372 states have return successors, (627), 458 states have call predecessors, (627), 472 states have call successors, (627) [2024-10-11 05:06:13,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4247 states to 4247 states and 5319 transitions. [2024-10-11 05:06:13,180 INFO L78 Accepts]: Start accepts. Automaton has 4247 states and 5319 transitions. Word has length 122 [2024-10-11 05:06:13,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:06:13,181 INFO L471 AbstractCegarLoop]: Abstraction has 4247 states and 5319 transitions. [2024-10-11 05:06:13,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2024-10-11 05:06:13,182 INFO L276 IsEmpty]: Start isEmpty. Operand 4247 states and 5319 transitions. [2024-10-11 05:06:13,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-10-11 05:06:13,185 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:06:13,185 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-10-11 05:06:13,204 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-11 05:06:13,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-10-11 05:06:13,387 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:06:13,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:06:13,387 INFO L85 PathProgramCache]: Analyzing trace with hash -50566100, now seen corresponding path program 1 times [2024-10-11 05:06:13,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:06:13,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997234132] [2024-10-11 05:06:13,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:06:13,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:06:13,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:13,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:06:13,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:13,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 05:06:13,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:13,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 05:06:13,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:13,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 05:06:13,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:13,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 05:06:13,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:13,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-11 05:06:13,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:13,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-11 05:06:13,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:13,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 05:06:13,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:13,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 05:06:13,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:13,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 05:06:13,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:13,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 05:06:13,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:13,493 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 35 proven. 6 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-10-11 05:06:13,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:06:13,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997234132] [2024-10-11 05:06:13,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997234132] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 05:06:13,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1273073476] [2024-10-11 05:06:13,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:06:13,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 05:06:13,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 05:06:13,495 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 05:06:13,497 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-11 05:06:13,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:13,587 INFO L255 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 05:06:13,589 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 05:06:13,640 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-11 05:06:13,641 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 05:06:13,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1273073476] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:06:13,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 05:06:13,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 6 [2024-10-11 05:06:13,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568772352] [2024-10-11 05:06:13,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:06:13,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 05:06:13,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:06:13,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 05:06:13,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:06:13,644 INFO L87 Difference]: Start difference. First operand 4247 states and 5319 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2024-10-11 05:06:13,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:06:13,988 INFO L93 Difference]: Finished difference Result 6340 states and 8128 transitions. [2024-10-11 05:06:13,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 05:06:13,988 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 123 [2024-10-11 05:06:13,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:06:14,008 INFO L225 Difference]: With dead ends: 6340 [2024-10-11 05:06:14,009 INFO L226 Difference]: Without dead ends: 4029 [2024-10-11 05:06:14,017 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:06:14,017 INFO L432 NwaCegarLoop]: 200 mSDtfsCounter, 72 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 05:06:14,018 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 309 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 05:06:14,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4029 states. [2024-10-11 05:06:14,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4029 to 3995. [2024-10-11 05:06:14,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3995 states, 3203 states have (on average 1.2182329066500157) internal successors, (3902), 3253 states have internal predecessors, (3902), 443 states have call successors, (443), 317 states have call predecessors, (443), 348 states have return successors, (581), 426 states have call predecessors, (581), 443 states have call successors, (581) [2024-10-11 05:06:14,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3995 states to 3995 states and 4926 transitions. [2024-10-11 05:06:14,630 INFO L78 Accepts]: Start accepts. Automaton has 3995 states and 4926 transitions. Word has length 123 [2024-10-11 05:06:14,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:06:14,631 INFO L471 AbstractCegarLoop]: Abstraction has 3995 states and 4926 transitions. [2024-10-11 05:06:14,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2024-10-11 05:06:14,631 INFO L276 IsEmpty]: Start isEmpty. Operand 3995 states and 4926 transitions. [2024-10-11 05:06:14,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-10-11 05:06:14,635 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:06:14,635 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-10-11 05:06:14,653 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-11 05:06:14,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 05:06:14,840 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:06:14,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:06:14,841 INFO L85 PathProgramCache]: Analyzing trace with hash 865400034, now seen corresponding path program 1 times [2024-10-11 05:06:14,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:06:14,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121931222] [2024-10-11 05:06:14,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:06:14,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:06:14,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:14,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:06:14,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:14,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 05:06:14,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:14,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 05:06:14,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:14,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 05:06:14,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:14,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 05:06:14,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:14,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-11 05:06:14,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:14,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-11 05:06:14,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:14,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 05:06:14,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:14,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 05:06:14,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:14,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 05:06:14,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:15,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-11 05:06:15,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:15,004 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2024-10-11 05:06:15,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:06:15,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121931222] [2024-10-11 05:06:15,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121931222] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:06:15,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:06:15,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 05:06:15,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478743189] [2024-10-11 05:06:15,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:06:15,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 05:06:15,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:06:15,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 05:06:15,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:06:15,008 INFO L87 Difference]: Start difference. First operand 3995 states and 4926 transitions. Second operand has 6 states, 6 states have (on average 12.5) internal successors, (75), 4 states have internal predecessors, (75), 4 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2024-10-11 05:06:16,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:06:16,001 INFO L93 Difference]: Finished difference Result 8449 states and 10385 transitions. [2024-10-11 05:06:16,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 05:06:16,002 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 4 states have internal predecessors, (75), 4 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) Word has length 124 [2024-10-11 05:06:16,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:06:16,022 INFO L225 Difference]: With dead ends: 8449 [2024-10-11 05:06:16,023 INFO L226 Difference]: Without dead ends: 4944 [2024-10-11 05:06:16,031 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-10-11 05:06:16,032 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 384 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 409 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 05:06:16,033 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [409 Valid, 349 Invalid, 501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 05:06:16,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4944 states. [2024-10-11 05:06:16,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4944 to 4429. [2024-10-11 05:06:16,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4429 states, 3562 states have (on average 1.2139247613700168) internal successors, (4324), 3611 states have internal predecessors, (4324), 475 states have call successors, (475), 337 states have call predecessors, (475), 391 states have return successors, (610), 482 states have call predecessors, (610), 475 states have call successors, (610) [2024-10-11 05:06:16,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4429 states to 4429 states and 5409 transitions. [2024-10-11 05:06:16,478 INFO L78 Accepts]: Start accepts. Automaton has 4429 states and 5409 transitions. Word has length 124 [2024-10-11 05:06:16,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:06:16,479 INFO L471 AbstractCegarLoop]: Abstraction has 4429 states and 5409 transitions. [2024-10-11 05:06:16,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 4 states have internal predecessors, (75), 4 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2024-10-11 05:06:16,479 INFO L276 IsEmpty]: Start isEmpty. Operand 4429 states and 5409 transitions. [2024-10-11 05:06:16,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-11 05:06:16,483 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:06:16,483 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-10-11 05:06:16,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-11 05:06:16,484 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:06:16,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:06:16,484 INFO L85 PathProgramCache]: Analyzing trace with hash -1490897935, now seen corresponding path program 1 times [2024-10-11 05:06:16,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:06:16,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258692649] [2024-10-11 05:06:16,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:06:16,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:06:16,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:16,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:06:16,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:16,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 05:06:16,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:16,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 05:06:16,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:16,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 05:06:16,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:16,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 05:06:16,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:16,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 05:06:16,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:16,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 05:06:16,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:16,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 05:06:16,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:16,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 05:06:16,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:16,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 05:06:16,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:16,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 05:06:16,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:16,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 05:06:16,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:16,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 05:06:16,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:16,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 05:06:16,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:16,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-11 05:06:16,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:16,704 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 12 proven. 20 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2024-10-11 05:06:16,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:06:16,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258692649] [2024-10-11 05:06:16,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258692649] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 05:06:16,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [790742385] [2024-10-11 05:06:16,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:06:16,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 05:06:16,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 05:06:16,709 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 05:06:16,711 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-11 05:06:16,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:16,810 INFO L255 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 05:06:16,814 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 05:06:16,833 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-10-11 05:06:16,833 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 05:06:16,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [790742385] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:06:16,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 05:06:16,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2024-10-11 05:06:16,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585077950] [2024-10-11 05:06:16,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:06:16,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 05:06:16,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:06:16,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 05:06:16,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-11 05:06:16,835 INFO L87 Difference]: Start difference. First operand 4429 states and 5409 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 3 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2024-10-11 05:06:17,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:06:17,478 INFO L93 Difference]: Finished difference Result 9715 states and 11926 transitions. [2024-10-11 05:06:17,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 05:06:17,479 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), 3 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) Word has length 142 [2024-10-11 05:06:17,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:06:17,502 INFO L225 Difference]: With dead ends: 9715 [2024-10-11 05:06:17,502 INFO L226 Difference]: Without dead ends: 6120 [2024-10-11 05:06:17,513 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-11 05:06:17,513 INFO L432 NwaCegarLoop]: 172 mSDtfsCounter, 116 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 05:06:17,514 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 279 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 05:06:17,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6120 states. [2024-10-11 05:06:18,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6120 to 6117. [2024-10-11 05:06:18,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6117 states, 4913 states have (on average 1.2116832892326481) internal successors, (5953), 4976 states have internal predecessors, (5953), 664 states have call successors, (664), 471 states have call predecessors, (664), 539 states have return successors, (862), 671 states have call predecessors, (862), 664 states have call successors, (862) [2024-10-11 05:06:18,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6117 states to 6117 states and 7479 transitions. [2024-10-11 05:06:18,083 INFO L78 Accepts]: Start accepts. Automaton has 6117 states and 7479 transitions. Word has length 142 [2024-10-11 05:06:18,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:06:18,083 INFO L471 AbstractCegarLoop]: Abstraction has 6117 states and 7479 transitions. [2024-10-11 05:06:18,084 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), 3 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2024-10-11 05:06:18,084 INFO L276 IsEmpty]: Start isEmpty. Operand 6117 states and 7479 transitions. [2024-10-11 05:06:18,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-11 05:06:18,089 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:06:18,089 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-10-11 05:06:18,154 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-10-11 05:06:18,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2024-10-11 05:06:18,290 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:06:18,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:06:18,291 INFO L85 PathProgramCache]: Analyzing trace with hash -1983524109, now seen corresponding path program 1 times [2024-10-11 05:06:18,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:06:18,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740286185] [2024-10-11 05:06:18,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:06:18,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:06:18,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:18,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:06:18,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:18,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 05:06:18,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:18,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 05:06:18,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:18,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 05:06:18,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:18,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 05:06:18,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:18,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 05:06:18,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:18,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 05:06:18,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:18,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 05:06:18,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:18,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 05:06:18,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:18,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 05:06:18,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:18,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 05:06:18,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:18,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 05:06:18,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:18,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 05:06:18,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:18,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 05:06:18,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:18,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-11 05:06:18,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:18,477 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 12 proven. 20 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2024-10-11 05:06:18,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:06:18,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740286185] [2024-10-11 05:06:18,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740286185] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 05:06:18,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [70579823] [2024-10-11 05:06:18,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:06:18,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 05:06:18,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 05:06:18,480 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 05:06:18,481 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-11 05:06:18,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:18,577 INFO L255 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 05:06:18,580 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 05:06:18,722 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-10-11 05:06:18,722 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 05:06:18,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [70579823] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:06:18,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 05:06:18,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2024-10-11 05:06:18,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517401315] [2024-10-11 05:06:18,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:06:18,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 05:06:18,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:06:18,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 05:06:18,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-10-11 05:06:18,725 INFO L87 Difference]: Start difference. First operand 6117 states and 7479 transitions. Second operand has 4 states, 4 states have (on average 21.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-11 05:06:19,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:06:19,196 INFO L93 Difference]: Finished difference Result 9036 states and 11156 transitions. [2024-10-11 05:06:19,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 05:06:19,196 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 142 [2024-10-11 05:06:19,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:06:19,206 INFO L225 Difference]: With dead ends: 9036 [2024-10-11 05:06:19,207 INFO L226 Difference]: Without dead ends: 0 [2024-10-11 05:06:19,221 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-10-11 05:06:19,222 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 104 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 05:06:19,222 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 121 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 05:06:19,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-11 05:06:19,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-11 05:06:19,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 05:06:19,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-11 05:06:19,227 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 142 [2024-10-11 05:06:19,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:06:19,228 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-11 05:06:19,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-11 05:06:19,228 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-11 05:06:19,228 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-11 05:06:19,230 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2024-10-11 05:06:19,231 INFO L782 garLoopResultBuilder]: Registering result SAFE for location error1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-10-11 05:06:19,245 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-10-11 05:06:19,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,10 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 05:06:19,437 INFO L407 BasicCegarLoop]: Path program histogram: [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] [2024-10-11 05:06:19,439 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.