/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/combinations/pc_sfifo_2.cil-1+token_ring.06.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 02:34:05,996 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 02:34:05,998 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 02:34:06,043 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 02:34:06,043 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 02:34:06,044 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 02:34:06,045 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 02:34:06,060 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 02:34:06,064 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 02:34:06,064 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 02:34:06,065 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 02:34:06,066 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 02:34:06,066 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 02:34:06,067 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 02:34:06,068 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 02:34:06,069 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 02:34:06,070 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 02:34:06,070 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 02:34:06,072 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 02:34:06,074 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 02:34:06,075 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 02:34:06,076 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 02:34:06,077 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 02:34:06,078 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 02:34:06,080 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 02:34:06,080 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 02:34:06,081 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 02:34:06,081 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 02:34:06,082 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 02:34:06,083 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 02:34:06,083 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 02:34:06,084 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 02:34:06,084 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 02:34:06,085 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 02:34:06,086 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 02:34:06,086 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 02:34:06,087 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 02:34:06,087 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 02:34:06,087 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 02:34:06,088 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 02:34:06,089 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 02:34:06,093 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_Default.epf [2022-01-10 02:34:06,117 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 02:34:06,117 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 02:34:06,118 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 02:34:06,118 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 02:34:06,119 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-10 02:34:06,119 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-10 02:34:06,119 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 02:34:06,119 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 02:34:06,120 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 02:34:06,120 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 02:34:06,120 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 02:34:06,120 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 02:34:06,120 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 02:34:06,121 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 02:34:06,121 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 02:34:06,121 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 02:34:06,121 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 02:34:06,121 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 02:34:06,121 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 02:34:06,122 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 02:34:06,122 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 02:34:06,122 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 02:34:06,122 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 02:34:06,122 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 02:34:06,122 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 02:34:06,123 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-10 02:34:06,123 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-10 02:34:06,125 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 02:34:06,125 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 02:34:06,126 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 02:34:06,126 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-01-10 02:34:06,365 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 02:34:06,389 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 02:34:06,391 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 02:34:06,392 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 02:34:06,393 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 02:34:06,395 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/combinations/pc_sfifo_2.cil-1+token_ring.06.cil-2.c [2022-01-10 02:34:06,450 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5cd008263/68cda5b905974ab1906c1a62e2fdaab6/FLAGbbf9cdde6 [2022-01-10 02:34:06,949 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 02:34:06,949 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/combinations/pc_sfifo_2.cil-1+token_ring.06.cil-2.c [2022-01-10 02:34:06,961 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5cd008263/68cda5b905974ab1906c1a62e2fdaab6/FLAGbbf9cdde6 [2022-01-10 02:34:07,289 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5cd008263/68cda5b905974ab1906c1a62e2fdaab6 [2022-01-10 02:34:07,291 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 02:34:07,292 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-10 02:34:07,295 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 02:34:07,296 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 02:34:07,300 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 02:34:07,300 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 02:34:07" (1/1) ... [2022-01-10 02:34:07,301 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10eb82de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:34:07, skipping insertion in model container [2022-01-10 02:34:07,301 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 02:34:07" (1/1) ... [2022-01-10 02:34:07,306 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 02:34:07,358 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 02:34:07,534 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/pc_sfifo_2.cil-1+token_ring.06.cil-2.c[914,927] [2022-01-10 02:34:07,603 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/pc_sfifo_2.cil-1+token_ring.06.cil-2.c[7115,7128] [2022-01-10 02:34:07,686 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 02:34:07,700 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 02:34:07,711 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/pc_sfifo_2.cil-1+token_ring.06.cil-2.c[914,927] [2022-01-10 02:34:07,737 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/pc_sfifo_2.cil-1+token_ring.06.cil-2.c[7115,7128] [2022-01-10 02:34:07,764 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 02:34:07,780 INFO L208 MainTranslator]: Completed translation [2022-01-10 02:34:07,780 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:34:07 WrapperNode [2022-01-10 02:34:07,781 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 02:34:07,781 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 02:34:07,782 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 02:34:07,782 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 02:34:07,790 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:34:07" (1/1) ... [2022-01-10 02:34:07,815 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:34:07" (1/1) ... [2022-01-10 02:34:07,860 INFO L137 Inliner]: procedures = 65, calls = 75, calls flagged for inlining = 34, calls inlined = 34, statements flattened = 692 [2022-01-10 02:34:07,861 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 02:34:07,862 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 02:34:07,862 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 02:34:07,862 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 02:34:07,875 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:34:07" (1/1) ... [2022-01-10 02:34:07,875 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:34:07" (1/1) ... [2022-01-10 02:34:07,885 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:34:07" (1/1) ... [2022-01-10 02:34:07,885 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:34:07" (1/1) ... [2022-01-10 02:34:07,898 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:34:07" (1/1) ... [2022-01-10 02:34:07,907 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:34:07" (1/1) ... [2022-01-10 02:34:07,909 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:34:07" (1/1) ... [2022-01-10 02:34:07,912 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 02:34:07,913 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 02:34:07,913 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 02:34:07,913 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 02:34:07,914 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:34:07" (1/1) ... [2022-01-10 02:34:07,935 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 02:34:07,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 02:34:07,960 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-10 02:34:07,965 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-10 02:34:07,991 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 02:34:07,992 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-01-10 02:34:07,992 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-01-10 02:34:07,992 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2022-01-10 02:34:07,992 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2022-01-10 02:34:07,992 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2022-01-10 02:34:07,992 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2022-01-10 02:34:07,992 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2022-01-10 02:34:07,993 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2022-01-10 02:34:07,993 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2022-01-10 02:34:07,993 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2022-01-10 02:34:07,993 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2022-01-10 02:34:07,993 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2022-01-10 02:34:07,993 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2022-01-10 02:34:07,993 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2022-01-10 02:34:07,993 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2022-01-10 02:34:07,994 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2022-01-10 02:34:07,994 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2022-01-10 02:34:07,994 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2022-01-10 02:34:07,994 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2022-01-10 02:34:07,994 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2022-01-10 02:34:07,995 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2022-01-10 02:34:07,995 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2022-01-10 02:34:07,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-10 02:34:07,995 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2022-01-10 02:34:07,995 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2022-01-10 02:34:07,995 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2022-01-10 02:34:07,995 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2022-01-10 02:34:07,995 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 02:34:07,996 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 02:34:07,996 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2022-01-10 02:34:07,996 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2022-01-10 02:34:08,120 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 02:34:08,121 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 02:34:08,716 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 02:34:08,732 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 02:34:08,733 INFO L299 CfgBuilder]: Removed 13 assume(true) statements. [2022-01-10 02:34:08,735 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 02:34:08 BoogieIcfgContainer [2022-01-10 02:34:08,735 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 02:34:08,737 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 02:34:08,737 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 02:34:08,740 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 02:34:08,740 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 02:34:07" (1/3) ... [2022-01-10 02:34:08,741 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36cbb16b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 02:34:08, skipping insertion in model container [2022-01-10 02:34:08,741 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:34:07" (2/3) ... [2022-01-10 02:34:08,741 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36cbb16b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 02:34:08, skipping insertion in model container [2022-01-10 02:34:08,741 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 02:34:08" (3/3) ... [2022-01-10 02:34:08,742 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-1+token_ring.06.cil-2.c [2022-01-10 02:34:08,746 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 02:34:08,746 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-01-10 02:34:08,785 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 02:34:08,791 INFO L339 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, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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, mLoopAccelerationTechnique=FAST_UPR [2022-01-10 02:34:08,791 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-01-10 02:34:08,810 INFO L276 IsEmpty]: Start isEmpty. Operand has 333 states, 282 states have (on average 1.6063829787234043) internal successors, (453), 288 states have internal predecessors, (453), 34 states have call successors, (34), 14 states have call predecessors, (34), 14 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2022-01-10 02:34:08,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-01-10 02:34:08,818 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:34:08,818 INFO L514 BasicCegarLoop]: 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] [2022-01-10 02:34:08,819 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:34:08,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:34:08,823 INFO L85 PathProgramCache]: Analyzing trace with hash 751120114, now seen corresponding path program 1 times [2022-01-10 02:34:08,830 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:34:08,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812744742] [2022-01-10 02:34:08,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:34:08,831 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:34:08,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:09,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:34:09,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:09,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-10 02:34:09,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:09,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-10 02:34:09,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:09,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-10 02:34:09,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:09,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 02:34:09,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:09,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-01-10 02:34:09,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:09,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-01-10 02:34:09,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:09,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 02:34:09,127 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:34:09,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812744742] [2022-01-10 02:34:09,127 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812744742] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:34:09,127 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:34:09,128 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-10 02:34:09,129 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23843258] [2022-01-10 02:34:09,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:34:09,132 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-10 02:34:09,133 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:34:09,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-10 02:34:09,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-01-10 02:34:09,160 INFO L87 Difference]: Start difference. First operand has 333 states, 282 states have (on average 1.6063829787234043) internal successors, (453), 288 states have internal predecessors, (453), 34 states have call successors, (34), 14 states have call predecessors, (34), 14 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 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) [2022-01-10 02:34:10,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:34:10,081 INFO L93 Difference]: Finished difference Result 779 states and 1212 transitions. [2022-01-10 02:34:10,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-10 02:34:10,084 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 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 65 [2022-01-10 02:34:10,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:34:10,095 INFO L225 Difference]: With dead ends: 779 [2022-01-10 02:34:10,096 INFO L226 Difference]: Without dead ends: 458 [2022-01-10 02:34:10,100 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2022-01-10 02:34:10,103 INFO L933 BasicCegarLoop]: 496 mSDtfsCounter, 846 mSDsluCounter, 1134 mSDsCounter, 0 mSdLazyCounter, 829 mSolverCounterSat, 184 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 851 SdHoareTripleChecker+Valid, 1630 SdHoareTripleChecker+Invalid, 1013 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 184 IncrementalHoareTripleChecker+Valid, 829 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-01-10 02:34:10,104 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [851 Valid, 1630 Invalid, 1013 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [184 Valid, 829 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-01-10 02:34:10,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2022-01-10 02:34:10,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 419. [2022-01-10 02:34:10,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 419 states, 350 states have (on average 1.4857142857142858) internal successors, (520), 356 states have internal predecessors, (520), 45 states have call successors, (45), 21 states have call predecessors, (45), 22 states have return successors, (48), 44 states have call predecessors, (48), 43 states have call successors, (48) [2022-01-10 02:34:10,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 613 transitions. [2022-01-10 02:34:10,169 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 613 transitions. Word has length 65 [2022-01-10 02:34:10,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:34:10,170 INFO L470 AbstractCegarLoop]: Abstraction has 419 states and 613 transitions. [2022-01-10 02:34:10,170 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 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) [2022-01-10 02:34:10,170 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 613 transitions. [2022-01-10 02:34:10,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-01-10 02:34:10,173 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:34:10,173 INFO L514 BasicCegarLoop]: 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] [2022-01-10 02:34:10,174 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-10 02:34:10,174 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:34:10,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:34:10,175 INFO L85 PathProgramCache]: Analyzing trace with hash -1864958542, now seen corresponding path program 1 times [2022-01-10 02:34:10,175 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:34:10,175 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2147156430] [2022-01-10 02:34:10,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:34:10,175 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:34:10,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:10,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:34:10,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:10,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-10 02:34:10,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:10,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-10 02:34:10,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:10,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-10 02:34:10,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:10,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 02:34:10,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:10,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-01-10 02:34:10,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:10,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-01-10 02:34:10,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:10,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 02:34:10,330 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:34:10,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2147156430] [2022-01-10 02:34:10,330 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2147156430] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:34:10,330 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:34:10,331 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-10 02:34:10,331 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558602680] [2022-01-10 02:34:10,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:34:10,332 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-10 02:34:10,332 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:34:10,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-10 02:34:10,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-01-10 02:34:10,333 INFO L87 Difference]: Start difference. First operand 419 states and 613 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 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) [2022-01-10 02:34:11,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:34:11,177 INFO L93 Difference]: Finished difference Result 766 states and 1090 transitions. [2022-01-10 02:34:11,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-01-10 02:34:11,178 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 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 65 [2022-01-10 02:34:11,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:34:11,182 INFO L225 Difference]: With dead ends: 766 [2022-01-10 02:34:11,182 INFO L226 Difference]: Without dead ends: 589 [2022-01-10 02:34:11,183 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2022-01-10 02:34:11,184 INFO L933 BasicCegarLoop]: 532 mSDtfsCounter, 1188 mSDsluCounter, 1086 mSDsCounter, 0 mSdLazyCounter, 1016 mSolverCounterSat, 182 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1213 SdHoareTripleChecker+Valid, 1618 SdHoareTripleChecker+Invalid, 1198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 182 IncrementalHoareTripleChecker+Valid, 1016 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-01-10 02:34:11,185 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1213 Valid, 1618 Invalid, 1198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [182 Valid, 1016 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-01-10 02:34:11,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2022-01-10 02:34:11,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 515. [2022-01-10 02:34:11,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 515 states, 426 states have (on average 1.4647887323943662) internal successors, (624), 434 states have internal predecessors, (624), 56 states have call successors, (56), 28 states have call predecessors, (56), 31 states have return successors, (67), 56 states have call predecessors, (67), 54 states have call successors, (67) [2022-01-10 02:34:11,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 747 transitions. [2022-01-10 02:34:11,224 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 747 transitions. Word has length 65 [2022-01-10 02:34:11,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:34:11,224 INFO L470 AbstractCegarLoop]: Abstraction has 515 states and 747 transitions. [2022-01-10 02:34:11,224 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 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) [2022-01-10 02:34:11,224 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 747 transitions. [2022-01-10 02:34:11,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-01-10 02:34:11,227 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:34:11,227 INFO L514 BasicCegarLoop]: 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] [2022-01-10 02:34:11,227 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-10 02:34:11,227 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:34:11,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:34:11,228 INFO L85 PathProgramCache]: Analyzing trace with hash 401422644, now seen corresponding path program 1 times [2022-01-10 02:34:11,228 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:34:11,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607405527] [2022-01-10 02:34:11,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:34:11,228 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:34:11,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:11,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:34:11,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:11,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-10 02:34:11,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:11,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-10 02:34:11,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:11,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-10 02:34:11,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:11,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 02:34:11,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:11,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-01-10 02:34:11,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:11,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-01-10 02:34:11,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:11,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 02:34:11,337 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:34:11,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607405527] [2022-01-10 02:34:11,337 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607405527] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:34:11,337 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:34:11,337 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-10 02:34:11,338 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516939855] [2022-01-10 02:34:11,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:34:11,338 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-10 02:34:11,338 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:34:11,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-10 02:34:11,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-01-10 02:34:11,339 INFO L87 Difference]: Start difference. First operand 515 states and 747 transitions. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-01-10 02:34:12,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:34:12,935 INFO L93 Difference]: Finished difference Result 1847 states and 2593 transitions. [2022-01-10 02:34:12,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-01-10 02:34:12,936 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 65 [2022-01-10 02:34:12,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:34:12,943 INFO L225 Difference]: With dead ends: 1847 [2022-01-10 02:34:12,944 INFO L226 Difference]: Without dead ends: 1562 [2022-01-10 02:34:12,945 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 340 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=257, Invalid=1075, Unknown=0, NotChecked=0, Total=1332 [2022-01-10 02:34:12,946 INFO L933 BasicCegarLoop]: 577 mSDtfsCounter, 2860 mSDsluCounter, 1304 mSDsCounter, 0 mSdLazyCounter, 1429 mSolverCounterSat, 656 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2874 SdHoareTripleChecker+Valid, 1881 SdHoareTripleChecker+Invalid, 2085 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 656 IncrementalHoareTripleChecker+Valid, 1429 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-01-10 02:34:12,947 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2874 Valid, 1881 Invalid, 2085 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [656 Valid, 1429 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-01-10 02:34:12,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1562 states. [2022-01-10 02:34:13,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1562 to 1401. [2022-01-10 02:34:13,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1401 states, 1129 states have (on average 1.3808680248007086) internal successors, (1559), 1152 states have internal predecessors, (1559), 144 states have call successors, (144), 111 states have call predecessors, (144), 126 states have return successors, (178), 140 states have call predecessors, (178), 142 states have call successors, (178) [2022-01-10 02:34:13,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1401 states to 1401 states and 1881 transitions. [2022-01-10 02:34:13,023 INFO L78 Accepts]: Start accepts. Automaton has 1401 states and 1881 transitions. Word has length 65 [2022-01-10 02:34:13,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:34:13,023 INFO L470 AbstractCegarLoop]: Abstraction has 1401 states and 1881 transitions. [2022-01-10 02:34:13,024 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-01-10 02:34:13,024 INFO L276 IsEmpty]: Start isEmpty. Operand 1401 states and 1881 transitions. [2022-01-10 02:34:13,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-01-10 02:34:13,025 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:34:13,025 INFO L514 BasicCegarLoop]: 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] [2022-01-10 02:34:13,026 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-10 02:34:13,026 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:34:13,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:34:13,026 INFO L85 PathProgramCache]: Analyzing trace with hash 1452871733, now seen corresponding path program 1 times [2022-01-10 02:34:13,026 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:34:13,027 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842317222] [2022-01-10 02:34:13,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:34:13,027 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:34:13,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:13,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:34:13,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:13,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-10 02:34:13,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:13,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-10 02:34:13,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:13,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-10 02:34:13,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:13,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 02:34:13,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:13,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-01-10 02:34:13,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:13,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-01-10 02:34:13,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:13,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 02:34:13,130 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:34:13,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842317222] [2022-01-10 02:34:13,130 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842317222] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:34:13,131 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:34:13,131 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-10 02:34:13,131 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970307457] [2022-01-10 02:34:13,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:34:13,131 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-10 02:34:13,131 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:34:13,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-10 02:34:13,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-01-10 02:34:13,132 INFO L87 Difference]: Start difference. First operand 1401 states and 1881 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 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) [2022-01-10 02:34:14,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:34:14,016 INFO L93 Difference]: Finished difference Result 2730 states and 3631 transitions. [2022-01-10 02:34:14,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-10 02:34:14,017 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 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 65 [2022-01-10 02:34:14,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:34:14,024 INFO L225 Difference]: With dead ends: 2730 [2022-01-10 02:34:14,024 INFO L226 Difference]: Without dead ends: 1565 [2022-01-10 02:34:14,026 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2022-01-10 02:34:14,027 INFO L933 BasicCegarLoop]: 467 mSDtfsCounter, 404 mSDsluCounter, 1617 mSDsCounter, 0 mSdLazyCounter, 1166 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 406 SdHoareTripleChecker+Valid, 2084 SdHoareTripleChecker+Invalid, 1250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 1166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-01-10 02:34:14,028 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [406 Valid, 2084 Invalid, 1250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 1166 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-01-10 02:34:14,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1565 states. [2022-01-10 02:34:14,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1565 to 1431. [2022-01-10 02:34:14,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1431 states, 1153 states have (on average 1.3660017346053772) internal successors, (1575), 1176 states have internal predecessors, (1575), 144 states have call successors, (144), 111 states have call predecessors, (144), 132 states have return successors, (184), 146 states have call predecessors, (184), 142 states have call successors, (184) [2022-01-10 02:34:14,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1431 states to 1431 states and 1903 transitions. [2022-01-10 02:34:14,106 INFO L78 Accepts]: Start accepts. Automaton has 1431 states and 1903 transitions. Word has length 65 [2022-01-10 02:34:14,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:34:14,106 INFO L470 AbstractCegarLoop]: Abstraction has 1431 states and 1903 transitions. [2022-01-10 02:34:14,107 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 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) [2022-01-10 02:34:14,107 INFO L276 IsEmpty]: Start isEmpty. Operand 1431 states and 1903 transitions. [2022-01-10 02:34:14,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-01-10 02:34:14,108 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:34:14,108 INFO L514 BasicCegarLoop]: 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] [2022-01-10 02:34:14,109 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-10 02:34:14,109 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:34:14,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:34:14,109 INFO L85 PathProgramCache]: Analyzing trace with hash -1455892169, now seen corresponding path program 1 times [2022-01-10 02:34:14,109 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:34:14,110 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483582095] [2022-01-10 02:34:14,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:34:14,110 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:34:14,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:14,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:34:14,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:14,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-10 02:34:14,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:14,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-10 02:34:14,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:14,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-10 02:34:14,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:14,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 02:34:14,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:14,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-01-10 02:34:14,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:14,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-01-10 02:34:14,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:14,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 02:34:14,232 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:34:14,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483582095] [2022-01-10 02:34:14,232 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483582095] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:34:14,232 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:34:14,232 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-10 02:34:14,232 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040698232] [2022-01-10 02:34:14,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:34:14,233 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-10 02:34:14,233 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:34:14,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-10 02:34:14,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-01-10 02:34:14,234 INFO L87 Difference]: Start difference. First operand 1431 states and 1903 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 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) [2022-01-10 02:34:15,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:34:15,147 INFO L93 Difference]: Finished difference Result 2780 states and 3605 transitions. [2022-01-10 02:34:15,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-01-10 02:34:15,147 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 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 65 [2022-01-10 02:34:15,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:34:15,155 INFO L225 Difference]: With dead ends: 2780 [2022-01-10 02:34:15,155 INFO L226 Difference]: Without dead ends: 1808 [2022-01-10 02:34:15,157 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=113, Invalid=307, Unknown=0, NotChecked=0, Total=420 [2022-01-10 02:34:15,158 INFO L933 BasicCegarLoop]: 481 mSDtfsCounter, 1197 mSDsluCounter, 925 mSDsCounter, 0 mSdLazyCounter, 946 mSolverCounterSat, 203 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1220 SdHoareTripleChecker+Valid, 1406 SdHoareTripleChecker+Invalid, 1149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 203 IncrementalHoareTripleChecker+Valid, 946 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-01-10 02:34:15,158 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1220 Valid, 1406 Invalid, 1149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [203 Valid, 946 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-01-10 02:34:15,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1808 states. [2022-01-10 02:34:15,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1808 to 1373. [2022-01-10 02:34:15,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1373 states, 1111 states have (on average 1.3636363636363635) internal successors, (1515), 1129 states have internal predecessors, (1515), 138 states have call successors, (138), 106 states have call predecessors, (138), 122 states have return successors, (169), 139 states have call predecessors, (169), 136 states have call successors, (169) [2022-01-10 02:34:15,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1373 states to 1373 states and 1822 transitions. [2022-01-10 02:34:15,216 INFO L78 Accepts]: Start accepts. Automaton has 1373 states and 1822 transitions. Word has length 65 [2022-01-10 02:34:15,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:34:15,216 INFO L470 AbstractCegarLoop]: Abstraction has 1373 states and 1822 transitions. [2022-01-10 02:34:15,216 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 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) [2022-01-10 02:34:15,216 INFO L276 IsEmpty]: Start isEmpty. Operand 1373 states and 1822 transitions. [2022-01-10 02:34:15,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-01-10 02:34:15,217 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:34:15,217 INFO L514 BasicCegarLoop]: 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] [2022-01-10 02:34:15,217 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-10 02:34:15,217 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:34:15,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:34:15,218 INFO L85 PathProgramCache]: Analyzing trace with hash -1589905675, now seen corresponding path program 1 times [2022-01-10 02:34:15,218 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:34:15,218 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020391482] [2022-01-10 02:34:15,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:34:15,218 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:34:15,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:15,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:34:15,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:15,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-10 02:34:15,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:15,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-10 02:34:15,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:15,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-10 02:34:15,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:15,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 02:34:15,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:15,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-01-10 02:34:15,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:15,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-01-10 02:34:15,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:15,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 02:34:15,296 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:34:15,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020391482] [2022-01-10 02:34:15,297 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020391482] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:34:15,297 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:34:15,297 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 02:34:15,297 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828495159] [2022-01-10 02:34:15,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:34:15,297 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 02:34:15,297 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:34:15,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 02:34:15,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-01-10 02:34:15,298 INFO L87 Difference]: Start difference. First operand 1373 states and 1822 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 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) [2022-01-10 02:34:15,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:34:15,778 INFO L93 Difference]: Finished difference Result 3727 states and 4840 transitions. [2022-01-10 02:34:15,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-10 02:34:15,778 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 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 65 [2022-01-10 02:34:15,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:34:15,790 INFO L225 Difference]: With dead ends: 3727 [2022-01-10 02:34:15,791 INFO L226 Difference]: Without dead ends: 2591 [2022-01-10 02:34:15,794 INFO L932 BasicCegarLoop]: 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 [2022-01-10 02:34:15,797 INFO L933 BasicCegarLoop]: 452 mSDtfsCounter, 1155 mSDsluCounter, 697 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 182 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1182 SdHoareTripleChecker+Valid, 1149 SdHoareTripleChecker+Invalid, 496 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 182 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-10 02:34:15,798 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1182 Valid, 1149 Invalid, 496 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [182 Valid, 314 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-10 02:34:15,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2591 states. [2022-01-10 02:34:15,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2591 to 2471. [2022-01-10 02:34:15,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2471 states, 1950 states have (on average 1.303076923076923) internal successors, (2541), 1992 states have internal predecessors, (2541), 268 states have call successors, (268), 205 states have call predecessors, (268), 251 states have return successors, (381), 276 states have call predecessors, (381), 266 states have call successors, (381) [2022-01-10 02:34:15,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2471 states to 2471 states and 3190 transitions. [2022-01-10 02:34:15,934 INFO L78 Accepts]: Start accepts. Automaton has 2471 states and 3190 transitions. Word has length 65 [2022-01-10 02:34:15,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:34:15,935 INFO L470 AbstractCegarLoop]: Abstraction has 2471 states and 3190 transitions. [2022-01-10 02:34:15,935 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 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) [2022-01-10 02:34:15,935 INFO L276 IsEmpty]: Start isEmpty. Operand 2471 states and 3190 transitions. [2022-01-10 02:34:15,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-01-10 02:34:15,936 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:34:15,936 INFO L514 BasicCegarLoop]: 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] [2022-01-10 02:34:15,936 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-10 02:34:15,936 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:34:15,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:34:15,937 INFO L85 PathProgramCache]: Analyzing trace with hash -1359463327, now seen corresponding path program 1 times [2022-01-10 02:34:15,937 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:34:15,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883497244] [2022-01-10 02:34:15,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:34:15,937 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:34:15,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:15,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:34:15,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:15,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-10 02:34:15,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:15,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-10 02:34:15,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:15,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-10 02:34:15,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:15,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 02:34:16,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:16,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-01-10 02:34:16,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:16,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-01-10 02:34:16,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:16,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 02:34:16,009 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:34:16,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883497244] [2022-01-10 02:34:16,009 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883497244] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:34:16,009 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:34:16,009 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-10 02:34:16,009 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350397023] [2022-01-10 02:34:16,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:34:16,010 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 02:34:16,010 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:34:16,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 02:34:16,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-01-10 02:34:16,010 INFO L87 Difference]: Start difference. First operand 2471 states and 3190 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) [2022-01-10 02:34:16,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:34:16,571 INFO L93 Difference]: Finished difference Result 5865 states and 7498 transitions. [2022-01-10 02:34:16,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-10 02:34:16,571 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 [2022-01-10 02:34:16,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:34:16,586 INFO L225 Difference]: With dead ends: 5865 [2022-01-10 02:34:16,586 INFO L226 Difference]: Without dead ends: 3636 [2022-01-10 02:34:16,591 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-01-10 02:34:16,592 INFO L933 BasicCegarLoop]: 481 mSDtfsCounter, 575 mSDsluCounter, 853 mSDsCounter, 0 mSdLazyCounter, 460 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 584 SdHoareTripleChecker+Valid, 1334 SdHoareTripleChecker+Invalid, 579 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-10 02:34:16,592 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [584 Valid, 1334 Invalid, 579 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 460 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-10 02:34:16,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3636 states. [2022-01-10 02:34:16,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3636 to 3305. [2022-01-10 02:34:16,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3305 states, 2595 states have (on average 1.2882466281310212) internal successors, (3343), 2644 states have internal predecessors, (3343), 364 states have call successors, (364), 285 states have call predecessors, (364), 344 states have return successors, (500), 378 states have call predecessors, (500), 362 states have call successors, (500) [2022-01-10 02:34:16,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3305 states to 3305 states and 4207 transitions. [2022-01-10 02:34:16,764 INFO L78 Accepts]: Start accepts. Automaton has 3305 states and 4207 transitions. Word has length 66 [2022-01-10 02:34:16,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:34:16,765 INFO L470 AbstractCegarLoop]: Abstraction has 3305 states and 4207 transitions. [2022-01-10 02:34:16,765 INFO L471 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) [2022-01-10 02:34:16,765 INFO L276 IsEmpty]: Start isEmpty. Operand 3305 states and 4207 transitions. [2022-01-10 02:34:16,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-01-10 02:34:16,769 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:34:16,769 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:34:16,769 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-10 02:34:16,769 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:34:16,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:34:16,769 INFO L85 PathProgramCache]: Analyzing trace with hash -1540190304, now seen corresponding path program 1 times [2022-01-10 02:34:16,770 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:34:16,770 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134511333] [2022-01-10 02:34:16,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:34:16,770 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:34:16,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:16,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:34:16,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:16,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-10 02:34:16,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:16,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-10 02:34:16,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:16,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-10 02:34:16,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:16,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 02:34:16,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:16,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-01-10 02:34:16,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:16,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-01-10 02:34:16,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:16,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 02:34:16,861 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:34:16,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134511333] [2022-01-10 02:34:16,861 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134511333] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:34:16,861 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:34:16,861 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-10 02:34:16,861 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592015900] [2022-01-10 02:34:16,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:34:16,861 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 02:34:16,861 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:34:16,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 02:34:16,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-01-10 02:34:16,862 INFO L87 Difference]: Start difference. First operand 3305 states and 4207 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 3 states have internal predecessors, (57), 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) [2022-01-10 02:34:17,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:34:17,257 INFO L93 Difference]: Finished difference Result 7291 states and 9206 transitions. [2022-01-10 02:34:17,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-10 02:34:17,257 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 3 states have internal predecessors, (57), 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 72 [2022-01-10 02:34:17,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:34:17,279 INFO L225 Difference]: With dead ends: 7291 [2022-01-10 02:34:17,279 INFO L226 Difference]: Without dead ends: 4226 [2022-01-10 02:34:17,286 INFO L932 BasicCegarLoop]: 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 [2022-01-10 02:34:17,287 INFO L933 BasicCegarLoop]: 497 mSDtfsCounter, 1119 mSDsluCounter, 488 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 161 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1147 SdHoareTripleChecker+Valid, 985 SdHoareTripleChecker+Invalid, 403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 161 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 02:34:17,287 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1147 Valid, 985 Invalid, 403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [161 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 02:34:17,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4226 states. [2022-01-10 02:34:17,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4226 to 3880. [2022-01-10 02:34:17,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3880 states, 3050 states have (on average 1.280983606557377) internal successors, (3907), 3103 states have internal predecessors, (3907), 423 states have call successors, (423), 335 states have call predecessors, (423), 405 states have return successors, (582), 444 states have call predecessors, (582), 421 states have call successors, (582) [2022-01-10 02:34:17,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3880 states to 3880 states and 4912 transitions. [2022-01-10 02:34:17,480 INFO L78 Accepts]: Start accepts. Automaton has 3880 states and 4912 transitions. Word has length 72 [2022-01-10 02:34:17,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:34:17,481 INFO L470 AbstractCegarLoop]: Abstraction has 3880 states and 4912 transitions. [2022-01-10 02:34:17,481 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 3 states have internal predecessors, (57), 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) [2022-01-10 02:34:17,481 INFO L276 IsEmpty]: Start isEmpty. Operand 3880 states and 4912 transitions. [2022-01-10 02:34:17,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-01-10 02:34:17,484 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:34:17,484 INFO L514 BasicCegarLoop]: 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, 1, 1, 1, 1, 1] [2022-01-10 02:34:17,484 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-10 02:34:17,484 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:34:17,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:34:17,485 INFO L85 PathProgramCache]: Analyzing trace with hash -1017748717, now seen corresponding path program 1 times [2022-01-10 02:34:17,485 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:34:17,485 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027185562] [2022-01-10 02:34:17,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:34:17,485 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:34:17,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:17,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:34:17,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:17,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-10 02:34:17,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:17,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-10 02:34:17,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:17,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-10 02:34:17,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:17,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 02:34:17,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:17,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-01-10 02:34:17,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:17,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-01-10 02:34:17,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:17,562 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 02:34:17,562 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:34:17,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027185562] [2022-01-10 02:34:17,562 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027185562] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:34:17,562 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:34:17,562 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 02:34:17,562 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747259707] [2022-01-10 02:34:17,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:34:17,563 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 02:34:17,563 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:34:17,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 02:34:17,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-01-10 02:34:17,563 INFO L87 Difference]: Start difference. First operand 3880 states and 4912 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 4 states have internal predecessors, (58), 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) [2022-01-10 02:34:18,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:34:18,092 INFO L93 Difference]: Finished difference Result 5062 states and 6368 transitions. [2022-01-10 02:34:18,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-10 02:34:18,092 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 4 states have internal predecessors, (58), 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 73 [2022-01-10 02:34:18,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:34:18,112 INFO L225 Difference]: With dead ends: 5062 [2022-01-10 02:34:18,112 INFO L226 Difference]: Without dead ends: 5059 [2022-01-10 02:34:18,114 INFO L932 BasicCegarLoop]: 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 [2022-01-10 02:34:18,115 INFO L933 BasicCegarLoop]: 488 mSDtfsCounter, 1353 mSDsluCounter, 691 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 253 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1362 SdHoareTripleChecker+Valid, 1179 SdHoareTripleChecker+Invalid, 577 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 253 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-10 02:34:18,115 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1362 Valid, 1179 Invalid, 577 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [253 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-10 02:34:18,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5059 states. [2022-01-10 02:34:18,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5059 to 4347. [2022-01-10 02:34:18,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4347 states, 3407 states have (on average 1.2717933665981802) internal successors, (4333), 3464 states have internal predecessors, (4333), 476 states have call successors, (476), 379 states have call predecessors, (476), 462 states have return successors, (664), 506 states have call predecessors, (664), 475 states have call successors, (664) [2022-01-10 02:34:18,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4347 states to 4347 states and 5473 transitions. [2022-01-10 02:34:18,313 INFO L78 Accepts]: Start accepts. Automaton has 4347 states and 5473 transitions. Word has length 73 [2022-01-10 02:34:18,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:34:18,313 INFO L470 AbstractCegarLoop]: Abstraction has 4347 states and 5473 transitions. [2022-01-10 02:34:18,314 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 4 states have internal predecessors, (58), 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) [2022-01-10 02:34:18,314 INFO L276 IsEmpty]: Start isEmpty. Operand 4347 states and 5473 transitions. [2022-01-10 02:34:18,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-01-10 02:34:18,315 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:34:18,315 INFO L514 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1] [2022-01-10 02:34:18,315 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-10 02:34:18,315 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:34:18,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:34:18,316 INFO L85 PathProgramCache]: Analyzing trace with hash -1486432694, now seen corresponding path program 1 times [2022-01-10 02:34:18,316 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:34:18,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193231466] [2022-01-10 02:34:18,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:34:18,316 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:34:18,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:18,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:34:18,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:18,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-10 02:34:18,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:18,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-10 02:34:18,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:18,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-10 02:34:18,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:18,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 02:34:18,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:18,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-01-10 02:34:18,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:18,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-01-10 02:34:18,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:18,417 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 02:34:18,417 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:34:18,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193231466] [2022-01-10 02:34:18,418 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193231466] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 02:34:18,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [399761437] [2022-01-10 02:34:18,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:34:18,418 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 02:34:18,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 02:34:18,423 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 02:34:18,465 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-01-10 02:34:18,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:18,556 INFO L263 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 9 conjunts are in the unsatisfiable core [2022-01-10 02:34:18,564 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:34:19,001 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 02:34:19,002 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 02:34:19,226 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 02:34:19,226 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [399761437] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 02:34:19,226 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 02:34:19,226 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 4] total 10 [2022-01-10 02:34:19,226 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718115584] [2022-01-10 02:34:19,227 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 02:34:19,227 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-10 02:34:19,227 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:34:19,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-10 02:34:19,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-01-10 02:34:19,228 INFO L87 Difference]: Start difference. First operand 4347 states and 5473 transitions. Second operand has 10 states, 10 states have (on average 12.0) internal successors, (120), 7 states have internal predecessors, (120), 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) [2022-01-10 02:34:20,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:34:20,823 INFO L93 Difference]: Finished difference Result 8888 states and 11081 transitions. [2022-01-10 02:34:20,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-01-10 02:34:20,824 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 12.0) internal successors, (120), 7 states have internal predecessors, (120), 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 74 [2022-01-10 02:34:20,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:34:20,866 INFO L225 Difference]: With dead ends: 8888 [2022-01-10 02:34:20,866 INFO L226 Difference]: Without dead ends: 8885 [2022-01-10 02:34:20,871 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 173 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=163, Invalid=593, Unknown=0, NotChecked=0, Total=756 [2022-01-10 02:34:20,872 INFO L933 BasicCegarLoop]: 653 mSDtfsCounter, 1572 mSDsluCounter, 1441 mSDsCounter, 0 mSdLazyCounter, 1844 mSolverCounterSat, 253 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1629 SdHoareTripleChecker+Valid, 2094 SdHoareTripleChecker+Invalid, 2097 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 253 IncrementalHoareTripleChecker+Valid, 1844 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-01-10 02:34:20,873 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1629 Valid, 2094 Invalid, 2097 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [253 Valid, 1844 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-01-10 02:34:20,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8885 states. [2022-01-10 02:34:21,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8885 to 7816. [2022-01-10 02:34:21,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7816 states, 6109 states have (on average 1.2594532656735964) internal successors, (7694), 6210 states have internal predecessors, (7694), 855 states have call successors, (855), 693 states have call predecessors, (855), 850 states have return successors, (1201), 915 states have call predecessors, (1201), 854 states have call successors, (1201) [2022-01-10 02:34:21,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7816 states to 7816 states and 9750 transitions. [2022-01-10 02:34:21,350 INFO L78 Accepts]: Start accepts. Automaton has 7816 states and 9750 transitions. Word has length 74 [2022-01-10 02:34:21,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:34:21,350 INFO L470 AbstractCegarLoop]: Abstraction has 7816 states and 9750 transitions. [2022-01-10 02:34:21,351 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.0) internal successors, (120), 7 states have internal predecessors, (120), 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) [2022-01-10 02:34:21,351 INFO L276 IsEmpty]: Start isEmpty. Operand 7816 states and 9750 transitions. [2022-01-10 02:34:21,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-01-10 02:34:21,353 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:34:21,353 INFO L514 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1] [2022-01-10 02:34:21,382 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-01-10 02:34:21,567 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-01-10 02:34:21,567 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:34:21,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:34:21,568 INFO L85 PathProgramCache]: Analyzing trace with hash 1906520915, now seen corresponding path program 2 times [2022-01-10 02:34:21,568 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:34:21,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456820989] [2022-01-10 02:34:21,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:34:21,568 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:34:21,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:21,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:34:21,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:21,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-10 02:34:21,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:21,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-10 02:34:21,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:21,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-10 02:34:21,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:21,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 02:34:21,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:21,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-01-10 02:34:21,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:21,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-01-10 02:34:21,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:21,629 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 02:34:21,629 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:34:21,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456820989] [2022-01-10 02:34:21,630 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456820989] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:34:21,630 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:34:21,630 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-10 02:34:21,630 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190017114] [2022-01-10 02:34:21,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:34:21,630 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 02:34:21,630 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:34:21,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 02:34:21,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-01-10 02:34:21,631 INFO L87 Difference]: Start difference. First operand 7816 states and 9750 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 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) [2022-01-10 02:34:22,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:34:22,173 INFO L93 Difference]: Finished difference Result 10526 states and 13162 transitions. [2022-01-10 02:34:22,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-10 02:34:22,174 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 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 77 [2022-01-10 02:34:22,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:34:22,196 INFO L225 Difference]: With dead ends: 10526 [2022-01-10 02:34:22,196 INFO L226 Difference]: Without dead ends: 4309 [2022-01-10 02:34:22,207 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-01-10 02:34:22,208 INFO L933 BasicCegarLoop]: 528 mSDtfsCounter, 1013 mSDsluCounter, 509 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1042 SdHoareTripleChecker+Valid, 1037 SdHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-10 02:34:22,208 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1042 Valid, 1037 Invalid, 389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-10 02:34:22,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4309 states. [2022-01-10 02:34:22,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4309 to 3192. [2022-01-10 02:34:22,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3192 states, 2517 states have (on average 1.2590385379419944) internal successors, (3169), 2552 states have internal predecessors, (3169), 348 states have call successors, (348), 275 states have call predecessors, (348), 325 states have return successors, (460), 367 states have call predecessors, (460), 347 states have call successors, (460) [2022-01-10 02:34:22,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3192 states to 3192 states and 3977 transitions. [2022-01-10 02:34:22,400 INFO L78 Accepts]: Start accepts. Automaton has 3192 states and 3977 transitions. Word has length 77 [2022-01-10 02:34:22,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:34:22,401 INFO L470 AbstractCegarLoop]: Abstraction has 3192 states and 3977 transitions. [2022-01-10 02:34:22,401 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 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) [2022-01-10 02:34:22,401 INFO L276 IsEmpty]: Start isEmpty. Operand 3192 states and 3977 transitions. [2022-01-10 02:34:22,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-01-10 02:34:22,403 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:34:22,403 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:34:22,403 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-10 02:34:22,403 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:34:22,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:34:22,404 INFO L85 PathProgramCache]: Analyzing trace with hash -1402994660, now seen corresponding path program 1 times [2022-01-10 02:34:22,404 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:34:22,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693861103] [2022-01-10 02:34:22,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:34:22,404 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:34:22,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:22,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:34:22,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:22,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-10 02:34:22,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:22,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-10 02:34:22,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:22,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-10 02:34:22,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:22,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 02:34:22,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:22,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-01-10 02:34:22,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:22,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-01-10 02:34:22,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:22,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-01-10 02:34:22,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:22,487 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-10 02:34:22,487 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:34:22,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693861103] [2022-01-10 02:34:22,487 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693861103] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:34:22,487 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:34:22,487 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-10 02:34:22,488 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034080490] [2022-01-10 02:34:22,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:34:22,488 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-10 02:34:22,488 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:34:22,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-10 02:34:22,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-01-10 02:34:22,489 INFO L87 Difference]: Start difference. First operand 3192 states and 3977 transitions. Second operand has 8 states, 8 states have (on average 7.875) internal successors, (63), 5 states have internal predecessors, (63), 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) [2022-01-10 02:34:23,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:34:23,653 INFO L93 Difference]: Finished difference Result 9248 states and 11441 transitions. [2022-01-10 02:34:23,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-01-10 02:34:23,654 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 5 states have internal predecessors, (63), 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 84 [2022-01-10 02:34:23,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:34:23,673 INFO L225 Difference]: With dead ends: 9248 [2022-01-10 02:34:23,673 INFO L226 Difference]: Without dead ends: 5433 [2022-01-10 02:34:23,682 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=142, Invalid=364, Unknown=0, NotChecked=0, Total=506 [2022-01-10 02:34:23,683 INFO L933 BasicCegarLoop]: 523 mSDtfsCounter, 1136 mSDsluCounter, 1183 mSDsCounter, 0 mSdLazyCounter, 891 mSolverCounterSat, 294 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1147 SdHoareTripleChecker+Valid, 1706 SdHoareTripleChecker+Invalid, 1185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 294 IncrementalHoareTripleChecker+Valid, 891 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-01-10 02:34:23,683 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1147 Valid, 1706 Invalid, 1185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [294 Valid, 891 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-01-10 02:34:23,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5433 states. [2022-01-10 02:34:23,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5433 to 5086. [2022-01-10 02:34:23,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5086 states, 3956 states have (on average 1.2287664307381194) internal successors, (4861), 4022 states have internal predecessors, (4861), 566 states have call successors, (566), 447 states have call predecessors, (566), 562 states have return successors, (854), 619 states have call predecessors, (854), 565 states have call successors, (854) [2022-01-10 02:34:23,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5086 states to 5086 states and 6281 transitions. [2022-01-10 02:34:23,970 INFO L78 Accepts]: Start accepts. Automaton has 5086 states and 6281 transitions. Word has length 84 [2022-01-10 02:34:23,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:34:23,971 INFO L470 AbstractCegarLoop]: Abstraction has 5086 states and 6281 transitions. [2022-01-10 02:34:23,971 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 5 states have internal predecessors, (63), 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) [2022-01-10 02:34:23,971 INFO L276 IsEmpty]: Start isEmpty. Operand 5086 states and 6281 transitions. [2022-01-10 02:34:23,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-01-10 02:34:23,973 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:34:23,974 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:34:23,974 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-10 02:34:23,974 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:34:23,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:34:23,974 INFO L85 PathProgramCache]: Analyzing trace with hash 1990740177, now seen corresponding path program 1 times [2022-01-10 02:34:23,974 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:34:23,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975455894] [2022-01-10 02:34:23,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:34:23,975 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:34:23,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:24,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:34:24,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:24,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-10 02:34:24,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:24,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-10 02:34:24,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:24,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-10 02:34:24,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:24,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 02:34:24,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:24,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-01-10 02:34:24,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:24,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-01-10 02:34:24,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:24,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-01-10 02:34:24,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:24,056 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-10 02:34:24,056 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:34:24,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975455894] [2022-01-10 02:34:24,057 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975455894] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:34:24,057 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:34:24,057 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-10 02:34:24,057 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657685357] [2022-01-10 02:34:24,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:34:24,057 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-10 02:34:24,057 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:34:24,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-10 02:34:24,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-01-10 02:34:24,058 INFO L87 Difference]: Start difference. First operand 5086 states and 6281 transitions. Second operand has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 6 states have internal predecessors, (74), 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) [2022-01-10 02:34:25,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:34:25,216 INFO L93 Difference]: Finished difference Result 9442 states and 11544 transitions. [2022-01-10 02:34:25,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-01-10 02:34:25,219 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 6 states have internal predecessors, (74), 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 93 [2022-01-10 02:34:25,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:34:25,235 INFO L225 Difference]: With dead ends: 9442 [2022-01-10 02:34:25,235 INFO L226 Difference]: Without dead ends: 5165 [2022-01-10 02:34:25,245 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=162, Invalid=540, Unknown=0, NotChecked=0, Total=702 [2022-01-10 02:34:25,246 INFO L933 BasicCegarLoop]: 514 mSDtfsCounter, 2088 mSDsluCounter, 979 mSDsCounter, 0 mSdLazyCounter, 1015 mSolverCounterSat, 469 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2121 SdHoareTripleChecker+Valid, 1493 SdHoareTripleChecker+Invalid, 1484 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 469 IncrementalHoareTripleChecker+Valid, 1015 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-01-10 02:34:25,246 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2121 Valid, 1493 Invalid, 1484 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [469 Valid, 1015 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-01-10 02:34:25,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5165 states. [2022-01-10 02:34:25,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5165 to 4794. [2022-01-10 02:34:25,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4794 states, 3712 states have (on average 1.2074353448275863) internal successors, (4482), 3780 states have internal predecessors, (4482), 536 states have call successors, (536), 429 states have call predecessors, (536), 544 states have return successors, (745), 587 states have call predecessors, (745), 535 states have call successors, (745) [2022-01-10 02:34:25,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4794 states to 4794 states and 5763 transitions. [2022-01-10 02:34:25,510 INFO L78 Accepts]: Start accepts. Automaton has 4794 states and 5763 transitions. Word has length 93 [2022-01-10 02:34:25,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:34:25,510 INFO L470 AbstractCegarLoop]: Abstraction has 4794 states and 5763 transitions. [2022-01-10 02:34:25,510 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 6 states have internal predecessors, (74), 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) [2022-01-10 02:34:25,510 INFO L276 IsEmpty]: Start isEmpty. Operand 4794 states and 5763 transitions. [2022-01-10 02:34:25,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-01-10 02:34:25,513 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:34:25,513 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:34:25,514 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-10 02:34:25,514 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:34:25,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:34:25,514 INFO L85 PathProgramCache]: Analyzing trace with hash 991651678, now seen corresponding path program 1 times [2022-01-10 02:34:25,514 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:34:25,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019715928] [2022-01-10 02:34:25,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:34:25,515 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:34:25,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:25,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:34:25,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:25,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-01-10 02:34:25,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:25,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-01-10 02:34:25,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:25,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-01-10 02:34:25,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:25,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-01-10 02:34:25,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:25,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 02:34:25,603 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:34:25,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019715928] [2022-01-10 02:34:25,603 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019715928] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:34:25,603 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:34:25,603 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 02:34:25,604 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847548945] [2022-01-10 02:34:25,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:34:25,604 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 02:34:25,604 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:34:25,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 02:34:25,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 02:34:25,605 INFO L87 Difference]: Start difference. First operand 4794 states and 5763 transitions. Second operand has 5 states, 5 states have (on average 20.4) internal successors, (102), 3 states have internal predecessors, (102), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 02:34:26,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:34:26,638 INFO L93 Difference]: Finished difference Result 5085 states and 6223 transitions. [2022-01-10 02:34:26,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-10 02:34:26,639 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 3 states have internal predecessors, (102), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 112 [2022-01-10 02:34:26,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:34:26,651 INFO L225 Difference]: With dead ends: 5085 [2022-01-10 02:34:26,651 INFO L226 Difference]: Without dead ends: 4870 [2022-01-10 02:34:26,653 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-01-10 02:34:26,654 INFO L933 BasicCegarLoop]: 505 mSDtfsCounter, 678 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 491 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 696 SdHoareTripleChecker+Valid, 908 SdHoareTripleChecker+Invalid, 571 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-10 02:34:26,654 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [696 Valid, 908 Invalid, 571 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 491 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-01-10 02:34:26,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4870 states. [2022-01-10 02:34:26,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4870 to 4794. [2022-01-10 02:34:26,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4794 states, 3712 states have (on average 1.207165948275862) internal successors, (4481), 3780 states have internal predecessors, (4481), 536 states have call successors, (536), 429 states have call predecessors, (536), 544 states have return successors, (745), 587 states have call predecessors, (745), 535 states have call successors, (745) [2022-01-10 02:34:27,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4794 states to 4794 states and 5762 transitions. [2022-01-10 02:34:27,004 INFO L78 Accepts]: Start accepts. Automaton has 4794 states and 5762 transitions. Word has length 112 [2022-01-10 02:34:27,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:34:27,004 INFO L470 AbstractCegarLoop]: Abstraction has 4794 states and 5762 transitions. [2022-01-10 02:34:27,004 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 3 states have internal predecessors, (102), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 02:34:27,004 INFO L276 IsEmpty]: Start isEmpty. Operand 4794 states and 5762 transitions. [2022-01-10 02:34:27,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-01-10 02:34:27,006 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:34:27,006 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:34:27,007 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-10 02:34:27,007 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:34:27,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:34:27,007 INFO L85 PathProgramCache]: Analyzing trace with hash -1396912352, now seen corresponding path program 1 times [2022-01-10 02:34:27,007 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:34:27,007 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065473708] [2022-01-10 02:34:27,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:34:27,008 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:34:27,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:27,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:34:27,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:27,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-01-10 02:34:27,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:27,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-01-10 02:34:27,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:27,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-01-10 02:34:27,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:27,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-01-10 02:34:27,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:27,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 02:34:27,106 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:34:27,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065473708] [2022-01-10 02:34:27,106 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065473708] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:34:27,106 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:34:27,106 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 02:34:27,108 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494600139] [2022-01-10 02:34:27,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:34:27,108 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 02:34:27,108 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:34:27,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 02:34:27,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-10 02:34:27,109 INFO L87 Difference]: Start difference. First operand 4794 states and 5762 transitions. Second operand has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 5 states have internal predecessors, (102), 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) [2022-01-10 02:34:29,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:34:29,148 INFO L93 Difference]: Finished difference Result 5391 states and 6718 transitions. [2022-01-10 02:34:29,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-10 02:34:29,148 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 5 states have internal predecessors, (102), 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 112 [2022-01-10 02:34:29,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:34:29,160 INFO L225 Difference]: With dead ends: 5391 [2022-01-10 02:34:29,160 INFO L226 Difference]: Without dead ends: 5178 [2022-01-10 02:34:29,162 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-01-10 02:34:29,162 INFO L933 BasicCegarLoop]: 699 mSDtfsCounter, 1035 mSDsluCounter, 1318 mSDsCounter, 0 mSdLazyCounter, 2048 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1058 SdHoareTripleChecker+Valid, 2017 SdHoareTripleChecker+Invalid, 2151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 2048 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-01-10 02:34:29,162 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1058 Valid, 2017 Invalid, 2151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 2048 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-01-10 02:34:29,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5178 states. [2022-01-10 02:34:29,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5178 to 5017. [2022-01-10 02:34:29,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5017 states, 3910 states have (on average 1.2255754475703324) internal successors, (4792), 3980 states have internal predecessors, (4792), 553 states have call successors, (553), 435 states have call predecessors, (553), 552 states have return successors, (769), 605 states have call predecessors, (769), 552 states have call successors, (769) [2022-01-10 02:34:29,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5017 states to 5017 states and 6114 transitions. [2022-01-10 02:34:29,471 INFO L78 Accepts]: Start accepts. Automaton has 5017 states and 6114 transitions. Word has length 112 [2022-01-10 02:34:29,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:34:29,471 INFO L470 AbstractCegarLoop]: Abstraction has 5017 states and 6114 transitions. [2022-01-10 02:34:29,472 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 5 states have internal predecessors, (102), 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) [2022-01-10 02:34:29,472 INFO L276 IsEmpty]: Start isEmpty. Operand 5017 states and 6114 transitions. [2022-01-10 02:34:29,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-01-10 02:34:29,474 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:34:29,474 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:34:29,474 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-10 02:34:29,475 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:34:29,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:34:29,475 INFO L85 PathProgramCache]: Analyzing trace with hash 1279080030, now seen corresponding path program 1 times [2022-01-10 02:34:29,475 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:34:29,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139838619] [2022-01-10 02:34:29,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:34:29,476 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:34:29,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:29,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:34:29,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:29,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-01-10 02:34:29,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:29,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-01-10 02:34:29,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:29,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-01-10 02:34:29,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:29,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-01-10 02:34:29,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:29,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 02:34:29,569 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:34:29,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139838619] [2022-01-10 02:34:29,569 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139838619] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:34:29,569 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:34:29,569 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 02:34:29,570 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299006162] [2022-01-10 02:34:29,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:34:29,570 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 02:34:29,570 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:34:29,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 02:34:29,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-10 02:34:29,571 INFO L87 Difference]: Start difference. First operand 5017 states and 6114 transitions. Second operand has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 5 states have internal predecessors, (102), 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) [2022-01-10 02:34:31,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:34:31,582 INFO L93 Difference]: Finished difference Result 6150 states and 7910 transitions. [2022-01-10 02:34:31,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-10 02:34:31,582 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 5 states have internal predecessors, (102), 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 112 [2022-01-10 02:34:31,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:34:31,599 INFO L225 Difference]: With dead ends: 6150 [2022-01-10 02:34:31,599 INFO L226 Difference]: Without dead ends: 5716 [2022-01-10 02:34:31,603 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-01-10 02:34:31,604 INFO L933 BasicCegarLoop]: 646 mSDtfsCounter, 1059 mSDsluCounter, 1255 mSDsCounter, 0 mSdLazyCounter, 1952 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1082 SdHoareTripleChecker+Valid, 1901 SdHoareTripleChecker+Invalid, 2062 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 1952 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-01-10 02:34:31,604 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1082 Valid, 1901 Invalid, 2062 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 1952 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-01-10 02:34:31,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5716 states. [2022-01-10 02:34:32,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5716 to 5427. [2022-01-10 02:34:32,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5427 states, 4276 states have (on average 1.2523386342376053) internal successors, (5355), 4348 states have internal predecessors, (5355), 583 states have call successors, (583), 447 states have call predecessors, (583), 566 states have return successors, (809), 637 states have call predecessors, (809), 582 states have call successors, (809) [2022-01-10 02:34:32,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5427 states to 5427 states and 6747 transitions. [2022-01-10 02:34:32,025 INFO L78 Accepts]: Start accepts. Automaton has 5427 states and 6747 transitions. Word has length 112 [2022-01-10 02:34:32,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:34:32,025 INFO L470 AbstractCegarLoop]: Abstraction has 5427 states and 6747 transitions. [2022-01-10 02:34:32,025 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 5 states have internal predecessors, (102), 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) [2022-01-10 02:34:32,025 INFO L276 IsEmpty]: Start isEmpty. Operand 5427 states and 6747 transitions. [2022-01-10 02:34:32,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-01-10 02:34:32,029 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:34:32,029 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:34:32,029 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-01-10 02:34:32,029 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:34:32,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:34:32,029 INFO L85 PathProgramCache]: Analyzing trace with hash 395571040, now seen corresponding path program 1 times [2022-01-10 02:34:32,030 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:34:32,030 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395129441] [2022-01-10 02:34:32,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:34:32,030 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:34:32,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:32,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:34:32,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:32,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-01-10 02:34:32,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:32,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-01-10 02:34:32,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:32,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-01-10 02:34:32,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:32,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-01-10 02:34:32,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:32,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 02:34:32,125 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:34:32,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395129441] [2022-01-10 02:34:32,125 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395129441] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:34:32,125 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:34:32,125 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 02:34:32,125 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646957512] [2022-01-10 02:34:32,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:34:32,126 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 02:34:32,126 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:34:32,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 02:34:32,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-10 02:34:32,126 INFO L87 Difference]: Start difference. First operand 5427 states and 6747 transitions. Second operand has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 5 states have internal predecessors, (102), 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) [2022-01-10 02:34:34,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:34:34,055 INFO L93 Difference]: Finished difference Result 7634 states and 10235 transitions. [2022-01-10 02:34:34,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-10 02:34:34,055 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 5 states have internal predecessors, (102), 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 112 [2022-01-10 02:34:34,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:34:34,074 INFO L225 Difference]: With dead ends: 7634 [2022-01-10 02:34:34,074 INFO L226 Difference]: Without dead ends: 6790 [2022-01-10 02:34:34,079 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-01-10 02:34:34,080 INFO L933 BasicCegarLoop]: 690 mSDtfsCounter, 1034 mSDsluCounter, 1318 mSDsCounter, 0 mSdLazyCounter, 2044 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1057 SdHoareTripleChecker+Valid, 2008 SdHoareTripleChecker+Invalid, 2150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 2044 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-01-10 02:34:34,080 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1057 Valid, 2008 Invalid, 2150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 2044 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-01-10 02:34:34,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6790 states. [2022-01-10 02:34:34,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6790 to 6249. [2022-01-10 02:34:34,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6249 states, 5010 states have (on average 1.2940119760479043) internal successors, (6483), 5086 states have internal predecessors, (6483), 643 states have call successors, (643), 471 states have call predecessors, (643), 594 states have return successors, (895), 701 states have call predecessors, (895), 642 states have call successors, (895) [2022-01-10 02:34:34,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6249 states to 6249 states and 8021 transitions. [2022-01-10 02:34:34,516 INFO L78 Accepts]: Start accepts. Automaton has 6249 states and 8021 transitions. Word has length 112 [2022-01-10 02:34:34,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:34:34,516 INFO L470 AbstractCegarLoop]: Abstraction has 6249 states and 8021 transitions. [2022-01-10 02:34:34,516 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 5 states have internal predecessors, (102), 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) [2022-01-10 02:34:34,516 INFO L276 IsEmpty]: Start isEmpty. Operand 6249 states and 8021 transitions. [2022-01-10 02:34:34,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-01-10 02:34:34,520 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:34:34,520 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:34:34,520 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-01-10 02:34:34,520 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:34:34,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:34:34,521 INFO L85 PathProgramCache]: Analyzing trace with hash 367070750, now seen corresponding path program 1 times [2022-01-10 02:34:34,521 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:34:34,521 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159249229] [2022-01-10 02:34:34,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:34:34,521 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:34:34,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:34,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:34:34,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:34,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-01-10 02:34:34,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:34,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-01-10 02:34:34,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:34,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-01-10 02:34:34,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:34,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-01-10 02:34:34,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:34,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 02:34:34,605 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:34:34,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159249229] [2022-01-10 02:34:34,606 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159249229] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:34:34,606 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:34:34,606 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 02:34:34,606 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835069008] [2022-01-10 02:34:34,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:34:34,606 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 02:34:34,606 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:34:34,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 02:34:34,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-10 02:34:34,607 INFO L87 Difference]: Start difference. First operand 6249 states and 8021 transitions. Second operand has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 5 states have internal predecessors, (102), 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) [2022-01-10 02:34:36,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:34:36,634 INFO L93 Difference]: Finished difference Result 10600 states and 14899 transitions. [2022-01-10 02:34:36,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-10 02:34:36,634 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 5 states have internal predecessors, (102), 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 112 [2022-01-10 02:34:36,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:34:36,665 INFO L225 Difference]: With dead ends: 10600 [2022-01-10 02:34:36,665 INFO L226 Difference]: Without dead ends: 8934 [2022-01-10 02:34:36,677 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-01-10 02:34:36,677 INFO L933 BasicCegarLoop]: 687 mSDtfsCounter, 1034 mSDsluCounter, 1318 mSDsCounter, 0 mSdLazyCounter, 2038 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1057 SdHoareTripleChecker+Valid, 2005 SdHoareTripleChecker+Invalid, 2144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 2038 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-01-10 02:34:36,678 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1057 Valid, 2005 Invalid, 2144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 2038 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-01-10 02:34:36,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8934 states. [2022-01-10 02:34:37,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8934 to 7899. [2022-01-10 02:34:37,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7899 states, 6484 states have (on average 1.3490129549660703) internal successors, (8747), 6568 states have internal predecessors, (8747), 763 states have call successors, (763), 519 states have call predecessors, (763), 650 states have return successors, (1085), 829 states have call predecessors, (1085), 762 states have call successors, (1085) [2022-01-10 02:34:37,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7899 states to 7899 states and 10595 transitions. [2022-01-10 02:34:37,212 INFO L78 Accepts]: Start accepts. Automaton has 7899 states and 10595 transitions. Word has length 112 [2022-01-10 02:34:37,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:34:37,212 INFO L470 AbstractCegarLoop]: Abstraction has 7899 states and 10595 transitions. [2022-01-10 02:34:37,213 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 5 states have internal predecessors, (102), 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) [2022-01-10 02:34:37,213 INFO L276 IsEmpty]: Start isEmpty. Operand 7899 states and 10595 transitions. [2022-01-10 02:34:37,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-01-10 02:34:37,219 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:34:37,219 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:34:37,219 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-01-10 02:34:37,219 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:34:37,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:34:37,219 INFO L85 PathProgramCache]: Analyzing trace with hash -1573511264, now seen corresponding path program 1 times [2022-01-10 02:34:37,220 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:34:37,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351256582] [2022-01-10 02:34:37,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:34:37,220 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:34:37,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:37,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:34:37,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:37,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-01-10 02:34:37,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:37,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-01-10 02:34:37,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:37,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-01-10 02:34:37,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:37,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-01-10 02:34:37,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:37,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 02:34:37,330 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:34:37,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351256582] [2022-01-10 02:34:37,330 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351256582] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:34:37,330 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:34:37,330 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 02:34:37,330 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528052099] [2022-01-10 02:34:37,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:34:37,331 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 02:34:37,331 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:34:37,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 02:34:37,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-10 02:34:37,332 INFO L87 Difference]: Start difference. First operand 7899 states and 10595 transitions. Second operand has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 5 states have internal predecessors, (102), 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) [2022-01-10 02:34:39,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:34:39,518 INFO L93 Difference]: Finished difference Result 16530 states and 24283 transitions. [2022-01-10 02:34:39,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-10 02:34:39,519 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 5 states have internal predecessors, (102), 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 112 [2022-01-10 02:34:39,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:34:39,593 INFO L225 Difference]: With dead ends: 16530 [2022-01-10 02:34:39,593 INFO L226 Difference]: Without dead ends: 13214 [2022-01-10 02:34:39,605 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-01-10 02:34:39,606 INFO L933 BasicCegarLoop]: 684 mSDtfsCounter, 1034 mSDsluCounter, 1318 mSDsCounter, 0 mSdLazyCounter, 2032 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1057 SdHoareTripleChecker+Valid, 2002 SdHoareTripleChecker+Invalid, 2138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 2032 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-01-10 02:34:39,606 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1057 Valid, 2002 Invalid, 2138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 2032 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-01-10 02:34:39,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13214 states. [2022-01-10 02:34:40,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13214 to 11213. [2022-01-10 02:34:40,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11213 states, 9446 states have (on average 1.40747406309549) internal successors, (13295), 9546 states have internal predecessors, (13295), 1003 states have call successors, (1003), 615 states have call predecessors, (1003), 762 states have return successors, (1519), 1085 states have call predecessors, (1519), 1002 states have call successors, (1519) [2022-01-10 02:34:40,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11213 states to 11213 states and 15817 transitions. [2022-01-10 02:34:40,248 INFO L78 Accepts]: Start accepts. Automaton has 11213 states and 15817 transitions. Word has length 112 [2022-01-10 02:34:40,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:34:40,249 INFO L470 AbstractCegarLoop]: Abstraction has 11213 states and 15817 transitions. [2022-01-10 02:34:40,249 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 5 states have internal predecessors, (102), 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) [2022-01-10 02:34:40,249 INFO L276 IsEmpty]: Start isEmpty. Operand 11213 states and 15817 transitions. [2022-01-10 02:34:40,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-01-10 02:34:40,256 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:34:40,257 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:34:40,257 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-01-10 02:34:40,257 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:34:40,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:34:40,257 INFO L85 PathProgramCache]: Analyzing trace with hash 303551966, now seen corresponding path program 1 times [2022-01-10 02:34:40,257 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:34:40,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981750216] [2022-01-10 02:34:40,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:34:40,258 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:34:40,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:40,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:34:40,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:40,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-01-10 02:34:40,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:40,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-01-10 02:34:40,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:40,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-01-10 02:34:40,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:40,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-01-10 02:34:40,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:40,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 02:34:40,336 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:34:40,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981750216] [2022-01-10 02:34:40,336 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981750216] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:34:40,336 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:34:40,336 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 02:34:40,336 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653013744] [2022-01-10 02:34:40,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:34:40,336 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 02:34:40,336 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:34:40,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 02:34:40,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-10 02:34:40,337 INFO L87 Difference]: Start difference. First operand 11213 states and 15817 transitions. Second operand has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 5 states have internal predecessors, (102), 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) [2022-01-10 02:34:43,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:34:43,005 INFO L93 Difference]: Finished difference Result 28388 states and 43239 transitions. [2022-01-10 02:34:43,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-10 02:34:43,006 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 5 states have internal predecessors, (102), 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 112 [2022-01-10 02:34:43,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:34:43,074 INFO L225 Difference]: With dead ends: 28388 [2022-01-10 02:34:43,075 INFO L226 Difference]: Without dead ends: 21758 [2022-01-10 02:34:43,107 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-01-10 02:34:43,107 INFO L933 BasicCegarLoop]: 681 mSDtfsCounter, 1034 mSDsluCounter, 1318 mSDsCounter, 0 mSdLazyCounter, 2026 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1057 SdHoareTripleChecker+Valid, 1999 SdHoareTripleChecker+Invalid, 2132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 2026 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-01-10 02:34:43,108 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1057 Valid, 1999 Invalid, 2132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 2026 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-01-10 02:34:43,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21758 states. [2022-01-10 02:34:44,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21758 to 17871. [2022-01-10 02:34:44,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17871 states, 15400 states have (on average 1.4568181818181818) internal successors, (22435), 15532 states have internal predecessors, (22435), 1483 states have call successors, (1483), 807 states have call predecessors, (1483), 986 states have return successors, (2549), 1597 states have call predecessors, (2549), 1482 states have call successors, (2549) [2022-01-10 02:34:44,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17871 states to 17871 states and 26467 transitions. [2022-01-10 02:34:44,242 INFO L78 Accepts]: Start accepts. Automaton has 17871 states and 26467 transitions. Word has length 112 [2022-01-10 02:34:44,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:34:44,242 INFO L470 AbstractCegarLoop]: Abstraction has 17871 states and 26467 transitions. [2022-01-10 02:34:44,243 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 5 states have internal predecessors, (102), 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) [2022-01-10 02:34:44,243 INFO L276 IsEmpty]: Start isEmpty. Operand 17871 states and 26467 transitions. [2022-01-10 02:34:44,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-01-10 02:34:44,255 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:34:44,255 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:34:44,255 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-01-10 02:34:44,255 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:34:44,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:34:44,256 INFO L85 PathProgramCache]: Analyzing trace with hash -467181600, now seen corresponding path program 1 times [2022-01-10 02:34:44,256 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:34:44,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789975700] [2022-01-10 02:34:44,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:34:44,256 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:34:44,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:44,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:34:44,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:44,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-01-10 02:34:44,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:44,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-01-10 02:34:44,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:44,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-01-10 02:34:44,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:44,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-01-10 02:34:44,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:44,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 02:34:44,334 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:34:44,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789975700] [2022-01-10 02:34:44,334 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789975700] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:34:44,335 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:34:44,335 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 02:34:44,335 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39006046] [2022-01-10 02:34:44,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:34:44,336 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 02:34:44,336 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:34:44,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 02:34:44,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-10 02:34:44,337 INFO L87 Difference]: Start difference. First operand 17871 states and 26467 transitions. Second operand has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 5 states have internal predecessors, (102), 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) [2022-01-10 02:34:48,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:34:48,833 INFO L93 Difference]: Finished difference Result 58054 states and 90709 transitions. [2022-01-10 02:34:48,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-10 02:34:48,833 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 5 states have internal predecessors, (102), 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 112 [2022-01-10 02:34:48,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:34:48,968 INFO L225 Difference]: With dead ends: 58054 [2022-01-10 02:34:48,969 INFO L226 Difference]: Without dead ends: 44766 [2022-01-10 02:34:49,013 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2022-01-10 02:34:49,014 INFO L933 BasicCegarLoop]: 778 mSDtfsCounter, 1100 mSDsluCounter, 1310 mSDsCounter, 0 mSdLazyCounter, 2316 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1122 SdHoareTripleChecker+Valid, 2088 SdHoareTripleChecker+Invalid, 2427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 2316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-01-10 02:34:49,014 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1122 Valid, 2088 Invalid, 2427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 2316 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-01-10 02:34:49,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44766 states. [2022-01-10 02:34:51,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44766 to 31057. [2022-01-10 02:34:51,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31057 states, 27242 states have (on average 1.4932457235151604) internal successors, (40679), 27438 states have internal predecessors, (40679), 2379 states have call successors, (2379), 1191 states have call predecessors, (2379), 1434 states have return successors, (5031), 2557 states have call predecessors, (5031), 2378 states have call successors, (5031) [2022-01-10 02:34:51,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31057 states to 31057 states and 48089 transitions. [2022-01-10 02:34:51,229 INFO L78 Accepts]: Start accepts. Automaton has 31057 states and 48089 transitions. Word has length 112 [2022-01-10 02:34:51,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:34:51,230 INFO L470 AbstractCegarLoop]: Abstraction has 31057 states and 48089 transitions. [2022-01-10 02:34:51,230 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 5 states have internal predecessors, (102), 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) [2022-01-10 02:34:51,230 INFO L276 IsEmpty]: Start isEmpty. Operand 31057 states and 48089 transitions. [2022-01-10 02:34:51,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-01-10 02:34:51,252 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:34:51,252 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:34:51,253 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-01-10 02:34:51,253 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:34:51,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:34:51,253 INFO L85 PathProgramCache]: Analyzing trace with hash -1461875298, now seen corresponding path program 1 times [2022-01-10 02:34:51,253 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:34:51,253 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522295994] [2022-01-10 02:34:51,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:34:51,254 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:34:51,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:51,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:34:51,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:51,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-01-10 02:34:51,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:51,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-01-10 02:34:51,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:51,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-01-10 02:34:51,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:51,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-01-10 02:34:51,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:34:51,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 02:34:51,333 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:34:51,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522295994] [2022-01-10 02:34:51,333 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522295994] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:34:51,334 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:34:51,334 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 02:34:51,334 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213250616] [2022-01-10 02:34:51,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:34:51,334 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 02:34:51,334 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:34:51,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 02:34:51,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-10 02:34:51,335 INFO L87 Difference]: Start difference. First operand 31057 states and 48089 transitions. Second operand has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 5 states have internal predecessors, (102), 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)