./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_2.cil-1+token_ring.12.cil-2.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_2.cil-1+token_ring.12.cil-2.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 a46e7920fd800fb5978581c250ecd4216776e6eac1b8dfb89d2f8a9c2732a33c --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 05:04:40,782 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 05:04:40,864 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:04:40,868 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 05:04:40,869 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 05:04:40,896 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 05:04:40,896 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 05:04:40,897 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 05:04:40,898 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 05:04:40,898 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 05:04:40,898 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 05:04:40,899 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 05:04:40,899 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 05:04:40,900 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 05:04:40,900 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 05:04:40,901 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 05:04:40,901 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 05:04:40,901 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 05:04:40,902 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 05:04:40,902 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 05:04:40,902 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 05:04:40,906 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 05:04:40,907 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 05:04:40,907 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 05:04:40,907 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 05:04:40,907 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 05:04:40,908 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 05:04:40,908 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 05:04:40,908 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 05:04:40,908 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 05:04:40,909 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 05:04:40,909 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 05:04:40,909 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 05:04:40,909 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 05:04:40,910 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 05:04:40,910 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 05:04:40,913 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 05:04:40,913 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 05:04:40,914 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 05:04:40,914 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 05:04:40,914 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 05:04:40,915 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 05:04:40,915 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 -> a46e7920fd800fb5978581c250ecd4216776e6eac1b8dfb89d2f8a9c2732a33c [2024-10-11 05:04:41,179 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 05:04:41,203 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 05:04:41,207 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 05:04:41,208 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 05:04:41,208 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 05:04:41,210 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.12.cil-2.c [2024-10-11 05:04:42,643 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 05:04:42,894 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 05:04:42,895 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.12.cil-2.c [2024-10-11 05:04:42,915 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/9d95e735b/476b3533d5b14d9786f47435d1c71674/FLAGab9f462f4 [2024-10-11 05:04:42,941 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/9d95e735b/476b3533d5b14d9786f47435d1c71674 [2024-10-11 05:04:42,944 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 05:04:42,945 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 05:04:42,947 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 05:04:42,947 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 05:04:42,952 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 05:04:42,953 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:04:42" (1/1) ... [2024-10-11 05:04:42,955 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18aac3ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:04:42, skipping insertion in model container [2024-10-11 05:04:42,956 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:04:42" (1/1) ... [2024-10-11 05:04:43,013 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 05:04:43,201 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_2.cil-1+token_ring.12.cil-2.c[914,927] [2024-10-11 05:04:43,267 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_2.cil-1+token_ring.12.cil-2.c[7115,7128] [2024-10-11 05:04:43,387 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 05:04:43,414 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 05:04:43,429 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_2.cil-1+token_ring.12.cil-2.c[914,927] [2024-10-11 05:04:43,450 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_2.cil-1+token_ring.12.cil-2.c[7115,7128] [2024-10-11 05:04:43,543 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 05:04:43,600 INFO L204 MainTranslator]: Completed translation [2024-10-11 05:04:43,601 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:04:43 WrapperNode [2024-10-11 05:04:43,601 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 05:04:43,602 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 05:04:43,602 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 05:04:43,603 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 05:04:43,609 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:04:43" (1/1) ... [2024-10-11 05:04:43,625 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:04:43" (1/1) ... [2024-10-11 05:04:43,676 INFO L138 Inliner]: procedures = 77, calls = 93, calls flagged for inlining = 46, calls inlined = 46, statements flattened = 1068 [2024-10-11 05:04:43,677 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 05:04:43,677 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 05:04:43,678 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 05:04:43,678 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 05:04:43,689 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:04:43" (1/1) ... [2024-10-11 05:04:43,690 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:04:43" (1/1) ... [2024-10-11 05:04:43,694 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:04:43" (1/1) ... [2024-10-11 05:04:43,725 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:04:43,725 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:04:43" (1/1) ... [2024-10-11 05:04:43,725 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:04:43" (1/1) ... [2024-10-11 05:04:43,749 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:04:43" (1/1) ... [2024-10-11 05:04:43,766 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:04:43" (1/1) ... [2024-10-11 05:04:43,773 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:04:43" (1/1) ... [2024-10-11 05:04:43,781 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:04:43" (1/1) ... [2024-10-11 05:04:43,789 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 05:04:43,790 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 05:04:43,790 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 05:04:43,790 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 05:04:43,791 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:04:43" (1/1) ... [2024-10-11 05:04:43,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 05:04:43,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 05:04:43,849 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:04:43,854 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:04:43,903 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 05:04:43,904 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-10-11 05:04:43,904 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-10-11 05:04:43,904 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2024-10-11 05:04:43,904 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2024-10-11 05:04:43,904 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2024-10-11 05:04:43,904 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2024-10-11 05:04:43,905 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2024-10-11 05:04:43,905 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2024-10-11 05:04:43,906 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2024-10-11 05:04:43,906 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2024-10-11 05:04:43,906 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2024-10-11 05:04:43,906 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2024-10-11 05:04:43,907 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2024-10-11 05:04:43,907 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2024-10-11 05:04:43,907 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2024-10-11 05:04:43,907 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2024-10-11 05:04:43,907 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2024-10-11 05:04:43,907 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2024-10-11 05:04:43,907 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2024-10-11 05:04:43,908 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2024-10-11 05:04:43,908 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2024-10-11 05:04:43,908 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2024-10-11 05:04:43,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 05:04:43,908 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2024-10-11 05:04:43,909 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2024-10-11 05:04:43,909 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2024-10-11 05:04:43,910 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2024-10-11 05:04:43,910 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 05:04:43,910 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 05:04:43,911 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2024-10-11 05:04:43,911 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2024-10-11 05:04:44,055 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 05:04:44,058 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 05:04:45,140 INFO L? ?]: Removed 127 outVars from TransFormulas that were not future-live. [2024-10-11 05:04:45,141 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 05:04:45,218 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 05:04:45,221 INFO L314 CfgBuilder]: Removed 19 assume(true) statements. [2024-10-11 05:04:45,221 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:04:45 BoogieIcfgContainer [2024-10-11 05:04:45,222 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 05:04:45,224 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 05:04:45,224 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 05:04:45,227 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 05:04:45,228 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 05:04:42" (1/3) ... [2024-10-11 05:04:45,228 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24bbf971 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:04:45, skipping insertion in model container [2024-10-11 05:04:45,228 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:04:43" (2/3) ... [2024-10-11 05:04:45,230 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24bbf971 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:04:45, skipping insertion in model container [2024-10-11 05:04:45,230 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:04:45" (3/3) ... [2024-10-11 05:04:45,231 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-1+token_ring.12.cil-2.c [2024-10-11 05:04:45,247 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 05:04:45,247 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-11 05:04:45,325 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 05:04:45,331 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;@6cef94f6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 05:04:45,331 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-11 05:04:45,342 INFO L276 IsEmpty]: Start isEmpty. Operand has 439 states, 382 states have (on average 1.7146596858638743) internal successors, (655), 388 states have internal predecessors, (655), 40 states have call successors, (40), 14 states have call predecessors, (40), 14 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-11 05:04:45,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-11 05:04:45,355 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:04:45,355 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:04:45,356 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:04:45,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:04:45,361 INFO L85 PathProgramCache]: Analyzing trace with hash 204893055, now seen corresponding path program 1 times [2024-10-11 05:04:45,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:04:45,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97951657] [2024-10-11 05:04:45,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:04:45,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:04:45,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:45,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:04:45,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:45,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:04:45,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:45,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:04:45,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:45,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:04:45,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:45,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 05:04:45,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:45,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 05:04:45,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:45,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:04:45,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:45,935 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:04:45,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:04:45,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97951657] [2024-10-11 05:04:45,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97951657] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:04:45,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:04:45,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 05:04:45,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179125965] [2024-10-11 05:04:45,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:04:45,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 05:04:45,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:04:45,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 05:04:45,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-11 05:04:45,968 INFO L87 Difference]: Start difference. First operand has 439 states, 382 states have (on average 1.7146596858638743) internal successors, (655), 388 states have internal predecessors, (655), 40 states have call successors, (40), 14 states have call predecessors, (40), 14 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) Second operand has 8 states, 8 states have (on average 5.375) internal successors, (43), 5 states have internal predecessors, (43), 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:04:47,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:04:47,583 INFO L93 Difference]: Finished difference Result 978 states and 1621 transitions. [2024-10-11 05:04:47,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 05:04:47,587 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 5 states have internal predecessors, (43), 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 58 [2024-10-11 05:04:47,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:04:47,602 INFO L225 Difference]: With dead ends: 978 [2024-10-11 05:04:47,602 INFO L226 Difference]: Without dead ends: 559 [2024-10-11 05:04:47,608 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2024-10-11 05:04:47,611 INFO L432 NwaCegarLoop]: 353 mSDtfsCounter, 1483 mSDsluCounter, 1135 mSDsCounter, 0 mSdLazyCounter, 1427 mSolverCounterSat, 235 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1488 SdHoareTripleChecker+Valid, 1488 SdHoareTripleChecker+Invalid, 1662 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 235 IncrementalHoareTripleChecker+Valid, 1427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-11 05:04:47,612 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1488 Valid, 1488 Invalid, 1662 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [235 Valid, 1427 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-11 05:04:47,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2024-10-11 05:04:47,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 522. [2024-10-11 05:04:47,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 522 states, 447 states have (on average 1.58165548098434) internal successors, (707), 453 states have internal predecessors, (707), 51 states have call successors, (51), 21 states have call predecessors, (51), 22 states have return successors, (54), 50 states have call predecessors, (54), 49 states have call successors, (54) [2024-10-11 05:04:47,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 812 transitions. [2024-10-11 05:04:47,731 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 812 transitions. Word has length 58 [2024-10-11 05:04:47,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:04:47,732 INFO L471 AbstractCegarLoop]: Abstraction has 522 states and 812 transitions. [2024-10-11 05:04:47,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 5 states have internal predecessors, (43), 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:04:47,733 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 812 transitions. [2024-10-11 05:04:47,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-11 05:04:47,737 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:04:47,737 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:04:47,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 05:04:47,739 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:04:47,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:04:47,741 INFO L85 PathProgramCache]: Analyzing trace with hash -886268992, now seen corresponding path program 1 times [2024-10-11 05:04:47,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:04:47,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520823122] [2024-10-11 05:04:47,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:04:47,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:04:47,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:47,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:04:47,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:47,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:04:47,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:47,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:04:47,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:47,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:04:47,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:47,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 05:04:47,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:47,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 05:04:47,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:47,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:04:47,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:47,957 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:04:47,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:04:47,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520823122] [2024-10-11 05:04:47,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520823122] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:04:47,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:04:47,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 05:04:47,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805112218] [2024-10-11 05:04:47,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:04:47,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 05:04:47,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:04:47,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 05:04:47,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 05:04:47,962 INFO L87 Difference]: Start difference. First operand 522 states and 812 transitions. Second operand has 8 states, 8 states have (on average 5.375) internal successors, (43), 6 states have internal predecessors, (43), 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:04:49,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:04:49,438 INFO L93 Difference]: Finished difference Result 842 states and 1262 transitions. [2024-10-11 05:04:49,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-11 05:04:49,439 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 6 states have internal predecessors, (43), 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 58 [2024-10-11 05:04:49,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:04:49,444 INFO L225 Difference]: With dead ends: 842 [2024-10-11 05:04:49,444 INFO L226 Difference]: Without dead ends: 680 [2024-10-11 05:04:49,445 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:04:49,449 INFO L432 NwaCegarLoop]: 376 mSDtfsCounter, 1711 mSDsluCounter, 1297 mSDsCounter, 0 mSdLazyCounter, 1688 mSolverCounterSat, 181 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1742 SdHoareTripleChecker+Valid, 1673 SdHoareTripleChecker+Invalid, 1869 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 181 IncrementalHoareTripleChecker+Valid, 1688 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-11 05:04:49,450 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1742 Valid, 1673 Invalid, 1869 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [181 Valid, 1688 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-11 05:04:49,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 680 states. [2024-10-11 05:04:49,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 680 to 610. [2024-10-11 05:04:49,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 610 states, 515 states have (on average 1.5592233009708738) internal successors, (803), 523 states have internal predecessors, (803), 62 states have call successors, (62), 28 states have call predecessors, (62), 31 states have return successors, (73), 62 states have call predecessors, (73), 60 states have call successors, (73) [2024-10-11 05:04:49,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 938 transitions. [2024-10-11 05:04:49,505 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 938 transitions. Word has length 58 [2024-10-11 05:04:49,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:04:49,506 INFO L471 AbstractCegarLoop]: Abstraction has 610 states and 938 transitions. [2024-10-11 05:04:49,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 6 states have internal predecessors, (43), 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:04:49,506 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 938 transitions. [2024-10-11 05:04:49,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-11 05:04:49,508 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:04:49,509 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:04:49,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 05:04:49,509 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:04:49,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:04:49,510 INFO L85 PathProgramCache]: Analyzing trace with hash 1042003710, now seen corresponding path program 1 times [2024-10-11 05:04:49,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:04:49,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010787899] [2024-10-11 05:04:49,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:04:49,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:04:49,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:49,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:04:49,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:49,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:04:49,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:49,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:04:49,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:49,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:04:49,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:49,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 05:04:49,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:49,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 05:04:49,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:49,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:04:49,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:49,681 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:04:49,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:04:49,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010787899] [2024-10-11 05:04:49,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010787899] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:04:49,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:04:49,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 05:04:49,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931876079] [2024-10-11 05:04:49,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:04:49,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 05:04:49,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:04:49,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 05:04:49,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-11 05:04:49,685 INFO L87 Difference]: Start difference. First operand 610 states and 938 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:04:51,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:04:51,006 INFO L93 Difference]: Finished difference Result 884 states and 1324 transitions. [2024-10-11 05:04:51,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 05:04:51,007 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:04:51,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:04:51,015 INFO L225 Difference]: With dead ends: 884 [2024-10-11 05:04:51,015 INFO L226 Difference]: Without dead ends: 640 [2024-10-11 05:04:51,016 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:04:51,018 INFO L432 NwaCegarLoop]: 352 mSDtfsCounter, 910 mSDsluCounter, 1786 mSDsCounter, 0 mSdLazyCounter, 2077 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 911 SdHoareTripleChecker+Valid, 2138 SdHoareTripleChecker+Invalid, 2208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 2077 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-11 05:04:51,022 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [911 Valid, 2138 Invalid, 2208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 2077 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-11 05:04:51,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states. [2024-10-11 05:04:51,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 614. [2024-10-11 05:04:51,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 614 states, 518 states have (on average 1.5521235521235521) internal successors, (804), 526 states have internal predecessors, (804), 62 states have call successors, (62), 28 states have call predecessors, (62), 32 states have return successors, (74), 63 states have call predecessors, (74), 60 states have call successors, (74) [2024-10-11 05:04:51,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 614 states and 940 transitions. [2024-10-11 05:04:51,071 INFO L78 Accepts]: Start accepts. Automaton has 614 states and 940 transitions. Word has length 58 [2024-10-11 05:04:51,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:04:51,072 INFO L471 AbstractCegarLoop]: Abstraction has 614 states and 940 transitions. [2024-10-11 05:04:51,072 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:04:51,072 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 940 transitions. [2024-10-11 05:04:51,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-11 05:04:51,078 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:04:51,078 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:04:51,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 05:04:51,079 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:04:51,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:04:51,079 INFO L85 PathProgramCache]: Analyzing trace with hash -1201979588, now seen corresponding path program 1 times [2024-10-11 05:04:51,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:04:51,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659417618] [2024-10-11 05:04:51,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:04:51,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:04:51,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:51,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:04:51,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:51,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:04:51,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:51,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:04:51,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:51,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:04:51,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:51,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 05:04:51,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:51,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 05:04:51,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:51,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:04:51,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:51,264 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:04:51,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:04:51,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659417618] [2024-10-11 05:04:51,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659417618] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:04:51,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:04:51,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 05:04:51,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478052002] [2024-10-11 05:04:51,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:04:51,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 05:04:51,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:04:51,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 05:04:51,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-10-11 05:04:51,267 INFO L87 Difference]: Start difference. First operand 614 states and 940 transitions. Second operand has 10 states, 9 states have (on average 4.777777777777778) internal successors, (43), 7 states have internal predecessors, (43), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2024-10-11 05:04:53,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:04:53,198 INFO L93 Difference]: Finished difference Result 1838 states and 2638 transitions. [2024-10-11 05:04:53,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-10-11 05:04:53,199 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.777777777777778) internal successors, (43), 7 states have internal predecessors, (43), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 58 [2024-10-11 05:04:53,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:04:53,207 INFO L225 Difference]: With dead ends: 1838 [2024-10-11 05:04:53,207 INFO L226 Difference]: Without dead ends: 1572 [2024-10-11 05:04:53,209 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=257, Invalid=1075, Unknown=0, NotChecked=0, Total=1332 [2024-10-11 05:04:53,212 INFO L432 NwaCegarLoop]: 383 mSDtfsCounter, 3437 mSDsluCounter, 1832 mSDsCounter, 0 mSdLazyCounter, 1981 mSolverCounterSat, 552 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3451 SdHoareTripleChecker+Valid, 2215 SdHoareTripleChecker+Invalid, 2533 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 552 IncrementalHoareTripleChecker+Valid, 1981 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-11 05:04:53,214 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3451 Valid, 2215 Invalid, 2533 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [552 Valid, 1981 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-11 05:04:53,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1572 states. [2024-10-11 05:04:53,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1572 to 1449. [2024-10-11 05:04:53,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1449 states, 1167 states have (on average 1.437017994858612) internal successors, (1677), 1190 states have internal predecessors, (1677), 150 states have call successors, (150), 111 states have call predecessors, (150), 130 states have return successors, (188), 150 states have call predecessors, (188), 148 states have call successors, (188) [2024-10-11 05:04:53,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1449 states to 1449 states and 2015 transitions. [2024-10-11 05:04:53,353 INFO L78 Accepts]: Start accepts. Automaton has 1449 states and 2015 transitions. Word has length 58 [2024-10-11 05:04:53,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:04:53,354 INFO L471 AbstractCegarLoop]: Abstraction has 1449 states and 2015 transitions. [2024-10-11 05:04:53,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.777777777777778) internal successors, (43), 7 states have internal predecessors, (43), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2024-10-11 05:04:53,355 INFO L276 IsEmpty]: Start isEmpty. Operand 1449 states and 2015 transitions. [2024-10-11 05:04:53,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-11 05:04:53,356 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:04:53,357 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:04:53,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 05:04:53,357 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:04:53,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:04:53,358 INFO L85 PathProgramCache]: Analyzing trace with hash 424762129, now seen corresponding path program 1 times [2024-10-11 05:04:53,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:04:53,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833242386] [2024-10-11 05:04:53,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:04:53,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:04:53,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:53,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:04:53,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:53,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:04:53,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:53,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:04:53,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:53,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:04:53,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:53,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 05:04:53,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:53,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 05:04:53,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:53,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:04:53,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:53,525 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:04:53,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:04:53,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833242386] [2024-10-11 05:04:53,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833242386] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:04:53,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:04:53,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 05:04:53,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259247302] [2024-10-11 05:04:53,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:04:53,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 05:04:53,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:04:53,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 05:04:53,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-11 05:04:53,528 INFO L87 Difference]: Start difference. First operand 1449 states and 2015 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:04:54,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:04:54,827 INFO L93 Difference]: Finished difference Result 2638 states and 3586 transitions. [2024-10-11 05:04:54,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 05:04:54,828 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:04:54,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:04:54,836 INFO L225 Difference]: With dead ends: 2638 [2024-10-11 05:04:54,837 INFO L226 Difference]: Without dead ends: 1543 [2024-10-11 05:04:54,839 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2024-10-11 05:04:54,840 INFO L432 NwaCegarLoop]: 349 mSDtfsCounter, 614 mSDsluCounter, 2059 mSDsCounter, 0 mSdLazyCounter, 2135 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 616 SdHoareTripleChecker+Valid, 2408 SdHoareTripleChecker+Invalid, 2222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 2135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-11 05:04:54,841 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [616 Valid, 2408 Invalid, 2222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 2135 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-11 05:04:54,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1543 states. [2024-10-11 05:04:54,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1543 to 1473. [2024-10-11 05:04:54,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1473 states, 1185 states have (on average 1.4236286919831223) internal successors, (1687), 1208 states have internal predecessors, (1687), 150 states have call successors, (150), 111 states have call predecessors, (150), 136 states have return successors, (194), 156 states have call predecessors, (194), 148 states have call successors, (194) [2024-10-11 05:04:54,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1473 states to 1473 states and 2031 transitions. [2024-10-11 05:04:54,944 INFO L78 Accepts]: Start accepts. Automaton has 1473 states and 2031 transitions. Word has length 59 [2024-10-11 05:04:54,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:04:54,944 INFO L471 AbstractCegarLoop]: Abstraction has 1473 states and 2031 transitions. [2024-10-11 05:04:54,944 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:04:54,945 INFO L276 IsEmpty]: Start isEmpty. Operand 1473 states and 2031 transitions. [2024-10-11 05:04:54,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-11 05:04:54,946 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:04:54,946 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:04:54,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 05:04:54,947 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:04:54,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:04:54,948 INFO L85 PathProgramCache]: Analyzing trace with hash -1946977133, now seen corresponding path program 1 times [2024-10-11 05:04:54,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:04:54,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102356997] [2024-10-11 05:04:54,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:04:54,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:04:54,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:55,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:04:55,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:55,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:04:55,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:55,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:04:55,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:55,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:04:55,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:55,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 05:04:55,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:55,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 05:04:55,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:55,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:04:55,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:55,112 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:04:55,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:04:55,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102356997] [2024-10-11 05:04:55,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102356997] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:04:55,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:04:55,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 05:04:55,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064190719] [2024-10-11 05:04:55,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:04:55,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 05:04:55,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:04:55,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 05:04:55,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 05:04:55,116 INFO L87 Difference]: Start difference. First operand 1473 states and 2031 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:04:56,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:04:56,436 INFO L93 Difference]: Finished difference Result 2623 states and 3473 transitions. [2024-10-11 05:04:56,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-11 05:04:56,437 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:04:56,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:04:56,446 INFO L225 Difference]: With dead ends: 2623 [2024-10-11 05:04:56,446 INFO L226 Difference]: Without dead ends: 1711 [2024-10-11 05:04:56,448 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2024-10-11 05:04:56,449 INFO L432 NwaCegarLoop]: 321 mSDtfsCounter, 1351 mSDsluCounter, 1429 mSDsCounter, 0 mSdLazyCounter, 1681 mSolverCounterSat, 134 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1380 SdHoareTripleChecker+Valid, 1750 SdHoareTripleChecker+Invalid, 1815 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 1681 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-11 05:04:56,451 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1380 Valid, 1750 Invalid, 1815 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 1681 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-11 05:04:56,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1711 states. [2024-10-11 05:04:56,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1711 to 1418. [2024-10-11 05:04:56,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1418 states, 1146 states have (on average 1.4214659685863875) internal successors, (1629), 1164 states have internal predecessors, (1629), 144 states have call successors, (144), 106 states have call predecessors, (144), 126 states have return successors, (179), 149 states have call predecessors, (179), 142 states have call successors, (179) [2024-10-11 05:04:56,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1418 states to 1418 states and 1952 transitions. [2024-10-11 05:04:56,550 INFO L78 Accepts]: Start accepts. Automaton has 1418 states and 1952 transitions. Word has length 59 [2024-10-11 05:04:56,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:04:56,550 INFO L471 AbstractCegarLoop]: Abstraction has 1418 states and 1952 transitions. [2024-10-11 05:04:56,550 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:04:56,550 INFO L276 IsEmpty]: Start isEmpty. Operand 1418 states and 1952 transitions. [2024-10-11 05:04:56,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-11 05:04:56,555 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:04:56,555 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:04:56,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 05:04:56,556 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:04:56,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:04:56,556 INFO L85 PathProgramCache]: Analyzing trace with hash -1728122415, now seen corresponding path program 1 times [2024-10-11 05:04:56,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:04:56,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852111209] [2024-10-11 05:04:56,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:04:56,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:04:56,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:56,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:04:56,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:56,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:04:56,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:56,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:04:56,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:56,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:04:56,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:56,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 05:04:56,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:56,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 05:04:56,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:56,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:04:56,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:56,684 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:04:56,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:04:56,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852111209] [2024-10-11 05:04:56,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852111209] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:04:56,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:04:56,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:04:56,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294675013] [2024-10-11 05:04:56,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:04:56,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:04:56,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:04:56,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:04:56,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:04:56,686 INFO L87 Difference]: Start difference. First operand 1418 states and 1952 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:04:57,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:04:57,538 INFO L93 Difference]: Finished difference Result 3567 states and 4723 transitions. [2024-10-11 05:04:57,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 05:04:57,539 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:04:57,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:04:57,550 INFO L225 Difference]: With dead ends: 3567 [2024-10-11 05:04:57,551 INFO L226 Difference]: Without dead ends: 2504 [2024-10-11 05:04:57,554 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2024-10-11 05:04:57,556 INFO L432 NwaCegarLoop]: 316 mSDtfsCounter, 1662 mSDsluCounter, 864 mSDsCounter, 0 mSdLazyCounter, 716 mSolverCounterSat, 189 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1695 SdHoareTripleChecker+Valid, 1180 SdHoareTripleChecker+Invalid, 905 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 189 IncrementalHoareTripleChecker+Valid, 716 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 05:04:57,557 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1695 Valid, 1180 Invalid, 905 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [189 Valid, 716 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 05:04:57,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2504 states. [2024-10-11 05:04:57,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2504 to 2388. [2024-10-11 05:04:57,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2388 states, 1873 states have (on average 1.3497063534436733) internal successors, (2528), 1908 states have internal predecessors, (2528), 263 states have call successors, (263), 205 states have call predecessors, (263), 250 states have return successors, (370), 277 states have call predecessors, (370), 261 states have call successors, (370) [2024-10-11 05:04:57,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2388 states to 2388 states and 3161 transitions. [2024-10-11 05:04:57,765 INFO L78 Accepts]: Start accepts. Automaton has 2388 states and 3161 transitions. Word has length 59 [2024-10-11 05:04:57,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:04:57,766 INFO L471 AbstractCegarLoop]: Abstraction has 2388 states and 3161 transitions. [2024-10-11 05:04:57,766 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:04:57,766 INFO L276 IsEmpty]: Start isEmpty. Operand 2388 states and 3161 transitions. [2024-10-11 05:04:57,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-11 05:04:57,767 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:04:57,767 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:04:57,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 05:04:57,768 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:04:57,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:04:57,768 INFO L85 PathProgramCache]: Analyzing trace with hash -1349667701, now seen corresponding path program 1 times [2024-10-11 05:04:57,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:04:57,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752404468] [2024-10-11 05:04:57,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:04:57,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:04:57,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:57,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:04:57,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:57,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:04:57,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:57,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:04:57,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:57,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:04:57,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:57,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 05:04:57,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:57,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 05:04:57,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:57,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:04:57,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:57,852 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:04:57,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:04:57,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752404468] [2024-10-11 05:04:57,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752404468] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:04:57,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:04:57,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 05:04:57,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435094091] [2024-10-11 05:04:57,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:04:57,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 05:04:57,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:04:57,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 05:04:57,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:04:57,855 INFO L87 Difference]: Start difference. First operand 2388 states and 3161 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:04:58,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:04:58,714 INFO L93 Difference]: Finished difference Result 5440 states and 7042 transitions. [2024-10-11 05:04:58,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 05:04:58,715 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:04:58,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:04:58,733 INFO L225 Difference]: With dead ends: 5440 [2024-10-11 05:04:58,733 INFO L226 Difference]: Without dead ends: 3412 [2024-10-11 05:04:58,738 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2024-10-11 05:04:58,738 INFO L432 NwaCegarLoop]: 349 mSDtfsCounter, 1124 mSDsluCounter, 830 mSDsCounter, 0 mSdLazyCounter, 906 mSolverCounterSat, 175 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1132 SdHoareTripleChecker+Valid, 1179 SdHoareTripleChecker+Invalid, 1081 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 175 IncrementalHoareTripleChecker+Valid, 906 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 05:04:58,739 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1132 Valid, 1179 Invalid, 1081 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [175 Valid, 906 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 05:04:58,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3412 states. [2024-10-11 05:04:59,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3412 to 3154. [2024-10-11 05:04:59,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3154 states, 2453 states have (on average 1.326946596004892) internal successors, (3255), 2493 states have internal predecessors, (3255), 355 states have call successors, (355), 285 states have call predecessors, (355), 344 states have return successors, (484), 378 states have call predecessors, (484), 353 states have call successors, (484) [2024-10-11 05:04:59,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3154 states to 3154 states and 4094 transitions. [2024-10-11 05:04:59,027 INFO L78 Accepts]: Start accepts. Automaton has 3154 states and 4094 transitions. Word has length 60 [2024-10-11 05:04:59,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:04:59,027 INFO L471 AbstractCegarLoop]: Abstraction has 3154 states and 4094 transitions. [2024-10-11 05:04:59,028 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:04:59,028 INFO L276 IsEmpty]: Start isEmpty. Operand 3154 states and 4094 transitions. [2024-10-11 05:04:59,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-10-11 05:04:59,030 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:04:59,030 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:04:59,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 05:04:59,030 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:04:59,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:04:59,031 INFO L85 PathProgramCache]: Analyzing trace with hash 1520239242, now seen corresponding path program 1 times [2024-10-11 05:04:59,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:04:59,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942926220] [2024-10-11 05:04:59,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:04:59,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:04:59,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:59,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:04:59,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:59,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:04:59,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:59,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:04:59,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:59,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:04:59,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:59,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 05:04:59,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:59,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 05:04:59,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:59,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:04:59,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:59,104 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:04:59,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:04:59,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942926220] [2024-10-11 05:04:59,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942926220] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:04:59,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:04:59,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 05:04:59,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744939146] [2024-10-11 05:04:59,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:04:59,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 05:04:59,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:04:59,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 05:04:59,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:04:59,107 INFO L87 Difference]: Start difference. First operand 3154 states and 4094 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 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:04:59,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:04:59,936 INFO L93 Difference]: Finished difference Result 6718 states and 8560 transitions. [2024-10-11 05:04:59,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 05:04:59,937 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 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 66 [2024-10-11 05:04:59,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:04:59,957 INFO L225 Difference]: With dead ends: 6718 [2024-10-11 05:04:59,957 INFO L226 Difference]: Without dead ends: 3922 [2024-10-11 05:04:59,965 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2024-10-11 05:04:59,966 INFO L432 NwaCegarLoop]: 360 mSDtfsCounter, 1628 mSDsluCounter, 599 mSDsCounter, 0 mSdLazyCounter, 623 mSolverCounterSat, 166 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1662 SdHoareTripleChecker+Valid, 959 SdHoareTripleChecker+Invalid, 789 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 166 IncrementalHoareTripleChecker+Valid, 623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 05:04:59,966 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1662 Valid, 959 Invalid, 789 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [166 Valid, 623 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 05:04:59,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3922 states. [2024-10-11 05:05:00,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3922 to 3658. [2024-10-11 05:05:00,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3658 states, 2843 states have (on average 1.3172704889201547) internal successors, (3745), 2887 states have internal predecessors, (3745), 411 states have call successors, (411), 335 states have call predecessors, (411), 402 states have return successors, (557), 438 states have call predecessors, (557), 409 states have call successors, (557) [2024-10-11 05:05:00,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3658 states to 3658 states and 4713 transitions. [2024-10-11 05:05:00,266 INFO L78 Accepts]: Start accepts. Automaton has 3658 states and 4713 transitions. Word has length 66 [2024-10-11 05:05:00,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:05:00,267 INFO L471 AbstractCegarLoop]: Abstraction has 3658 states and 4713 transitions. [2024-10-11 05:05:00,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 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:05:00,267 INFO L276 IsEmpty]: Start isEmpty. Operand 3658 states and 4713 transitions. [2024-10-11 05:05:00,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-10-11 05:05:00,268 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:05:00,269 INFO L215 NwaCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:00,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 05:05:00,269 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:05:00,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:05:00,269 INFO L85 PathProgramCache]: Analyzing trace with hash -634166033, now seen corresponding path program 1 times [2024-10-11 05:05:00,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:05:00,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947775081] [2024-10-11 05:05:00,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:05:00,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:05:00,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:00,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:05:00,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:00,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:05:00,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:00,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:05:00,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:00,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:05:00,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:00,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 05:05:00,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:00,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 05:05:00,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:00,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:05:00,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:00,369 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:05:00,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:05:00,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947775081] [2024-10-11 05:05:00,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947775081] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:05:00,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:05:00,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:05:00,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104624135] [2024-10-11 05:05:00,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:05:00,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:05:00,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:05:00,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:05:00,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:05:00,371 INFO L87 Difference]: Start difference. First operand 3658 states and 4713 transitions. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-11 05:05:01,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:05:01,445 INFO L93 Difference]: Finished difference Result 4666 states and 5930 transitions. [2024-10-11 05:05:01,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 05:05:01,446 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 67 [2024-10-11 05:05:01,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:05:01,467 INFO L225 Difference]: With dead ends: 4666 [2024-10-11 05:05:01,467 INFO L226 Difference]: Without dead ends: 4663 [2024-10-11 05:05:01,469 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2024-10-11 05:05:01,469 INFO L432 NwaCegarLoop]: 353 mSDtfsCounter, 2274 mSDsluCounter, 582 mSDsCounter, 0 mSdLazyCounter, 638 mSolverCounterSat, 322 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2284 SdHoareTripleChecker+Valid, 935 SdHoareTripleChecker+Invalid, 960 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 322 IncrementalHoareTripleChecker+Valid, 638 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 05:05:01,470 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2284 Valid, 935 Invalid, 960 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [322 Valid, 638 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 05:05:01,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4663 states. [2024-10-11 05:05:01,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4663 to 4078. [2024-10-11 05:05:01,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4078 states, 3156 states have (on average 1.3051330798479088) internal successors, (4119), 3203 states have internal predecessors, (4119), 461 states have call successors, (461), 379 states have call predecessors, (461), 459 states have return successors, (634), 498 states have call predecessors, (634), 460 states have call successors, (634) [2024-10-11 05:05:01,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4078 states to 4078 states and 5214 transitions. [2024-10-11 05:05:01,925 INFO L78 Accepts]: Start accepts. Automaton has 4078 states and 5214 transitions. Word has length 67 [2024-10-11 05:05:01,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:05:01,927 INFO L471 AbstractCegarLoop]: Abstraction has 4078 states and 5214 transitions. [2024-10-11 05:05:01,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-11 05:05:01,927 INFO L276 IsEmpty]: Start isEmpty. Operand 4078 states and 5214 transitions. [2024-10-11 05:05:01,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-11 05:05:01,928 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:05:01,929 INFO L215 NwaCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:01,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 05:05:01,929 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:05:01,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:05:01,930 INFO L85 PathProgramCache]: Analyzing trace with hash 1814243188, now seen corresponding path program 1 times [2024-10-11 05:05:01,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:05:01,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952685545] [2024-10-11 05:05:01,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:05:01,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:05:01,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:02,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:05:02,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:02,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:05:02,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:02,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:05:02,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:02,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:05:02,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:02,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 05:05:02,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:02,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 05:05:02,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:02,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:05:02,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:02,089 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:05:02,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:05:02,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952685545] [2024-10-11 05:05:02,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952685545] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 05:05:02,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [942044467] [2024-10-11 05:05:02,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:05:02,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 05:05:02,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 05:05:02,092 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:05:02,094 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:05:02,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:02,218 INFO L255 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-11 05:05:02,225 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 05:05:02,461 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:05:02,461 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 05:05:02,558 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:05:02,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [942044467] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 05:05:02,559 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 05:05:02,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 4] total 10 [2024-10-11 05:05:02,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390258432] [2024-10-11 05:05:02,559 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 05:05:02,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 05:05:02,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:05:02,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 05:05:02,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-10-11 05:05:02,560 INFO L87 Difference]: Start difference. First operand 4078 states and 5214 transitions. Second operand has 10 states, 10 states have (on average 10.9) internal successors, (109), 7 states have internal predecessors, (109), 4 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2024-10-11 05:05:04,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:05:04,702 INFO L93 Difference]: Finished difference Result 8050 states and 10077 transitions. [2024-10-11 05:05:04,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-10-11 05:05:04,703 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 10.9) internal successors, (109), 7 states have internal predecessors, (109), 4 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 68 [2024-10-11 05:05:04,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:05:04,742 INFO L225 Difference]: With dead ends: 8050 [2024-10-11 05:05:04,742 INFO L226 Difference]: Without dead ends: 8047 [2024-10-11 05:05:04,745 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=163, Invalid=593, Unknown=0, NotChecked=0, Total=756 [2024-10-11 05:05:04,746 INFO L432 NwaCegarLoop]: 424 mSDtfsCounter, 2368 mSDsluCounter, 1624 mSDsCounter, 0 mSdLazyCounter, 1973 mSolverCounterSat, 256 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2432 SdHoareTripleChecker+Valid, 2048 SdHoareTripleChecker+Invalid, 2229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 256 IncrementalHoareTripleChecker+Valid, 1973 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-11 05:05:04,746 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2432 Valid, 2048 Invalid, 2229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [256 Valid, 1973 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-11 05:05:04,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8047 states. [2024-10-11 05:05:05,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8047 to 7195. [2024-10-11 05:05:05,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7195 states, 5531 states have (on average 1.2840354366299043) internal successors, (7102), 5613 states have internal predecessors, (7102), 820 states have call successors, (820), 693 states have call predecessors, (820), 842 states have return successors, (1135), 891 states have call predecessors, (1135), 819 states have call successors, (1135) [2024-10-11 05:05:05,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7195 states to 7195 states and 9057 transitions. [2024-10-11 05:05:05,612 INFO L78 Accepts]: Start accepts. Automaton has 7195 states and 9057 transitions. Word has length 68 [2024-10-11 05:05:05,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:05:05,613 INFO L471 AbstractCegarLoop]: Abstraction has 7195 states and 9057 transitions. [2024-10-11 05:05:05,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.9) internal successors, (109), 7 states have internal predecessors, (109), 4 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2024-10-11 05:05:05,613 INFO L276 IsEmpty]: Start isEmpty. Operand 7195 states and 9057 transitions. [2024-10-11 05:05:05,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-11 05:05:05,615 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:05:05,615 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:05:05,634 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:05:05,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-10-11 05:05:05,817 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:05:05,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:05:05,817 INFO L85 PathProgramCache]: Analyzing trace with hash -1384081233, now seen corresponding path program 2 times [2024-10-11 05:05:05,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:05:05,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411156659] [2024-10-11 05:05:05,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:05:05,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:05:05,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:05,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:05:05,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:05,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:05:05,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:05,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:05:05,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:05,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:05:05,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:05,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 05:05:05,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:05,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 05:05:05,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:05,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:05:05,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:05,887 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:05:05,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:05:05,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411156659] [2024-10-11 05:05:05,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411156659] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:05:05,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:05:05,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 05:05:05,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208328217] [2024-10-11 05:05:05,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:05:05,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 05:05:05,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:05:05,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 05:05:05,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:05:05,890 INFO L87 Difference]: Start difference. First operand 7195 states and 9057 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-11 05:05:06,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:05:06,738 INFO L93 Difference]: Finished difference Result 9583 states and 12060 transitions. [2024-10-11 05:05:06,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 05:05:06,738 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 71 [2024-10-11 05:05:06,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:05:06,755 INFO L225 Difference]: With dead ends: 9583 [2024-10-11 05:05:06,756 INFO L226 Difference]: Without dead ends: 3945 [2024-10-11 05:05:06,766 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-10-11 05:05:06,767 INFO L432 NwaCegarLoop]: 375 mSDtfsCounter, 1545 mSDsluCounter, 615 mSDsCounter, 0 mSdLazyCounter, 658 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1581 SdHoareTripleChecker+Valid, 990 SdHoareTripleChecker+Invalid, 794 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 658 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 05:05:06,767 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1581 Valid, 990 Invalid, 794 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 658 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 05:05:06,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3945 states. [2024-10-11 05:05:07,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3945 to 3009. [2024-10-11 05:05:07,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3009 states, 2351 states have (on average 1.2994470438111443) internal successors, (3055), 2379 states have internal predecessors, (3055), 339 states have call successors, (339), 275 states have call predecessors, (339), 317 states have return successors, (434), 357 states have call predecessors, (434), 338 states have call successors, (434) [2024-10-11 05:05:07,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3009 states to 3009 states and 3828 transitions. [2024-10-11 05:05:07,030 INFO L78 Accepts]: Start accepts. Automaton has 3009 states and 3828 transitions. Word has length 71 [2024-10-11 05:05:07,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:05:07,031 INFO L471 AbstractCegarLoop]: Abstraction has 3009 states and 3828 transitions. [2024-10-11 05:05:07,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-11 05:05:07,031 INFO L276 IsEmpty]: Start isEmpty. Operand 3009 states and 3828 transitions. [2024-10-11 05:05:07,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-11 05:05:07,033 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:05:07,033 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:05:07,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 05:05:07,033 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:05:07,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:05:07,034 INFO L85 PathProgramCache]: Analyzing trace with hash 1923995982, now seen corresponding path program 1 times [2024-10-11 05:05:07,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:05:07,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768614260] [2024-10-11 05:05:07,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:05:07,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:05:07,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:07,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:05:07,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:07,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:05:07,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:07,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:05:07,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:07,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:05:07,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:07,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 05:05:07,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:07,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 05:05:07,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:07,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:05:07,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:07,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 05:05:07,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:07,153 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 05:05:07,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:05:07,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768614260] [2024-10-11 05:05:07,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768614260] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:05:07,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:05:07,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 05:05:07,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286317206] [2024-10-11 05:05:07,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:05:07,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 05:05:07,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:05:07,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 05:05:07,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-11 05:05:07,155 INFO L87 Difference]: Start difference. First operand 3009 states and 3828 transitions. Second operand has 8 states, 8 states have (on average 7.0) internal successors, (56), 5 states have internal predecessors, (56), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-11 05:05:08,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:05:08,751 INFO L93 Difference]: Finished difference Result 8327 states and 10359 transitions. [2024-10-11 05:05:08,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-11 05:05:08,752 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 5 states have internal predecessors, (56), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 76 [2024-10-11 05:05:08,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:05:08,781 INFO L225 Difference]: With dead ends: 8327 [2024-10-11 05:05:08,781 INFO L226 Difference]: Without dead ends: 4937 [2024-10-11 05:05:08,791 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2024-10-11 05:05:08,792 INFO L432 NwaCegarLoop]: 363 mSDtfsCounter, 1429 mSDsluCounter, 1190 mSDsCounter, 0 mSdLazyCounter, 1386 mSolverCounterSat, 249 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1441 SdHoareTripleChecker+Valid, 1553 SdHoareTripleChecker+Invalid, 1635 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 249 IncrementalHoareTripleChecker+Valid, 1386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 05:05:08,792 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1441 Valid, 1553 Invalid, 1635 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [249 Valid, 1386 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 05:05:08,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4937 states. [2024-10-11 05:05:09,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4937 to 4677. [2024-10-11 05:05:09,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4677 states, 3584 states have (on average 1.2575334821428572) internal successors, (4507), 3649 states have internal predecessors, (4507), 539 states have call successors, (539), 447 states have call predecessors, (539), 552 states have return successors, (784), 583 states have call predecessors, (784), 538 states have call successors, (784) [2024-10-11 05:05:09,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4677 states to 4677 states and 5830 transitions. [2024-10-11 05:05:09,450 INFO L78 Accepts]: Start accepts. Automaton has 4677 states and 5830 transitions. Word has length 76 [2024-10-11 05:05:09,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:05:09,450 INFO L471 AbstractCegarLoop]: Abstraction has 4677 states and 5830 transitions. [2024-10-11 05:05:09,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 5 states have internal predecessors, (56), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-11 05:05:09,452 INFO L276 IsEmpty]: Start isEmpty. Operand 4677 states and 5830 transitions. [2024-10-11 05:05:09,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-10-11 05:05:09,454 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:05:09,454 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1] [2024-10-11 05:05:09,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 05:05:09,454 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:05:09,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:05:09,455 INFO L85 PathProgramCache]: Analyzing trace with hash -1804284816, now seen corresponding path program 1 times [2024-10-11 05:05:09,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:05:09,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384400830] [2024-10-11 05:05:09,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:05:09,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:05:09,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:09,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:05:09,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:09,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:05:09,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:09,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:05:09,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:09,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:05:09,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:09,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 05:05:09,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:09,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 05:05:09,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:09,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:05:09,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:09,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-11 05:05:09,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:09,605 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 05:05:09,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:05:09,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384400830] [2024-10-11 05:05:09,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384400830] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:05:09,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:05:09,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 05:05:09,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915886694] [2024-10-11 05:05:09,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:05:09,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 05:05:09,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:05:09,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 05:05:09,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-10-11 05:05:09,608 INFO L87 Difference]: Start difference. First operand 4677 states and 5830 transitions. Second operand has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 6 states have internal predecessors, (67), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-11 05:05:11,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:05:11,132 INFO L93 Difference]: Finished difference Result 7767 states and 9578 transitions. [2024-10-11 05:05:11,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-11 05:05:11,133 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 6 states have internal predecessors, (67), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 86 [2024-10-11 05:05:11,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:05:11,150 INFO L225 Difference]: With dead ends: 7767 [2024-10-11 05:05:11,150 INFO L226 Difference]: Without dead ends: 3924 [2024-10-11 05:05:11,159 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=162, Invalid=540, Unknown=0, NotChecked=0, Total=702 [2024-10-11 05:05:11,160 INFO L432 NwaCegarLoop]: 344 mSDtfsCounter, 2227 mSDsluCounter, 1198 mSDsCounter, 0 mSdLazyCounter, 1637 mSolverCounterSat, 359 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2266 SdHoareTripleChecker+Valid, 1542 SdHoareTripleChecker+Invalid, 1996 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 359 IncrementalHoareTripleChecker+Valid, 1637 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-11 05:05:11,160 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2266 Valid, 1542 Invalid, 1996 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [359 Valid, 1637 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-11 05:05:11,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3924 states. [2024-10-11 05:05:11,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3924 to 3520. [2024-10-11 05:05:11,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3520 states, 2693 states have (on average 1.2491645005569996) internal successors, (3364), 2746 states have internal predecessors, (3364), 404 states have call successors, (404), 329 states have call predecessors, (404), 421 states have return successors, (553), 447 states have call predecessors, (553), 403 states have call successors, (553) [2024-10-11 05:05:11,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3520 states to 3520 states and 4321 transitions. [2024-10-11 05:05:11,603 INFO L78 Accepts]: Start accepts. Automaton has 3520 states and 4321 transitions. Word has length 86 [2024-10-11 05:05:11,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:05:11,603 INFO L471 AbstractCegarLoop]: Abstraction has 3520 states and 4321 transitions. [2024-10-11 05:05:11,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 6 states have internal predecessors, (67), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-11 05:05:11,604 INFO L276 IsEmpty]: Start isEmpty. Operand 3520 states and 4321 transitions. [2024-10-11 05:05:11,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-11 05:05:11,607 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:05:11,607 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 05:05:11,607 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:05:11,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:05:11,608 INFO L85 PathProgramCache]: Analyzing trace with hash -1449862396, now seen corresponding path program 1 times [2024-10-11 05:05:11,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:05:11,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093762464] [2024-10-11 05:05:11,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:05:11,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:05:11,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:11,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:05:11,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:11,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:05:11,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:11,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:05:11,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:11,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:05:11,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:11,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 05:05:11,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:11,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 05:05:11,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:11,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:05:11,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:11,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 05:05:11,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:11,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-11 05:05:11,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:11,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 05:05:11,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:11,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 05:05:11,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:11,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:05:11,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:11,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 05:05:11,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:11,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 05:05:11,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:11,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 05:05:11,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:11,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 05:05:11,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:11,796 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 18 proven. 4 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-10-11 05:05:11,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:05:11,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093762464] [2024-10-11 05:05:11,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093762464] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 05:05:11,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [263622571] [2024-10-11 05:05:11,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:05:11,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 05:05:11,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 05:05:11,799 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:05:11,801 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:05:11,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:11,943 INFO L255 TraceCheckSpWp]: Trace formula consists of 553 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 05:05:11,947 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 05:05:11,989 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-11 05:05:11,990 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 05:05:11,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [263622571] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:05:11,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 05:05:11,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 12 [2024-10-11 05:05:11,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102943406] [2024-10-11 05:05:11,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:05:11,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 05:05:11,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:05:11,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 05:05:11,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-10-11 05:05:11,996 INFO L87 Difference]: Start difference. First operand 3520 states and 4321 transitions. Second operand has 6 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-11 05:05:12,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:05:12,259 INFO L93 Difference]: Finished difference Result 5111 states and 6229 transitions. [2024-10-11 05:05:12,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 05:05:12,259 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) Word has length 131 [2024-10-11 05:05:12,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:05:12,267 INFO L225 Difference]: With dead ends: 5111 [2024-10-11 05:05:12,268 INFO L226 Difference]: Without dead ends: 1951 [2024-10-11 05:05:12,275 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-10-11 05:05:12,275 INFO L432 NwaCegarLoop]: 631 mSDtfsCounter, 0 mSDsluCounter, 2517 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3148 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 05:05:12,276 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3148 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 05:05:12,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1951 states. [2024-10-11 05:05:12,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1951 to 1951. [2024-10-11 05:05:12,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1951 states, 1570 states have (on average 1.280891719745223) internal successors, (2011), 1586 states have internal predecessors, (2011), 193 states have call successors, (193), 143 states have call predecessors, (193), 186 states have return successors, (260), 222 states have call predecessors, (260), 192 states have call successors, (260) [2024-10-11 05:05:12,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1951 states to 1951 states and 2464 transitions. [2024-10-11 05:05:12,484 INFO L78 Accepts]: Start accepts. Automaton has 1951 states and 2464 transitions. Word has length 131 [2024-10-11 05:05:12,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:05:12,484 INFO L471 AbstractCegarLoop]: Abstraction has 1951 states and 2464 transitions. [2024-10-11 05:05:12,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-11 05:05:12,485 INFO L276 IsEmpty]: Start isEmpty. Operand 1951 states and 2464 transitions. [2024-10-11 05:05:12,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-10-11 05:05:12,488 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:05:12,488 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12,504 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-11 05:05:12,689 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,SelfDestructingSolverStorable14 [2024-10-11 05:05:12,689 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:05:12,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:05:12,690 INFO L85 PathProgramCache]: Analyzing trace with hash 1121280322, now seen corresponding path program 1 times [2024-10-11 05:05:12,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:05:12,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253831069] [2024-10-11 05:05:12,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:05:12,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:05:12,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:12,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:05:12,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:12,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:05:12,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:12,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:05:12,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:12,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:05:12,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:12,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 05:05:12,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:12,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 05:05:12,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:12,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:05:12,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:12,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 05:05:12,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:12,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 05:05:12,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:12,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-11 05:05:12,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:12,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 05:05:12,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:12,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:05:12,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:12,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 05:05:12,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:12,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 05:05:12,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:12,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 05:05:12,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:12,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-11 05:05:12,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:12,784 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2024-10-11 05:05:12,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:05:12,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253831069] [2024-10-11 05:05:12,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253831069] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:05:12,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:05:12,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 05:05:12,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584836214] [2024-10-11 05:05:12,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:05:12,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 05:05:12,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:05:12,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 05:05:12,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:05:12,787 INFO L87 Difference]: Start difference. First operand 1951 states and 2464 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 3 states have internal predecessors, (61), 3 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-11 05:05:13,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:05:13,618 INFO L93 Difference]: Finished difference Result 1999 states and 2514 transitions. [2024-10-11 05:05:13,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 05:05:13,618 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 3 states have internal predecessors, (61), 3 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 133 [2024-10-11 05:05:13,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:05:13,626 INFO L225 Difference]: With dead ends: 1999 [2024-10-11 05:05:13,626 INFO L226 Difference]: Without dead ends: 1659 [2024-10-11 05:05:13,627 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-10-11 05:05:13,628 INFO L432 NwaCegarLoop]: 343 mSDtfsCounter, 713 mSDsluCounter, 1056 mSDsCounter, 0 mSdLazyCounter, 915 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 725 SdHoareTripleChecker+Valid, 1399 SdHoareTripleChecker+Invalid, 1007 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 915 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 05:05:13,628 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [725 Valid, 1399 Invalid, 1007 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 915 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 05:05:13,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1659 states. [2024-10-11 05:05:13,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1659 to 1614. [2024-10-11 05:05:13,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1614 states, 1317 states have (on average 1.3052391799544418) internal successors, (1719), 1330 states have internal predecessors, (1719), 152 states have call successors, (152), 108 states have call predecessors, (152), 143 states have return successors, (205), 176 states have call predecessors, (205), 151 states have call successors, (205) [2024-10-11 05:05:13,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1614 states to 1614 states and 2076 transitions. [2024-10-11 05:05:13,772 INFO L78 Accepts]: Start accepts. Automaton has 1614 states and 2076 transitions. Word has length 133 [2024-10-11 05:05:13,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:05:13,772 INFO L471 AbstractCegarLoop]: Abstraction has 1614 states and 2076 transitions. [2024-10-11 05:05:13,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 3 states have internal predecessors, (61), 3 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-11 05:05:13,772 INFO L276 IsEmpty]: Start isEmpty. Operand 1614 states and 2076 transitions. [2024-10-11 05:05:13,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-10-11 05:05:13,775 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:05:13,775 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 05:05:13,776 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:05:13,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:05:13,776 INFO L85 PathProgramCache]: Analyzing trace with hash 1716805501, now seen corresponding path program 1 times [2024-10-11 05:05:13,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:05:13,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364922742] [2024-10-11 05:05:13,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:05:13,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:05:13,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:13,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:05:13,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:13,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:05:13,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:13,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:05:13,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:13,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:05:13,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:13,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 05:05:13,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:13,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 05:05:13,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:13,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:05:13,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:13,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 05:05:13,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:13,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 05:05:13,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:13,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 05:05:13,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:13,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 05:05:13,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:13,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:05:13,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:13,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 05:05:13,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:13,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 05:05:13,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:13,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-11 05:05:13,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:13,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-11 05:05:13,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:13,887 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-10-11 05:05:13,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:05:13,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364922742] [2024-10-11 05:05:13,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364922742] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:05:13,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:05:13,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:05:13,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163383905] [2024-10-11 05:05:13,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:05:13,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:05:13,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:05:13,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:05:13,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:05:13,890 INFO L87 Difference]: Start difference. First operand 1614 states and 2076 transitions. Second operand has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 4 states have internal predecessors, (85), 3 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2024-10-11 05:05:14,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:05:14,977 INFO L93 Difference]: Finished difference Result 2765 states and 3460 transitions. [2024-10-11 05:05:14,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 05:05:14,978 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 4 states have internal predecessors, (85), 3 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 145 [2024-10-11 05:05:14,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:05:14,986 INFO L225 Difference]: With dead ends: 2765 [2024-10-11 05:05:14,987 INFO L226 Difference]: Without dead ends: 1594 [2024-10-11 05:05:14,989 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-11 05:05:14,990 INFO L432 NwaCegarLoop]: 369 mSDtfsCounter, 944 mSDsluCounter, 1163 mSDsCounter, 0 mSdLazyCounter, 1338 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 945 SdHoareTripleChecker+Valid, 1532 SdHoareTripleChecker+Invalid, 1465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 1338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 05:05:14,990 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [945 Valid, 1532 Invalid, 1465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 1338 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 05:05:14,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1594 states. [2024-10-11 05:05:15,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1594 to 1513. [2024-10-11 05:05:15,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1513 states, 1240 states have (on average 1.3161290322580645) internal successors, (1632), 1253 states have internal predecessors, (1632), 140 states have call successors, (140), 98 states have call predecessors, (140), 131 states have return successors, (187), 162 states have call predecessors, (187), 139 states have call successors, (187) [2024-10-11 05:05:15,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1513 states to 1513 states and 1959 transitions. [2024-10-11 05:05:15,206 INFO L78 Accepts]: Start accepts. Automaton has 1513 states and 1959 transitions. Word has length 145 [2024-10-11 05:05:15,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:05:15,207 INFO L471 AbstractCegarLoop]: Abstraction has 1513 states and 1959 transitions. [2024-10-11 05:05:15,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 4 states have internal predecessors, (85), 3 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2024-10-11 05:05:15,207 INFO L276 IsEmpty]: Start isEmpty. Operand 1513 states and 1959 transitions. [2024-10-11 05:05:15,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-10-11 05:05:15,210 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:05:15,210 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 05:05:15,211 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:05:15,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:05:15,212 INFO L85 PathProgramCache]: Analyzing trace with hash 430610257, now seen corresponding path program 1 times [2024-10-11 05:05:15,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:05:15,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497225455] [2024-10-11 05:05:15,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:05:15,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:05:15,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:15,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:05:15,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:15,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:05:15,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:15,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:05:15,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:15,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:05:15,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:15,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 05:05:15,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:15,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 05:05:15,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:15,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:05:15,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:15,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 05:05:15,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:15,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 05:05:15,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:15,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 05:05:15,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:15,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 05:05:15,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:15,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:05:15,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:15,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 05:05:15,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:15,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 05:05:15,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:15,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 05:05:15,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:15,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-11 05:05:15,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:15,518 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 18 proven. 7 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-10-11 05:05:15,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:05:15,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497225455] [2024-10-11 05:05:15,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497225455] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 05:05:15,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1002080410] [2024-10-11 05:05:15,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:05:15,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 05:05:15,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 05:05:15,550 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:05:15,554 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:05:15,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:15,708 INFO L255 TraceCheckSpWp]: Trace formula consists of 618 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-11 05:05:15,713 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 05:05:15,859 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 54 proven. 2 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-10-11 05:05:15,860 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 05:05:16,109 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 19 proven. 4 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2024-10-11 05:05:16,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1002080410] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 05:05:16,109 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 05:05:16,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 14 [2024-10-11 05:05:16,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938310319] [2024-10-11 05:05:16,110 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 05:05:16,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-11 05:05:16,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:05:16,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-11 05:05:16,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2024-10-11 05:05:16,112 INFO L87 Difference]: Start difference. First operand 1513 states and 1959 transitions. Second operand has 14 states, 14 states have (on average 16.0) internal successors, (224), 12 states have internal predecessors, (224), 6 states have call successors, (38), 8 states have call predecessors, (38), 10 states have return successors, (35), 6 states have call predecessors, (35), 6 states have call successors, (35) [2024-10-11 05:05:17,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:05:17,531 INFO L93 Difference]: Finished difference Result 3104 states and 3953 transitions. [2024-10-11 05:05:17,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-10-11 05:05:17,532 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 16.0) internal successors, (224), 12 states have internal predecessors, (224), 6 states have call successors, (38), 8 states have call predecessors, (38), 10 states have return successors, (35), 6 states have call predecessors, (35), 6 states have call successors, (35) Word has length 147 [2024-10-11 05:05:17,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:05:17,542 INFO L225 Difference]: With dead ends: 3104 [2024-10-11 05:05:17,542 INFO L226 Difference]: Without dead ends: 1881 [2024-10-11 05:05:17,546 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 356 GetRequests, 327 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=232, Invalid=638, Unknown=0, NotChecked=0, Total=870 [2024-10-11 05:05:17,546 INFO L432 NwaCegarLoop]: 309 mSDtfsCounter, 2047 mSDsluCounter, 1327 mSDsCounter, 0 mSdLazyCounter, 1565 mSolverCounterSat, 326 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2078 SdHoareTripleChecker+Valid, 1636 SdHoareTripleChecker+Invalid, 1891 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 326 IncrementalHoareTripleChecker+Valid, 1565 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-11 05:05:17,547 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2078 Valid, 1636 Invalid, 1891 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [326 Valid, 1565 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-11 05:05:17,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1881 states. [2024-10-11 05:05:17,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1881 to 1773. [2024-10-11 05:05:17,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1773 states, 1425 states have (on average 1.2750877192982457) internal successors, (1817), 1439 states have internal predecessors, (1817), 180 states have call successors, (180), 136 states have call predecessors, (180), 166 states have return successors, (256), 198 states have call predecessors, (256), 179 states have call successors, (256) [2024-10-11 05:05:17,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1773 states to 1773 states and 2253 transitions. [2024-10-11 05:05:17,723 INFO L78 Accepts]: Start accepts. Automaton has 1773 states and 2253 transitions. Word has length 147 [2024-10-11 05:05:17,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:05:17,723 INFO L471 AbstractCegarLoop]: Abstraction has 1773 states and 2253 transitions. [2024-10-11 05:05:17,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 16.0) internal successors, (224), 12 states have internal predecessors, (224), 6 states have call successors, (38), 8 states have call predecessors, (38), 10 states have return successors, (35), 6 states have call predecessors, (35), 6 states have call successors, (35) [2024-10-11 05:05:17,724 INFO L276 IsEmpty]: Start isEmpty. Operand 1773 states and 2253 transitions. [2024-10-11 05:05:17,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-11 05:05:17,726 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:05:17,726 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:05:17,744 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:05:17,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 05:05:17,930 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:05:17,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:05:17,931 INFO L85 PathProgramCache]: Analyzing trace with hash 1626747324, now seen corresponding path program 1 times [2024-10-11 05:05:17,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:05:17,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268277573] [2024-10-11 05:05:17,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:05:17,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:05:17,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:17,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:05:17,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:18,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 05:05:18,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:18,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 05:05:18,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:18,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 05:05:18,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:18,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 05:05:18,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:18,127 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:18,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:05:18,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268277573] [2024-10-11 05:05:18,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268277573] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:05:18,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:05:18,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 05:05:18,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143091997] [2024-10-11 05:05:18,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:05:18,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 05:05:18,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:05:18,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 05:05:18,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:05:18,130 INFO L87 Difference]: Start difference. First operand 1773 states and 2253 transitions. Second operand has 5 states, 5 states have (on average 30.2) internal successors, (151), 3 states have internal predecessors, (151), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:05:20,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:05:20,280 INFO L93 Difference]: Finished difference Result 2242 states and 3038 transitions. [2024-10-11 05:05:20,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 05:05:20,280 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 30.2) internal successors, (151), 3 states have internal predecessors, (151), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 161 [2024-10-11 05:05:20,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:05:20,287 INFO L225 Difference]: With dead ends: 2242 [2024-10-11 05:05:20,287 INFO L226 Difference]: Without dead ends: 1903 [2024-10-11 05:05:20,288 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-10-11 05:05:20,289 INFO L432 NwaCegarLoop]: 361 mSDtfsCounter, 1068 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 1208 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1092 SdHoareTripleChecker+Valid, 826 SdHoareTripleChecker+Invalid, 1294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 1208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-11 05:05:20,289 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1092 Valid, 826 Invalid, 1294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 1208 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-11 05:05:20,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1903 states. [2024-10-11 05:05:20,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1903 to 1773. [2024-10-11 05:05:20,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1773 states, 1425 states have (on average 1.2743859649122806) internal successors, (1816), 1439 states have internal predecessors, (1816), 180 states have call successors, (180), 136 states have call predecessors, (180), 166 states have return successors, (256), 198 states have call predecessors, (256), 179 states have call successors, (256) [2024-10-11 05:05:20,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1773 states to 1773 states and 2252 transitions. [2024-10-11 05:05:20,652 INFO L78 Accepts]: Start accepts. Automaton has 1773 states and 2252 transitions. Word has length 161 [2024-10-11 05:05:20,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:05:20,652 INFO L471 AbstractCegarLoop]: Abstraction has 1773 states and 2252 transitions. [2024-10-11 05:05:20,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.2) internal successors, (151), 3 states have internal predecessors, (151), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:05:20,652 INFO L276 IsEmpty]: Start isEmpty. Operand 1773 states and 2252 transitions. [2024-10-11 05:05:20,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-11 05:05:20,654 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:05:20,655 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:05:20,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-11 05:05:20,655 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:05:20,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:05:20,655 INFO L85 PathProgramCache]: Analyzing trace with hash -267586562, now seen corresponding path program 1 times [2024-10-11 05:05:20,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:05:20,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188972807] [2024-10-11 05:05:20,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:05:20,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:05:20,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:20,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:05:20,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:20,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 05:05:20,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:20,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 05:05:20,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:20,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 05:05:20,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:20,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 05:05:20,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:20,842 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:20,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:05:20,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188972807] [2024-10-11 05:05:20,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188972807] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:05:20,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:05:20,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 05:05:20,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427552850] [2024-10-11 05:05:20,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:05:20,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 05:05:20,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:05:20,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 05:05:20,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:05:20,845 INFO L87 Difference]: Start difference. First operand 1773 states and 2252 transitions. Second operand has 5 states, 5 states have (on average 30.2) internal successors, (151), 3 states have internal predecessors, (151), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:05:22,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:05:22,805 INFO L93 Difference]: Finished difference Result 2234 states and 3021 transitions. [2024-10-11 05:05:22,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 05:05:22,806 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 30.2) internal successors, (151), 3 states have internal predecessors, (151), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 161 [2024-10-11 05:05:22,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:05:22,813 INFO L225 Difference]: With dead ends: 2234 [2024-10-11 05:05:22,814 INFO L226 Difference]: Without dead ends: 1903 [2024-10-11 05:05:22,815 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-10-11 05:05:22,816 INFO L432 NwaCegarLoop]: 360 mSDtfsCounter, 1059 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 1207 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1083 SdHoareTripleChecker+Valid, 824 SdHoareTripleChecker+Invalid, 1293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 1207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-11 05:05:22,816 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1083 Valid, 824 Invalid, 1293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 1207 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-11 05:05:22,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1903 states. [2024-10-11 05:05:23,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1903 to 1773. [2024-10-11 05:05:23,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1773 states, 1425 states have (on average 1.2736842105263158) internal successors, (1815), 1439 states have internal predecessors, (1815), 180 states have call successors, (180), 136 states have call predecessors, (180), 166 states have return successors, (256), 198 states have call predecessors, (256), 179 states have call successors, (256) [2024-10-11 05:05:23,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1773 states to 1773 states and 2251 transitions. [2024-10-11 05:05:23,200 INFO L78 Accepts]: Start accepts. Automaton has 1773 states and 2251 transitions. Word has length 161 [2024-10-11 05:05:23,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:05:23,200 INFO L471 AbstractCegarLoop]: Abstraction has 1773 states and 2251 transitions. [2024-10-11 05:05:23,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.2) internal successors, (151), 3 states have internal predecessors, (151), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:05:23,201 INFO L276 IsEmpty]: Start isEmpty. Operand 1773 states and 2251 transitions. [2024-10-11 05:05:23,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-11 05:05:23,203 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:05:23,203 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:05:23,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-11 05:05:23,203 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:05:23,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:05:23,204 INFO L85 PathProgramCache]: Analyzing trace with hash -605874112, now seen corresponding path program 1 times [2024-10-11 05:05:23,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:05:23,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596670876] [2024-10-11 05:05:23,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:05:23,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:05:23,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:23,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:05:23,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:23,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 05:05:23,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:23,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 05:05:23,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:23,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 05:05:23,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:23,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 05:05:23,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:23,443 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:23,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:05:23,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596670876] [2024-10-11 05:05:23,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596670876] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:05:23,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:05:23,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 05:05:23,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506116600] [2024-10-11 05:05:23,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:05:23,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 05:05:23,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:05:23,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 05:05:23,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:05:23,446 INFO L87 Difference]: Start difference. First operand 1773 states and 2251 transitions. Second operand has 6 states, 6 states have (on average 25.166666666666668) internal successors, (151), 4 states have internal predecessors, (151), 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:26,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:05:26,309 INFO L93 Difference]: Finished difference Result 2708 states and 3817 transitions. [2024-10-11 05:05:26,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 05:05:26,310 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.166666666666668) internal successors, (151), 4 states have internal predecessors, (151), 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 161 [2024-10-11 05:05:26,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:05:26,317 INFO L225 Difference]: With dead ends: 2708 [2024-10-11 05:05:26,318 INFO L226 Difference]: Without dead ends: 2380 [2024-10-11 05:05:26,319 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-10-11 05:05:26,320 INFO L432 NwaCegarLoop]: 318 mSDtfsCounter, 1681 mSDsluCounter, 913 mSDsCounter, 0 mSdLazyCounter, 2461 mSolverCounterSat, 142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1710 SdHoareTripleChecker+Valid, 1231 SdHoareTripleChecker+Invalid, 2603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 2461 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-11 05:05:26,321 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1710 Valid, 1231 Invalid, 2603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [142 Valid, 2461 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-11 05:05:26,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2380 states. [2024-10-11 05:05:26,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2380 to 2121. [2024-10-11 05:05:26,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2121 states, 1745 states have (on average 1.3426934097421204) internal successors, (2343), 1760 states have internal predecessors, (2343), 201 states have call successors, (201), 142 states have call predecessors, (201), 173 states have return successors, (280), 219 states have call predecessors, (280), 200 states have call successors, (280) [2024-10-11 05:05:26,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2121 states to 2121 states and 2824 transitions. [2024-10-11 05:05:26,790 INFO L78 Accepts]: Start accepts. Automaton has 2121 states and 2824 transitions. Word has length 161 [2024-10-11 05:05:26,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:05:26,790 INFO L471 AbstractCegarLoop]: Abstraction has 2121 states and 2824 transitions. [2024-10-11 05:05:26,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.166666666666668) internal successors, (151), 4 states have internal predecessors, (151), 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:26,791 INFO L276 IsEmpty]: Start isEmpty. Operand 2121 states and 2824 transitions. [2024-10-11 05:05:26,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-11 05:05:26,793 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:05:26,793 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:05:26,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-11 05:05:26,793 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:05:26,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:05:26,794 INFO L85 PathProgramCache]: Analyzing trace with hash -1092657024, now seen corresponding path program 1 times [2024-10-11 05:05:26,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:05:26,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398707055] [2024-10-11 05:05:26,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:05:26,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:05:26,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:26,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:05:26,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:26,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 05:05:26,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:27,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 05:05:27,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:27,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 05:05:27,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:27,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 05:05:27,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:27,049 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:27,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:05:27,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398707055] [2024-10-11 05:05:27,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398707055] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:05:27,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:05:27,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:05:27,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814335345] [2024-10-11 05:05:27,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:05:27,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:05:27,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:05:27,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:05:27,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:05:27,052 INFO L87 Difference]: Start difference. First operand 2121 states and 2824 transitions. Second operand has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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:30,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:05:30,866 INFO L93 Difference]: Finished difference Result 3555 states and 5229 transitions. [2024-10-11 05:05:30,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 05:05:30,867 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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 161 [2024-10-11 05:05:30,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:05:30,880 INFO L225 Difference]: With dead ends: 3555 [2024-10-11 05:05:30,880 INFO L226 Difference]: Without dead ends: 2879 [2024-10-11 05:05:30,884 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-11 05:05:30,886 INFO L432 NwaCegarLoop]: 516 mSDtfsCounter, 1724 mSDsluCounter, 1702 mSDsCounter, 0 mSdLazyCounter, 3969 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1753 SdHoareTripleChecker+Valid, 2218 SdHoareTripleChecker+Invalid, 4065 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 3969 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-10-11 05:05:30,886 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1753 Valid, 2218 Invalid, 4065 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 3969 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-10-11 05:05:30,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2879 states. [2024-10-11 05:05:31,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2879 to 2443. [2024-10-11 05:05:31,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2443 states, 2039 states have (on average 1.3825404610102991) internal successors, (2819), 2055 states have internal predecessors, (2819), 222 states have call successors, (222), 148 states have call predecessors, (222), 180 states have return successors, (303), 241 states have call predecessors, (303), 221 states have call successors, (303) [2024-10-11 05:05:31,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2443 states to 2443 states and 3344 transitions. [2024-10-11 05:05:31,300 INFO L78 Accepts]: Start accepts. Automaton has 2443 states and 3344 transitions. Word has length 161 [2024-10-11 05:05:31,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:05:31,301 INFO L471 AbstractCegarLoop]: Abstraction has 2443 states and 3344 transitions. [2024-10-11 05:05:31,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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:31,301 INFO L276 IsEmpty]: Start isEmpty. Operand 2443 states and 3344 transitions. [2024-10-11 05:05:31,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-11 05:05:31,303 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:05:31,304 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:05:31,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-11 05:05:31,304 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:05:31,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:05:31,304 INFO L85 PathProgramCache]: Analyzing trace with hash 1066427070, now seen corresponding path program 1 times [2024-10-11 05:05:31,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:05:31,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928287281] [2024-10-11 05:05:31,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:05:31,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:05:31,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:31,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:05:31,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:31,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 05:05:31,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:31,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 05:05:31,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:31,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 05:05:31,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:31,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 05:05:31,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:31,539 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:31,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:05:31,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928287281] [2024-10-11 05:05:31,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928287281] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:05:31,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:05:31,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:05:31,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073786283] [2024-10-11 05:05:31,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:05:31,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:05:31,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:05:31,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:05:31,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:05:31,541 INFO L87 Difference]: Start difference. First operand 2443 states and 3344 transitions. Second operand has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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:33,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:05:33,708 INFO L93 Difference]: Finished difference Result 3895 states and 5789 transitions. [2024-10-11 05:05:33,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 05:05:33,709 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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 161 [2024-10-11 05:05:33,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:05:33,720 INFO L225 Difference]: With dead ends: 3895 [2024-10-11 05:05:33,720 INFO L226 Difference]: Without dead ends: 2897 [2024-10-11 05:05:33,724 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-11 05:05:33,725 INFO L432 NwaCegarLoop]: 305 mSDtfsCounter, 1276 mSDsluCounter, 945 mSDsCounter, 0 mSdLazyCounter, 2087 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1306 SdHoareTripleChecker+Valid, 1250 SdHoareTripleChecker+Invalid, 2187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 2087 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-11 05:05:33,725 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1306 Valid, 1250 Invalid, 2187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 2087 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-11 05:05:33,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2897 states. [2024-10-11 05:05:34,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2897 to 2443. [2024-10-11 05:05:34,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2443 states, 2039 states have (on average 1.381069151544875) internal successors, (2816), 2055 states have internal predecessors, (2816), 222 states have call successors, (222), 148 states have call predecessors, (222), 180 states have return successors, (303), 241 states have call predecessors, (303), 221 states have call successors, (303) [2024-10-11 05:05:34,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2443 states to 2443 states and 3341 transitions. [2024-10-11 05:05:34,110 INFO L78 Accepts]: Start accepts. Automaton has 2443 states and 3341 transitions. Word has length 161 [2024-10-11 05:05:34,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:05:34,110 INFO L471 AbstractCegarLoop]: Abstraction has 2443 states and 3341 transitions. [2024-10-11 05:05:34,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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:34,111 INFO L276 IsEmpty]: Start isEmpty. Operand 2443 states and 3341 transitions. [2024-10-11 05:05:34,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-11 05:05:34,113 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:05:34,113 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:05:34,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-11 05:05:34,113 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:05:34,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:05:34,114 INFO L85 PathProgramCache]: Analyzing trace with hash 1136074944, now seen corresponding path program 1 times [2024-10-11 05:05:34,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:05:34,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269732918] [2024-10-11 05:05:34,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:05:34,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:05:34,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:34,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:05:34,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:34,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 05:05:34,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:34,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 05:05:34,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:34,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 05:05:34,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:34,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 05:05:34,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:34,357 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:34,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:05:34,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269732918] [2024-10-11 05:05:34,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269732918] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:05:34,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:05:34,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:05:34,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567796766] [2024-10-11 05:05:34,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:05:34,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:05:34,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:05:34,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:05:34,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:05:34,360 INFO L87 Difference]: Start difference. First operand 2443 states and 3341 transitions. Second operand has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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:36,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:05:36,490 INFO L93 Difference]: Finished difference Result 3891 states and 5772 transitions. [2024-10-11 05:05:36,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 05:05:36,491 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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 161 [2024-10-11 05:05:36,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:05:36,500 INFO L225 Difference]: With dead ends: 3891 [2024-10-11 05:05:36,500 INFO L226 Difference]: Without dead ends: 2893 [2024-10-11 05:05:36,503 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-11 05:05:36,504 INFO L432 NwaCegarLoop]: 304 mSDtfsCounter, 1360 mSDsluCounter, 945 mSDsCounter, 0 mSdLazyCounter, 1938 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1390 SdHoareTripleChecker+Valid, 1249 SdHoareTripleChecker+Invalid, 2039 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 1938 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-11 05:05:36,504 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1390 Valid, 1249 Invalid, 2039 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 1938 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-11 05:05:36,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2893 states. [2024-10-11 05:05:36,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2893 to 2443. [2024-10-11 05:05:36,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2443 states, 2039 states have (on average 1.3795978420794508) internal successors, (2813), 2055 states have internal predecessors, (2813), 222 states have call successors, (222), 148 states have call predecessors, (222), 180 states have return successors, (303), 241 states have call predecessors, (303), 221 states have call successors, (303) [2024-10-11 05:05:36,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2443 states to 2443 states and 3338 transitions. [2024-10-11 05:05:36,905 INFO L78 Accepts]: Start accepts. Automaton has 2443 states and 3338 transitions. Word has length 161 [2024-10-11 05:05:36,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:05:36,905 INFO L471 AbstractCegarLoop]: Abstraction has 2443 states and 3338 transitions. [2024-10-11 05:05:36,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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:36,905 INFO L276 IsEmpty]: Start isEmpty. Operand 2443 states and 3338 transitions. [2024-10-11 05:05:36,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-11 05:05:36,907 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:05:36,907 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:05:36,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-11 05:05:36,907 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:05:36,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:05:36,908 INFO L85 PathProgramCache]: Analyzing trace with hash 1553963646, now seen corresponding path program 1 times [2024-10-11 05:05:36,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:05:36,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818151346] [2024-10-11 05:05:36,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:05:36,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:05:36,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:36,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:05:36,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:37,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 05:05:37,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:37,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 05:05:37,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:37,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 05:05:37,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:37,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 05:05:37,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:37,134 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:37,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:05:37,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818151346] [2024-10-11 05:05:37,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818151346] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:05:37,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:05:37,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:05:37,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998353961] [2024-10-11 05:05:37,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:05:37,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:05:37,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:05:37,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:05:37,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:05:37,136 INFO L87 Difference]: Start difference. First operand 2443 states and 3338 transitions. Second operand has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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:38,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:05:38,990 INFO L93 Difference]: Finished difference Result 3887 states and 5755 transitions. [2024-10-11 05:05:38,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 05:05:38,990 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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 161 [2024-10-11 05:05:38,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:05:39,002 INFO L225 Difference]: With dead ends: 3887 [2024-10-11 05:05:39,002 INFO L226 Difference]: Without dead ends: 2889 [2024-10-11 05:05:39,006 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-11 05:05:39,007 INFO L432 NwaCegarLoop]: 305 mSDtfsCounter, 1471 mSDsluCounter, 740 mSDsCounter, 0 mSdLazyCounter, 1859 mSolverCounterSat, 141 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1501 SdHoareTripleChecker+Valid, 1045 SdHoareTripleChecker+Invalid, 2000 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 141 IncrementalHoareTripleChecker+Valid, 1859 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-11 05:05:39,008 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1501 Valid, 1045 Invalid, 2000 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [141 Valid, 1859 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-11 05:05:39,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2889 states. [2024-10-11 05:05:39,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2889 to 2443. [2024-10-11 05:05:39,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2443 states, 2039 states have (on average 1.3781265326140264) internal successors, (2810), 2055 states have internal predecessors, (2810), 222 states have call successors, (222), 148 states have call predecessors, (222), 180 states have return successors, (303), 241 states have call predecessors, (303), 221 states have call successors, (303) [2024-10-11 05:05:39,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2443 states to 2443 states and 3335 transitions. [2024-10-11 05:05:39,554 INFO L78 Accepts]: Start accepts. Automaton has 2443 states and 3335 transitions. Word has length 161 [2024-10-11 05:05:39,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:05:39,555 INFO L471 AbstractCegarLoop]: Abstraction has 2443 states and 3335 transitions. [2024-10-11 05:05:39,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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:39,555 INFO L276 IsEmpty]: Start isEmpty. Operand 2443 states and 3335 transitions. [2024-10-11 05:05:39,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-11 05:05:39,557 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:05:39,557 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:05:39,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-11 05:05:39,557 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:05:39,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:05:39,558 INFO L85 PathProgramCache]: Analyzing trace with hash -1342050048, now seen corresponding path program 1 times [2024-10-11 05:05:39,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:05:39,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026594640] [2024-10-11 05:05:39,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:05:39,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:05:39,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:39,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:05:39,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:39,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 05:05:39,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:39,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 05:05:39,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:39,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 05:05:39,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:39,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 05:05:39,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:39,806 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:39,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:05:39,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026594640] [2024-10-11 05:05:39,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026594640] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:05:39,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:05:39,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:05:39,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562090202] [2024-10-11 05:05:39,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:05:39,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:05:39,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:05:39,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:05:39,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:05:39,811 INFO L87 Difference]: Start difference. First operand 2443 states and 3335 transitions. Second operand has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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:43,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:05:43,679 INFO L93 Difference]: Finished difference Result 4782 states and 7211 transitions. [2024-10-11 05:05:43,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 05:05:43,680 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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 161 [2024-10-11 05:05:43,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:05:43,694 INFO L225 Difference]: With dead ends: 4782 [2024-10-11 05:05:43,694 INFO L226 Difference]: Without dead ends: 3784 [2024-10-11 05:05:43,698 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-11 05:05:43,698 INFO L432 NwaCegarLoop]: 514 mSDtfsCounter, 1698 mSDsluCounter, 1702 mSDsCounter, 0 mSdLazyCounter, 3869 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1727 SdHoareTripleChecker+Valid, 2216 SdHoareTripleChecker+Invalid, 3967 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 3869 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-10-11 05:05:43,698 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1727 Valid, 2216 Invalid, 3967 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 3869 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-10-11 05:05:43,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3784 states. [2024-10-11 05:05:44,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3784 to 3099. [2024-10-11 05:05:44,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3099 states, 2639 states have (on average 1.429708222811671) internal successors, (3773), 2657 states have internal predecessors, (3773), 264 states have call successors, (264), 160 states have call predecessors, (264), 194 states have return successors, (353), 285 states have call predecessors, (353), 263 states have call successors, (353) [2024-10-11 05:05:44,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3099 states to 3099 states and 4390 transitions. [2024-10-11 05:05:44,184 INFO L78 Accepts]: Start accepts. Automaton has 3099 states and 4390 transitions. Word has length 161 [2024-10-11 05:05:44,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:05:44,184 INFO L471 AbstractCegarLoop]: Abstraction has 3099 states and 4390 transitions. [2024-10-11 05:05:44,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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:44,185 INFO L276 IsEmpty]: Start isEmpty. Operand 3099 states and 4390 transitions. [2024-10-11 05:05:44,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-11 05:05:44,187 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:05:44,187 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:05:44,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-11 05:05:44,187 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:05:44,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:05:44,188 INFO L85 PathProgramCache]: Analyzing trace with hash 1335476798, now seen corresponding path program 1 times [2024-10-11 05:05:44,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:05:44,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378049276] [2024-10-11 05:05:44,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:05:44,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:05:44,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:44,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:05:44,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:44,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 05:05:44,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:44,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 05:05:44,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:44,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 05:05:44,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:44,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 05:05:44,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:44,475 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:44,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:05:44,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378049276] [2024-10-11 05:05:44,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378049276] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:05:44,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:05:44,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:05:44,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989406779] [2024-10-11 05:05:44,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:05:44,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:05:44,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:05:44,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:05:44,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:05:44,477 INFO L87 Difference]: Start difference. First operand 3099 states and 4390 transitions. Second operand has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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:46,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:05:46,639 INFO L93 Difference]: Finished difference Result 5425 states and 8254 transitions. [2024-10-11 05:05:46,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 05:05:46,640 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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 161 [2024-10-11 05:05:46,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:05:46,652 INFO L225 Difference]: With dead ends: 5425 [2024-10-11 05:05:46,652 INFO L226 Difference]: Without dead ends: 3771 [2024-10-11 05:05:46,658 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-11 05:05:46,659 INFO L432 NwaCegarLoop]: 305 mSDtfsCounter, 1271 mSDsluCounter, 945 mSDsCounter, 0 mSdLazyCounter, 2029 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1301 SdHoareTripleChecker+Valid, 1250 SdHoareTripleChecker+Invalid, 2129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 2029 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-11 05:05:46,659 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1301 Valid, 1250 Invalid, 2129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 2029 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-11 05:05:46,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3771 states. [2024-10-11 05:05:47,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3771 to 3099. [2024-10-11 05:05:47,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3099 states, 2639 states have (on average 1.4278135657446003) internal successors, (3768), 2657 states have internal predecessors, (3768), 264 states have call successors, (264), 160 states have call predecessors, (264), 194 states have return successors, (353), 285 states have call predecessors, (353), 263 states have call successors, (353) [2024-10-11 05:05:47,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3099 states to 3099 states and 4385 transitions. [2024-10-11 05:05:47,157 INFO L78 Accepts]: Start accepts. Automaton has 3099 states and 4385 transitions. Word has length 161 [2024-10-11 05:05:47,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:05:47,157 INFO L471 AbstractCegarLoop]: Abstraction has 3099 states and 4385 transitions. [2024-10-11 05:05:47,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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,158 INFO L276 IsEmpty]: Start isEmpty. Operand 3099 states and 4385 transitions. [2024-10-11 05:05:47,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-11 05:05:47,160 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:05:47,160 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:05:47,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-10-11 05:05:47,160 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:05:47,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:05:47,161 INFO L85 PathProgramCache]: Analyzing trace with hash 1698943296, now seen corresponding path program 1 times [2024-10-11 05:05:47,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:05:47,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129413107] [2024-10-11 05:05:47,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:05:47,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:05:47,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:47,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:05:47,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:47,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 05:05:47,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:47,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 05:05:47,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:47,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 05:05:47,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:47,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 05:05:47,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:47,404 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,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:05:47,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129413107] [2024-10-11 05:05:47,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129413107] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:05:47,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:05:47,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:05:47,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026138972] [2024-10-11 05:05:47,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:05:47,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:05:47,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:05:47,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:05:47,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:05:47,406 INFO L87 Difference]: Start difference. First operand 3099 states and 4385 transitions. Second operand has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:05:51,329 INFO L93 Difference]: Finished difference Result 7160 states and 11062 transitions. [2024-10-11 05:05:51,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 05:05:51,330 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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 161 [2024-10-11 05:05:51,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:05:51,344 INFO L225 Difference]: With dead ends: 7160 [2024-10-11 05:05:51,345 INFO L226 Difference]: Without dead ends: 5506 [2024-10-11 05:05:51,348 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-11 05:05:51,348 INFO L432 NwaCegarLoop]: 514 mSDtfsCounter, 1696 mSDsluCounter, 1702 mSDsCounter, 0 mSdLazyCounter, 3826 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1725 SdHoareTripleChecker+Valid, 2216 SdHoareTripleChecker+Invalid, 3924 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 3826 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-10-11 05:05:51,348 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1725 Valid, 2216 Invalid, 3924 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 3826 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-10-11 05:05:51,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5506 states. [2024-10-11 05:05:51,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5506 to 4413. [2024-10-11 05:05:51,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4413 states, 3841 states have (on average 1.4808643582400416) internal successors, (5688), 3863 states have internal predecessors, (5688), 348 states have call successors, (348), 184 states have call predecessors, (348), 222 states have return successors, (459), 373 states have call predecessors, (459), 347 states have call successors, (459) [2024-10-11 05:05:51,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4413 states to 4413 states and 6495 transitions. [2024-10-11 05:05:51,929 INFO L78 Accepts]: Start accepts. Automaton has 4413 states and 6495 transitions. Word has length 161 [2024-10-11 05:05:51,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:05:51,929 INFO L471 AbstractCegarLoop]: Abstraction has 4413 states and 6495 transitions. [2024-10-11 05:05:51,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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,930 INFO L276 IsEmpty]: Start isEmpty. Operand 4413 states and 6495 transitions. [2024-10-11 05:05:51,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-11 05:05:51,934 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:05:51,934 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:05:51,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-10-11 05:05:51,934 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:05:51,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:05:51,935 INFO L85 PathProgramCache]: Analyzing trace with hash 1987762686, now seen corresponding path program 1 times [2024-10-11 05:05:51,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:05:51,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019638121] [2024-10-11 05:05:51,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:05:51,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:05:51,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:52,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:05:52,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:52,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 05:05:52,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:52,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 05:05:52,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:52,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 05:05:52,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:52,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 05:05:52,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:52,183 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,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:05:52,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019638121] [2024-10-11 05:05:52,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019638121] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:05:52,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:05:52,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:05:52,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904781180] [2024-10-11 05:05:52,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:05:52,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:05:52,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:05:52,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:05:52,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:05:52,186 INFO L87 Difference]: Start difference. First operand 4413 states and 6495 transitions. Second operand has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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)