/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_3.cil+token_ring.09.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 02:36:53,821 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 02:36:53,823 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 02:36:53,898 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 02:36:53,898 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 02:36:53,899 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 02:36:53,900 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 02:36:53,902 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 02:36:53,904 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 02:36:53,905 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 02:36:53,905 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 02:36:53,906 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 02:36:53,907 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 02:36:53,908 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 02:36:53,908 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 02:36:53,909 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 02:36:53,910 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 02:36:53,911 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 02:36:53,912 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 02:36:53,913 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 02:36:53,914 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 02:36:53,915 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 02:36:53,916 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 02:36:53,917 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 02:36:53,919 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 02:36:53,920 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 02:36:53,920 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 02:36:53,921 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 02:36:53,921 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 02:36:53,922 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 02:36:53,922 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 02:36:53,923 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 02:36:53,923 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 02:36:53,924 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 02:36:53,925 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 02:36:53,925 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 02:36:53,926 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 02:36:53,926 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 02:36:53,926 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 02:36:53,927 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 02:36:53,927 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 02:36:53,929 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:36:53,954 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 02:36:53,954 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 02:36:53,954 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 02:36:53,955 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 02:36:53,955 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-10 02:36:53,955 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-10 02:36:53,956 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 02:36:53,956 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 02:36:53,956 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 02:36:53,956 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 02:36:53,957 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 02:36:53,957 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 02:36:53,957 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 02:36:53,957 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 02:36:53,958 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 02:36:53,958 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 02:36:53,958 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 02:36:53,958 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 02:36:53,958 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 02:36:53,958 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 02:36:53,958 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 02:36:53,958 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 02:36:53,959 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 02:36:53,959 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 02:36:53,959 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 02:36:53,959 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-10 02:36:53,959 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-10 02:36:53,959 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 02:36:53,959 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 02:36:53,959 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 02:36:53,960 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:36:54,191 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 02:36:54,225 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 02:36:54,227 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 02:36:54,228 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 02:36:54,228 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 02:36:54,230 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/combinations/pc_sfifo_3.cil+token_ring.09.cil-1.c [2022-01-10 02:36:54,287 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac269777a/a606a87b15004f6489136eb0ad7f8185/FLAG9a2fa959f [2022-01-10 02:36:54,736 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 02:36:54,736 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/combinations/pc_sfifo_3.cil+token_ring.09.cil-1.c [2022-01-10 02:36:54,750 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac269777a/a606a87b15004f6489136eb0ad7f8185/FLAG9a2fa959f [2022-01-10 02:36:55,078 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac269777a/a606a87b15004f6489136eb0ad7f8185 [2022-01-10 02:36:55,080 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 02:36:55,081 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-10 02:36:55,083 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 02:36:55,083 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 02:36:55,086 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 02:36:55,087 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 02:36:55" (1/1) ... [2022-01-10 02:36:55,088 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ad4b752 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:36:55, skipping insertion in model container [2022-01-10 02:36:55,088 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 02:36:55" (1/1) ... [2022-01-10 02:36:55,095 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 02:36:55,143 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 02:36:55,316 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_3.cil+token_ring.09.cil-1.c[911,924] [2022-01-10 02:36:55,426 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_3.cil+token_ring.09.cil-1.c[8416,8429] [2022-01-10 02:36:55,531 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 02:36:55,549 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 02:36:55,560 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_3.cil+token_ring.09.cil-1.c[911,924] [2022-01-10 02:36:55,588 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_3.cil+token_ring.09.cil-1.c[8416,8429] [2022-01-10 02:36:55,639 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 02:36:55,665 INFO L208 MainTranslator]: Completed translation [2022-01-10 02:36:55,666 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:36:55 WrapperNode [2022-01-10 02:36:55,666 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 02:36:55,667 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 02:36:55,667 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 02:36:55,667 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 02:36:55,674 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:36:55" (1/1) ... [2022-01-10 02:36:55,700 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:36:55" (1/1) ... [2022-01-10 02:36:55,750 INFO L137 Inliner]: procedures = 73, calls = 88, calls flagged for inlining = 42, calls inlined = 42, statements flattened = 904 [2022-01-10 02:36:55,750 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 02:36:55,761 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 02:36:55,761 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 02:36:55,762 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 02:36:55,769 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:36:55" (1/1) ... [2022-01-10 02:36:55,769 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:36:55" (1/1) ... [2022-01-10 02:36:55,775 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:36:55" (1/1) ... [2022-01-10 02:36:55,775 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:36:55" (1/1) ... [2022-01-10 02:36:55,794 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:36:55" (1/1) ... [2022-01-10 02:36:55,815 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:36:55" (1/1) ... [2022-01-10 02:36:55,818 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:36:55" (1/1) ... [2022-01-10 02:36:55,823 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 02:36:55,838 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 02:36:55,838 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 02:36:55,838 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 02:36:55,840 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:36:55" (1/1) ... [2022-01-10 02:36:55,846 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 02:36:55,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 02:36:55,868 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:36:55,896 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:36:55,912 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 02:36:55,912 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-01-10 02:36:55,912 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-01-10 02:36:55,912 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2022-01-10 02:36:55,912 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2022-01-10 02:36:55,912 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2022-01-10 02:36:55,912 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2022-01-10 02:36:55,912 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2022-01-10 02:36:55,912 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2022-01-10 02:36:55,913 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2022-01-10 02:36:55,913 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2022-01-10 02:36:55,913 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2022-01-10 02:36:55,913 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2022-01-10 02:36:55,913 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2022-01-10 02:36:55,913 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2022-01-10 02:36:55,913 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2022-01-10 02:36:55,913 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2022-01-10 02:36:55,913 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2022-01-10 02:36:55,913 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2022-01-10 02:36:55,913 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2022-01-10 02:36:55,913 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2022-01-10 02:36:55,914 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2022-01-10 02:36:55,914 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2022-01-10 02:36:55,914 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-10 02:36:55,914 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2022-01-10 02:36:55,914 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2022-01-10 02:36:55,914 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2022-01-10 02:36:55,914 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2022-01-10 02:36:55,914 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 02:36:55,914 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 02:36:55,914 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2022-01-10 02:36:55,914 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2022-01-10 02:36:56,075 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 02:36:56,077 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 02:36:56,724 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##56: assume !(1 == ~q_free~0); [2022-01-10 02:36:56,724 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##55: assume 1 == ~q_free~0;~c_dr_st~0 := 2;~c_dr_pc~0 := 2;~a_t~0 := do_read_c_~a~0#1; [2022-01-10 02:36:56,799 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 02:36:56,820 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 02:36:56,820 INFO L299 CfgBuilder]: Removed 16 assume(true) statements. [2022-01-10 02:36:56,827 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 02:36:56 BoogieIcfgContainer [2022-01-10 02:36:56,827 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 02:36:56,828 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 02:36:56,828 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 02:36:56,831 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 02:36:56,832 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 02:36:55" (1/3) ... [2022-01-10 02:36:56,832 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c367519 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 02:36:56, skipping insertion in model container [2022-01-10 02:36:56,833 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:36:55" (2/3) ... [2022-01-10 02:36:56,833 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c367519 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 02:36:56, skipping insertion in model container [2022-01-10 02:36:56,833 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 02:36:56" (3/3) ... [2022-01-10 02:36:56,834 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_3.cil+token_ring.09.cil-1.c [2022-01-10 02:36:56,839 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 02:36:56,840 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-01-10 02:36:56,879 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 02:36:56,884 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:36:56,885 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-01-10 02:36:56,918 INFO L276 IsEmpty]: Start isEmpty. Operand has 424 states, 368 states have (on average 1.625) internal successors, (598), 374 states have internal predecessors, (598), 39 states have call successors, (39), 14 states have call predecessors, (39), 14 states have return successors, (39), 38 states have call predecessors, (39), 39 states have call successors, (39) [2022-01-10 02:36:56,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-01-10 02:36:56,925 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:36:56,926 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:36:56,926 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:36:56,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:36:56,931 INFO L85 PathProgramCache]: Analyzing trace with hash 1177923463, now seen corresponding path program 1 times [2022-01-10 02:36:56,938 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:36:56,938 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623459108] [2022-01-10 02:36:56,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:36:56,939 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:36:57,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:57,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:36:57,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:57,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-10 02:36:57,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:57,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-10 02:36:57,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:57,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-10 02:36:57,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:57,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 02:36:57,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:57,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-01-10 02:36:57,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:57,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-01-10 02:36:57,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:57,297 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:36:57,297 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:36:57,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623459108] [2022-01-10 02:36:57,298 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623459108] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:36:57,298 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:36:57,298 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-10 02:36:57,300 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548296066] [2022-01-10 02:36:57,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:36:57,304 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 02:36:57,304 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:36:57,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 02:36:57,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-01-10 02:36:57,329 INFO L87 Difference]: Start difference. First operand has 424 states, 368 states have (on average 1.625) internal successors, (598), 374 states have internal predecessors, (598), 39 states have call successors, (39), 14 states have call predecessors, (39), 14 states have return successors, (39), 38 states have call predecessors, (39), 39 states have call successors, (39) Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-01-10 02:36:58,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:36:58,140 INFO L93 Difference]: Finished difference Result 842 states and 1340 transitions. [2022-01-10 02:36:58,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-10 02:36:58,143 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2022-01-10 02:36:58,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:36:58,158 INFO L225 Difference]: With dead ends: 842 [2022-01-10 02:36:58,158 INFO L226 Difference]: Without dead ends: 432 [2022-01-10 02:36:58,166 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-01-10 02:36:58,171 INFO L933 BasicCegarLoop]: 635 mSDtfsCounter, 669 mSDsluCounter, 1106 mSDsCounter, 0 mSdLazyCounter, 442 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 681 SdHoareTripleChecker+Valid, 1741 SdHoareTripleChecker+Invalid, 538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-10 02:36:58,173 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [681 Valid, 1741 Invalid, 538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 442 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-01-10 02:36:58,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2022-01-10 02:36:58,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 414. [2022-01-10 02:36:58,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 414 states, 360 states have (on average 1.5361111111111112) internal successors, (553), 364 states have internal predecessors, (553), 39 states have call successors, (39), 14 states have call predecessors, (39), 13 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2022-01-10 02:36:58,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 629 transitions. [2022-01-10 02:36:58,272 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 629 transitions. Word has length 65 [2022-01-10 02:36:58,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:36:58,273 INFO L470 AbstractCegarLoop]: Abstraction has 414 states and 629 transitions. [2022-01-10 02:36:58,273 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-01-10 02:36:58,273 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 629 transitions. [2022-01-10 02:36:58,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-01-10 02:36:58,276 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:36:58,276 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:36:58,276 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-10 02:36:58,277 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:36:58,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:36:58,278 INFO L85 PathProgramCache]: Analyzing trace with hash 1137248713, now seen corresponding path program 1 times [2022-01-10 02:36:58,278 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:36:58,278 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957756222] [2022-01-10 02:36:58,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:36:58,278 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:36:58,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:58,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:36:58,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:58,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-10 02:36:58,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:58,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-10 02:36:58,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:58,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-10 02:36:58,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:58,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 02:36:58,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:58,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-01-10 02:36:58,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:58,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-01-10 02:36:58,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:58,485 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:36:58,485 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:36:58,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957756222] [2022-01-10 02:36:58,486 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957756222] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:36:58,486 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:36:58,486 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-10 02:36:58,486 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902078682] [2022-01-10 02:36:58,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:36:58,487 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-10 02:36:58,487 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:36:58,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-10 02:36:58,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-01-10 02:36:58,488 INFO L87 Difference]: Start difference. First operand 414 states and 629 transitions. 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:36:59,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:36:59,452 INFO L93 Difference]: Finished difference Result 669 states and 998 transitions. [2022-01-10 02:36:59,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-10 02:36:59,453 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:36:59,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:36:59,459 INFO L225 Difference]: With dead ends: 669 [2022-01-10 02:36:59,459 INFO L226 Difference]: Without dead ends: 565 [2022-01-10 02:36:59,463 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2022-01-10 02:36:59,464 INFO L933 BasicCegarLoop]: 660 mSDtfsCounter, 1394 mSDsluCounter, 1221 mSDsCounter, 0 mSdLazyCounter, 944 mSolverCounterSat, 244 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1401 SdHoareTripleChecker+Valid, 1881 SdHoareTripleChecker+Invalid, 1188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 244 IncrementalHoareTripleChecker+Valid, 944 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-01-10 02:36:59,464 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1401 Valid, 1881 Invalid, 1188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [244 Valid, 944 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-01-10 02:36:59,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2022-01-10 02:36:59,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 526. [2022-01-10 02:36:59,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 526 states, 450 states have (on average 1.508888888888889) internal successors, (679), 456 states have internal predecessors, (679), 52 states have call successors, (52), 21 states have call predecessors, (52), 22 states have return successors, (55), 51 states have call predecessors, (55), 50 states have call successors, (55) [2022-01-10 02:36:59,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 786 transitions. [2022-01-10 02:36:59,497 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 786 transitions. Word has length 65 [2022-01-10 02:36:59,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:36:59,497 INFO L470 AbstractCegarLoop]: Abstraction has 526 states and 786 transitions. [2022-01-10 02:36:59,497 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:36:59,497 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 786 transitions. [2022-01-10 02:36:59,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-01-10 02:36:59,500 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:36:59,500 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:36:59,500 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-10 02:36:59,500 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:36:59,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:36:59,501 INFO L85 PathProgramCache]: Analyzing trace with hash -1619378553, now seen corresponding path program 1 times [2022-01-10 02:36:59,501 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:36:59,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212867843] [2022-01-10 02:36:59,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:36:59,501 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:36:59,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:59,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:36:59,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:59,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-10 02:36:59,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:59,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-10 02:36:59,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:59,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-10 02:36:59,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:59,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 02:36:59,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:59,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-01-10 02:36:59,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:59,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-01-10 02:36:59,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:36:59,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:36:59,605 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:36:59,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212867843] [2022-01-10 02:36:59,606 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [212867843] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:36:59,606 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:36:59,606 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-10 02:36:59,606 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136775122] [2022-01-10 02:36:59,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:36:59,607 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-10 02:36:59,607 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:36:59,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-10 02:36:59,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-01-10 02:36:59,608 INFO L87 Difference]: Start difference. First operand 526 states and 786 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:37:00,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:37:00,713 INFO L93 Difference]: Finished difference Result 923 states and 1351 transitions. [2022-01-10 02:37:00,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-01-10 02:37:00,714 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:37:00,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:37:00,720 INFO L225 Difference]: With dead ends: 923 [2022-01-10 02:37:00,720 INFO L226 Difference]: Without dead ends: 714 [2022-01-10 02:37:00,723 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:37:00,727 INFO L933 BasicCegarLoop]: 715 mSDtfsCounter, 1216 mSDsluCounter, 1776 mSDsCounter, 0 mSdLazyCounter, 1384 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1245 SdHoareTripleChecker+Valid, 2491 SdHoareTripleChecker+Invalid, 1515 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 1384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-01-10 02:37:00,728 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1245 Valid, 2491 Invalid, 1515 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 1384 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-01-10 02:37:00,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 714 states. [2022-01-10 02:37:00,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 714 to 638. [2022-01-10 02:37:00,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 638 states, 540 states have (on average 1.488888888888889) internal successors, (804), 548 states have internal predecessors, (804), 65 states have call successors, (65), 28 states have call predecessors, (65), 31 states have return successors, (76), 65 states have call predecessors, (76), 63 states have call successors, (76) [2022-01-10 02:37:00,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 945 transitions. [2022-01-10 02:37:00,775 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 945 transitions. Word has length 65 [2022-01-10 02:37:00,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:37:00,776 INFO L470 AbstractCegarLoop]: Abstraction has 638 states and 945 transitions. [2022-01-10 02:37:00,776 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:37:00,776 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 945 transitions. [2022-01-10 02:37:00,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-01-10 02:37:00,782 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:37:00,782 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:37:00,782 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-10 02:37:00,783 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:37:00,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:37:00,783 INFO L85 PathProgramCache]: Analyzing trace with hash 647002633, now seen corresponding path program 1 times [2022-01-10 02:37:00,783 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:37:00,783 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387421190] [2022-01-10 02:37:00,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:37:00,784 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:37:00,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:37:00,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:37:00,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:37:00,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-10 02:37:00,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:37:00,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-10 02:37:00,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:37:00,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-10 02:37:00,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:37:00,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 02:37:00,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:37:00,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-01-10 02:37:00,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:37:00,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-01-10 02:37:00,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:37:00,926 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:37:00,927 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:37:00,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387421190] [2022-01-10 02:37:00,927 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387421190] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:37:00,927 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:37:00,927 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-10 02:37:00,927 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111996528] [2022-01-10 02:37:00,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:37:00,928 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-10 02:37:00,928 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:37:00,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-10 02:37:00,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-01-10 02:37:00,929 INFO L87 Difference]: Start difference. First operand 638 states and 945 transitions. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 5 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) [2022-01-10 02:37:02,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:37:02,828 INFO L93 Difference]: Finished difference Result 2184 states and 3142 transitions. [2022-01-10 02:37:02,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-01-10 02:37:02,828 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), 5 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) Word has length 65 [2022-01-10 02:37:02,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:37:02,837 INFO L225 Difference]: With dead ends: 2184 [2022-01-10 02:37:02,837 INFO L226 Difference]: Without dead ends: 1851 [2022-01-10 02:37:02,840 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 337 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=257, Invalid=1075, Unknown=0, NotChecked=0, Total=1332 [2022-01-10 02:37:02,845 INFO L933 BasicCegarLoop]: 765 mSDtfsCounter, 3313 mSDsluCounter, 2070 mSDsCounter, 0 mSdLazyCounter, 1847 mSolverCounterSat, 644 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3331 SdHoareTripleChecker+Valid, 2835 SdHoareTripleChecker+Invalid, 2491 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 644 IncrementalHoareTripleChecker+Valid, 1847 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-01-10 02:37:02,847 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3331 Valid, 2835 Invalid, 2491 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [644 Valid, 1847 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-01-10 02:37:02,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1851 states. [2022-01-10 02:37:02,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1851 to 1691. [2022-01-10 02:37:02,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1691 states, 1388 states have (on average 1.404899135446686) internal successors, (1950), 1411 states have internal predecessors, (1950), 175 states have call successors, (175), 111 states have call predecessors, (175), 126 states have return successors, (209), 171 states have call predecessors, (209), 173 states have call successors, (209) [2022-01-10 02:37:02,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1691 states to 1691 states and 2334 transitions. [2022-01-10 02:37:02,946 INFO L78 Accepts]: Start accepts. Automaton has 1691 states and 2334 transitions. Word has length 65 [2022-01-10 02:37:02,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:37:02,947 INFO L470 AbstractCegarLoop]: Abstraction has 1691 states and 2334 transitions. [2022-01-10 02:37:02,947 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), 5 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) [2022-01-10 02:37:02,947 INFO L276 IsEmpty]: Start isEmpty. Operand 1691 states and 2334 transitions. [2022-01-10 02:37:02,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-01-10 02:37:02,948 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:37:02,948 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:37:02,948 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-10 02:37:02,948 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:37:02,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:37:02,949 INFO L85 PathProgramCache]: Analyzing trace with hash -1861088182, now seen corresponding path program 1 times [2022-01-10 02:37:02,949 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:37:02,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348608308] [2022-01-10 02:37:02,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:37:02,949 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:37:02,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:37:02,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:37:02,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:37:03,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-10 02:37:03,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:37:03,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-10 02:37:03,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:37:03,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-10 02:37:03,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:37:03,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-01-10 02:37:03,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:37:03,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-01-10 02:37:03,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:37:03,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-01-10 02:37:03,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:37:03,083 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:37:03,083 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:37:03,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348608308] [2022-01-10 02:37:03,083 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348608308] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:37:03,083 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:37:03,084 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-10 02:37:03,084 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427789248] [2022-01-10 02:37:03,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:37:03,084 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-10 02:37:03,084 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:37:03,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-10 02:37:03,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-01-10 02:37:03,085 INFO L87 Difference]: Start difference. First operand 1691 states and 2334 transitions. Second operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 5 states have internal predecessors, (51), 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:37:04,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:37:04,100 INFO L93 Difference]: Finished difference Result 3219 states and 4413 transitions. [2022-01-10 02:37:04,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-10 02:37:04,101 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 5 states have internal predecessors, (51), 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 66 [2022-01-10 02:37:04,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:37:04,110 INFO L225 Difference]: With dead ends: 3219 [2022-01-10 02:37:04,110 INFO L226 Difference]: Without dead ends: 1839 [2022-01-10 02:37:04,116 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-01-10 02:37:04,117 INFO L933 BasicCegarLoop]: 617 mSDtfsCounter, 546 mSDsluCounter, 2127 mSDsCounter, 0 mSdLazyCounter, 1479 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 547 SdHoareTripleChecker+Valid, 2744 SdHoareTripleChecker+Invalid, 1574 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 1479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-01-10 02:37:04,117 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [547 Valid, 2744 Invalid, 1574 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 1479 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-01-10 02:37:04,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1839 states. [2022-01-10 02:37:04,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1839 to 1731. [2022-01-10 02:37:04,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1731 states, 1420 states have (on average 1.3915492957746478) internal successors, (1976), 1443 states have internal predecessors, (1976), 175 states have call successors, (175), 111 states have call predecessors, (175), 134 states have return successors, (217), 179 states have call predecessors, (217), 173 states have call successors, (217) [2022-01-10 02:37:04,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1731 states to 1731 states and 2368 transitions. [2022-01-10 02:37:04,199 INFO L78 Accepts]: Start accepts. Automaton has 1731 states and 2368 transitions. Word has length 66 [2022-01-10 02:37:04,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:37:04,199 INFO L470 AbstractCegarLoop]: Abstraction has 1731 states and 2368 transitions. [2022-01-10 02:37:04,199 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 5 states have internal predecessors, (51), 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:37:04,200 INFO L276 IsEmpty]: Start isEmpty. Operand 1731 states and 2368 transitions. [2022-01-10 02:37:04,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-01-10 02:37:04,201 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:37:04,201 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:37:04,201 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-10 02:37:04,201 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:37:04,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:37:04,202 INFO L85 PathProgramCache]: Analyzing trace with hash 1404519816, now seen corresponding path program 1 times [2022-01-10 02:37:04,202 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:37:04,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656621383] [2022-01-10 02:37:04,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:37:04,202 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:37:04,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:37:04,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:37:04,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:37:04,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-10 02:37:04,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:37:04,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-10 02:37:04,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:37:04,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-10 02:37:04,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:37:04,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-01-10 02:37:04,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:37:04,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-01-10 02:37:04,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:37:04,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-01-10 02:37:04,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:37:04,307 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:37:04,307 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:37:04,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656621383] [2022-01-10 02:37:04,307 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656621383] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:37:04,307 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:37:04,307 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-10 02:37:04,307 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304024756] [2022-01-10 02:37:04,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:37:04,308 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-10 02:37:04,308 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:37:04,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-10 02:37:04,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-01-10 02:37:04,308 INFO L87 Difference]: Start difference. First operand 1731 states and 2368 transitions. Second operand has 10 states, 10 states have (on average 5.1) internal successors, (51), 7 states have internal predecessors, (51), 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:37:06,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:37:06,100 INFO L93 Difference]: Finished difference Result 5303 states and 7242 transitions. [2022-01-10 02:37:06,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-01-10 02:37:06,101 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 7 states have internal predecessors, (51), 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 66 [2022-01-10 02:37:06,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:37:06,110 INFO L225 Difference]: With dead ends: 5303 [2022-01-10 02:37:06,110 INFO L226 Difference]: Without dead ends: 2122 [2022-01-10 02:37:06,115 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 340 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=257, Invalid=1075, Unknown=0, NotChecked=0, Total=1332 [2022-01-10 02:37:06,116 INFO L933 BasicCegarLoop]: 756 mSDtfsCounter, 3425 mSDsluCounter, 2100 mSDsCounter, 0 mSdLazyCounter, 1764 mSolverCounterSat, 662 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3443 SdHoareTripleChecker+Valid, 2856 SdHoareTripleChecker+Invalid, 2426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 662 IncrementalHoareTripleChecker+Valid, 1764 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-01-10 02:37:06,116 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3443 Valid, 2856 Invalid, 2426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [662 Valid, 1764 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-01-10 02:37:06,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2122 states. [2022-01-10 02:37:06,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2122 to 1942. [2022-01-10 02:37:06,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1942 states, 1559 states have (on average 1.3483001924310456) internal successors, (2102), 1584 states have internal predecessors, (2102), 215 states have call successors, (215), 139 states have call predecessors, (215), 166 states have return successors, (263), 221 states have call predecessors, (263), 213 states have call successors, (263) [2022-01-10 02:37:06,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1942 states to 1942 states and 2580 transitions. [2022-01-10 02:37:06,195 INFO L78 Accepts]: Start accepts. Automaton has 1942 states and 2580 transitions. Word has length 66 [2022-01-10 02:37:06,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:37:06,195 INFO L470 AbstractCegarLoop]: Abstraction has 1942 states and 2580 transitions. [2022-01-10 02:37:06,195 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 7 states have internal predecessors, (51), 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:37:06,195 INFO L276 IsEmpty]: Start isEmpty. Operand 1942 states and 2580 transitions. [2022-01-10 02:37:06,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-01-10 02:37:06,201 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:37:06,201 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:37:06,201 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-10 02:37:06,202 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:37:06,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:37:06,202 INFO L85 PathProgramCache]: Analyzing trace with hash -934912176, now seen corresponding path program 1 times [2022-01-10 02:37:06,202 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:37:06,205 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030842329] [2022-01-10 02:37:06,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:37:06,205 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:37:06,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:37:06,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:37:06,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:37:06,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-10 02:37:06,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:37:06,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-10 02:37:06,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:37:06,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-10 02:37:06,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:37:06,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-01-10 02:37:06,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:37:06,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-01-10 02:37:06,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:37:06,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-01-10 02:37:06,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:37:06,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-01-10 02:37:06,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:37:06,335 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-01-10 02:37:06,335 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:37:06,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030842329] [2022-01-10 02:37:06,335 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030842329] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:37:06,335 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:37:06,335 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-10 02:37:06,336 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269856519] [2022-01-10 02:37:06,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:37:06,336 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-10 02:37:06,337 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:37:06,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-10 02:37:06,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-01-10 02:37:06,337 INFO L87 Difference]: Start difference. First operand 1942 states and 2580 transitions. Second operand has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 5 states have internal predecessors, (62), 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:37:07,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:37:07,301 INFO L93 Difference]: Finished difference Result 3767 states and 4982 transitions. [2022-01-10 02:37:07,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-10 02:37:07,301 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 5 states have internal predecessors, (62), 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 91 [2022-01-10 02:37:07,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:37:07,314 INFO L225 Difference]: With dead ends: 3767 [2022-01-10 02:37:07,314 INFO L226 Difference]: Without dead ends: 2136 [2022-01-10 02:37:07,318 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2022-01-10 02:37:07,320 INFO L933 BasicCegarLoop]: 605 mSDtfsCounter, 800 mSDsluCounter, 1810 mSDsCounter, 0 mSdLazyCounter, 1393 mSolverCounterSat, 141 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 802 SdHoareTripleChecker+Valid, 2415 SdHoareTripleChecker+Invalid, 1534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 141 IncrementalHoareTripleChecker+Valid, 1393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-01-10 02:37:07,320 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [802 Valid, 2415 Invalid, 1534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [141 Valid, 1393 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-01-10 02:37:07,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2136 states. [2022-01-10 02:37:07,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2136 to 2002. [2022-01-10 02:37:07,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2002 states, 1607 states have (on average 1.3341630367143746) internal successors, (2144), 1632 states have internal predecessors, (2144), 215 states have call successors, (215), 139 states have call predecessors, (215), 178 states have return successors, (275), 233 states have call predecessors, (275), 213 states have call successors, (275) [2022-01-10 02:37:07,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2002 states to 2002 states and 2634 transitions. [2022-01-10 02:37:07,461 INFO L78 Accepts]: Start accepts. Automaton has 2002 states and 2634 transitions. Word has length 91 [2022-01-10 02:37:07,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:37:07,461 INFO L470 AbstractCegarLoop]: Abstraction has 2002 states and 2634 transitions. [2022-01-10 02:37:07,461 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 5 states have internal predecessors, (62), 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:37:07,461 INFO L276 IsEmpty]: Start isEmpty. Operand 2002 states and 2634 transitions. [2022-01-10 02:37:07,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-01-10 02:37:07,463 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:37:07,463 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:37:07,463 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-10 02:37:07,463 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:37:07,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:37:07,464 INFO L85 PathProgramCache]: Analyzing trace with hash -491011502, now seen corresponding path program 1 times [2022-01-10 02:37:07,464 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:37:07,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597458080] [2022-01-10 02:37:07,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:37:07,464 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:37:07,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:37:07,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:37:07,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:37:07,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-10 02:37:07,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:37:07,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-10 02:37:07,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:37:07,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-10 02:37:07,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:37:07,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-01-10 02:37:07,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:37:07,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-01-10 02:37:07,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:37:07,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-01-10 02:37:07,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:37:07,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-01-10 02:37:07,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:37:07,576 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-01-10 02:37:07,576 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:37:07,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597458080] [2022-01-10 02:37:07,576 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597458080] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:37:07,576 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:37:07,576 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-10 02:37:07,577 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001591129] [2022-01-10 02:37:07,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:37:07,577 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-10 02:37:07,577 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:37:07,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-10 02:37:07,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-01-10 02:37:07,578 INFO L87 Difference]: Start difference. First operand 2002 states and 2634 transitions. Second operand has 8 states, 8 states have (on average 7.75) internal successors, (62), 6 states have internal predecessors, (62), 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:37:08,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:37:08,573 INFO L93 Difference]: Finished difference Result 3529 states and 4598 transitions. [2022-01-10 02:37:08,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-01-10 02:37:08,573 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 6 states have internal predecessors, (62), 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 91 [2022-01-10 02:37:08,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:37:08,583 INFO L225 Difference]: With dead ends: 3529 [2022-01-10 02:37:08,583 INFO L226 Difference]: Without dead ends: 2076 [2022-01-10 02:37:08,587 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=277, Unknown=0, NotChecked=0, Total=380 [2022-01-10 02:37:08,587 INFO L933 BasicCegarLoop]: 634 mSDtfsCounter, 1237 mSDsluCounter, 1539 mSDsCounter, 0 mSdLazyCounter, 1182 mSolverCounterSat, 153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1267 SdHoareTripleChecker+Valid, 2173 SdHoareTripleChecker+Invalid, 1335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 153 IncrementalHoareTripleChecker+Valid, 1182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-01-10 02:37:08,588 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1267 Valid, 2173 Invalid, 1335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [153 Valid, 1182 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-01-10 02:37:08,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2076 states. [2022-01-10 02:37:08,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2076 to 1781. [2022-01-10 02:37:08,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1781 states, 1439 states have (on average 1.3384294649061848) internal successors, (1926), 1459 states have internal predecessors, (1926), 187 states have call successors, (187), 120 states have call predecessors, (187), 153 states have return successors, (235), 203 states have call predecessors, (235), 185 states have call successors, (235) [2022-01-10 02:37:08,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1781 states to 1781 states and 2348 transitions. [2022-01-10 02:37:08,664 INFO L78 Accepts]: Start accepts. Automaton has 1781 states and 2348 transitions. Word has length 91 [2022-01-10 02:37:08,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:37:08,664 INFO L470 AbstractCegarLoop]: Abstraction has 1781 states and 2348 transitions. [2022-01-10 02:37:08,664 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 6 states have internal predecessors, (62), 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:37:08,664 INFO L276 IsEmpty]: Start isEmpty. Operand 1781 states and 2348 transitions. [2022-01-10 02:37:08,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-01-10 02:37:08,665 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:37:08,666 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:37:08,666 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-10 02:37:08,666 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:37:08,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:37:08,666 INFO L85 PathProgramCache]: Analyzing trace with hash 1448150544, now seen corresponding path program 1 times [2022-01-10 02:37:08,667 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:37:08,667 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30473383] [2022-01-10 02:37:08,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:37:08,667 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:37:08,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:37:08,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:37:08,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:37:08,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-10 02:37:08,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:37:08,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-10 02:37:08,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:37:08,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-10 02:37:08,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:37:08,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-01-10 02:37:08,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:37:08,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-01-10 02:37:08,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:37:08,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-01-10 02:37:08,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:37:08,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-01-10 02:37:08,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:37:08,752 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-10 02:37:08,752 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:37:08,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30473383] [2022-01-10 02:37:08,752 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30473383] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:37:08,753 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:37:08,753 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 02:37:08,753 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626377260] [2022-01-10 02:37:08,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:37:08,754 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 02:37:08,754 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:37:08,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 02:37:08,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-01-10 02:37:08,755 INFO L87 Difference]: Start difference. First operand 1781 states and 2348 transitions. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 4 states have internal predecessors, (70), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-01-10 02:37:09,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:37:09,267 INFO L93 Difference]: Finished difference Result 4933 states and 6460 transitions. [2022-01-10 02:37:09,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-10 02:37:09,268 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 4 states have internal predecessors, (70), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 91 [2022-01-10 02:37:09,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:37:09,286 INFO L225 Difference]: With dead ends: 4933 [2022-01-10 02:37:09,287 INFO L226 Difference]: Without dead ends: 3464 [2022-01-10 02:37:09,290 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2022-01-10 02:37:09,292 INFO L933 BasicCegarLoop]: 617 mSDtfsCounter, 1155 mSDsluCounter, 1192 mSDsCounter, 0 mSdLazyCounter, 454 mSolverCounterSat, 143 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1186 SdHoareTripleChecker+Valid, 1809 SdHoareTripleChecker+Invalid, 597 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 143 IncrementalHoareTripleChecker+Valid, 454 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-10 02:37:09,292 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1186 Valid, 1809 Invalid, 597 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [143 Valid, 454 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-10 02:37:09,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3464 states. [2022-01-10 02:37:09,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3464 to 3250. [2022-01-10 02:37:09,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3250 states, 2588 states have (on average 1.295981452859351) internal successors, (3354), 2637 states have internal predecessors, (3354), 348 states have call successors, (348), 233 states have call predecessors, (348), 312 states have return successors, (518), 382 states have call predecessors, (518), 346 states have call successors, (518) [2022-01-10 02:37:09,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3250 states to 3250 states and 4220 transitions. [2022-01-10 02:37:09,441 INFO L78 Accepts]: Start accepts. Automaton has 3250 states and 4220 transitions. Word has length 91 [2022-01-10 02:37:09,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:37:09,441 INFO L470 AbstractCegarLoop]: Abstraction has 3250 states and 4220 transitions. [2022-01-10 02:37:09,442 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 4 states have internal predecessors, (70), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-01-10 02:37:09,442 INFO L276 IsEmpty]: Start isEmpty. Operand 3250 states and 4220 transitions. [2022-01-10 02:37:09,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-01-10 02:37:09,443 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:37:09,443 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:37:09,443 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-10 02:37:09,444 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:37:09,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:37:09,444 INFO L85 PathProgramCache]: Analyzing trace with hash 390312466, now seen corresponding path program 1 times [2022-01-10 02:37:09,444 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:37:09,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75609944] [2022-01-10 02:37:09,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:37:09,444 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:37:09,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:37:09,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:37:09,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:37:09,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-10 02:37:09,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:37:09,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-10 02:37:09,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:37:09,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-10 02:37:09,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:37:09,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-01-10 02:37:09,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:37:09,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-01-10 02:37:09,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:37:09,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-01-10 02:37:09,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:37:09,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-01-10 02:37:09,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:37:09,509 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-01-10 02:37:09,509 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:37:09,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75609944] [2022-01-10 02:37:09,510 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75609944] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:37:09,510 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:37:09,510 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-10 02:37:09,510 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475271126] [2022-01-10 02:37:09,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:37:09,510 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 02:37:09,510 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:37:09,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 02:37:09,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-01-10 02:37:09,511 INFO L87 Difference]: Start difference. First operand 3250 states and 4220 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-01-10 02:37:09,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:37:09,977 INFO L93 Difference]: Finished difference Result 4834 states and 6204 transitions. [2022-01-10 02:37:09,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-10 02:37:09,978 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), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 91 [2022-01-10 02:37:09,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:37:09,986 INFO L225 Difference]: With dead ends: 4834 [2022-01-10 02:37:09,986 INFO L226 Difference]: Without dead ends: 1896 [2022-01-10 02:37:09,991 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-01-10 02:37:09,992 INFO L933 BasicCegarLoop]: 602 mSDtfsCounter, 916 mSDsluCounter, 783 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 931 SdHoareTripleChecker+Valid, 1385 SdHoareTripleChecker+Invalid, 505 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-10 02:37:09,993 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [931 Valid, 1385 Invalid, 505 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [142 Valid, 363 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-10 02:37:09,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1896 states. [2022-01-10 02:37:10,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1896 to 1781. [2022-01-10 02:37:10,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1781 states, 1439 states have (on average 1.3127171646977067) internal successors, (1889), 1459 states have internal predecessors, (1889), 187 states have call successors, (187), 120 states have call predecessors, (187), 153 states have return successors, (235), 203 states have call predecessors, (235), 185 states have call successors, (235) [2022-01-10 02:37:10,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1781 states to 1781 states and 2311 transitions. [2022-01-10 02:37:10,091 INFO L78 Accepts]: Start accepts. Automaton has 1781 states and 2311 transitions. Word has length 91 [2022-01-10 02:37:10,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:37:10,091 INFO L470 AbstractCegarLoop]: Abstraction has 1781 states and 2311 transitions. [2022-01-10 02:37:10,091 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), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-01-10 02:37:10,091 INFO L276 IsEmpty]: Start isEmpty. Operand 1781 states and 2311 transitions. [2022-01-10 02:37:10,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-01-10 02:37:10,093 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:37:10,093 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:37:10,094 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-10 02:37:10,094 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:37:10,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:37:10,094 INFO L85 PathProgramCache]: Analyzing trace with hash -1802771828, now seen corresponding path program 1 times [2022-01-10 02:37:10,094 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:37:10,095 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676665011] [2022-01-10 02:37:10,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:37:10,095 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:37:10,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:37:10,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:37:10,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:37:10,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-10 02:37:10,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:37:10,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-10 02:37:10,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:37:10,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-10 02:37:10,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:37:10,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-01-10 02:37:10,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:37:10,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-01-10 02:37:10,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:37:10,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-01-10 02:37:10,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:37:10,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-01-10 02:37:10,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:37:10,189 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-10 02:37:10,189 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:37:10,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676665011] [2022-01-10 02:37:10,190 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676665011] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:37:10,190 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:37:10,190 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-10 02:37:10,190 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505715565] [2022-01-10 02:37:10,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:37:10,190 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-10 02:37:10,190 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:37:10,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-10 02:37:10,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-01-10 02:37:10,192 INFO L87 Difference]: Start difference. First operand 1781 states and 2311 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:37:11,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:37:11,427 INFO L93 Difference]: Finished difference Result 4122 states and 5300 transitions. [2022-01-10 02:37:11,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-01-10 02:37:11,428 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 92 [2022-01-10 02:37:11,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:37:11,442 INFO L225 Difference]: With dead ends: 4122 [2022-01-10 02:37:11,443 INFO L226 Difference]: Without dead ends: 2579 [2022-01-10 02:37:11,447 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=210, Invalid=720, Unknown=0, NotChecked=0, Total=930 [2022-01-10 02:37:11,447 INFO L933 BasicCegarLoop]: 700 mSDtfsCounter, 2156 mSDsluCounter, 1302 mSDsCounter, 0 mSdLazyCounter, 1310 mSolverCounterSat, 442 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2195 SdHoareTripleChecker+Valid, 2002 SdHoareTripleChecker+Invalid, 1752 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 442 IncrementalHoareTripleChecker+Valid, 1310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-01-10 02:37:11,448 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2195 Valid, 2002 Invalid, 1752 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [442 Valid, 1310 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-01-10 02:37:11,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2579 states. [2022-01-10 02:37:11,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2579 to 2402. [2022-01-10 02:37:11,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2402 states, 1906 states have (on average 1.2759706190975866) internal successors, (2432), 1934 states have internal predecessors, (2432), 264 states have call successors, (264), 168 states have call predecessors, (264), 230 states have return successors, (366), 301 states have call predecessors, (366), 262 states have call successors, (366) [2022-01-10 02:37:11,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2402 states to 2402 states and 3062 transitions. [2022-01-10 02:37:11,561 INFO L78 Accepts]: Start accepts. Automaton has 2402 states and 3062 transitions. Word has length 92 [2022-01-10 02:37:11,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:37:11,562 INFO L470 AbstractCegarLoop]: Abstraction has 2402 states and 3062 transitions. [2022-01-10 02:37:11,562 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:37:11,562 INFO L276 IsEmpty]: Start isEmpty. Operand 2402 states and 3062 transitions. [2022-01-10 02:37:11,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-01-10 02:37:11,564 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:37:11,565 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:11,565 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-10 02:37:11,565 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:37:11,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:37:11,565 INFO L85 PathProgramCache]: Analyzing trace with hash -971775259, now seen corresponding path program 1 times [2022-01-10 02:37:11,565 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:37:11,565 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878657683] [2022-01-10 02:37:11,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:37:11,566 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:37:11,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:37:11,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:37:11,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:37:11,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-01-10 02:37:11,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:37:11,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-01-10 02:37:11,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:37:11,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-01-10 02:37:11,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:37:11,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-01-10 02:37:11,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:37:11,668 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:37:11,668 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:37:11,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878657683] [2022-01-10 02:37:11,668 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878657683] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:37:11,668 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:37:11,668 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 02:37:11,669 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669003971] [2022-01-10 02:37:11,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:37:11,669 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 02:37:11,669 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:37:11,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 02:37:11,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 02:37:11,670 INFO L87 Difference]: Start difference. First operand 2402 states and 3062 transitions. Second operand has 5 states, 5 states have (on average 27.0) internal successors, (135), 3 states have internal predecessors, (135), 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:37:12,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:37:12,848 INFO L93 Difference]: Finished difference Result 2800 states and 3700 transitions. [2022-01-10 02:37:12,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-10 02:37:12,849 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 27.0) internal successors, (135), 3 states have internal predecessors, (135), 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 145 [2022-01-10 02:37:12,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:37:12,859 INFO L225 Difference]: With dead ends: 2800 [2022-01-10 02:37:12,859 INFO L226 Difference]: Without dead ends: 2511 [2022-01-10 02:37:12,860 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-01-10 02:37:12,861 INFO L933 BasicCegarLoop]: 661 mSDtfsCounter, 908 mSDsluCounter, 505 mSDsCounter, 0 mSdLazyCounter, 661 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 929 SdHoareTripleChecker+Valid, 1166 SdHoareTripleChecker+Invalid, 751 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 661 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-01-10 02:37:12,861 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [929 Valid, 1166 Invalid, 751 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 661 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-01-10 02:37:12,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2511 states. [2022-01-10 02:37:13,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2511 to 2402. [2022-01-10 02:37:13,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2402 states, 1906 states have (on average 1.275445960125918) internal successors, (2431), 1934 states have internal predecessors, (2431), 264 states have call successors, (264), 168 states have call predecessors, (264), 230 states have return successors, (366), 301 states have call predecessors, (366), 262 states have call successors, (366) [2022-01-10 02:37:13,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2402 states to 2402 states and 3061 transitions. [2022-01-10 02:37:13,023 INFO L78 Accepts]: Start accepts. Automaton has 2402 states and 3061 transitions. Word has length 145 [2022-01-10 02:37:13,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:37:13,024 INFO L470 AbstractCegarLoop]: Abstraction has 2402 states and 3061 transitions. [2022-01-10 02:37:13,024 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.0) internal successors, (135), 3 states have internal predecessors, (135), 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:37:13,024 INFO L276 IsEmpty]: Start isEmpty. Operand 2402 states and 3061 transitions. [2022-01-10 02:37:13,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-01-10 02:37:13,026 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:37:13,026 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:13,027 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-10 02:37:13,027 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:37:13,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:37:13,027 INFO L85 PathProgramCache]: Analyzing trace with hash -1646935385, now seen corresponding path program 1 times [2022-01-10 02:37:13,027 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:37:13,027 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505569341] [2022-01-10 02:37:13,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:37:13,027 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:37:13,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:37:13,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:37:13,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:37:13,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-01-10 02:37:13,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:37:13,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-01-10 02:37:13,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:37:13,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-01-10 02:37:13,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:37:13,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-01-10 02:37:13,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:37:13,137 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:37:13,137 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:37:13,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505569341] [2022-01-10 02:37:13,137 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505569341] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:37:13,137 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:37:13,137 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-10 02:37:13,138 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528794799] [2022-01-10 02:37:13,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:37:13,138 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 02:37:13,138 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:37:13,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 02:37:13,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-10 02:37:13,139 INFO L87 Difference]: Start difference. First operand 2402 states and 3061 transitions. Second operand has 6 states, 6 states have (on average 22.5) internal successors, (135), 4 states have internal predecessors, (135), 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:37:15,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:37:15,149 INFO L93 Difference]: Finished difference Result 3202 states and 4348 transitions. [2022-01-10 02:37:15,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-10 02:37:15,149 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.5) internal successors, (135), 4 states have internal predecessors, (135), 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 145 [2022-01-10 02:37:15,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:37:15,159 INFO L225 Difference]: With dead ends: 3202 [2022-01-10 02:37:15,159 INFO L226 Difference]: Without dead ends: 2917 [2022-01-10 02:37:15,161 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-01-10 02:37:15,162 INFO L933 BasicCegarLoop]: 689 mSDtfsCounter, 1446 mSDsluCounter, 935 mSDsCounter, 0 mSdLazyCounter, 1700 mSolverCounterSat, 144 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1474 SdHoareTripleChecker+Valid, 1624 SdHoareTripleChecker+Invalid, 1844 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 144 IncrementalHoareTripleChecker+Valid, 1700 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-01-10 02:37:15,162 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1474 Valid, 1624 Invalid, 1844 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [144 Valid, 1700 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-01-10 02:37:15,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2917 states. [2022-01-10 02:37:15,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2917 to 2700. [2022-01-10 02:37:15,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2700 states, 2179 states have (on average 1.3143643873336393) internal successors, (2864), 2208 states have internal predecessors, (2864), 282 states have call successors, (282), 174 states have call predecessors, (282), 237 states have return successors, (387), 319 states have call predecessors, (387), 280 states have call successors, (387) [2022-01-10 02:37:15,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2700 states to 2700 states and 3533 transitions. [2022-01-10 02:37:15,322 INFO L78 Accepts]: Start accepts. Automaton has 2700 states and 3533 transitions. Word has length 145 [2022-01-10 02:37:15,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:37:15,322 INFO L470 AbstractCegarLoop]: Abstraction has 2700 states and 3533 transitions. [2022-01-10 02:37:15,322 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.5) internal successors, (135), 4 states have internal predecessors, (135), 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:37:15,322 INFO L276 IsEmpty]: Start isEmpty. Operand 2700 states and 3533 transitions. [2022-01-10 02:37:15,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-01-10 02:37:15,324 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:37:15,324 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:15,324 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-10 02:37:15,324 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:37:15,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:37:15,325 INFO L85 PathProgramCache]: Analyzing trace with hash 96068139, now seen corresponding path program 1 times [2022-01-10 02:37:15,325 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:37:15,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831887907] [2022-01-10 02:37:15,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:37:15,325 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:37:15,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:37:15,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:37:15,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:37:15,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-01-10 02:37:15,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:37:15,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-01-10 02:37:15,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:37:15,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-01-10 02:37:15,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:37:15,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-01-10 02:37:15,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:37:15,456 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:37:15,456 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:37:15,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831887907] [2022-01-10 02:37:15,457 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831887907] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:37:15,457 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:37:15,457 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 02:37:15,457 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142062738] [2022-01-10 02:37:15,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:37:15,458 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 02:37:15,458 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:37:15,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 02:37:15,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-10 02:37:15,458 INFO L87 Difference]: Start difference. First operand 2700 states and 3533 transitions. Second operand has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 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:37:17,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:37:17,984 INFO L93 Difference]: Finished difference Result 3920 states and 5495 transitions. [2022-01-10 02:37:17,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-10 02:37:17,985 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 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 145 [2022-01-10 02:37:17,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:37:17,996 INFO L225 Difference]: With dead ends: 3920 [2022-01-10 02:37:17,996 INFO L226 Difference]: Without dead ends: 3337 [2022-01-10 02:37:17,999 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-01-10 02:37:17,999 INFO L933 BasicCegarLoop]: 924 mSDtfsCounter, 1463 mSDsluCounter, 1728 mSDsCounter, 0 mSdLazyCounter, 2659 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1491 SdHoareTripleChecker+Valid, 2652 SdHoareTripleChecker+Invalid, 2768 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 2659 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-01-10 02:37:17,999 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1491 Valid, 2652 Invalid, 2768 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 2659 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-01-10 02:37:18,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3337 states. [2022-01-10 02:37:18,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3337 to 2977. [2022-01-10 02:37:18,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2977 states, 2431 states have (on average 1.3389551624845744) internal successors, (3255), 2461 states have internal predecessors, (3255), 300 states have call successors, (300), 180 states have call predecessors, (300), 244 states have return successors, (407), 338 states have call predecessors, (407), 298 states have call successors, (407) [2022-01-10 02:37:18,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2977 states to 2977 states and 3962 transitions. [2022-01-10 02:37:18,174 INFO L78 Accepts]: Start accepts. Automaton has 2977 states and 3962 transitions. Word has length 145 [2022-01-10 02:37:18,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:37:18,174 INFO L470 AbstractCegarLoop]: Abstraction has 2977 states and 3962 transitions. [2022-01-10 02:37:18,174 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 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:37:18,174 INFO L276 IsEmpty]: Start isEmpty. Operand 2977 states and 3962 transitions. [2022-01-10 02:37:18,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-01-10 02:37:18,176 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:37:18,176 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:18,177 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-10 02:37:18,177 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:37:18,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:37:18,177 INFO L85 PathProgramCache]: Analyzing trace with hash 1043106025, now seen corresponding path program 1 times [2022-01-10 02:37:18,177 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:37:18,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16232737] [2022-01-10 02:37:18,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:37:18,178 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:37:18,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:37:18,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:37:18,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:37:18,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-01-10 02:37:18,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:37:18,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-01-10 02:37:18,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:37:18,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-01-10 02:37:18,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:37:18,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-01-10 02:37:18,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:37:18,288 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:37:18,288 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:37:18,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16232737] [2022-01-10 02:37:18,288 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16232737] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:37:18,288 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:37:18,288 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 02:37:18,289 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582964140] [2022-01-10 02:37:18,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:37:18,289 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 02:37:18,289 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:37:18,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 02:37:18,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-10 02:37:18,290 INFO L87 Difference]: Start difference. First operand 2977 states and 3962 transitions. Second operand has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 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:37:20,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:37:20,763 INFO L93 Difference]: Finished difference Result 4978 states and 7172 transitions. [2022-01-10 02:37:20,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-10 02:37:20,764 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 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 145 [2022-01-10 02:37:20,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:37:20,777 INFO L225 Difference]: With dead ends: 4978 [2022-01-10 02:37:20,777 INFO L226 Difference]: Without dead ends: 4118 [2022-01-10 02:37:20,780 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-01-10 02:37:20,781 INFO L933 BasicCegarLoop]: 916 mSDtfsCounter, 1460 mSDsluCounter, 1728 mSDsCounter, 0 mSdLazyCounter, 2661 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1488 SdHoareTripleChecker+Valid, 2644 SdHoareTripleChecker+Invalid, 2773 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 2661 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-01-10 02:37:20,781 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1488 Valid, 2644 Invalid, 2773 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 2661 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-01-10 02:37:20,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4118 states. [2022-01-10 02:37:20,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4118 to 3532. [2022-01-10 02:37:20,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3532 states, 2936 states have (on average 1.375340599455041) internal successors, (4038), 2968 states have internal predecessors, (4038), 336 states have call successors, (336), 192 states have call predecessors, (336), 258 states have return successors, (451), 376 states have call predecessors, (451), 334 states have call successors, (451) [2022-01-10 02:37:20,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3532 states to 3532 states and 4825 transitions. [2022-01-10 02:37:20,997 INFO L78 Accepts]: Start accepts. Automaton has 3532 states and 4825 transitions. Word has length 145 [2022-01-10 02:37:20,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:37:20,997 INFO L470 AbstractCegarLoop]: Abstraction has 3532 states and 4825 transitions. [2022-01-10 02:37:20,997 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 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:37:20,997 INFO L276 IsEmpty]: Start isEmpty. Operand 3532 states and 4825 transitions. [2022-01-10 02:37:20,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-01-10 02:37:20,999 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:37:21,000 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:21,000 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-10 02:37:21,000 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:37:21,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:37:21,000 INFO L85 PathProgramCache]: Analyzing trace with hash 1904939627, now seen corresponding path program 1 times [2022-01-10 02:37:21,000 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:37:21,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719680298] [2022-01-10 02:37:21,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:37:21,001 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:37:21,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:37:21,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:37:21,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:37:21,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-01-10 02:37:21,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:37:21,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-01-10 02:37:21,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:37:21,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-01-10 02:37:21,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:37:21,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-01-10 02:37:21,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:37:21,121 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:37:21,121 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:37:21,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719680298] [2022-01-10 02:37:21,123 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719680298] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:37:21,123 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:37:21,123 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 02:37:21,123 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611235496] [2022-01-10 02:37:21,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:37:21,124 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 02:37:21,124 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:37:21,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 02:37:21,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-10 02:37:21,124 INFO L87 Difference]: Start difference. First operand 3532 states and 4825 transitions. Second operand has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 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:37:23,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:37:23,863 INFO L93 Difference]: Finished difference Result 7013 states and 10379 transitions. [2022-01-10 02:37:23,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-10 02:37:23,864 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 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 145 [2022-01-10 02:37:23,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:37:23,890 INFO L225 Difference]: With dead ends: 7013 [2022-01-10 02:37:23,890 INFO L226 Difference]: Without dead ends: 5598 [2022-01-10 02:37:23,898 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-01-10 02:37:23,898 INFO L933 BasicCegarLoop]: 912 mSDtfsCounter, 1456 mSDsluCounter, 1728 mSDsCounter, 0 mSdLazyCounter, 2656 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1484 SdHoareTripleChecker+Valid, 2640 SdHoareTripleChecker+Invalid, 2768 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 2656 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-01-10 02:37:23,899 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1484 Valid, 2640 Invalid, 2768 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 2656 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-01-10 02:37:23,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5598 states. [2022-01-10 02:37:24,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5598 to 4643. [2022-01-10 02:37:24,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4643 states, 3947 states have (on average 1.4198125158348112) internal successors, (5604), 3983 states have internal predecessors, (5604), 408 states have call successors, (408), 216 states have call predecessors, (408), 286 states have return successors, (545), 452 states have call predecessors, (545), 406 states have call successors, (545) [2022-01-10 02:37:24,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4643 states to 4643 states and 6557 transitions. [2022-01-10 02:37:24,210 INFO L78 Accepts]: Start accepts. Automaton has 4643 states and 6557 transitions. Word has length 145 [2022-01-10 02:37:24,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:37:24,210 INFO L470 AbstractCegarLoop]: Abstraction has 4643 states and 6557 transitions. [2022-01-10 02:37:24,211 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 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:37:24,211 INFO L276 IsEmpty]: Start isEmpty. Operand 4643 states and 6557 transitions. [2022-01-10 02:37:24,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-01-10 02:37:24,215 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:37:24,215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:24,216 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-01-10 02:37:24,216 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:37:24,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:37:24,216 INFO L85 PathProgramCache]: Analyzing trace with hash -145469271, now seen corresponding path program 1 times [2022-01-10 02:37:24,216 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:37:24,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515092717] [2022-01-10 02:37:24,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:37:24,217 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:37:24,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:37:24,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:37:24,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:37:24,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-01-10 02:37:24,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:37:24,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-01-10 02:37:24,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:37:24,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-01-10 02:37:24,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:37:24,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-01-10 02:37:24,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:37:24,369 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:37:24,369 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:37:24,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515092717] [2022-01-10 02:37:24,369 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515092717] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:37:24,369 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:37:24,369 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 02:37:24,370 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246580263] [2022-01-10 02:37:24,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:37:24,370 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 02:37:24,370 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:37:24,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 02:37:24,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-10 02:37:24,371 INFO L87 Difference]: Start difference. First operand 4643 states and 6557 transitions. Second operand has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 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:37:26,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:37:26,977 INFO L93 Difference]: Finished difference Result 11082 states and 16809 transitions. [2022-01-10 02:37:26,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-10 02:37:26,978 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 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 145 [2022-01-10 02:37:26,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:37:27,005 INFO L225 Difference]: With dead ends: 11082 [2022-01-10 02:37:27,005 INFO L226 Difference]: Without dead ends: 8556 [2022-01-10 02:37:27,018 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-01-10 02:37:27,019 INFO L933 BasicCegarLoop]: 908 mSDtfsCounter, 1452 mSDsluCounter, 1728 mSDsCounter, 0 mSdLazyCounter, 2651 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1480 SdHoareTripleChecker+Valid, 2636 SdHoareTripleChecker+Invalid, 2763 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 2651 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-01-10 02:37:27,019 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1480 Valid, 2636 Invalid, 2763 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 2651 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-01-10 02:37:27,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8556 states. [2022-01-10 02:37:27,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8556 to 6870. [2022-01-10 02:37:27,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6870 states, 5974 states have (on average 1.4633411449615) internal successors, (8742), 6018 states have internal predecessors, (8742), 552 states have call successors, (552), 264 states have call predecessors, (552), 342 states have return successors, (751), 604 states have call predecessors, (751), 550 states have call successors, (751) [2022-01-10 02:37:27,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6870 states to 6870 states and 10045 transitions. [2022-01-10 02:37:27,534 INFO L78 Accepts]: Start accepts. Automaton has 6870 states and 10045 transitions. Word has length 145 [2022-01-10 02:37:27,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:37:27,535 INFO L470 AbstractCegarLoop]: Abstraction has 6870 states and 10045 transitions. [2022-01-10 02:37:27,535 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 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:37:27,535 INFO L276 IsEmpty]: Start isEmpty. Operand 6870 states and 10045 transitions. [2022-01-10 02:37:27,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-01-10 02:37:27,539 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:37:27,539 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:27,540 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-01-10 02:37:27,540 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:37:27,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:37:27,540 INFO L85 PathProgramCache]: Analyzing trace with hash 342577835, now seen corresponding path program 1 times [2022-01-10 02:37:27,540 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:37:27,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205774588] [2022-01-10 02:37:27,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:37:27,541 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:37:27,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:37:27,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:37:27,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:37:27,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-01-10 02:37:27,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:37:27,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-01-10 02:37:27,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:37:27,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-01-10 02:37:27,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:37:27,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-01-10 02:37:27,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:37:27,674 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:37:27,675 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:37:27,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205774588] [2022-01-10 02:37:27,675 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205774588] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:37:27,675 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:37:27,675 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 02:37:27,675 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277327950] [2022-01-10 02:37:27,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:37:27,676 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 02:37:27,676 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:37:27,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 02:37:27,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-01-10 02:37:27,677 INFO L87 Difference]: Start difference. First operand 6870 states and 10045 transitions. Second operand has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 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:37:29,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:37:29,230 INFO L93 Difference]: Finished difference Result 13387 states and 20520 transitions. [2022-01-10 02:37:29,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-10 02:37:29,231 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 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 145 [2022-01-10 02:37:29,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:37:29,257 INFO L225 Difference]: With dead ends: 13387 [2022-01-10 02:37:29,257 INFO L226 Difference]: Without dead ends: 8634 [2022-01-10 02:37:29,272 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2022-01-10 02:37:29,272 INFO L933 BasicCegarLoop]: 626 mSDtfsCounter, 1298 mSDsluCounter, 764 mSDsCounter, 0 mSdLazyCounter, 1153 mSolverCounterSat, 157 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1327 SdHoareTripleChecker+Valid, 1390 SdHoareTripleChecker+Invalid, 1310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 157 IncrementalHoareTripleChecker+Valid, 1153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-01-10 02:37:29,273 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1327 Valid, 1390 Invalid, 1310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [157 Valid, 1153 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-01-10 02:37:29,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8634 states. [2022-01-10 02:37:29,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8634 to 6870. [2022-01-10 02:37:29,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6870 states, 5974 states have (on average 1.4604954804151322) internal successors, (8725), 6018 states have internal predecessors, (8725), 552 states have call successors, (552), 264 states have call predecessors, (552), 342 states have return successors, (751), 604 states have call predecessors, (751), 550 states have call successors, (751) [2022-01-10 02:37:29,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6870 states to 6870 states and 10028 transitions. [2022-01-10 02:37:29,717 INFO L78 Accepts]: Start accepts. Automaton has 6870 states and 10028 transitions. Word has length 145 [2022-01-10 02:37:29,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:37:29,717 INFO L470 AbstractCegarLoop]: Abstraction has 6870 states and 10028 transitions. [2022-01-10 02:37:29,718 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 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:37:29,718 INFO L276 IsEmpty]: Start isEmpty. Operand 6870 states and 10028 transitions. [2022-01-10 02:37:29,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-01-10 02:37:29,722 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:37:29,722 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:29,723 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-01-10 02:37:29,723 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:37:29,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:37:29,723 INFO L85 PathProgramCache]: Analyzing trace with hash -750057367, now seen corresponding path program 1 times [2022-01-10 02:37:29,723 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:37:29,723 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032552601] [2022-01-10 02:37:29,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:37:29,724 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:37:29,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:37:29,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:37:29,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:37:29,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-01-10 02:37:29,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:37:29,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-01-10 02:37:29,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:37:29,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-01-10 02:37:29,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:37:29,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-01-10 02:37:29,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:37:29,845 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:37:29,845 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:37:29,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032552601] [2022-01-10 02:37:29,845 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032552601] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:37:29,845 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:37:29,845 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 02:37:29,845 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298347586] [2022-01-10 02:37:29,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:37:29,847 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 02:37:29,847 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:37:29,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 02:37:29,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-01-10 02:37:29,848 INFO L87 Difference]: Start difference. First operand 6870 states and 10028 transitions. Second operand has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 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:37:31,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:37:31,642 INFO L93 Difference]: Finished difference Result 13369 states and 20434 transitions. [2022-01-10 02:37:31,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-10 02:37:31,643 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 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 145 [2022-01-10 02:37:31,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:37:31,669 INFO L225 Difference]: With dead ends: 13369 [2022-01-10 02:37:31,669 INFO L226 Difference]: Without dead ends: 8616 [2022-01-10 02:37:31,683 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2022-01-10 02:37:31,684 INFO L933 BasicCegarLoop]: 592 mSDtfsCounter, 1167 mSDsluCounter, 979 mSDsCounter, 0 mSdLazyCounter, 1224 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1196 SdHoareTripleChecker+Valid, 1571 SdHoareTripleChecker+Invalid, 1344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 1224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-01-10 02:37:31,684 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1196 Valid, 1571 Invalid, 1344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 1224 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-01-10 02:37:31,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8616 states. [2022-01-10 02:37:32,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8616 to 6870. [2022-01-10 02:37:32,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6870 states, 5974 states have (on average 1.4576498158687647) internal successors, (8708), 6018 states have internal predecessors, (8708), 552 states have call successors, (552), 264 states have call predecessors, (552), 342 states have return successors, (751), 604 states have call predecessors, (751), 550 states have call successors, (751) [2022-01-10 02:37:32,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6870 states to 6870 states and 10011 transitions. [2022-01-10 02:37:32,259 INFO L78 Accepts]: Start accepts. Automaton has 6870 states and 10011 transitions. Word has length 145 [2022-01-10 02:37:32,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:37:32,259 INFO L470 AbstractCegarLoop]: Abstraction has 6870 states and 10011 transitions. [2022-01-10 02:37:32,259 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 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:37:32,259 INFO L276 IsEmpty]: Start isEmpty. Operand 6870 states and 10011 transitions. [2022-01-10 02:37:32,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-01-10 02:37:32,264 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:37:32,265 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:32,265 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-01-10 02:37:32,265 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:37:32,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:37:32,265 INFO L85 PathProgramCache]: Analyzing trace with hash -2032229653, now seen corresponding path program 1 times [2022-01-10 02:37:32,265 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:37:32,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71642884] [2022-01-10 02:37:32,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:37:32,266 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:37:32,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:37:32,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:37:32,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:37:32,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-01-10 02:37:32,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:37:32,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-01-10 02:37:32,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:37:32,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-01-10 02:37:32,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:37:32,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-01-10 02:37:32,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:37:32,379 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:37:32,379 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:37:32,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71642884] [2022-01-10 02:37:32,379 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71642884] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:37:32,379 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:37:32,379 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 02:37:32,380 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616158234] [2022-01-10 02:37:32,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:37:32,380 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 02:37:32,380 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:37:32,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 02:37:32,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-10 02:37:32,381 INFO L87 Difference]: Start difference. First operand 6870 states and 10011 transitions. Second operand has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 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:37:35,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:37:35,406 INFO L93 Difference]: Finished difference Result 19164 states and 29455 transitions. [2022-01-10 02:37:35,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-10 02:37:35,407 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 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 145 [2022-01-10 02:37:35,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:37:35,453 INFO L225 Difference]: With dead ends: 19164 [2022-01-10 02:37:35,453 INFO L226 Difference]: Without dead ends: 14411 [2022-01-10 02:37:35,470 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-01-10 02:37:35,471 INFO L933 BasicCegarLoop]: 886 mSDtfsCounter, 1434 mSDsluCounter, 1728 mSDsCounter, 0 mSdLazyCounter, 2592 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1462 SdHoareTripleChecker+Valid, 2614 SdHoareTripleChecker+Invalid, 2708 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 2592 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-01-10 02:37:35,471 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1462 Valid, 2614 Invalid, 2708 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 2592 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-01-10 02:37:35,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14411 states. [2022-01-10 02:37:36,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14411 to 11386. [2022-01-10 02:37:36,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11386 states, 10090 states have (on average 1.490386521308226) internal successors, (15038), 10150 states have internal predecessors, (15038), 840 states have call successors, (840), 360 states have call predecessors, (840), 454 states have return successors, (1217), 908 states have call predecessors, (1217), 838 states have call successors, (1217) [2022-01-10 02:37:36,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11386 states to 11386 states and 17095 transitions. [2022-01-10 02:37:36,248 INFO L78 Accepts]: Start accepts. Automaton has 11386 states and 17095 transitions. Word has length 145 [2022-01-10 02:37:36,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:37:36,248 INFO L470 AbstractCegarLoop]: Abstraction has 11386 states and 17095 transitions. [2022-01-10 02:37:36,248 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 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:37:36,248 INFO L276 IsEmpty]: Start isEmpty. Operand 11386 states and 17095 transitions. [2022-01-10 02:37:36,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-01-10 02:37:36,255 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:37:36,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:36,255 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-01-10 02:37:36,255 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:37:36,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:37:36,256 INFO L85 PathProgramCache]: Analyzing trace with hash 540734957, now seen corresponding path program 1 times [2022-01-10 02:37:36,256 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:37:36,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246050938] [2022-01-10 02:37:36,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:37:36,256 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:37:36,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:37:36,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:37:36,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:37:36,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-01-10 02:37:36,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:37:36,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-01-10 02:37:36,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:37:36,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-01-10 02:37:36,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:37:36,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-01-10 02:37:36,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:37:36,365 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:37:36,365 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:37:36,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246050938] [2022-01-10 02:37:36,365 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246050938] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:37:36,365 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:37:36,365 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 02:37:36,365 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019922335] [2022-01-10 02:37:36,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:37:36,366 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 02:37:36,367 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:37:36,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 02:37:36,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-01-10 02:37:36,368 INFO L87 Difference]: Start difference. First operand 11386 states and 17095 transitions. Second operand has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 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:37:38,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:37:38,435 INFO L93 Difference]: Finished difference Result 23819 states and 37022 transitions. [2022-01-10 02:37:38,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-10 02:37:38,435 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 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 145 [2022-01-10 02:37:38,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:37:38,478 INFO L225 Difference]: With dead ends: 23819 [2022-01-10 02:37:38,478 INFO L226 Difference]: Without dead ends: 14550 [2022-01-10 02:37:38,497 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2022-01-10 02:37:38,497 INFO L933 BasicCegarLoop]: 611 mSDtfsCounter, 1296 mSDsluCounter, 764 mSDsCounter, 0 mSdLazyCounter, 1121 mSolverCounterSat, 160 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1325 SdHoareTripleChecker+Valid, 1375 SdHoareTripleChecker+Invalid, 1281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 160 IncrementalHoareTripleChecker+Valid, 1121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-01-10 02:37:38,498 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1325 Valid, 1375 Invalid, 1281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [160 Valid, 1121 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-01-10 02:37:38,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14550 states. [2022-01-10 02:37:39,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14550 to 11386. [2022-01-10 02:37:39,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11386 states, 10090 states have (on average 1.4871159563924679) internal successors, (15005), 10150 states have internal predecessors, (15005), 840 states have call successors, (840), 360 states have call predecessors, (840), 454 states have return successors, (1217), 908 states have call predecessors, (1217), 838 states have call successors, (1217) [2022-01-10 02:37:39,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11386 states to 11386 states and 17062 transitions. [2022-01-10 02:37:39,320 INFO L78 Accepts]: Start accepts. Automaton has 11386 states and 17062 transitions. Word has length 145 [2022-01-10 02:37:39,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:37:39,320 INFO L470 AbstractCegarLoop]: Abstraction has 11386 states and 17062 transitions. [2022-01-10 02:37:39,320 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 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:37:39,320 INFO L276 IsEmpty]: Start isEmpty. Operand 11386 states and 17062 transitions. [2022-01-10 02:37:39,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-01-10 02:37:39,327 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:37:39,327 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:39,328 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-01-10 02:37:39,328 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:37:39,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:37:39,328 INFO L85 PathProgramCache]: Analyzing trace with hash 208091819, now seen corresponding path program 1 times [2022-01-10 02:37:39,328 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:37:39,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493316232] [2022-01-10 02:37:39,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:37:39,329 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:37:39,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:37:39,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:37:39,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:37:39,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-01-10 02:37:39,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:37:39,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-01-10 02:37:39,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:37:39,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-01-10 02:37:39,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:37:39,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-01-10 02:37:39,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:37:39,447 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:37:39,447 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:37:39,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493316232] [2022-01-10 02:37:39,447 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493316232] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:37:39,447 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:37:39,447 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 02:37:39,448 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086153380] [2022-01-10 02:37:39,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:37:39,448 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 02:37:39,448 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:37:39,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 02:37:39,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-10 02:37:39,449 INFO L87 Difference]: Start difference. First operand 11386 states and 17062 transitions. Second operand has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 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:37:44,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:37:44,392 INFO L93 Difference]: Finished difference Result 39724 states and 61659 transitions. [2022-01-10 02:37:44,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-10 02:37:44,396 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 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 145 [2022-01-10 02:37:44,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:37:44,489 INFO L225 Difference]: With dead ends: 39724 [2022-01-10 02:37:44,490 INFO L226 Difference]: Without dead ends: 30455 [2022-01-10 02:37:44,518 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2022-01-10 02:37:44,519 INFO L933 BasicCegarLoop]: 1025 mSDtfsCounter, 1519 mSDsluCounter, 1720 mSDsCounter, 0 mSdLazyCounter, 2999 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1546 SdHoareTripleChecker+Valid, 2745 SdHoareTripleChecker+Invalid, 3117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 2999 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-01-10 02:37:44,520 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1546 Valid, 2745 Invalid, 3117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 2999 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-01-10 02:37:44,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30455 states. [2022-01-10 02:37:46,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30455 to 20380. [2022-01-10 02:37:46,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20380 states, 18316 states have (on average 1.5088993229962875) internal successors, (27637), 18408 states have internal predecessors, (27637), 1384 states have call successors, (1384), 552 states have call predecessors, (1384), 678 states have return successors, (2279), 1484 states have call predecessors, (2279), 1382 states have call successors, (2279) [2022-01-10 02:37:46,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20380 states to 20380 states and 31300 transitions. [2022-01-10 02:37:46,158 INFO L78 Accepts]: Start accepts. Automaton has 20380 states and 31300 transitions. Word has length 145 [2022-01-10 02:37:46,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:37:46,159 INFO L470 AbstractCegarLoop]: Abstraction has 20380 states and 31300 transitions. [2022-01-10 02:37:46,159 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 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:37:46,159 INFO L276 IsEmpty]: Start isEmpty. Operand 20380 states and 31300 transitions. [2022-01-10 02:37:46,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-01-10 02:37:46,170 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:37:46,170 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:46,170 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-01-10 02:37:46,170 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:37:46,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:37:46,171 INFO L85 PathProgramCache]: Analyzing trace with hash 2137024045, now seen corresponding path program 1 times [2022-01-10 02:37:46,171 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 02:37:46,171 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956414487] [2022-01-10 02:37:46,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:37:46,171 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 02:37:46,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:37:46,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-10 02:37:46,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:37:46,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-01-10 02:37:46,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:37:46,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-01-10 02:37:46,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:37:46,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-01-10 02:37:46,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:37:46,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-01-10 02:37:46,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:37:46,278 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:37:46,278 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 02:37:46,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956414487] [2022-01-10 02:37:46,278 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956414487] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:37:46,278 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:37:46,278 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 02:37:46,279 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652314260] [2022-01-10 02:37:46,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:37:46,279 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 02:37:46,279 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 02:37:46,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 02:37:46,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-10 02:37:46,280 INFO L87 Difference]: Start difference. First operand 20380 states and 31300 transitions. Second operand has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 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)