./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.03.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.03.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 4c3aab1156afcb98b97b027e9b66004d54025f3b89e95d6d35dc2e84fdb640d2 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 05:02:57,662 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 05:02:57,724 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:02:57,731 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 05:02:57,733 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 05:02:57,756 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 05:02:57,756 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 05:02:57,756 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 05:02:57,757 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 05:02:57,759 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 05:02:57,761 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 05:02:57,761 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 05:02:57,762 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 05:02:57,762 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 05:02:57,762 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 05:02:57,762 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 05:02:57,763 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 05:02:57,763 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 05:02:57,763 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 05:02:57,763 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 05:02:57,763 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 05:02:57,765 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 05:02:57,765 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 05:02:57,765 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 05:02:57,766 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 05:02:57,766 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 05:02:57,766 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 05:02:57,766 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 05:02:57,766 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 05:02:57,766 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 05:02:57,767 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 05:02:57,767 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 05:02:57,767 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 05:02:57,767 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 05:02:57,767 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 05:02:57,767 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 05:02:57,767 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 05:02:57,768 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 05:02:57,768 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 05:02:57,768 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 05:02:57,769 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 05:02:57,770 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 05:02:57,770 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 -> 4c3aab1156afcb98b97b027e9b66004d54025f3b89e95d6d35dc2e84fdb640d2 [2024-10-11 05:02:57,977 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 05:02:57,999 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 05:02:58,002 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 05:02:58,003 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 05:02:58,004 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 05:02:58,005 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.03.cil-2.c [2024-10-11 05:02:59,279 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 05:02:59,443 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 05:02:59,443 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.03.cil-2.c [2024-10-11 05:02:59,454 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/5c6e5d5f7/946359b5c0034b27a4302d6ba12c7d59/FLAGa3e8b8c72 [2024-10-11 05:02:59,464 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/5c6e5d5f7/946359b5c0034b27a4302d6ba12c7d59 [2024-10-11 05:02:59,466 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 05:02:59,468 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 05:02:59,470 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 05:02:59,470 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 05:02:59,474 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 05:02:59,475 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:02:59" (1/1) ... [2024-10-11 05:02:59,477 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@199e5530 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:02:59, skipping insertion in model container [2024-10-11 05:02:59,477 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:02:59" (1/1) ... [2024-10-11 05:02:59,509 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 05:02:59,634 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.03.cil-2.c[914,927] [2024-10-11 05:02:59,685 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.03.cil-2.c[7115,7128] [2024-10-11 05:02:59,737 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 05:02:59,747 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 05:02:59,757 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.03.cil-2.c[914,927] [2024-10-11 05:02:59,780 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.03.cil-2.c[7115,7128] [2024-10-11 05:02:59,800 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 05:02:59,819 INFO L204 MainTranslator]: Completed translation [2024-10-11 05:02:59,819 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:02:59 WrapperNode [2024-10-11 05:02:59,820 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 05:02:59,820 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 05:02:59,821 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 05:02:59,821 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 05:02:59,826 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:02:59" (1/1) ... [2024-10-11 05:02:59,836 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:02:59" (1/1) ... [2024-10-11 05:02:59,859 INFO L138 Inliner]: procedures = 59, calls = 66, calls flagged for inlining = 28, calls inlined = 28, statements flattened = 528 [2024-10-11 05:02:59,860 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 05:02:59,860 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 05:02:59,860 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 05:02:59,860 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 05:02:59,869 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:02:59" (1/1) ... [2024-10-11 05:02:59,869 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:02:59" (1/1) ... [2024-10-11 05:02:59,872 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:02:59" (1/1) ... [2024-10-11 05:02:59,887 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:02:59,887 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:02:59" (1/1) ... [2024-10-11 05:02:59,888 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:02:59" (1/1) ... [2024-10-11 05:02:59,894 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:02:59" (1/1) ... [2024-10-11 05:02:59,899 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:02:59" (1/1) ... [2024-10-11 05:02:59,901 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:02:59" (1/1) ... [2024-10-11 05:02:59,902 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:02:59" (1/1) ... [2024-10-11 05:02:59,905 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 05:02:59,906 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 05:02:59,906 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 05:02:59,906 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 05:02:59,907 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:02:59" (1/1) ... [2024-10-11 05:02:59,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 05:02:59,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 05:02:59,943 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:02:59,950 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:02:59,986 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 05:02:59,986 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-10-11 05:02:59,986 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-10-11 05:02:59,986 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2024-10-11 05:02:59,987 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2024-10-11 05:02:59,988 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2024-10-11 05:02:59,988 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2024-10-11 05:02:59,988 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2024-10-11 05:02:59,988 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2024-10-11 05:02:59,988 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2024-10-11 05:02:59,988 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2024-10-11 05:02:59,988 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2024-10-11 05:02:59,988 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2024-10-11 05:02:59,988 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2024-10-11 05:02:59,988 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2024-10-11 05:02:59,988 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2024-10-11 05:02:59,988 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2024-10-11 05:02:59,988 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2024-10-11 05:02:59,988 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2024-10-11 05:02:59,989 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2024-10-11 05:02:59,989 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2024-10-11 05:02:59,989 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2024-10-11 05:02:59,989 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2024-10-11 05:02:59,989 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 05:02:59,989 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2024-10-11 05:02:59,989 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2024-10-11 05:02:59,989 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2024-10-11 05:02:59,990 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2024-10-11 05:02:59,990 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 05:02:59,990 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 05:02:59,990 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2024-10-11 05:02:59,990 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2024-10-11 05:03:00,081 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 05:03:00,082 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 05:03:00,567 INFO L? ?]: Removed 73 outVars from TransFormulas that were not future-live. [2024-10-11 05:03:00,568 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 05:03:00,622 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 05:03:00,623 INFO L314 CfgBuilder]: Removed 10 assume(true) statements. [2024-10-11 05:03:00,623 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:03:00 BoogieIcfgContainer [2024-10-11 05:03:00,623 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 05:03:00,624 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 05:03:00,624 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 05:03:00,627 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 05:03:00,627 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 05:02:59" (1/3) ... [2024-10-11 05:03:00,628 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36283fbb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:03:00, skipping insertion in model container [2024-10-11 05:03:00,628 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:02:59" (2/3) ... [2024-10-11 05:03:00,628 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36283fbb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:03:00, skipping insertion in model container [2024-10-11 05:03:00,628 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:03:00" (3/3) ... [2024-10-11 05:03:00,629 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-1+token_ring.03.cil-2.c [2024-10-11 05:03:00,642 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 05:03:00,643 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-11 05:03:00,702 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 05:03:00,707 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;@188e8c13, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 05:03:00,707 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-11 05:03:00,711 INFO L276 IsEmpty]: Start isEmpty. Operand has 232 states, 184 states have (on average 1.6521739130434783) internal successors, (304), 190 states have internal predecessors, (304), 31 states have call successors, (31), 14 states have call predecessors, (31), 14 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2024-10-11 05:03:00,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-11 05:03:00,720 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:03:00,721 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:03:00,721 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:03:00,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:03:00,726 INFO L85 PathProgramCache]: Analyzing trace with hash -917654171, now seen corresponding path program 1 times [2024-10-11 05:03:00,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:03:00,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93331284] [2024-10-11 05:03:00,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:03:00,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:03:00,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:01,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:03:01,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:01,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:03:01,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:01,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:03:01,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:01,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:03:01,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:01,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 05:03:01,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:01,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 05:03:01,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:01,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:03:01,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:01,293 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:03:01,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:03:01,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93331284] [2024-10-11 05:03:01,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93331284] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:03:01,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:03:01,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 05:03:01,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195753235] [2024-10-11 05:03:01,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:03:01,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 05:03:01,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:03:01,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 05:03:01,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-11 05:03:01,328 INFO L87 Difference]: Start difference. First operand has 232 states, 184 states have (on average 1.6521739130434783) internal successors, (304), 190 states have internal predecessors, (304), 31 states have call successors, (31), 14 states have call predecessors, (31), 14 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) Second operand has 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:03:02,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:03:02,371 INFO L93 Difference]: Finished difference Result 573 states and 901 transitions. [2024-10-11 05:03:02,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 05:03:02,374 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:03:02,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:03:02,387 INFO L225 Difference]: With dead ends: 573 [2024-10-11 05:03:02,387 INFO L226 Difference]: Without dead ends: 352 [2024-10-11 05:03:02,391 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2024-10-11 05:03:02,394 INFO L432 NwaCegarLoop]: 191 mSDtfsCounter, 464 mSDsluCounter, 816 mSDsCounter, 0 mSdLazyCounter, 944 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 469 SdHoareTripleChecker+Valid, 1007 SdHoareTripleChecker+Invalid, 1048 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 944 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 05:03:02,395 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [469 Valid, 1007 Invalid, 1048 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 944 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 05:03:02,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2024-10-11 05:03:02,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 315. [2024-10-11 05:03:02,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 249 states have (on average 1.502008032128514) internal successors, (374), 255 states have internal predecessors, (374), 42 states have call successors, (42), 21 states have call predecessors, (42), 22 states have return successors, (45), 41 states have call predecessors, (45), 40 states have call successors, (45) [2024-10-11 05:03:02,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 461 transitions. [2024-10-11 05:03:02,467 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 461 transitions. Word has length 58 [2024-10-11 05:03:02,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:03:02,468 INFO L471 AbstractCegarLoop]: Abstraction has 315 states and 461 transitions. [2024-10-11 05:03:02,468 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:03:02,468 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 461 transitions. [2024-10-11 05:03:02,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-11 05:03:02,472 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:03:02,472 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:03:02,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 05:03:02,472 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:03:02,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:03:02,473 INFO L85 PathProgramCache]: Analyzing trace with hash -2008816218, now seen corresponding path program 1 times [2024-10-11 05:03:02,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:03:02,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617837369] [2024-10-11 05:03:02,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:03:02,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:03:02,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:02,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:03:02,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:02,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:03:02,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:02,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:03:02,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:02,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:03:02,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:02,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 05:03:02,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:02,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 05:03:02,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:02,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:03:02,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:02,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:03:02,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:03:02,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617837369] [2024-10-11 05:03:02,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617837369] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:03:02,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:03:02,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 05:03:02,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199870291] [2024-10-11 05:03:02,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:03:02,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 05:03:02,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:03:02,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 05:03:02,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 05:03:02,704 INFO L87 Difference]: Start difference. First operand 315 states and 461 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:03:03,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:03:03,611 INFO L93 Difference]: Finished difference Result 635 states and 911 transitions. [2024-10-11 05:03:03,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-11 05:03:03,612 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:03:03,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:03:03,622 INFO L225 Difference]: With dead ends: 635 [2024-10-11 05:03:03,622 INFO L226 Difference]: Without dead ends: 473 [2024-10-11 05:03:03,623 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:03:03,624 INFO L432 NwaCegarLoop]: 223 mSDtfsCounter, 674 mSDsluCounter, 888 mSDsCounter, 0 mSdLazyCounter, 1131 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 696 SdHoareTripleChecker+Valid, 1111 SdHoareTripleChecker+Invalid, 1240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 1131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 05:03:03,626 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [696 Valid, 1111 Invalid, 1240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 1131 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 05:03:03,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2024-10-11 05:03:03,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 403. [2024-10-11 05:03:03,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 403 states, 317 states have (on average 1.4826498422712935) internal successors, (470), 325 states have internal predecessors, (470), 53 states have call successors, (53), 28 states have call predecessors, (53), 31 states have return successors, (64), 53 states have call predecessors, (64), 51 states have call successors, (64) [2024-10-11 05:03:03,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 587 transitions. [2024-10-11 05:03:03,677 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 587 transitions. Word has length 58 [2024-10-11 05:03:03,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:03:03,677 INFO L471 AbstractCegarLoop]: Abstraction has 403 states and 587 transitions. [2024-10-11 05:03:03,677 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:03:03,677 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 587 transitions. [2024-10-11 05:03:03,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-11 05:03:03,680 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:03:03,680 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:03:03,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 05:03:03,680 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:03:03,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:03:03,681 INFO L85 PathProgramCache]: Analyzing trace with hash -80543516, now seen corresponding path program 1 times [2024-10-11 05:03:03,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:03:03,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289768062] [2024-10-11 05:03:03,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:03:03,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:03:03,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:03,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:03:03,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:03,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:03:03,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:03,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:03:03,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:03,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:03:03,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:03,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 05:03:03,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:03,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 05:03:03,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:03,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:03:03,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:03,824 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:03:03,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:03:03,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289768062] [2024-10-11 05:03:03,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289768062] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:03:03,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:03:03,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 05:03:03,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764899677] [2024-10-11 05:03:03,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:03:03,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 05:03:03,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:03:03,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 05:03:03,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-11 05:03:03,826 INFO L87 Difference]: Start difference. First operand 403 states and 587 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:03:04,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:03:04,466 INFO L93 Difference]: Finished difference Result 677 states and 973 transitions. [2024-10-11 05:03:04,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 05:03:04,467 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:03:04,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:03:04,470 INFO L225 Difference]: With dead ends: 677 [2024-10-11 05:03:04,470 INFO L226 Difference]: Without dead ends: 433 [2024-10-11 05:03:04,471 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:03:04,472 INFO L432 NwaCegarLoop]: 190 mSDtfsCounter, 397 mSDsluCounter, 886 mSDsCounter, 0 mSdLazyCounter, 1042 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 398 SdHoareTripleChecker+Valid, 1076 SdHoareTripleChecker+Invalid, 1146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 1042 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 05:03:04,472 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [398 Valid, 1076 Invalid, 1146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 1042 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 05:03:04,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2024-10-11 05:03:04,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 407. [2024-10-11 05:03:04,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 407 states, 320 states have (on average 1.471875) internal successors, (471), 328 states have internal predecessors, (471), 53 states have call successors, (53), 28 states have call predecessors, (53), 32 states have return successors, (65), 54 states have call predecessors, (65), 51 states have call successors, (65) [2024-10-11 05:03:04,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 589 transitions. [2024-10-11 05:03:04,531 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 589 transitions. Word has length 58 [2024-10-11 05:03:04,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:03:04,531 INFO L471 AbstractCegarLoop]: Abstraction has 407 states and 589 transitions. [2024-10-11 05:03:04,531 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:03:04,531 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 589 transitions. [2024-10-11 05:03:04,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-11 05:03:04,534 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:03:04,534 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:03:04,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 05:03:04,535 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:03:04,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:03:04,535 INFO L85 PathProgramCache]: Analyzing trace with hash 1970440482, now seen corresponding path program 1 times [2024-10-11 05:03:04,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:03:04,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568518396] [2024-10-11 05:03:04,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:03:04,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:03:04,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:04,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:03:04,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:04,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:03:04,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:04,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:03:04,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:04,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:03:04,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:04,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 05:03:04,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:04,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 05:03:04,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:04,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:03:04,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:04,682 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:03:04,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:03:04,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568518396] [2024-10-11 05:03:04,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568518396] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:03:04,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:03:04,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 05:03:04,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335590807] [2024-10-11 05:03:04,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:03:04,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 05:03:04,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:03:04,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 05:03:04,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-11 05:03:04,684 INFO L87 Difference]: Start difference. First operand 407 states and 589 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:03:05,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:03:05,347 INFO L93 Difference]: Finished difference Result 695 states and 991 transitions. [2024-10-11 05:03:05,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 05:03:05,351 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:03:05,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:03:05,353 INFO L225 Difference]: With dead ends: 695 [2024-10-11 05:03:05,353 INFO L226 Difference]: Without dead ends: 447 [2024-10-11 05:03:05,354 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2024-10-11 05:03:05,355 INFO L432 NwaCegarLoop]: 188 mSDtfsCounter, 403 mSDsluCounter, 886 mSDsCounter, 0 mSdLazyCounter, 1025 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 405 SdHoareTripleChecker+Valid, 1074 SdHoareTripleChecker+Invalid, 1130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 1025 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 05:03:05,355 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [405 Valid, 1074 Invalid, 1130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 1025 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 05:03:05,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2024-10-11 05:03:05,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 419. [2024-10-11 05:03:05,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 419 states, 329 states have (on average 1.458966565349544) internal successors, (480), 337 states have internal predecessors, (480), 53 states have call successors, (53), 28 states have call predecessors, (53), 35 states have return successors, (68), 57 states have call predecessors, (68), 51 states have call successors, (68) [2024-10-11 05:03:05,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 601 transitions. [2024-10-11 05:03:05,375 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 601 transitions. Word has length 58 [2024-10-11 05:03:05,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:03:05,376 INFO L471 AbstractCegarLoop]: Abstraction has 419 states and 601 transitions. [2024-10-11 05:03:05,376 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:03:05,376 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 601 transitions. [2024-10-11 05:03:05,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-11 05:03:05,377 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:03:05,377 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:03:05,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 05:03:05,378 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:03:05,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:03:05,378 INFO L85 PathProgramCache]: Analyzing trace with hash 2032480096, now seen corresponding path program 1 times [2024-10-11 05:03:05,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:03:05,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15731900] [2024-10-11 05:03:05,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:03:05,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:03:05,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:05,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:03:05,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:05,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:03:05,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:05,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:03:05,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:05,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:03:05,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:05,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 05:03:05,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:05,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 05:03:05,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:05,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:03:05,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:05,538 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:03:05,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:03:05,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15731900] [2024-10-11 05:03:05,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15731900] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:03:05,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:03:05,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 05:03:05,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005863142] [2024-10-11 05:03:05,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:03:05,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 05:03:05,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:03:05,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 05:03:05,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 05:03:05,541 INFO L87 Difference]: Start difference. First operand 419 states and 601 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:03:06,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:03:06,308 INFO L93 Difference]: Finished difference Result 775 states and 1076 transitions. [2024-10-11 05:03:06,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-11 05:03:06,309 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:03:06,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:03:06,311 INFO L225 Difference]: With dead ends: 775 [2024-10-11 05:03:06,312 INFO L226 Difference]: Without dead ends: 517 [2024-10-11 05:03:06,313 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2024-10-11 05:03:06,314 INFO L432 NwaCegarLoop]: 182 mSDtfsCounter, 668 mSDsluCounter, 728 mSDsCounter, 0 mSdLazyCounter, 1031 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 690 SdHoareTripleChecker+Valid, 910 SdHoareTripleChecker+Invalid, 1145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 1031 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 05:03:06,314 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [690 Valid, 910 Invalid, 1145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 1031 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 05:03:06,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2024-10-11 05:03:06,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 429. [2024-10-11 05:03:06,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 429 states, 337 states have (on average 1.4480712166172107) internal successors, (488), 345 states have internal predecessors, (488), 54 states have call successors, (54), 29 states have call predecessors, (54), 36 states have return successors, (67), 58 states have call predecessors, (67), 52 states have call successors, (67) [2024-10-11 05:03:06,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 609 transitions. [2024-10-11 05:03:06,344 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 609 transitions. Word has length 58 [2024-10-11 05:03:06,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:03:06,345 INFO L471 AbstractCegarLoop]: Abstraction has 429 states and 609 transitions. [2024-10-11 05:03:06,345 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:03:06,345 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 609 transitions. [2024-10-11 05:03:06,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-11 05:03:06,346 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:03:06,346 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:03:06,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 05:03:06,346 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:03:06,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:03:06,347 INFO L85 PathProgramCache]: Analyzing trace with hash -1839785374, now seen corresponding path program 1 times [2024-10-11 05:03:06,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:03:06,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852148182] [2024-10-11 05:03:06,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:03:06,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:03:06,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:06,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:03:06,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:06,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:03:06,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:06,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:03:06,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:06,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:03:06,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:06,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 05:03:06,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:06,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 05:03:06,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:06,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:03:06,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:06,449 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:03:06,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:03:06,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852148182] [2024-10-11 05:03:06,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852148182] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:03:06,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:03:06,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:03:06,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950028546] [2024-10-11 05:03:06,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:03:06,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:03:06,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:03:06,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:03:06,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:03:06,451 INFO L87 Difference]: Start difference. First operand 429 states and 609 transitions. Second operand has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 4 states have internal predecessors, (43), 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:03:06,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:03:06,955 INFO L93 Difference]: Finished difference Result 1011 states and 1396 transitions. [2024-10-11 05:03:06,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 05:03:06,955 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 4 states have internal predecessors, (43), 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 58 [2024-10-11 05:03:06,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:03:06,959 INFO L225 Difference]: With dead ends: 1011 [2024-10-11 05:03:06,959 INFO L226 Difference]: Without dead ends: 744 [2024-10-11 05:03:06,960 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:03:06,961 INFO L432 NwaCegarLoop]: 169 mSDtfsCounter, 809 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 459 mSolverCounterSat, 152 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 832 SdHoareTripleChecker+Valid, 607 SdHoareTripleChecker+Invalid, 611 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 152 IncrementalHoareTripleChecker+Valid, 459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 05:03:06,961 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [832 Valid, 607 Invalid, 611 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [152 Valid, 459 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 05:03:06,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 744 states. [2024-10-11 05:03:06,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 744 to 690. [2024-10-11 05:03:06,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 690 states, 532 states have (on average 1.4022556390977443) internal successors, (746), 547 states have internal predecessors, (746), 89 states have call successors, (89), 51 states have call predecessors, (89), 67 states have return successors, (124), 98 states have call predecessors, (124), 87 states have call successors, (124) [2024-10-11 05:03:06,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 690 states and 959 transitions. [2024-10-11 05:03:07,000 INFO L78 Accepts]: Start accepts. Automaton has 690 states and 959 transitions. Word has length 58 [2024-10-11 05:03:07,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:03:07,000 INFO L471 AbstractCegarLoop]: Abstraction has 690 states and 959 transitions. [2024-10-11 05:03:07,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 4 states have internal predecessors, (43), 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:03:07,000 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 959 transitions. [2024-10-11 05:03:07,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-11 05:03:07,002 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:03:07,002 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:03:07,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 05:03:07,002 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:03:07,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:03:07,002 INFO L85 PathProgramCache]: Analyzing trace with hash 1289341817, now seen corresponding path program 1 times [2024-10-11 05:03:07,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:03:07,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539170929] [2024-10-11 05:03:07,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:03:07,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:03:07,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:07,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:03:07,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:07,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:03:07,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:07,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:03:07,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:07,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:03:07,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:07,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 05:03:07,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:07,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 05:03:07,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:07,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:03:07,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:07,072 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:03:07,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:03:07,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539170929] [2024-10-11 05:03:07,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539170929] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:03:07,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:03:07,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 05:03:07,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217268160] [2024-10-11 05:03:07,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:03:07,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 05:03:07,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:03:07,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 05:03:07,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:03:07,073 INFO L87 Difference]: Start difference. First operand 690 states and 959 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 3 states have internal predecessors, (44), 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:03:07,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:03:07,581 INFO L93 Difference]: Finished difference Result 1774 states and 2405 transitions. [2024-10-11 05:03:07,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 05:03:07,582 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 3 states have internal predecessors, (44), 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 59 [2024-10-11 05:03:07,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:03:07,588 INFO L225 Difference]: With dead ends: 1774 [2024-10-11 05:03:07,588 INFO L226 Difference]: Without dead ends: 1255 [2024-10-11 05:03:07,590 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2024-10-11 05:03:07,591 INFO L432 NwaCegarLoop]: 196 mSDtfsCounter, 643 mSDsluCounter, 435 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 669 SdHoareTripleChecker+Valid, 631 SdHoareTripleChecker+Invalid, 522 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 05:03:07,591 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [669 Valid, 631 Invalid, 522 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 423 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 05:03:07,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1255 states. [2024-10-11 05:03:07,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1255 to 1101. [2024-10-11 05:03:07,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1101 states, 843 states have (on average 1.3594306049822065) internal successors, (1146), 865 states have internal predecessors, (1146), 138 states have call successors, (138), 93 states have call predecessors, (138), 118 states have return successors, (194), 149 states have call predecessors, (194), 136 states have call successors, (194) [2024-10-11 05:03:07,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1101 states to 1101 states and 1478 transitions. [2024-10-11 05:03:07,663 INFO L78 Accepts]: Start accepts. Automaton has 1101 states and 1478 transitions. Word has length 59 [2024-10-11 05:03:07,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:03:07,664 INFO L471 AbstractCegarLoop]: Abstraction has 1101 states and 1478 transitions. [2024-10-11 05:03:07,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 3 states have internal predecessors, (44), 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:03:07,664 INFO L276 IsEmpty]: Start isEmpty. Operand 1101 states and 1478 transitions. [2024-10-11 05:03:07,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-11 05:03:07,667 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:03:07,667 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:03:07,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 05:03:07,668 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:03:07,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:03:07,668 INFO L85 PathProgramCache]: Analyzing trace with hash -574964482, now seen corresponding path program 1 times [2024-10-11 05:03:07,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:03:07,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119211837] [2024-10-11 05:03:07,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:03:07,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:03:07,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:07,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:03:07,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:07,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:03:07,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:07,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:03:07,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:07,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:03:07,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:07,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 05:03:07,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:07,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 05:03:07,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:07,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:03:07,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:07,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:03:07,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:03:07,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119211837] [2024-10-11 05:03:07,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119211837] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:03:07,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:03:07,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 05:03:07,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451224330] [2024-10-11 05:03:07,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:03:07,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 05:03:07,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:03:07,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 05:03:07,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:03:07,738 INFO L87 Difference]: Start difference. First operand 1101 states and 1478 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:03:08,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:03:08,332 INFO L93 Difference]: Finished difference Result 3061 states and 4041 transitions. [2024-10-11 05:03:08,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 05:03:08,333 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:03:08,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:03:08,343 INFO L225 Difference]: With dead ends: 3061 [2024-10-11 05:03:08,343 INFO L226 Difference]: Without dead ends: 2101 [2024-10-11 05:03:08,346 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:03:08,347 INFO L432 NwaCegarLoop]: 186 mSDtfsCounter, 450 mSDsluCounter, 512 mSDsCounter, 0 mSdLazyCounter, 525 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 458 SdHoareTripleChecker+Valid, 698 SdHoareTripleChecker+Invalid, 628 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 525 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 05:03:08,347 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [458 Valid, 698 Invalid, 628 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 525 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 05:03:08,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2101 states. [2024-10-11 05:03:08,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2101 to 1917. [2024-10-11 05:03:08,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1917 states, 1461 states have (on average 1.326488706365503) internal successors, (1938), 1489 states have internal predecessors, (1938), 232 states have call successors, (232), 179 states have call predecessors, (232), 222 states have return successors, (332), 255 states have call predecessors, (332), 230 states have call successors, (332) [2024-10-11 05:03:08,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1917 states to 1917 states and 2502 transitions. [2024-10-11 05:03:08,487 INFO L78 Accepts]: Start accepts. Automaton has 1917 states and 2502 transitions. Word has length 60 [2024-10-11 05:03:08,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:03:08,488 INFO L471 AbstractCegarLoop]: Abstraction has 1917 states and 2502 transitions. [2024-10-11 05:03:08,488 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:03:08,488 INFO L276 IsEmpty]: Start isEmpty. Operand 1917 states and 2502 transitions. [2024-10-11 05:03:08,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-10-11 05:03:08,490 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:03:08,490 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:03:08,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 05:03:08,490 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:03:08,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:03:08,491 INFO L85 PathProgramCache]: Analyzing trace with hash -1978334883, now seen corresponding path program 1 times [2024-10-11 05:03:08,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:03:08,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490645523] [2024-10-11 05:03:08,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:03:08,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:03:08,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:08,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:03:08,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:08,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:03:08,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:08,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:03:08,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:08,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:03:08,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:08,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 05:03:08,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:08,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 05:03:08,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:08,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:03:08,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:08,559 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:03:08,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:03:08,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490645523] [2024-10-11 05:03:08,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490645523] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:03:08,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:03:08,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 05:03:08,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623590392] [2024-10-11 05:03:08,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:03:08,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 05:03:08,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:03:08,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 05:03:08,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:03:08,561 INFO L87 Difference]: Start difference. First operand 1917 states and 2502 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:03:09,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:03:09,166 INFO L93 Difference]: Finished difference Result 4581 states and 5906 transitions. [2024-10-11 05:03:09,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 05:03:09,166 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:03:09,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:03:09,178 INFO L225 Difference]: With dead ends: 4581 [2024-10-11 05:03:09,179 INFO L226 Difference]: Without dead ends: 2825 [2024-10-11 05:03:09,184 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:03:09,185 INFO L432 NwaCegarLoop]: 198 mSDtfsCounter, 793 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 139 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 817 SdHoareTripleChecker+Valid, 507 SdHoareTripleChecker+Invalid, 494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 139 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 05:03:09,185 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [817 Valid, 507 Invalid, 494 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [139 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 05:03:09,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2825 states. [2024-10-11 05:03:09,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2825 to 2583. [2024-10-11 05:03:09,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2583 states, 1963 states have (on average 1.3122771268466633) internal successors, (2576), 1999 states have internal predecessors, (2576), 312 states have call successors, (312), 249 states have call predecessors, (312), 306 states have return successors, (441), 341 states have call predecessors, (441), 310 states have call successors, (441) [2024-10-11 05:03:09,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2583 states to 2583 states and 3329 transitions. [2024-10-11 05:03:09,368 INFO L78 Accepts]: Start accepts. Automaton has 2583 states and 3329 transitions. Word has length 66 [2024-10-11 05:03:09,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:03:09,369 INFO L471 AbstractCegarLoop]: Abstraction has 2583 states and 3329 transitions. [2024-10-11 05:03:09,369 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:03:09,369 INFO L276 IsEmpty]: Start isEmpty. Operand 2583 states and 3329 transitions. [2024-10-11 05:03:09,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-10-11 05:03:09,371 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:03:09,371 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:03:09,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 05:03:09,371 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:03:09,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:03:09,371 INFO L85 PathProgramCache]: Analyzing trace with hash -1715112493, now seen corresponding path program 1 times [2024-10-11 05:03:09,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:03:09,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365447411] [2024-10-11 05:03:09,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:03:09,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:03:09,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:09,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:03:09,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:09,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:03:09,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:09,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:03:09,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:09,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:03:09,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:09,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 05:03:09,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:09,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 05:03:09,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:09,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:03:09,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:09,451 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:03:09,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:03:09,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365447411] [2024-10-11 05:03:09,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365447411] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:03:09,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:03:09,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:03:09,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656415512] [2024-10-11 05:03:09,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:03:09,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:03:09,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:03:09,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:03:09,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:03:09,453 INFO L87 Difference]: Start difference. First operand 2583 states and 3329 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:03:10,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:03:10,167 INFO L93 Difference]: Finished difference Result 3303 states and 4206 transitions. [2024-10-11 05:03:10,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 05:03:10,168 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:03:10,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:03:10,181 INFO L225 Difference]: With dead ends: 3303 [2024-10-11 05:03:10,181 INFO L226 Difference]: Without dead ends: 3300 [2024-10-11 05:03:10,182 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2024-10-11 05:03:10,183 INFO L432 NwaCegarLoop]: 191 mSDtfsCounter, 970 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 435 mSolverCounterSat, 224 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 980 SdHoareTripleChecker+Valid, 617 SdHoareTripleChecker+Invalid, 659 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 224 IncrementalHoareTripleChecker+Valid, 435 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 05:03:10,183 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [980 Valid, 617 Invalid, 659 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [224 Valid, 435 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 05:03:10,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3300 states. [2024-10-11 05:03:10,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3300 to 3033. [2024-10-11 05:03:10,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3033 states, 2304 states have (on average 1.3038194444444444) internal successors, (3004), 2345 states have internal predecessors, (3004), 362 states have call successors, (362), 293 states have call predecessors, (362), 365 states have return successors, (520), 401 states have call predecessors, (520), 361 states have call successors, (520) [2024-10-11 05:03:10,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3033 states to 3033 states and 3886 transitions. [2024-10-11 05:03:10,420 INFO L78 Accepts]: Start accepts. Automaton has 3033 states and 3886 transitions. Word has length 67 [2024-10-11 05:03:10,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:03:10,420 INFO L471 AbstractCegarLoop]: Abstraction has 3033 states and 3886 transitions. [2024-10-11 05:03:10,421 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:03:10,421 INFO L276 IsEmpty]: Start isEmpty. Operand 3033 states and 3886 transitions. [2024-10-11 05:03:10,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-11 05:03:10,423 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:03:10,423 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:03:10,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 05:03:10,423 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:03:10,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:03:10,424 INFO L85 PathProgramCache]: Analyzing trace with hash -1629656985, now seen corresponding path program 1 times [2024-10-11 05:03:10,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:03:10,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345927312] [2024-10-11 05:03:10,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:03:10,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:03:10,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:10,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:03:10,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:10,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:03:10,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:10,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:03:10,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:10,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:03:10,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:10,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 05:03:10,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:10,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 05:03:10,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:10,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:03:10,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:10,552 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:03:10,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:03:10,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345927312] [2024-10-11 05:03:10,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345927312] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 05:03:10,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [223503413] [2024-10-11 05:03:10,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:03:10,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 05:03:10,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 05:03:10,555 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:03:10,557 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:03:10,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:10,641 INFO L255 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-11 05:03:10,648 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 05:03:10,883 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:03:10,883 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 05:03:10,979 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:03:10,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [223503413] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 05:03:10,980 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 05:03:10,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 4] total 10 [2024-10-11 05:03:10,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234125041] [2024-10-11 05:03:10,980 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 05:03:10,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 05:03:10,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:03:10,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 05:03:10,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-10-11 05:03:10,981 INFO L87 Difference]: Start difference. First operand 3033 states and 3886 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:03:12,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:03:12,596 INFO L93 Difference]: Finished difference Result 7100 states and 8998 transitions. [2024-10-11 05:03:12,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-10-11 05:03:12,597 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:03:12,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:03:12,624 INFO L225 Difference]: With dead ends: 7100 [2024-10-11 05:03:12,624 INFO L226 Difference]: Without dead ends: 7097 [2024-10-11 05:03:12,627 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=170, Invalid=642, Unknown=0, NotChecked=0, Total=812 [2024-10-11 05:03:12,627 INFO L432 NwaCegarLoop]: 265 mSDtfsCounter, 1336 mSDsluCounter, 804 mSDsCounter, 0 mSdLazyCounter, 1330 mSolverCounterSat, 212 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1399 SdHoareTripleChecker+Valid, 1069 SdHoareTripleChecker+Invalid, 1542 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 212 IncrementalHoareTripleChecker+Valid, 1330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 05:03:12,628 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1399 Valid, 1069 Invalid, 1542 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [212 Valid, 1330 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 05:03:12,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7097 states. [2024-10-11 05:03:13,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7097 to 4659. [2024-10-11 05:03:13,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4659 states, 3544 states have (on average 1.3024830699774266) internal successors, (4616), 3607 states have internal predecessors, (4616), 546 states have call successors, (546), 451 states have call predecessors, (546), 567 states have return successors, (798), 607 states have call predecessors, (798), 545 states have call successors, (798) [2024-10-11 05:03:13,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4659 states to 4659 states and 5960 transitions. [2024-10-11 05:03:13,106 INFO L78 Accepts]: Start accepts. Automaton has 4659 states and 5960 transitions. Word has length 68 [2024-10-11 05:03:13,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:03:13,106 INFO L471 AbstractCegarLoop]: Abstraction has 4659 states and 5960 transitions. [2024-10-11 05:03:13,107 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:03:13,107 INFO L276 IsEmpty]: Start isEmpty. Operand 4659 states and 5960 transitions. [2024-10-11 05:03:13,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-11 05:03:13,109 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:03:13,109 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:03:13,125 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:03:13,309 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:03:13,310 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:03:13,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:03:13,310 INFO L85 PathProgramCache]: Analyzing trace with hash 228963667, now seen corresponding path program 2 times [2024-10-11 05:03:13,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:03:13,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868150920] [2024-10-11 05:03:13,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:03:13,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:03:13,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:13,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:03:13,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:13,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:03:13,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:13,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:03:13,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:13,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:03:13,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:13,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 05:03:13,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:13,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 05:03:13,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:13,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:03:13,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:13,366 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:03:13,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:03:13,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868150920] [2024-10-11 05:03:13,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868150920] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:03:13,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:03:13,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 05:03:13,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724037878] [2024-10-11 05:03:13,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:03:13,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 05:03:13,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:03:13,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 05:03:13,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:03:13,369 INFO L87 Difference]: Start difference. First operand 4659 states and 5960 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:03:14,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:03:14,051 INFO L93 Difference]: Finished difference Result 7115 states and 9107 transitions. [2024-10-11 05:03:14,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 05:03:14,052 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:03:14,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:03:14,068 INFO L225 Difference]: With dead ends: 7115 [2024-10-11 05:03:14,068 INFO L226 Difference]: Without dead ends: 3412 [2024-10-11 05:03:14,077 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 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:03:14,078 INFO L432 NwaCegarLoop]: 221 mSDtfsCounter, 558 mSDsluCounter, 491 mSDsCounter, 0 mSdLazyCounter, 514 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 585 SdHoareTripleChecker+Valid, 712 SdHoareTripleChecker+Invalid, 594 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 514 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 05:03:14,078 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [585 Valid, 712 Invalid, 594 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 514 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 05:03:14,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3412 states. [2024-10-11 05:03:14,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3412 to 3183. [2024-10-11 05:03:14,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3183 states, 2424 states have (on average 1.2821782178217822) internal successors, (3108), 2465 states have internal predecessors, (3108), 378 states have call successors, (378), 307 states have call predecessors, (378), 379 states have return successors, (524), 417 states have call predecessors, (524), 377 states have call successors, (524) [2024-10-11 05:03:14,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3183 states to 3183 states and 4010 transitions. [2024-10-11 05:03:14,367 INFO L78 Accepts]: Start accepts. Automaton has 3183 states and 4010 transitions. Word has length 71 [2024-10-11 05:03:14,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:03:14,368 INFO L471 AbstractCegarLoop]: Abstraction has 3183 states and 4010 transitions. [2024-10-11 05:03:14,368 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:03:14,368 INFO L276 IsEmpty]: Start isEmpty. Operand 3183 states and 4010 transitions. [2024-10-11 05:03:14,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-11 05:03:14,370 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:03:14,370 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:03:14,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 05:03:14,371 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:03:14,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:03:14,371 INFO L85 PathProgramCache]: Analyzing trace with hash 1733702944, now seen corresponding path program 1 times [2024-10-11 05:03:14,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:03:14,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978509657] [2024-10-11 05:03:14,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:03:14,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:03:14,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:14,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:03:14,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:14,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 05:03:14,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:14,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-11 05:03:14,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:14,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 05:03:14,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:14,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 05:03:14,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:14,453 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:03:14,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:03:14,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978509657] [2024-10-11 05:03:14,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978509657] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:03:14,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:03:14,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 05:03:14,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369531166] [2024-10-11 05:03:14,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:03:14,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 05:03:14,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:03:14,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 05:03:14,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:03:14,456 INFO L87 Difference]: Start difference. First operand 3183 states and 4010 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 4 states have internal predecessors, (61), 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:03:15,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:03:15,489 INFO L93 Difference]: Finished difference Result 3524 states and 4550 transitions. [2024-10-11 05:03:15,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 05:03:15,489 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 4 states have internal predecessors, (61), 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 71 [2024-10-11 05:03:15,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:03:15,510 INFO L225 Difference]: With dead ends: 3524 [2024-10-11 05:03:15,510 INFO L226 Difference]: Without dead ends: 3394 [2024-10-11 05:03:15,512 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-10-11 05:03:15,512 INFO L432 NwaCegarLoop]: 169 mSDtfsCounter, 698 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 947 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 718 SdHoareTripleChecker+Valid, 615 SdHoareTripleChecker+Invalid, 1053 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 947 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 05:03:15,512 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [718 Valid, 615 Invalid, 1053 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 947 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 05:03:15,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3394 states. [2024-10-11 05:03:16,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3394 to 3315. [2024-10-11 05:03:16,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3315 states, 2537 states have (on average 1.2948364209696492) internal successors, (3285), 2579 states have internal predecessors, (3285), 390 states have call successors, (390), 313 states have call predecessors, (390), 386 states have return successors, (539), 429 states have call predecessors, (539), 389 states have call successors, (539) [2024-10-11 05:03:16,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3315 states to 3315 states and 4214 transitions. [2024-10-11 05:03:16,060 INFO L78 Accepts]: Start accepts. Automaton has 3315 states and 4214 transitions. Word has length 71 [2024-10-11 05:03:16,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:03:16,060 INFO L471 AbstractCegarLoop]: Abstraction has 3315 states and 4214 transitions. [2024-10-11 05:03:16,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 4 states have internal predecessors, (61), 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:03:16,060 INFO L276 IsEmpty]: Start isEmpty. Operand 3315 states and 4214 transitions. [2024-10-11 05:03:16,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-11 05:03:16,063 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:03:16,063 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] [2024-10-11 05:03:16,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 05:03:16,063 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:03:16,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:03:16,064 INFO L85 PathProgramCache]: Analyzing trace with hash -1860015964, now seen corresponding path program 1 times [2024-10-11 05:03:16,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:03:16,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743504499] [2024-10-11 05:03:16,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:03:16,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:03:16,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:16,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:03:16,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:16,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 05:03:16,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:16,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-11 05:03:16,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:16,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 05:03:16,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:16,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 05:03:16,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:16,164 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:03:16,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:03:16,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743504499] [2024-10-11 05:03:16,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743504499] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:03:16,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:03:16,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:03:16,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292375423] [2024-10-11 05:03:16,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:03:16,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:03:16,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:03:16,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:03:16,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:03:16,166 INFO L87 Difference]: Start difference. First operand 3315 states and 4214 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 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:03:17,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:03:17,395 INFO L93 Difference]: Finished difference Result 3829 states and 5020 transitions. [2024-10-11 05:03:17,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 05:03:17,396 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 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 71 [2024-10-11 05:03:17,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:03:17,409 INFO L225 Difference]: With dead ends: 3829 [2024-10-11 05:03:17,409 INFO L226 Difference]: Without dead ends: 3567 [2024-10-11 05:03:17,412 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-11 05:03:17,413 INFO L432 NwaCegarLoop]: 250 mSDtfsCounter, 697 mSDsluCounter, 771 mSDsCounter, 0 mSdLazyCounter, 1531 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 717 SdHoareTripleChecker+Valid, 1021 SdHoareTripleChecker+Invalid, 1608 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 1531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 05:03:17,413 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [717 Valid, 1021 Invalid, 1608 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 1531 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 05:03:17,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3567 states. [2024-10-11 05:03:17,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3567 to 3438. [2024-10-11 05:03:17,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3438 states, 2641 states have (on average 1.3040514956455889) internal successors, (3444), 2684 states have internal predecessors, (3444), 402 states have call successors, (402), 319 states have call predecessors, (402), 393 states have return successors, (553), 442 states have call predecessors, (553), 401 states have call successors, (553) [2024-10-11 05:03:17,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3438 states to 3438 states and 4399 transitions. [2024-10-11 05:03:17,787 INFO L78 Accepts]: Start accepts. Automaton has 3438 states and 4399 transitions. Word has length 71 [2024-10-11 05:03:17,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:03:17,788 INFO L471 AbstractCegarLoop]: Abstraction has 3438 states and 4399 transitions. [2024-10-11 05:03:17,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 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:03:17,788 INFO L276 IsEmpty]: Start isEmpty. Operand 3438 states and 4399 transitions. [2024-10-11 05:03:17,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-11 05:03:17,790 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:03:17,790 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] [2024-10-11 05:03:17,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 05:03:17,790 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:03:17,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:03:17,791 INFO L85 PathProgramCache]: Analyzing trace with hash -1426286878, now seen corresponding path program 1 times [2024-10-11 05:03:17,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:03:17,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530138520] [2024-10-11 05:03:17,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:03:17,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:03:17,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:17,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:03:17,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:17,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 05:03:17,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:17,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-11 05:03:17,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:17,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 05:03:17,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:17,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 05:03:17,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:17,889 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:03:17,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:03:17,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530138520] [2024-10-11 05:03:17,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530138520] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:03:17,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:03:17,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:03:17,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786145733] [2024-10-11 05:03:17,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:03:17,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:03:17,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:03:17,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:03:17,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:03:17,890 INFO L87 Difference]: Start difference. First operand 3438 states and 4399 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 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:03:19,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:03:19,111 INFO L93 Difference]: Finished difference Result 4275 states and 5707 transitions. [2024-10-11 05:03:19,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 05:03:19,111 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 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 71 [2024-10-11 05:03:19,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:03:19,126 INFO L225 Difference]: With dead ends: 4275 [2024-10-11 05:03:19,126 INFO L226 Difference]: Without dead ends: 3890 [2024-10-11 05:03:19,130 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-11 05:03:19,131 INFO L432 NwaCegarLoop]: 248 mSDtfsCounter, 695 mSDsluCounter, 771 mSDsCounter, 0 mSdLazyCounter, 1527 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 715 SdHoareTripleChecker+Valid, 1019 SdHoareTripleChecker+Invalid, 1606 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 1527 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 05:03:19,131 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [715 Valid, 1019 Invalid, 1606 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 1527 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 05:03:19,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3890 states. [2024-10-11 05:03:19,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3890 to 3685. [2024-10-11 05:03:19,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3685 states, 2850 states have (on average 1.3203508771929824) internal successors, (3763), 2895 states have internal predecessors, (3763), 426 states have call successors, (426), 331 states have call predecessors, (426), 407 states have return successors, (585), 468 states have call predecessors, (585), 425 states have call successors, (585) [2024-10-11 05:03:19,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3685 states to 3685 states and 4774 transitions. [2024-10-11 05:03:19,713 INFO L78 Accepts]: Start accepts. Automaton has 3685 states and 4774 transitions. Word has length 71 [2024-10-11 05:03:19,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:03:19,713 INFO L471 AbstractCegarLoop]: Abstraction has 3685 states and 4774 transitions. [2024-10-11 05:03:19,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 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:03:19,714 INFO L276 IsEmpty]: Start isEmpty. Operand 3685 states and 4774 transitions. [2024-10-11 05:03:19,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-11 05:03:19,716 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:03:19,716 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] [2024-10-11 05:03:19,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 05:03:19,717 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:03:19,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:03:19,717 INFO L85 PathProgramCache]: Analyzing trace with hash -165369628, now seen corresponding path program 1 times [2024-10-11 05:03:19,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:03:19,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291675356] [2024-10-11 05:03:19,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:03:19,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:03:19,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:19,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:03:19,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:19,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 05:03:19,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:19,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-11 05:03:19,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:19,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 05:03:19,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:19,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 05:03:19,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:19,811 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:03:19,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:03:19,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291675356] [2024-10-11 05:03:19,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291675356] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:03:19,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:03:19,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:03:19,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142987531] [2024-10-11 05:03:19,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:03:19,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:03:19,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:03:19,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:03:19,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:03:19,812 INFO L87 Difference]: Start difference. First operand 3685 states and 4774 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 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:03:20,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:03:20,699 INFO L93 Difference]: Finished difference Result 4512 states and 6075 transitions. [2024-10-11 05:03:20,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 05:03:20,699 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 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 71 [2024-10-11 05:03:20,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:03:20,712 INFO L225 Difference]: With dead ends: 4512 [2024-10-11 05:03:20,712 INFO L226 Difference]: Without dead ends: 3880 [2024-10-11 05:03:20,716 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-11 05:03:20,716 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 578 mSDsluCounter, 473 mSDsCounter, 0 mSdLazyCounter, 825 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 599 SdHoareTripleChecker+Valid, 629 SdHoareTripleChecker+Invalid, 906 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 825 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 05:03:20,716 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [599 Valid, 629 Invalid, 906 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 825 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 05:03:20,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3880 states. [2024-10-11 05:03:21,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3880 to 3685. [2024-10-11 05:03:21,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3685 states, 2850 states have (on average 1.31859649122807) internal successors, (3758), 2895 states have internal predecessors, (3758), 426 states have call successors, (426), 331 states have call predecessors, (426), 407 states have return successors, (585), 468 states have call predecessors, (585), 425 states have call successors, (585) [2024-10-11 05:03:21,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3685 states to 3685 states and 4769 transitions. [2024-10-11 05:03:21,125 INFO L78 Accepts]: Start accepts. Automaton has 3685 states and 4769 transitions. Word has length 71 [2024-10-11 05:03:21,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:03:21,126 INFO L471 AbstractCegarLoop]: Abstraction has 3685 states and 4769 transitions. [2024-10-11 05:03:21,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 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:03:21,126 INFO L276 IsEmpty]: Start isEmpty. Operand 3685 states and 4769 transitions. [2024-10-11 05:03:21,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-11 05:03:21,129 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:03:21,129 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] [2024-10-11 05:03:21,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 05:03:21,129 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:03:21,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:03:21,130 INFO L85 PathProgramCache]: Analyzing trace with hash -124694878, now seen corresponding path program 1 times [2024-10-11 05:03:21,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:03:21,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577388864] [2024-10-11 05:03:21,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:03:21,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:03:21,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:21,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:03:21,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:21,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 05:03:21,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:21,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-11 05:03:21,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:21,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 05:03:21,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:21,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 05:03:21,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:21,225 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:03:21,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:03:21,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577388864] [2024-10-11 05:03:21,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577388864] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:03:21,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:03:21,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:03:21,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545275457] [2024-10-11 05:03:21,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:03:21,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:03:21,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:03:21,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:03:21,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:03:21,228 INFO L87 Difference]: Start difference. First operand 3685 states and 4769 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 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:03:22,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:03:22,769 INFO L93 Difference]: Finished difference Result 5303 states and 7264 transitions. [2024-10-11 05:03:22,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 05:03:22,769 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 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 71 [2024-10-11 05:03:22,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:03:22,782 INFO L225 Difference]: With dead ends: 5303 [2024-10-11 05:03:22,782 INFO L226 Difference]: Without dead ends: 4671 [2024-10-11 05:03:22,785 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-11 05:03:22,785 INFO L432 NwaCegarLoop]: 246 mSDtfsCounter, 712 mSDsluCounter, 766 mSDsCounter, 0 mSdLazyCounter, 1694 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 731 SdHoareTripleChecker+Valid, 1012 SdHoareTripleChecker+Invalid, 1775 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 1694 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 05:03:22,786 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [731 Valid, 1012 Invalid, 1775 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 1694 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 05:03:22,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4671 states. [2024-10-11 05:03:23,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4671 to 4176. [2024-10-11 05:03:23,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4176 states, 3269 states have (on average 1.3438360354848577) internal successors, (4393), 3318 states have internal predecessors, (4393), 470 states have call successors, (470), 355 states have call predecessors, (470), 435 states have return successors, (651), 516 states have call predecessors, (651), 469 states have call successors, (651) [2024-10-11 05:03:23,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4176 states to 4176 states and 5514 transitions. [2024-10-11 05:03:23,225 INFO L78 Accepts]: Start accepts. Automaton has 4176 states and 5514 transitions. Word has length 71 [2024-10-11 05:03:23,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:03:23,225 INFO L471 AbstractCegarLoop]: Abstraction has 4176 states and 5514 transitions. [2024-10-11 05:03:23,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 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:03:23,225 INFO L276 IsEmpty]: Start isEmpty. Operand 4176 states and 5514 transitions. [2024-10-11 05:03:23,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-11 05:03:23,228 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:03:23,229 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] [2024-10-11 05:03:23,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 05:03:23,229 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:03:23,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:03:23,230 INFO L85 PathProgramCache]: Analyzing trace with hash 1262090532, now seen corresponding path program 1 times [2024-10-11 05:03:23,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:03:23,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996576888] [2024-10-11 05:03:23,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:03:23,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:03:23,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:23,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:03:23,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:23,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 05:03:23,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:23,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-11 05:03:23,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:23,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 05:03:23,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:23,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 05:03:23,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:23,330 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:03:23,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:03:23,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996576888] [2024-10-11 05:03:23,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996576888] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:03:23,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:03:23,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:03:23,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650809851] [2024-10-11 05:03:23,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:03:23,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:03:23,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:03:23,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:03:23,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:03:23,333 INFO L87 Difference]: Start difference. First operand 4176 states and 5514 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 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:03:25,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:03:25,075 INFO L93 Difference]: Finished difference Result 7084 states and 9993 transitions. [2024-10-11 05:03:25,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 05:03:25,075 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 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 71 [2024-10-11 05:03:25,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:03:25,093 INFO L225 Difference]: With dead ends: 7084 [2024-10-11 05:03:25,093 INFO L226 Difference]: Without dead ends: 5961 [2024-10-11 05:03:25,099 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-11 05:03:25,100 INFO L432 NwaCegarLoop]: 245 mSDtfsCounter, 768 mSDsluCounter, 763 mSDsCounter, 0 mSdLazyCounter, 1469 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 792 SdHoareTripleChecker+Valid, 1008 SdHoareTripleChecker+Invalid, 1551 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 1469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 05:03:25,100 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [792 Valid, 1008 Invalid, 1551 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 1469 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 05:03:25,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5961 states. [2024-10-11 05:03:25,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5961 to 5114. [2024-10-11 05:03:25,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5114 states, 4067 states have (on average 1.3766904352102287) internal successors, (5599), 4124 states have internal predecessors, (5599), 554 states have call successors, (554), 403 states have call predecessors, (554), 491 states have return successors, (797), 608 states have call predecessors, (797), 553 states have call successors, (797) [2024-10-11 05:03:25,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5114 states to 5114 states and 6950 transitions. [2024-10-11 05:03:25,598 INFO L78 Accepts]: Start accepts. Automaton has 5114 states and 6950 transitions. Word has length 71 [2024-10-11 05:03:25,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:03:25,598 INFO L471 AbstractCegarLoop]: Abstraction has 5114 states and 6950 transitions. [2024-10-11 05:03:25,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 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:03:25,599 INFO L276 IsEmpty]: Start isEmpty. Operand 5114 states and 6950 transitions. [2024-10-11 05:03:25,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-11 05:03:25,602 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:03:25,603 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] [2024-10-11 05:03:25,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-11 05:03:25,603 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:03:25,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:03:25,603 INFO L85 PathProgramCache]: Analyzing trace with hash 2138109538, now seen corresponding path program 1 times [2024-10-11 05:03:25,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:03:25,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216694480] [2024-10-11 05:03:25,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:03:25,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:03:25,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:25,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:03:25,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:25,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 05:03:25,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:25,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-11 05:03:25,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:25,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 05:03:25,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:25,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 05:03:25,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:25,711 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:03:25,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:03:25,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216694480] [2024-10-11 05:03:25,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216694480] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:03:25,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:03:25,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:03:25,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826058957] [2024-10-11 05:03:25,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:03:25,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:03:25,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:03:25,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:03:25,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:03:25,715 INFO L87 Difference]: Start difference. First operand 5114 states and 6950 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 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:03:27,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:03:27,363 INFO L93 Difference]: Finished difference Result 10204 states and 14801 transitions. [2024-10-11 05:03:27,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 05:03:27,364 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 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 71 [2024-10-11 05:03:27,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:03:27,389 INFO L225 Difference]: With dead ends: 10204 [2024-10-11 05:03:27,389 INFO L226 Difference]: Without dead ends: 8143 [2024-10-11 05:03:27,397 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-11 05:03:27,398 INFO L432 NwaCegarLoop]: 246 mSDtfsCounter, 692 mSDsluCounter, 766 mSDsCounter, 0 mSdLazyCounter, 1440 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 716 SdHoareTripleChecker+Valid, 1012 SdHoareTripleChecker+Invalid, 1523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 1440 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 05:03:27,398 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [716 Valid, 1012 Invalid, 1523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 1440 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 05:03:27,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8143 states. [2024-10-11 05:03:28,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8143 to 7045. [2024-10-11 05:03:28,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7045 states, 5726 states have (on average 1.4182675515193852) internal successors, (8121), 5799 states have internal predecessors, (8121), 714 states have call successors, (714), 499 states have call predecessors, (714), 603 states have return successors, (1135), 784 states have call predecessors, (1135), 713 states have call successors, (1135) [2024-10-11 05:03:28,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7045 states to 7045 states and 9970 transitions. [2024-10-11 05:03:28,075 INFO L78 Accepts]: Start accepts. Automaton has 7045 states and 9970 transitions. Word has length 71 [2024-10-11 05:03:28,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:03:28,075 INFO L471 AbstractCegarLoop]: Abstraction has 7045 states and 9970 transitions. [2024-10-11 05:03:28,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 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:03:28,076 INFO L276 IsEmpty]: Start isEmpty. Operand 7045 states and 9970 transitions. [2024-10-11 05:03:28,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-11 05:03:28,081 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:03:28,081 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] [2024-10-11 05:03:28,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-11 05:03:28,081 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:03:28,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:03:28,082 INFO L85 PathProgramCache]: Analyzing trace with hash -618517728, now seen corresponding path program 1 times [2024-10-11 05:03:28,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:03:28,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717953835] [2024-10-11 05:03:28,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:03:28,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:03:28,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:28,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:03:28,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:28,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 05:03:28,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:28,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-11 05:03:28,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:28,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 05:03:28,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:28,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 05:03:28,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:28,152 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:03:28,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:03:28,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717953835] [2024-10-11 05:03:28,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717953835] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:03:28,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:03:28,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 05:03:28,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744913201] [2024-10-11 05:03:28,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:03:28,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 05:03:28,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:03:28,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 05:03:28,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:03:28,154 INFO L87 Difference]: Start difference. First operand 7045 states and 9970 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 4 states have internal predecessors, (61), 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:03:29,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:03:29,584 INFO L93 Difference]: Finished difference Result 11960 states and 17678 transitions. [2024-10-11 05:03:29,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 05:03:29,585 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 4 states have internal predecessors, (61), 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 71 [2024-10-11 05:03:29,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:03:29,612 INFO L225 Difference]: With dead ends: 11960 [2024-10-11 05:03:29,612 INFO L226 Difference]: Without dead ends: 7969 [2024-10-11 05:03:29,624 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-10-11 05:03:29,625 INFO L432 NwaCegarLoop]: 192 mSDtfsCounter, 264 mSDsluCounter, 533 mSDsCounter, 0 mSdLazyCounter, 853 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 725 SdHoareTripleChecker+Invalid, 917 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 853 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 05:03:29,625 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 725 Invalid, 917 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 853 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 05:03:29,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7969 states. [2024-10-11 05:03:30,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7969 to 7111. [2024-10-11 05:03:30,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7111 states, 5792 states have (on average 1.4135013812154695) internal successors, (8187), 5865 states have internal predecessors, (8187), 714 states have call successors, (714), 499 states have call predecessors, (714), 603 states have return successors, (1135), 784 states have call predecessors, (1135), 713 states have call successors, (1135) [2024-10-11 05:03:30,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7111 states to 7111 states and 10036 transitions. [2024-10-11 05:03:30,301 INFO L78 Accepts]: Start accepts. Automaton has 7111 states and 10036 transitions. Word has length 71 [2024-10-11 05:03:30,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:03:30,301 INFO L471 AbstractCegarLoop]: Abstraction has 7111 states and 10036 transitions. [2024-10-11 05:03:30,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 4 states have internal predecessors, (61), 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:03:30,301 INFO L276 IsEmpty]: Start isEmpty. Operand 7111 states and 10036 transitions. [2024-10-11 05:03:30,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-11 05:03:30,307 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:03:30,307 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] [2024-10-11 05:03:30,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-11 05:03:30,307 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:03:30,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:03:30,307 INFO L85 PathProgramCache]: Analyzing trace with hash 1627061726, now seen corresponding path program 1 times [2024-10-11 05:03:30,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:03:30,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231178170] [2024-10-11 05:03:30,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:03:30,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:03:30,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:30,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:03:30,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:30,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 05:03:30,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:30,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-11 05:03:30,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:30,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 05:03:30,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:30,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 05:03:30,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:30,397 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:03:30,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:03:30,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231178170] [2024-10-11 05:03:30,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231178170] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:03:30,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:03:30,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:03:30,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996630435] [2024-10-11 05:03:30,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:03:30,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:03:30,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:03:30,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:03:30,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:03:30,400 INFO L87 Difference]: Start difference. First operand 7111 states and 10036 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 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:03:32,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:03:32,818 INFO L93 Difference]: Finished difference Result 21102 states and 32121 transitions. [2024-10-11 05:03:32,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-11 05:03:32,819 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 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 71 [2024-10-11 05:03:32,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:03:32,888 INFO L225 Difference]: With dead ends: 21102 [2024-10-11 05:03:32,888 INFO L226 Difference]: Without dead ends: 17045 [2024-10-11 05:03:32,913 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2024-10-11 05:03:32,914 INFO L432 NwaCegarLoop]: 281 mSDtfsCounter, 1456 mSDsluCounter, 578 mSDsCounter, 0 mSdLazyCounter, 1361 mSolverCounterSat, 274 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1473 SdHoareTripleChecker+Valid, 859 SdHoareTripleChecker+Invalid, 1635 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 274 IncrementalHoareTripleChecker+Valid, 1361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-11 05:03:32,914 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1473 Valid, 859 Invalid, 1635 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [274 Valid, 1361 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-11 05:03:32,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17045 states. [2024-10-11 05:03:34,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17045 to 14765. [2024-10-11 05:03:34,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14765 states, 12311 states have (on average 1.4520347656567298) internal successors, (17876), 12499 states have internal predecessors, (17876), 1387 states have call successors, (1387), 897 states have call predecessors, (1387), 1065 states have return successors, (2460), 1406 states have call predecessors, (2460), 1386 states have call successors, (2460) [2024-10-11 05:03:34,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14765 states to 14765 states and 21723 transitions. [2024-10-11 05:03:34,651 INFO L78 Accepts]: Start accepts. Automaton has 14765 states and 21723 transitions. Word has length 71 [2024-10-11 05:03:34,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:03:34,652 INFO L471 AbstractCegarLoop]: Abstraction has 14765 states and 21723 transitions. [2024-10-11 05:03:34,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 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:03:34,652 INFO L276 IsEmpty]: Start isEmpty. Operand 14765 states and 21723 transitions. [2024-10-11 05:03:34,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-11 05:03:34,659 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:03:34,659 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:03:34,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-11 05:03:34,659 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:03:34,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:03:34,660 INFO L85 PathProgramCache]: Analyzing trace with hash -1810871584, now seen corresponding path program 1 times [2024-10-11 05:03:34,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:03:34,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524156385] [2024-10-11 05:03:34,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:03:34,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:03:34,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:34,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:03:34,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:34,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:03:34,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:34,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:03:34,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:34,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:03:34,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:34,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 05:03:34,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:34,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 05:03:34,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:34,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:03:34,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:34,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 05:03:34,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:34,758 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:03:34,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:03:34,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524156385] [2024-10-11 05:03:34,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524156385] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:03:34,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:03:34,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 05:03:34,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404629454] [2024-10-11 05:03:34,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:03:34,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 05:03:34,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:03:34,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 05:03:34,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-11 05:03:34,760 INFO L87 Difference]: Start difference. First operand 14765 states and 21723 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:03:37,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:03:37,295 INFO L93 Difference]: Finished difference Result 21063 states and 29566 transitions. [2024-10-11 05:03:37,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-11 05:03:37,295 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:03:37,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:03:37,361 INFO L225 Difference]: With dead ends: 21063 [2024-10-11 05:03:37,361 INFO L226 Difference]: Without dead ends: 16826 [2024-10-11 05:03:37,380 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2024-10-11 05:03:37,381 INFO L432 NwaCegarLoop]: 202 mSDtfsCounter, 658 mSDsluCounter, 757 mSDsCounter, 0 mSdLazyCounter, 938 mSolverCounterSat, 167 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 673 SdHoareTripleChecker+Valid, 959 SdHoareTripleChecker+Invalid, 1105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 167 IncrementalHoareTripleChecker+Valid, 938 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 05:03:37,382 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [673 Valid, 959 Invalid, 1105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [167 Valid, 938 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 05:03:37,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16826 states. [2024-10-11 05:03:39,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16826 to 16506. [2024-10-11 05:03:39,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16506 states, 13595 states have (on average 1.4288341301949246) internal successors, (19425), 13826 states have internal predecessors, (19425), 1591 states have call successors, (1591), 1071 states have call predecessors, (1591), 1318 states have return successors, (2842), 1646 states have call predecessors, (2842), 1590 states have call successors, (2842) [2024-10-11 05:03:39,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16506 states to 16506 states and 23858 transitions. [2024-10-11 05:03:39,117 INFO L78 Accepts]: Start accepts. Automaton has 16506 states and 23858 transitions. Word has length 76 [2024-10-11 05:03:39,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:03:39,117 INFO L471 AbstractCegarLoop]: Abstraction has 16506 states and 23858 transitions. [2024-10-11 05:03:39,118 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:03:39,118 INFO L276 IsEmpty]: Start isEmpty. Operand 16506 states and 23858 transitions. [2024-10-11 05:03:39,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-10-11 05:03:39,128 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:03:39,128 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:03:39,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-11 05:03:39,128 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:03:39,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:03:39,128 INFO L85 PathProgramCache]: Analyzing trace with hash -826737294, now seen corresponding path program 1 times [2024-10-11 05:03:39,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:03:39,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334252300] [2024-10-11 05:03:39,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:03:39,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:03:39,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:39,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:03:39,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:39,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:03:39,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:39,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:03:39,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:39,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:03:39,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:39,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 05:03:39,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:39,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 05:03:39,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:39,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:03:39,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:39,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-11 05:03:39,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:39,226 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:03:39,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:03:39,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334252300] [2024-10-11 05:03:39,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334252300] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:03:39,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:03:39,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 05:03:39,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565581989] [2024-10-11 05:03:39,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:03:39,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 05:03:39,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:03:39,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 05:03:39,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-10-11 05:03:39,228 INFO L87 Difference]: Start difference. First operand 16506 states and 23858 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:03:41,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:03:41,988 INFO L93 Difference]: Finished difference Result 20177 states and 28366 transitions. [2024-10-11 05:03:41,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-11 05:03:41,989 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:03:41,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:03:42,072 INFO L225 Difference]: With dead ends: 20177 [2024-10-11 05:03:42,072 INFO L226 Difference]: Without dead ends: 15997 [2024-10-11 05:03:42,092 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=162, Invalid=540, Unknown=0, NotChecked=0, Total=702 [2024-10-11 05:03:42,092 INFO L432 NwaCegarLoop]: 193 mSDtfsCounter, 1193 mSDsluCounter, 790 mSDsCounter, 0 mSdLazyCounter, 1109 mSolverCounterSat, 291 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1230 SdHoareTripleChecker+Valid, 983 SdHoareTripleChecker+Invalid, 1400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 291 IncrementalHoareTripleChecker+Valid, 1109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 05:03:42,093 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1230 Valid, 983 Invalid, 1400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [291 Valid, 1109 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 05:03:42,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15997 states. [2024-10-11 05:03:43,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15997 to 15663. [2024-10-11 05:03:43,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15663 states, 12965 states have (on average 1.4350173544157347) internal successors, (18605), 13178 states have internal predecessors, (18605), 1492 states have call successors, (1492), 986 states have call predecessors, (1492), 1204 states have return successors, (2620), 1536 states have call predecessors, (2620), 1491 states have call successors, (2620) [2024-10-11 05:03:43,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15663 states to 15663 states and 22717 transitions. [2024-10-11 05:03:43,784 INFO L78 Accepts]: Start accepts. Automaton has 15663 states and 22717 transitions. Word has length 86 [2024-10-11 05:03:43,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:03:43,785 INFO L471 AbstractCegarLoop]: Abstraction has 15663 states and 22717 transitions. [2024-10-11 05:03:43,785 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:03:43,785 INFO L276 IsEmpty]: Start isEmpty. Operand 15663 states and 22717 transitions. [2024-10-11 05:03:43,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-11 05:03:43,807 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:03:43,807 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-11 05:03:43,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-11 05:03:43,808 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:03:43,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:03:43,808 INFO L85 PathProgramCache]: Analyzing trace with hash 1337323179, now seen corresponding path program 1 times [2024-10-11 05:03:43,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:03:43,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143331755] [2024-10-11 05:03:43,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:03:43,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:03:43,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:43,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:03:43,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:43,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 05:03:43,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:43,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-11 05:03:43,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:43,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 05:03:43,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:43,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 05:03:43,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:43,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 05:03:43,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:43,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 05:03:43,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:43,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 05:03:43,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:43,890 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-10-11 05:03:43,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:03:43,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143331755] [2024-10-11 05:03:43,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143331755] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 05:03:43,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [229804284] [2024-10-11 05:03:43,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:03:43,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 05:03:43,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 05:03:43,892 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:03:43,896 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:03:43,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:43,985 INFO L255 TraceCheckSpWp]: Trace formula consists of 462 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 05:03:43,987 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 05:03:44,029 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-11 05:03:44,030 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 05:03:44,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [229804284] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:03:44,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 05:03:44,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2024-10-11 05:03:44,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322377316] [2024-10-11 05:03:44,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:03:44,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 05:03:44,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:03:44,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 05:03:44,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:03:44,032 INFO L87 Difference]: Start difference. First operand 15663 states and 22717 transitions. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 2 states have internal predecessors, (87), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 05:03:46,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:03:46,140 INFO L93 Difference]: Finished difference Result 38768 states and 58591 transitions. [2024-10-11 05:03:46,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 05:03:46,141 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 2 states have internal predecessors, (87), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 115 [2024-10-11 05:03:46,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:03:46,250 INFO L225 Difference]: With dead ends: 38768 [2024-10-11 05:03:46,250 INFO L226 Difference]: Without dead ends: 27057 [2024-10-11 05:03:46,296 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:03:46,298 INFO L432 NwaCegarLoop]: 304 mSDtfsCounter, 285 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 05:03:46,298 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [285 Valid, 477 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 05:03:46,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27057 states. [2024-10-11 05:03:49,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27057 to 26955. [2024-10-11 05:03:49,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26955 states, 22603 states have (on average 1.4548511259567314) internal successors, (32884), 22963 states have internal predecessors, (32884), 2458 states have call successors, (2458), 1578 states have call predecessors, (2458), 1892 states have return successors, (4455), 2451 states have call predecessors, (4455), 2457 states have call successors, (4455) [2024-10-11 05:03:49,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26955 states to 26955 states and 39797 transitions. [2024-10-11 05:03:49,156 INFO L78 Accepts]: Start accepts. Automaton has 26955 states and 39797 transitions. Word has length 115 [2024-10-11 05:03:49,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:03:49,156 INFO L471 AbstractCegarLoop]: Abstraction has 26955 states and 39797 transitions. [2024-10-11 05:03:49,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 2 states have internal predecessors, (87), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 05:03:49,157 INFO L276 IsEmpty]: Start isEmpty. Operand 26955 states and 39797 transitions. [2024-10-11 05:03:49,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-11 05:03:49,197 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:03:49,198 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-11 05:03:49,213 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:03:49,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 05:03:49,399 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:03:49,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:03:49,400 INFO L85 PathProgramCache]: Analyzing trace with hash 1108002025, now seen corresponding path program 1 times [2024-10-11 05:03:49,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:03:49,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636107153] [2024-10-11 05:03:49,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:03:49,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:03:49,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:49,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:03:49,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:49,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 05:03:49,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:49,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-11 05:03:49,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:49,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 05:03:49,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:49,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 05:03:49,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:49,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 05:03:49,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:49,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 05:03:49,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:49,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 05:03:49,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:49,516 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-10-11 05:03:49,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:03:49,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636107153] [2024-10-11 05:03:49,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636107153] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 05:03:49,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [683094233] [2024-10-11 05:03:49,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:03:49,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 05:03:49,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 05:03:49,519 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:03:49,521 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:03:49,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:49,624 INFO L255 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 05:03:49,629 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 05:03:49,651 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-10-11 05:03:49,652 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 05:03:49,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [683094233] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:03:49,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 05:03:49,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-10-11 05:03:49,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878691587] [2024-10-11 05:03:49,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:03:49,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 05:03:49,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:03:49,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 05:03:49,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:03:49,653 INFO L87 Difference]: Start difference. First operand 26955 states and 39797 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 05:03:53,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:03:53,346 INFO L93 Difference]: Finished difference Result 71904 states and 108757 transitions. [2024-10-11 05:03:53,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 05:03:53,346 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 115 [2024-10-11 05:03:53,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:03:53,451 INFO L225 Difference]: With dead ends: 71904 [2024-10-11 05:03:53,452 INFO L226 Difference]: Without dead ends: 30912 [2024-10-11 05:03:53,524 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:03:53,525 INFO L432 NwaCegarLoop]: 478 mSDtfsCounter, 182 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 782 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 05:03:53,525 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 782 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 05:03:53,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30912 states. [2024-10-11 05:03:56,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30912 to 30912. [2024-10-11 05:03:56,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30912 states, 25989 states have (on average 1.4575397283466083) internal successors, (37880), 26381 states have internal predecessors, (37880), 2793 states have call successors, (2793), 1782 states have call predecessors, (2793), 2128 states have return successors, (5085), 2786 states have call predecessors, (5085), 2792 states have call successors, (5085) [2024-10-11 05:03:56,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30912 states to 30912 states and 45758 transitions. [2024-10-11 05:03:56,239 INFO L78 Accepts]: Start accepts. Automaton has 30912 states and 45758 transitions. Word has length 115 [2024-10-11 05:03:56,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:03:56,240 INFO L471 AbstractCegarLoop]: Abstraction has 30912 states and 45758 transitions. [2024-10-11 05:03:56,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 05:03:56,240 INFO L276 IsEmpty]: Start isEmpty. Operand 30912 states and 45758 transitions. [2024-10-11 05:03:56,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-11 05:03:56,273 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:03:56,273 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:03:56,288 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:03:56,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 05:03:56,478 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:03:56,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:03:56,478 INFO L85 PathProgramCache]: Analyzing trace with hash -1385852961, now seen corresponding path program 1 times [2024-10-11 05:03:56,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:03:56,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711195344] [2024-10-11 05:03:56,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:03:56,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:03:56,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:56,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:03:56,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:56,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:03:56,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:56,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:03:56,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:56,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:03:56,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:56,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 05:03:56,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:56,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 05:03:56,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:56,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:03:56,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:56,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 05:03:56,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:56,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-11 05:03:56,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:56,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 05:03:56,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:56,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 05:03:56,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:56,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:03:56,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:56,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 05:03:56,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:56,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 05:03:56,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:56,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 05:03:56,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:56,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 05:03:56,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:56,601 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:03:56,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:03:56,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711195344] [2024-10-11 05:03:56,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711195344] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 05:03:56,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [508894807] [2024-10-11 05:03:56,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:03:56,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 05:03:56,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 05:03:56,604 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 05:03:56,605 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 05:03:56,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:03:56,689 INFO L255 TraceCheckSpWp]: Trace formula consists of 463 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 05:03:56,692 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 05:03:56,732 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:03:56,735 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 05:03:56,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [508894807] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:03:56,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 05:03:56,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 12 [2024-10-11 05:03:56,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982233396] [2024-10-11 05:03:56,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:03:56,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 05:03:56,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:03:56,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 05:03:56,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-10-11 05:03:56,737 INFO L87 Difference]: Start difference. First operand 30912 states and 45758 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:03:59,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:03:59,439 INFO L93 Difference]: Finished difference Result 32759 states and 48011 transitions. [2024-10-11 05:03:59,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 05:03:59,440 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:03:59,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:03:59,548 INFO L225 Difference]: With dead ends: 32759 [2024-10-11 05:03:59,548 INFO L226 Difference]: Without dead ends: 28843 [2024-10-11 05:03:59,573 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:03:59,574 INFO L432 NwaCegarLoop]: 305 mSDtfsCounter, 0 mSDsluCounter, 1213 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1518 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 05:03:59,574 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1518 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 05:03:59,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28843 states. [2024-10-11 05:04:01,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28843 to 28843. [2024-10-11 05:04:01,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28843 states, 24497 states have (on average 1.4704249499938769) internal successors, (36021), 24838 states have internal predecessors, (36021), 2517 states have call successors, (2517), 1548 states have call predecessors, (2517), 1827 states have return successors, (4692), 2488 states have call predecessors, (4692), 2516 states have call successors, (4692) [2024-10-11 05:04:01,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28843 states to 28843 states and 43230 transitions. [2024-10-11 05:04:01,932 INFO L78 Accepts]: Start accepts. Automaton has 28843 states and 43230 transitions. Word has length 131 [2024-10-11 05:04:01,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:04:01,932 INFO L471 AbstractCegarLoop]: Abstraction has 28843 states and 43230 transitions. [2024-10-11 05:04:01,932 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:04:01,932 INFO L276 IsEmpty]: Start isEmpty. Operand 28843 states and 43230 transitions. [2024-10-11 05:04:01,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-10-11 05:04:01,964 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:04:01,964 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:04:01,977 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-11 05:04:02,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2024-10-11 05:04:02,165 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:04:02,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:04:02,165 INFO L85 PathProgramCache]: Analyzing trace with hash 35117497, now seen corresponding path program 1 times [2024-10-11 05:04:02,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:04:02,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201648274] [2024-10-11 05:04:02,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:04:02,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:04:02,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:02,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:04:02,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:02,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:04:02,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:02,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:04:02,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:02,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:04:02,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:02,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 05:04:02,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:02,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 05:04:02,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:02,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:04:02,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:02,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 05:04:02,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:02,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 05:04:02,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:02,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-11 05:04:02,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:02,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 05:04:02,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:02,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:04:02,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:02,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 05:04:02,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:02,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 05:04:02,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:02,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 05:04:02,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:02,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-11 05:04:02,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:02,225 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:04:02,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:04:02,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201648274] [2024-10-11 05:04:02,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201648274] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:04:02,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:04:02,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 05:04:02,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333955428] [2024-10-11 05:04:02,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:04:02,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 05:04:02,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:04:02,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 05:04:02,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:04:02,227 INFO L87 Difference]: Start difference. First operand 28843 states and 43230 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:04:04,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:04:04,408 INFO L93 Difference]: Finished difference Result 28908 states and 43298 transitions. [2024-10-11 05:04:04,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 05:04:04,408 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:04:04,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:04:04,505 INFO L225 Difference]: With dead ends: 28908 [2024-10-11 05:04:04,505 INFO L226 Difference]: Without dead ends: 28506 [2024-10-11 05:04:04,525 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-10-11 05:04:04,526 INFO L432 NwaCegarLoop]: 179 mSDtfsCounter, 494 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 382 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 509 SdHoareTripleChecker+Valid, 522 SdHoareTripleChecker+Invalid, 490 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 05:04:04,526 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [509 Valid, 522 Invalid, 490 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 382 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 05:04:04,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28506 states. [2024-10-11 05:04:06,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28506 to 28444. [2024-10-11 05:04:06,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28444 states, 24194 states have (on average 1.4738364883855501) internal successors, (35658), 24532 states have internal predecessors, (35658), 2471 states have call successors, (2471), 1508 states have call predecessors, (2471), 1777 states have return successors, (4628), 2435 states have call predecessors, (4628), 2470 states have call successors, (4628) [2024-10-11 05:04:06,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28444 states to 28444 states and 42757 transitions. [2024-10-11 05:04:06,875 INFO L78 Accepts]: Start accepts. Automaton has 28444 states and 42757 transitions. Word has length 133 [2024-10-11 05:04:06,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:04:06,876 INFO L471 AbstractCegarLoop]: Abstraction has 28444 states and 42757 transitions. [2024-10-11 05:04:06,876 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:04:06,876 INFO L276 IsEmpty]: Start isEmpty. Operand 28444 states and 42757 transitions. [2024-10-11 05:04:06,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-10-11 05:04:06,913 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:04:06,913 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:04:06,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-10-11 05:04:06,914 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:04:06,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:04:06,914 INFO L85 PathProgramCache]: Analyzing trace with hash 2104333097, now seen corresponding path program 1 times [2024-10-11 05:04:06,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:04:06,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850658993] [2024-10-11 05:04:06,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:04:06,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:04:06,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:06,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:04:06,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:06,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:04:06,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:06,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:04:06,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:06,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:04:06,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:06,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 05:04:06,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:06,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 05:04:06,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:06,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:04:06,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:06,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 05:04:06,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:06,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 05:04:06,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:06,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 05:04:06,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:06,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 05:04:06,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:06,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:04:06,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:06,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 05:04:06,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:06,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 05:04:06,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:06,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-11 05:04:06,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:06,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-11 05:04:07,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:07,003 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:04:07,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:04:07,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850658993] [2024-10-11 05:04:07,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850658993] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:04:07,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:04:07,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:04:07,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187981876] [2024-10-11 05:04:07,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:04:07,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:04:07,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:04:07,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:04:07,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:04:07,005 INFO L87 Difference]: Start difference. First operand 28444 states and 42757 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:04:09,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:04:09,241 INFO L93 Difference]: Finished difference Result 29791 states and 44426 transitions. [2024-10-11 05:04:09,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 05:04:09,241 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:04:09,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:04:09,345 INFO L225 Difference]: With dead ends: 29791 [2024-10-11 05:04:09,345 INFO L226 Difference]: Without dead ends: 28551 [2024-10-11 05:04:09,364 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:04:09,365 INFO L432 NwaCegarLoop]: 208 mSDtfsCounter, 427 mSDsluCounter, 582 mSDsCounter, 0 mSdLazyCounter, 689 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 428 SdHoareTripleChecker+Valid, 790 SdHoareTripleChecker+Invalid, 790 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 689 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 05:04:09,365 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [428 Valid, 790 Invalid, 790 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 689 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 05:04:09,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28551 states. [2024-10-11 05:04:11,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28551 to 28369. [2024-10-11 05:04:11,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28369 states, 24141 states have (on average 1.474213992792345) internal successors, (35589), 24480 states have internal predecessors, (35589), 2462 states have call successors, (2462), 1503 states have call predecessors, (2462), 1764 states have return successors, (4612), 2417 states have call predecessors, (4612), 2461 states have call successors, (4612) [2024-10-11 05:04:11,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28369 states to 28369 states and 42663 transitions. [2024-10-11 05:04:11,619 INFO L78 Accepts]: Start accepts. Automaton has 28369 states and 42663 transitions. Word has length 145 [2024-10-11 05:04:11,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:04:11,619 INFO L471 AbstractCegarLoop]: Abstraction has 28369 states and 42663 transitions. [2024-10-11 05:04:11,619 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:04:11,620 INFO L276 IsEmpty]: Start isEmpty. Operand 28369 states and 42663 transitions. [2024-10-11 05:04:11,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-10-11 05:04:11,653 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:04:11,653 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:04:11,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-10-11 05:04:11,654 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:04:11,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:04:11,654 INFO L85 PathProgramCache]: Analyzing trace with hash 352784505, now seen corresponding path program 1 times [2024-10-11 05:04:11,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:04:11,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645813235] [2024-10-11 05:04:11,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:04:11,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:04:11,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:11,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:04:11,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:11,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:04:11,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:11,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:04:11,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:11,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:04:11,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:11,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 05:04:11,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:11,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 05:04:11,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:11,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:04:11,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:11,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 05:04:11,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:11,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 05:04:11,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:11,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 05:04:11,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:11,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 05:04:11,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:11,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:04:11,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:11,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 05:04:11,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:11,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 05:04:11,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:11,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 05:04:11,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:11,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-11 05:04:11,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:11,805 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:04:11,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:04:11,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645813235] [2024-10-11 05:04:11,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645813235] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 05:04:11,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2135185430] [2024-10-11 05:04:11,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:04:11,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 05:04:11,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 05:04:11,807 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 05:04:11,808 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-11 05:04:11,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:11,907 INFO L255 TraceCheckSpWp]: Trace formula consists of 528 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-11 05:04:11,910 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 05:04:12,010 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:04:12,011 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 05:04:12,192 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:04:12,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2135185430] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 05:04:12,193 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 05:04:12,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 14 [2024-10-11 05:04:12,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239096723] [2024-10-11 05:04:12,193 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 05:04:12,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-11 05:04:12,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:04:12,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-11 05:04:12,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2024-10-11 05:04:12,195 INFO L87 Difference]: Start difference. First operand 28369 states and 42663 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:04:15,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:04:15,187 INFO L93 Difference]: Finished difference Result 30176 states and 44951 transitions. [2024-10-11 05:04:15,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-10-11 05:04:15,187 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:04:15,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:04:15,292 INFO L225 Difference]: With dead ends: 30176 [2024-10-11 05:04:15,292 INFO L226 Difference]: Without dead ends: 28874 [2024-10-11 05:04:15,310 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 356 GetRequests, 327 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=232, Invalid=638, Unknown=0, NotChecked=0, Total=870 [2024-10-11 05:04:15,310 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 1429 mSDsluCounter, 443 mSDsCounter, 0 mSdLazyCounter, 1027 mSolverCounterSat, 362 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1450 SdHoareTripleChecker+Valid, 598 SdHoareTripleChecker+Invalid, 1389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 362 IncrementalHoareTripleChecker+Valid, 1027 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 05:04:15,311 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1450 Valid, 598 Invalid, 1389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [362 Valid, 1027 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 05:04:15,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28874 states. [2024-10-11 05:04:17,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28874 to 28730. [2024-10-11 05:04:17,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28730 states, 24390 states have (on average 1.4703977039770397) internal successors, (35863), 24737 states have internal predecessors, (35863), 2516 states have call successors, (2516), 1553 states have call predecessors, (2516), 1822 states have return successors, (4726), 2471 states have call predecessors, (4726), 2515 states have call successors, (4726) [2024-10-11 05:04:17,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28730 states to 28730 states and 43105 transitions. [2024-10-11 05:04:17,617 INFO L78 Accepts]: Start accepts. Automaton has 28730 states and 43105 transitions. Word has length 147 [2024-10-11 05:04:17,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:04:17,617 INFO L471 AbstractCegarLoop]: Abstraction has 28730 states and 43105 transitions. [2024-10-11 05:04:17,617 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:04:17,617 INFO L276 IsEmpty]: Start isEmpty. Operand 28730 states and 43105 transitions. [2024-10-11 05:04:17,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-10-11 05:04:17,656 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:04:17,657 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-11 05:04:17,669 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-11 05:04:17,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-10-11 05:04:17,861 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:04:17,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:04:17,861 INFO L85 PathProgramCache]: Analyzing trace with hash -1663998302, now seen corresponding path program 1 times [2024-10-11 05:04:17,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:04:17,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276488656] [2024-10-11 05:04:17,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:04:17,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:04:17,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:17,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:04:17,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:17,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 05:04:17,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:17,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-11 05:04:17,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:17,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 05:04:17,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:17,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 05:04:17,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:17,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 05:04:17,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:17,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 05:04:17,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:17,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 05:04:17,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:17,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 05:04:17,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:17,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-11 05:04:17,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:17,961 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-10-11 05:04:17,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:04:17,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276488656] [2024-10-11 05:04:17,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276488656] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 05:04:17,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [963578727] [2024-10-11 05:04:17,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:04:17,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 05:04:17,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 05:04:17,963 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 05:04:17,964 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-11 05:04:18,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:04:18,054 INFO L255 TraceCheckSpWp]: Trace formula consists of 565 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 05:04:18,057 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 05:04:18,143 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-10-11 05:04:18,144 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 05:04:18,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [963578727] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:04:18,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 05:04:18,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2024-10-11 05:04:18,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834914841] [2024-10-11 05:04:18,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:04:18,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 05:04:18,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:04:18,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 05:04:18,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:04:18,145 INFO L87 Difference]: Start difference. First operand 28730 states and 43105 transitions. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 2 states have internal predecessors, (104), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10)