./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-linux-3.0/module_get_put-drivers-block-loop.ko.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f4b24e32 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-linux-3.0/module_get_put-drivers-block-loop.ko.cil.out.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash f25e8d9a29012500b38126aa22b2b7d181aad99a845cece264158253e2ec92e3 --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-13 22:59:00,807 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 22:59:00,808 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 22:59:00,868 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 22:59:00,868 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 22:59:00,869 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 22:59:00,871 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 22:59:00,872 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 22:59:00,874 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 22:59:00,876 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 22:59:00,877 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 22:59:00,879 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 22:59:00,879 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 22:59:00,880 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 22:59:00,881 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 22:59:00,883 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 22:59:00,884 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 22:59:00,885 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 22:59:00,886 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 22:59:00,890 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 22:59:00,891 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 22:59:00,892 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 22:59:00,892 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 22:59:00,893 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 22:59:00,894 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 22:59:00,899 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 22:59:00,899 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 22:59:00,900 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 22:59:00,901 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 22:59:00,901 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 22:59:00,902 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 22:59:00,902 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 22:59:00,903 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 22:59:00,903 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 22:59:00,904 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 22:59:00,904 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 22:59:00,905 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 22:59:00,905 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 22:59:00,905 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 22:59:00,905 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 22:59:00,906 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 22:59:00,907 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 22:59:00,908 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-13 22:59:00,930 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 22:59:00,930 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 22:59:00,931 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 22:59:00,931 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 22:59:00,931 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 22:59:00,931 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 22:59:00,932 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 22:59:00,932 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 22:59:00,932 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 22:59:00,933 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 22:59:00,933 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 22:59:00,933 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 22:59:00,933 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 22:59:00,933 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 22:59:00,934 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 22:59:00,934 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 22:59:00,934 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 22:59:00,934 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 22:59:00,934 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 22:59:00,935 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 22:59:00,935 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 22:59:00,935 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 22:59:00,935 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 22:59:00,936 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 22:59:00,936 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 22:59:00,936 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 22:59:00,936 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-13 22:59:00,936 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 22:59:00,936 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 22:59:00,937 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 22:59:00,937 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.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f25e8d9a29012500b38126aa22b2b7d181aad99a845cece264158253e2ec92e3 [2022-07-13 22:59:01,095 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 22:59:01,109 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 22:59:01,110 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 22:59:01,111 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 22:59:01,112 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 22:59:01,113 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-3.0/module_get_put-drivers-block-loop.ko.cil.out.i [2022-07-13 22:59:01,179 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5878bbe21/789a044d95da4eda8a3b602856537bae/FLAG255724859 [2022-07-13 22:59:01,739 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 22:59:01,739 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.0/module_get_put-drivers-block-loop.ko.cil.out.i [2022-07-13 22:59:01,764 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5878bbe21/789a044d95da4eda8a3b602856537bae/FLAG255724859 [2022-07-13 22:59:02,190 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5878bbe21/789a044d95da4eda8a3b602856537bae [2022-07-13 22:59:02,192 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 22:59:02,192 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 22:59:02,194 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 22:59:02,194 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 22:59:02,196 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 22:59:02,196 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 10:59:02" (1/1) ... [2022-07-13 22:59:02,197 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ca8e0d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:59:02, skipping insertion in model container [2022-07-13 22:59:02,197 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 10:59:02" (1/1) ... [2022-07-13 22:59:02,201 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 22:59:02,265 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 22:59:03,094 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.0/module_get_put-drivers-block-loop.ko.cil.out.i[192897,192910] [2022-07-13 22:59:03,110 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 22:59:03,131 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 22:59:03,369 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.0/module_get_put-drivers-block-loop.ko.cil.out.i[192897,192910] [2022-07-13 22:59:03,379 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 22:59:03,427 INFO L208 MainTranslator]: Completed translation [2022-07-13 22:59:03,428 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:59:03 WrapperNode [2022-07-13 22:59:03,428 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 22:59:03,429 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 22:59:03,429 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 22:59:03,429 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 22:59:03,434 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:59:03" (1/1) ... [2022-07-13 22:59:03,485 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:59:03" (1/1) ... [2022-07-13 22:59:03,597 INFO L137 Inliner]: procedures = 236, calls = 1201, calls flagged for inlining = 124, calls inlined = 121, statements flattened = 3745 [2022-07-13 22:59:03,598 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 22:59:03,599 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 22:59:03,599 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 22:59:03,599 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 22:59:03,605 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:59:03" (1/1) ... [2022-07-13 22:59:03,605 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:59:03" (1/1) ... [2022-07-13 22:59:03,623 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:59:03" (1/1) ... [2022-07-13 22:59:03,624 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:59:03" (1/1) ... [2022-07-13 22:59:03,682 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:59:03" (1/1) ... [2022-07-13 22:59:03,698 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:59:03" (1/1) ... [2022-07-13 22:59:03,719 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:59:03" (1/1) ... [2022-07-13 22:59:03,741 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 22:59:03,742 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 22:59:03,742 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 22:59:03,742 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 22:59:03,743 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:59:03" (1/1) ... [2022-07-13 22:59:03,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 22:59:03,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:59:03,764 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-07-13 22:59:03,772 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-07-13 22:59:03,807 INFO L130 BoogieDeclarations]: Found specification of procedure bio_endio [2022-07-13 22:59:03,808 INFO L138 BoogieDeclarations]: Found implementation of procedure bio_endio [2022-07-13 22:59:03,808 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-07-13 22:59:03,808 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-07-13 22:59:03,808 INFO L130 BoogieDeclarations]: Found specification of procedure vfs_fsync [2022-07-13 22:59:03,808 INFO L138 BoogieDeclarations]: Found implementation of procedure vfs_fsync [2022-07-13 22:59:03,808 INFO L130 BoogieDeclarations]: Found specification of procedure lowmem_page_address [2022-07-13 22:59:03,808 INFO L138 BoogieDeclarations]: Found implementation of procedure lowmem_page_address [2022-07-13 22:59:03,809 INFO L130 BoogieDeclarations]: Found specification of procedure get_current [2022-07-13 22:59:03,809 INFO L138 BoogieDeclarations]: Found implementation of procedure get_current [2022-07-13 22:59:03,809 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-13 22:59:03,809 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-13 22:59:03,809 INFO L130 BoogieDeclarations]: Found specification of procedure add_disk [2022-07-13 22:59:03,809 INFO L138 BoogieDeclarations]: Found implementation of procedure add_disk [2022-07-13 22:59:03,809 INFO L130 BoogieDeclarations]: Found specification of procedure kobject_uevent [2022-07-13 22:59:03,810 INFO L138 BoogieDeclarations]: Found implementation of procedure kobject_uevent [2022-07-13 22:59:03,810 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_module_put [2022-07-13 22:59:03,810 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_module_put [2022-07-13 22:59:03,810 INFO L130 BoogieDeclarations]: Found specification of procedure transfer_xor [2022-07-13 22:59:03,810 INFO L138 BoogieDeclarations]: Found implementation of procedure transfer_xor [2022-07-13 22:59:03,810 INFO L130 BoogieDeclarations]: Found specification of procedure invalidate_bdev [2022-07-13 22:59:03,810 INFO L138 BoogieDeclarations]: Found implementation of procedure invalidate_bdev [2022-07-13 22:59:03,811 INFO L130 BoogieDeclarations]: Found specification of procedure __might_sleep [2022-07-13 22:59:03,811 INFO L138 BoogieDeclarations]: Found implementation of procedure __might_sleep [2022-07-13 22:59:03,811 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_unlock [2022-07-13 22:59:03,811 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_unlock [2022-07-13 22:59:03,811 INFO L130 BoogieDeclarations]: Found specification of procedure huge_encode_dev [2022-07-13 22:59:03,811 INFO L138 BoogieDeclarations]: Found implementation of procedure huge_encode_dev [2022-07-13 22:59:03,811 INFO L130 BoogieDeclarations]: Found specification of procedure lo_do_transfer [2022-07-13 22:59:03,811 INFO L138 BoogieDeclarations]: Found implementation of procedure lo_do_transfer [2022-07-13 22:59:03,812 INFO L130 BoogieDeclarations]: Found specification of procedure loop_sysfs_exit [2022-07-13 22:59:03,812 INFO L138 BoogieDeclarations]: Found implementation of procedure loop_sysfs_exit [2022-07-13 22:59:03,812 INFO L130 BoogieDeclarations]: Found specification of procedure set_capacity [2022-07-13 22:59:03,812 INFO L138 BoogieDeclarations]: Found implementation of procedure set_capacity [2022-07-13 22:59:03,812 INFO L130 BoogieDeclarations]: Found specification of procedure kthread_should_stop [2022-07-13 22:59:03,812 INFO L138 BoogieDeclarations]: Found implementation of procedure kthread_should_stop [2022-07-13 22:59:03,812 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-07-13 22:59:03,813 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-07-13 22:59:03,813 INFO L130 BoogieDeclarations]: Found specification of procedure loop_alloc [2022-07-13 22:59:03,813 INFO L138 BoogieDeclarations]: Found implementation of procedure loop_alloc [2022-07-13 22:59:03,813 INFO L130 BoogieDeclarations]: Found specification of procedure loop_make_request [2022-07-13 22:59:03,813 INFO L138 BoogieDeclarations]: Found implementation of procedure loop_make_request [2022-07-13 22:59:03,813 INFO L130 BoogieDeclarations]: Found specification of procedure __do_lo_send_write [2022-07-13 22:59:03,813 INFO L138 BoogieDeclarations]: Found implementation of procedure __do_lo_send_write [2022-07-13 22:59:03,813 INFO L130 BoogieDeclarations]: Found specification of procedure loop_get_status [2022-07-13 22:59:03,814 INFO L138 BoogieDeclarations]: Found implementation of procedure loop_get_status [2022-07-13 22:59:03,814 INFO L130 BoogieDeclarations]: Found specification of procedure loop_clr_fd [2022-07-13 22:59:03,814 INFO L138 BoogieDeclarations]: Found implementation of procedure loop_clr_fd [2022-07-13 22:59:03,814 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-13 22:59:03,814 INFO L130 BoogieDeclarations]: Found specification of procedure figure_loop_size [2022-07-13 22:59:03,814 INFO L138 BoogieDeclarations]: Found implementation of procedure figure_loop_size [2022-07-13 22:59:03,814 INFO L130 BoogieDeclarations]: Found specification of procedure ioctl_by_bdev [2022-07-13 22:59:03,815 INFO L138 BoogieDeclarations]: Found implementation of procedure ioctl_by_bdev [2022-07-13 22:59:03,815 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-13 22:59:03,815 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_blast_assert [2022-07-13 22:59:03,815 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_blast_assert [2022-07-13 22:59:03,816 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-13 22:59:03,816 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-13 22:59:03,816 INFO L130 BoogieDeclarations]: Found specification of procedure might_fault [2022-07-13 22:59:03,817 INFO L138 BoogieDeclarations]: Found implementation of procedure might_fault [2022-07-13 22:59:03,817 INFO L130 BoogieDeclarations]: Found specification of procedure capable [2022-07-13 22:59:03,817 INFO L138 BoogieDeclarations]: Found implementation of procedure capable [2022-07-13 22:59:03,817 INFO L130 BoogieDeclarations]: Found specification of procedure fput [2022-07-13 22:59:03,817 INFO L138 BoogieDeclarations]: Found implementation of procedure fput [2022-07-13 22:59:03,817 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock_nested [2022-07-13 22:59:03,818 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock_nested [2022-07-13 22:59:03,818 INFO L130 BoogieDeclarations]: Found specification of procedure loop_set_capacity [2022-07-13 22:59:03,818 INFO L138 BoogieDeclarations]: Found implementation of procedure loop_set_capacity [2022-07-13 22:59:03,818 INFO L130 BoogieDeclarations]: Found specification of procedure bio_list_empty [2022-07-13 22:59:03,818 INFO L138 BoogieDeclarations]: Found implementation of procedure bio_list_empty [2022-07-13 22:59:03,818 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-07-13 22:59:03,818 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_from_user [2022-07-13 22:59:03,819 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_from_user [2022-07-13 22:59:03,819 INFO L130 BoogieDeclarations]: Found specification of procedure loop_free [2022-07-13 22:59:03,819 INFO L138 BoogieDeclarations]: Found implementation of procedure loop_free [2022-07-13 22:59:03,819 INFO L130 BoogieDeclarations]: Found specification of procedure transfer_none [2022-07-13 22:59:03,819 INFO L138 BoogieDeclarations]: Found implementation of procedure transfer_none [2022-07-13 22:59:03,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-07-13 22:59:03,819 INFO L130 BoogieDeclarations]: Found specification of procedure bd_set_size [2022-07-13 22:59:03,820 INFO L138 BoogieDeclarations]: Found implementation of procedure bd_set_size [2022-07-13 22:59:03,820 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-13 22:59:03,820 INFO L130 BoogieDeclarations]: Found specification of procedure fget [2022-07-13 22:59:03,820 INFO L138 BoogieDeclarations]: Found implementation of procedure fget [2022-07-13 22:59:03,820 INFO L130 BoogieDeclarations]: Found specification of procedure mapping_set_gfp_mask [2022-07-13 22:59:03,820 INFO L138 BoogieDeclarations]: Found implementation of procedure mapping_set_gfp_mask [2022-07-13 22:59:03,820 INFO L130 BoogieDeclarations]: Found specification of procedure xor_init [2022-07-13 22:59:03,820 INFO L138 BoogieDeclarations]: Found implementation of procedure xor_init [2022-07-13 22:59:03,821 INFO L130 BoogieDeclarations]: Found specification of procedure kmap [2022-07-13 22:59:03,821 INFO L138 BoogieDeclarations]: Found implementation of procedure kmap [2022-07-13 22:59:03,821 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-07-13 22:59:03,821 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-07-13 22:59:03,821 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-07-13 22:59:03,821 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-07-13 22:59:03,822 INFO L130 BoogieDeclarations]: Found specification of procedure unregister_blkdev [2022-07-13 22:59:03,822 INFO L138 BoogieDeclarations]: Found implementation of procedure unregister_blkdev [2022-07-13 22:59:03,822 INFO L130 BoogieDeclarations]: Found specification of procedure list_add_tail [2022-07-13 22:59:03,823 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add_tail [2022-07-13 22:59:03,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-13 22:59:03,823 INFO L130 BoogieDeclarations]: Found specification of procedure copy_to_user [2022-07-13 22:59:03,824 INFO L138 BoogieDeclarations]: Found implementation of procedure copy_to_user [2022-07-13 22:59:03,824 INFO L130 BoogieDeclarations]: Found specification of procedure __kmap_atomic [2022-07-13 22:59:03,824 INFO L138 BoogieDeclarations]: Found implementation of procedure __kmap_atomic [2022-07-13 22:59:03,824 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_irq [2022-07-13 22:59:03,824 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_irq [2022-07-13 22:59:03,824 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-13 22:59:03,825 INFO L130 BoogieDeclarations]: Found specification of procedure copy_from_user [2022-07-13 22:59:03,825 INFO L138 BoogieDeclarations]: Found implementation of procedure copy_from_user [2022-07-13 22:59:03,825 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 22:59:03,825 INFO L130 BoogieDeclarations]: Found specification of procedure get_loop_size [2022-07-13 22:59:03,825 INFO L138 BoogieDeclarations]: Found implementation of procedure get_loop_size [2022-07-13 22:59:03,825 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-13 22:59:03,825 INFO L130 BoogieDeclarations]: Found specification of procedure blk_cleanup_queue [2022-07-13 22:59:03,826 INFO L138 BoogieDeclarations]: Found implementation of procedure blk_cleanup_queue [2022-07-13 22:59:03,826 INFO L130 BoogieDeclarations]: Found specification of procedure loop_set_status [2022-07-13 22:59:03,826 INFO L138 BoogieDeclarations]: Found implementation of procedure loop_set_status [2022-07-13 22:59:03,826 INFO L130 BoogieDeclarations]: Found specification of procedure __bad_percpu_size [2022-07-13 22:59:03,826 INFO L130 BoogieDeclarations]: Found specification of procedure lo_ioctl [2022-07-13 22:59:03,827 INFO L138 BoogieDeclarations]: Found implementation of procedure lo_ioctl [2022-07-13 22:59:03,827 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock_irq [2022-07-13 22:59:03,829 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock_irq [2022-07-13 22:59:03,829 INFO L130 BoogieDeclarations]: Found specification of procedure current_thread_info [2022-07-13 22:59:03,829 INFO L138 BoogieDeclarations]: Found implementation of procedure current_thread_info [2022-07-13 22:59:03,829 INFO L130 BoogieDeclarations]: Found specification of procedure loop_release_xfer [2022-07-13 22:59:03,830 INFO L138 BoogieDeclarations]: Found implementation of procedure loop_release_xfer [2022-07-13 22:59:03,830 INFO L130 BoogieDeclarations]: Found specification of procedure _cond_resched [2022-07-13 22:59:03,831 INFO L138 BoogieDeclarations]: Found implementation of procedure _cond_resched [2022-07-13 22:59:03,831 INFO L130 BoogieDeclarations]: Found specification of procedure kunmap [2022-07-13 22:59:03,831 INFO L138 BoogieDeclarations]: Found implementation of procedure kunmap [2022-07-13 22:59:03,834 INFO L130 BoogieDeclarations]: Found specification of procedure PTR_ERR [2022-07-13 22:59:03,834 INFO L138 BoogieDeclarations]: Found implementation of procedure PTR_ERR [2022-07-13 22:59:03,834 INFO L130 BoogieDeclarations]: Found specification of procedure loop_switch [2022-07-13 22:59:03,834 INFO L138 BoogieDeclarations]: Found implementation of procedure loop_switch [2022-07-13 22:59:03,835 INFO L130 BoogieDeclarations]: Found specification of procedure mapping_gfp_mask [2022-07-13 22:59:03,835 INFO L138 BoogieDeclarations]: Found implementation of procedure mapping_gfp_mask [2022-07-13 22:59:03,835 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2022-07-13 22:59:03,835 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2022-07-13 22:59:03,835 INFO L130 BoogieDeclarations]: Found specification of procedure __init_waitqueue_head [2022-07-13 22:59:03,835 INFO L138 BoogieDeclarations]: Found implementation of procedure __init_waitqueue_head [2022-07-13 22:59:03,835 INFO L130 BoogieDeclarations]: Found specification of procedure __kunmap_atomic [2022-07-13 22:59:03,835 INFO L138 BoogieDeclarations]: Found implementation of procedure __kunmap_atomic [2022-07-13 22:59:03,835 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-13 22:59:03,836 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 22:59:03,836 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 22:59:03,836 INFO L130 BoogieDeclarations]: Found specification of procedure IS_ERR [2022-07-13 22:59:03,836 INFO L138 BoogieDeclarations]: Found implementation of procedure IS_ERR [2022-07-13 22:59:04,298 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 22:59:04,300 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 22:59:04,751 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-13 22:59:05,700 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume !false; [2022-07-13 22:59:05,700 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##17: assume false; [2022-07-13 22:59:05,715 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-07-13 22:59:05,715 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-07-13 22:59:06,036 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-07-13 22:59:06,036 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-07-13 22:59:06,293 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-13 22:59:06,294 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-13 22:59:07,246 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##72: assume !false; [2022-07-13 22:59:07,246 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##71: assume false; [2022-07-13 22:59:07,246 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##38: assume !false; [2022-07-13 22:59:07,246 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##37: assume false; [2022-07-13 22:59:07,272 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 22:59:07,281 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 22:59:07,281 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-13 22:59:07,283 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 10:59:07 BoogieIcfgContainer [2022-07-13 22:59:07,283 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 22:59:07,285 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 22:59:07,285 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 22:59:07,287 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 22:59:07,287 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 10:59:02" (1/3) ... [2022-07-13 22:59:07,287 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16845694 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 10:59:07, skipping insertion in model container [2022-07-13 22:59:07,287 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:59:03" (2/3) ... [2022-07-13 22:59:07,288 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16845694 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 10:59:07, skipping insertion in model container [2022-07-13 22:59:07,288 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 10:59:07" (3/3) ... [2022-07-13 22:59:07,289 INFO L111 eAbstractionObserver]: Analyzing ICFG module_get_put-drivers-block-loop.ko.cil.out.i [2022-07-13 22:59:07,297 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 22:59:07,298 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-13 22:59:07,337 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 22:59:07,342 INFO L357 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@7b7e4a98, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@4d720279 [2022-07-13 22:59:07,342 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-13 22:59:07,347 INFO L276 IsEmpty]: Start isEmpty. Operand has 1134 states, 846 states have (on average 1.3416075650118204) internal successors, (1135), 859 states have internal predecessors, (1135), 222 states have call successors, (222), 64 states have call predecessors, (222), 64 states have return successors, (222), 221 states have call predecessors, (222), 222 states have call successors, (222) [2022-07-13 22:59:07,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-13 22:59:07,353 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:59:07,353 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:59:07,354 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:59:07,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:59:07,359 INFO L85 PathProgramCache]: Analyzing trace with hash 1638152850, now seen corresponding path program 1 times [2022-07-13 22:59:07,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:59:07,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082959633] [2022-07-13 22:59:07,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:59:07,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:59:07,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:07,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 22:59:07,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:59:07,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082959633] [2022-07-13 22:59:07,642 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082959633] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:59:07,642 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:59:07,642 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 22:59:07,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598387939] [2022-07-13 22:59:07,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:59:07,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 22:59:07,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:59:07,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 22:59:07,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 22:59:07,672 INFO L87 Difference]: Start difference. First operand has 1134 states, 846 states have (on average 1.3416075650118204) internal successors, (1135), 859 states have internal predecessors, (1135), 222 states have call successors, (222), 64 states have call predecessors, (222), 64 states have return successors, (222), 221 states have call predecessors, (222), 222 states have call successors, (222) Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 22:59:07,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:59:07,833 INFO L93 Difference]: Finished difference Result 3311 states and 4739 transitions. [2022-07-13 22:59:07,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 22:59:07,835 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-07-13 22:59:07,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:59:07,860 INFO L225 Difference]: With dead ends: 3311 [2022-07-13 22:59:07,861 INFO L226 Difference]: Without dead ends: 2166 [2022-07-13 22:59:07,875 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 22:59:07,880 INFO L413 NwaCegarLoop]: 1914 mSDtfsCounter, 1542 mSDsluCounter, 1464 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1542 SdHoareTripleChecker+Valid, 3378 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 22:59:07,881 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1542 Valid, 3378 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 22:59:07,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2166 states. [2022-07-13 22:59:08,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2166 to 2163. [2022-07-13 22:59:08,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2163 states, 1610 states have (on average 1.3198757763975155) internal successors, (2125), 1630 states have internal predecessors, (2125), 429 states have call successors, (429), 124 states have call predecessors, (429), 123 states have return successors, (432), 425 states have call predecessors, (432), 427 states have call successors, (432) [2022-07-13 22:59:08,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2163 states to 2163 states and 2986 transitions. [2022-07-13 22:59:08,028 INFO L78 Accepts]: Start accepts. Automaton has 2163 states and 2986 transitions. Word has length 11 [2022-07-13 22:59:08,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:59:08,029 INFO L495 AbstractCegarLoop]: Abstraction has 2163 states and 2986 transitions. [2022-07-13 22:59:08,029 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 22:59:08,029 INFO L276 IsEmpty]: Start isEmpty. Operand 2163 states and 2986 transitions. [2022-07-13 22:59:08,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-13 22:59:08,034 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:59:08,034 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:59:08,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-13 22:59:08,035 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:59:08,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:59:08,035 INFO L85 PathProgramCache]: Analyzing trace with hash -780115607, now seen corresponding path program 1 times [2022-07-13 22:59:08,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:59:08,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199328809] [2022-07-13 22:59:08,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:59:08,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:59:08,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:08,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 22:59:08,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:08,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-13 22:59:08,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:08,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:59:08,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:08,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 22:59:08,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:59:08,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199328809] [2022-07-13 22:59:08,120 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199328809] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:59:08,120 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:59:08,120 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 22:59:08,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613607560] [2022-07-13 22:59:08,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:59:08,122 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 22:59:08,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:59:08,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 22:59:08,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 22:59:08,123 INFO L87 Difference]: Start difference. First operand 2163 states and 2986 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-13 22:59:09,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:59:09,603 INFO L93 Difference]: Finished difference Result 4691 states and 6565 transitions. [2022-07-13 22:59:09,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 22:59:09,605 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 46 [2022-07-13 22:59:09,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:59:09,618 INFO L225 Difference]: With dead ends: 4691 [2022-07-13 22:59:09,618 INFO L226 Difference]: Without dead ends: 2609 [2022-07-13 22:59:09,624 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-13 22:59:09,625 INFO L413 NwaCegarLoop]: 1480 mSDtfsCounter, 565 mSDsluCounter, 2868 mSDsCounter, 0 mSdLazyCounter, 1373 mSolverCounterSat, 276 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 657 SdHoareTripleChecker+Valid, 4348 SdHoareTripleChecker+Invalid, 1649 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 276 IncrementalHoareTripleChecker+Valid, 1373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-07-13 22:59:09,625 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [657 Valid, 4348 Invalid, 1649 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [276 Valid, 1373 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-07-13 22:59:09,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2609 states. [2022-07-13 22:59:09,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2609 to 2163. [2022-07-13 22:59:09,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2163 states, 1610 states have (on average 1.3186335403726708) internal successors, (2123), 1630 states have internal predecessors, (2123), 429 states have call successors, (429), 124 states have call predecessors, (429), 123 states have return successors, (432), 425 states have call predecessors, (432), 427 states have call successors, (432) [2022-07-13 22:59:09,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2163 states to 2163 states and 2984 transitions. [2022-07-13 22:59:09,678 INFO L78 Accepts]: Start accepts. Automaton has 2163 states and 2984 transitions. Word has length 46 [2022-07-13 22:59:09,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:59:09,678 INFO L495 AbstractCegarLoop]: Abstraction has 2163 states and 2984 transitions. [2022-07-13 22:59:09,679 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-13 22:59:09,679 INFO L276 IsEmpty]: Start isEmpty. Operand 2163 states and 2984 transitions. [2022-07-13 22:59:09,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-13 22:59:09,681 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:59:09,681 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:59:09,681 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-13 22:59:09,681 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:59:09,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:59:09,682 INFO L85 PathProgramCache]: Analyzing trace with hash -800617350, now seen corresponding path program 1 times [2022-07-13 22:59:09,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:59:09,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129489073] [2022-07-13 22:59:09,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:59:09,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:59:09,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:09,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-13 22:59:09,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:09,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-13 22:59:09,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:09,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:59:09,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:09,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 22:59:09,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:59:09,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129489073] [2022-07-13 22:59:09,780 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129489073] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:59:09,780 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:59:09,780 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 22:59:09,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237977202] [2022-07-13 22:59:09,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:59:09,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 22:59:09,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:59:09,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 22:59:09,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 22:59:09,782 INFO L87 Difference]: Start difference. First operand 2163 states and 2984 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-13 22:59:10,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:59:10,818 INFO L93 Difference]: Finished difference Result 4764 states and 6650 transitions. [2022-07-13 22:59:10,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 22:59:10,819 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 58 [2022-07-13 22:59:10,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:59:10,830 INFO L225 Difference]: With dead ends: 4764 [2022-07-13 22:59:10,830 INFO L226 Difference]: Without dead ends: 2609 [2022-07-13 22:59:10,838 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 22:59:10,839 INFO L413 NwaCegarLoop]: 1472 mSDtfsCounter, 2078 mSDsluCounter, 724 mSDsCounter, 0 mSdLazyCounter, 335 mSolverCounterSat, 582 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2231 SdHoareTripleChecker+Valid, 2196 SdHoareTripleChecker+Invalid, 917 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 582 IncrementalHoareTripleChecker+Valid, 335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-13 22:59:10,839 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2231 Valid, 2196 Invalid, 917 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [582 Valid, 335 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-13 22:59:10,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2609 states. [2022-07-13 22:59:10,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2609 to 2163. [2022-07-13 22:59:10,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2163 states, 1610 states have (on average 1.317391304347826) internal successors, (2121), 1630 states have internal predecessors, (2121), 429 states have call successors, (429), 124 states have call predecessors, (429), 123 states have return successors, (432), 425 states have call predecessors, (432), 427 states have call successors, (432) [2022-07-13 22:59:10,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2163 states to 2163 states and 2982 transitions. [2022-07-13 22:59:10,938 INFO L78 Accepts]: Start accepts. Automaton has 2163 states and 2982 transitions. Word has length 58 [2022-07-13 22:59:10,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:59:10,938 INFO L495 AbstractCegarLoop]: Abstraction has 2163 states and 2982 transitions. [2022-07-13 22:59:10,939 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-13 22:59:10,939 INFO L276 IsEmpty]: Start isEmpty. Operand 2163 states and 2982 transitions. [2022-07-13 22:59:10,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-07-13 22:59:10,941 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:59:10,941 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:59:10,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-13 22:59:10,941 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:59:10,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:59:10,942 INFO L85 PathProgramCache]: Analyzing trace with hash -973306474, now seen corresponding path program 1 times [2022-07-13 22:59:10,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:59:10,942 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319598912] [2022-07-13 22:59:10,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:59:10,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:59:10,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:11,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 22:59:11,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:11,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-13 22:59:11,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:11,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:59:11,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:11,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 22:59:11,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:59:11,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319598912] [2022-07-13 22:59:11,034 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319598912] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:59:11,034 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:59:11,034 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 22:59:11,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581692213] [2022-07-13 22:59:11,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:59:11,037 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 22:59:11,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:59:11,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 22:59:11,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 22:59:11,038 INFO L87 Difference]: Start difference. First operand 2163 states and 2982 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-13 22:59:12,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:59:12,345 INFO L93 Difference]: Finished difference Result 4691 states and 6560 transitions. [2022-07-13 22:59:12,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 22:59:12,345 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 51 [2022-07-13 22:59:12,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:59:12,356 INFO L225 Difference]: With dead ends: 4691 [2022-07-13 22:59:12,356 INFO L226 Difference]: Without dead ends: 2592 [2022-07-13 22:59:12,362 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-13 22:59:12,363 INFO L413 NwaCegarLoop]: 1476 mSDtfsCounter, 565 mSDsluCounter, 2858 mSDsCounter, 0 mSdLazyCounter, 1371 mSolverCounterSat, 276 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 657 SdHoareTripleChecker+Valid, 4334 SdHoareTripleChecker+Invalid, 1647 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 276 IncrementalHoareTripleChecker+Valid, 1371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-07-13 22:59:12,363 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [657 Valid, 4334 Invalid, 1647 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [276 Valid, 1371 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-07-13 22:59:12,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2592 states. [2022-07-13 22:59:12,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2592 to 2146. [2022-07-13 22:59:12,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2146 states, 1599 states have (on average 1.3176985616010006) internal successors, (2107), 1619 states have internal predecessors, (2107), 425 states have call successors, (425), 122 states have call predecessors, (425), 121 states have return successors, (428), 421 states have call predecessors, (428), 423 states have call successors, (428) [2022-07-13 22:59:12,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2146 states to 2146 states and 2960 transitions. [2022-07-13 22:59:12,447 INFO L78 Accepts]: Start accepts. Automaton has 2146 states and 2960 transitions. Word has length 51 [2022-07-13 22:59:12,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:59:12,447 INFO L495 AbstractCegarLoop]: Abstraction has 2146 states and 2960 transitions. [2022-07-13 22:59:12,447 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-13 22:59:12,447 INFO L276 IsEmpty]: Start isEmpty. Operand 2146 states and 2960 transitions. [2022-07-13 22:59:12,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-07-13 22:59:12,449 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:59:12,449 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:59:12,449 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-13 22:59:12,449 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:59:12,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:59:12,450 INFO L85 PathProgramCache]: Analyzing trace with hash 966613706, now seen corresponding path program 1 times [2022-07-13 22:59:12,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:59:12,450 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869541031] [2022-07-13 22:59:12,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:59:12,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:59:12,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:12,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-13 22:59:12,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:12,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-13 22:59:12,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:12,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:59:12,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:12,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 22:59:12,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:59:12,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869541031] [2022-07-13 22:59:12,522 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869541031] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:59:12,522 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:59:12,522 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 22:59:12,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025357288] [2022-07-13 22:59:12,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:59:12,523 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 22:59:12,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:59:12,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 22:59:12,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-13 22:59:12,523 INFO L87 Difference]: Start difference. First operand 2146 states and 2960 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-13 22:59:13,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:59:13,645 INFO L93 Difference]: Finished difference Result 4690 states and 6558 transitions. [2022-07-13 22:59:13,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 22:59:13,646 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 63 [2022-07-13 22:59:13,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:59:13,657 INFO L225 Difference]: With dead ends: 4690 [2022-07-13 22:59:13,657 INFO L226 Difference]: Without dead ends: 2598 [2022-07-13 22:59:13,664 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-13 22:59:13,665 INFO L413 NwaCegarLoop]: 1465 mSDtfsCounter, 738 mSDsluCounter, 1762 mSDsCounter, 0 mSdLazyCounter, 864 mSolverCounterSat, 278 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 874 SdHoareTripleChecker+Valid, 3227 SdHoareTripleChecker+Invalid, 1142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 278 IncrementalHoareTripleChecker+Valid, 864 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-13 22:59:13,665 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [874 Valid, 3227 Invalid, 1142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [278 Valid, 864 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-07-13 22:59:13,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2598 states. [2022-07-13 22:59:13,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2598 to 2147. [2022-07-13 22:59:13,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2147 states, 1600 states have (on average 1.3175) internal successors, (2108), 1620 states have internal predecessors, (2108), 425 states have call successors, (425), 122 states have call predecessors, (425), 121 states have return successors, (428), 421 states have call predecessors, (428), 423 states have call successors, (428) [2022-07-13 22:59:13,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2147 states to 2147 states and 2961 transitions. [2022-07-13 22:59:13,761 INFO L78 Accepts]: Start accepts. Automaton has 2147 states and 2961 transitions. Word has length 63 [2022-07-13 22:59:13,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:59:13,762 INFO L495 AbstractCegarLoop]: Abstraction has 2147 states and 2961 transitions. [2022-07-13 22:59:13,763 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-13 22:59:13,763 INFO L276 IsEmpty]: Start isEmpty. Operand 2147 states and 2961 transitions. [2022-07-13 22:59:13,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-07-13 22:59:13,765 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:59:13,765 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:59:13,765 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-13 22:59:13,765 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:59:13,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:59:13,766 INFO L85 PathProgramCache]: Analyzing trace with hash 707532724, now seen corresponding path program 1 times [2022-07-13 22:59:13,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:59:13,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006255937] [2022-07-13 22:59:13,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:59:13,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:59:13,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:13,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 22:59:13,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:13,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:59:13,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:13,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-13 22:59:13,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:13,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-13 22:59:13,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:13,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-13 22:59:13,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:13,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:59:13,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:13,958 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-13 22:59:13,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:59:13,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006255937] [2022-07-13 22:59:13,958 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006255937] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:59:13,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1888593704] [2022-07-13 22:59:13,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:59:13,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:59:13,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:59:13,961 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 22:59:13,962 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-13 22:59:14,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:14,392 INFO L263 TraceCheckSpWp]: Trace formula consists of 1285 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-13 22:59:14,398 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:59:14,475 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 22:59:14,476 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 22:59:14,542 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-13 22:59:14,542 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1888593704] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 22:59:14,542 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 22:59:14,542 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 13 [2022-07-13 22:59:14,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512429337] [2022-07-13 22:59:14,543 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 22:59:14,544 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-13 22:59:14,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:59:14,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-13 22:59:14,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2022-07-13 22:59:14,545 INFO L87 Difference]: Start difference. First operand 2147 states and 2961 transitions. Second operand has 13 states, 13 states have (on average 7.538461538461538) internal successors, (98), 11 states have internal predecessors, (98), 5 states have call successors, (19), 4 states have call predecessors, (19), 2 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2022-07-13 22:59:18,285 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 22:59:20,174 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 22:59:21,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:59:21,158 INFO L93 Difference]: Finished difference Result 4887 states and 6970 transitions. [2022-07-13 22:59:21,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 22:59:21,159 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 7.538461538461538) internal successors, (98), 11 states have internal predecessors, (98), 5 states have call successors, (19), 4 states have call predecessors, (19), 2 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) Word has length 87 [2022-07-13 22:59:21,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:59:21,172 INFO L225 Difference]: With dead ends: 4887 [2022-07-13 22:59:21,172 INFO L226 Difference]: Without dead ends: 2795 [2022-07-13 22:59:21,178 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2022-07-13 22:59:21,178 INFO L413 NwaCegarLoop]: 1400 mSDtfsCounter, 1002 mSDsluCounter, 4289 mSDsCounter, 0 mSdLazyCounter, 2770 mSolverCounterSat, 421 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1162 SdHoareTripleChecker+Valid, 5689 SdHoareTripleChecker+Invalid, 3192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 421 IncrementalHoareTripleChecker+Valid, 2770 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2022-07-13 22:59:21,179 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1162 Valid, 5689 Invalid, 3192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [421 Valid, 2770 Invalid, 1 Unknown, 0 Unchecked, 6.4s Time] [2022-07-13 22:59:21,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2795 states. [2022-07-13 22:59:21,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2795 to 2165. [2022-07-13 22:59:21,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2165 states, 1612 states have (on average 1.315136476426799) internal successors, (2120), 1632 states have internal predecessors, (2120), 431 states have call successors, (431), 122 states have call predecessors, (431), 121 states have return successors, (434), 427 states have call predecessors, (434), 429 states have call successors, (434) [2022-07-13 22:59:21,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2165 states to 2165 states and 2985 transitions. [2022-07-13 22:59:21,265 INFO L78 Accepts]: Start accepts. Automaton has 2165 states and 2985 transitions. Word has length 87 [2022-07-13 22:59:21,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:59:21,266 INFO L495 AbstractCegarLoop]: Abstraction has 2165 states and 2985 transitions. [2022-07-13 22:59:21,266 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 7.538461538461538) internal successors, (98), 11 states have internal predecessors, (98), 5 states have call successors, (19), 4 states have call predecessors, (19), 2 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2022-07-13 22:59:21,266 INFO L276 IsEmpty]: Start isEmpty. Operand 2165 states and 2985 transitions. [2022-07-13 22:59:21,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2022-07-13 22:59:21,268 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:59:21,268 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-13 22:59:21,291 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-13 22:59:21,487 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-07-13 22:59:21,488 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:59:21,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:59:21,488 INFO L85 PathProgramCache]: Analyzing trace with hash 2065381788, now seen corresponding path program 1 times [2022-07-13 22:59:21,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:59:21,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571553925] [2022-07-13 22:59:21,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:59:21,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:59:21,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:21,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 22:59:21,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:21,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:59:21,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:21,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-13 22:59:21,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:21,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-13 22:59:21,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:21,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:59:21,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:21,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-13 22:59:21,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:21,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-13 22:59:21,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:21,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:59:21,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:21,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-13 22:59:21,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:21,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-13 22:59:21,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:21,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:59:21,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:21,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-13 22:59:21,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:21,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-13 22:59:21,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:21,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-07-13 22:59:21,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:21,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:59:21,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:21,766 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2022-07-13 22:59:21,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:59:21,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571553925] [2022-07-13 22:59:21,766 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571553925] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:59:21,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [354976027] [2022-07-13 22:59:21,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:59:21,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:59:21,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:59:21,768 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 22:59:21,769 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-13 22:59:22,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:22,282 INFO L263 TraceCheckSpWp]: Trace formula consists of 1827 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-13 22:59:22,287 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:59:22,435 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 16 proven. 40 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2022-07-13 22:59:22,436 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 22:59:22,598 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2022-07-13 22:59:22,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [354976027] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 22:59:22,598 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 22:59:22,598 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 22 [2022-07-13 22:59:22,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128701907] [2022-07-13 22:59:22,598 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 22:59:22,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-07-13 22:59:22,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:59:22,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-07-13 22:59:22,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=299, Unknown=0, NotChecked=0, Total=462 [2022-07-13 22:59:22,599 INFO L87 Difference]: Start difference. First operand 2165 states and 2985 transitions. Second operand has 22 states, 22 states have (on average 5.7727272727272725) internal successors, (127), 20 states have internal predecessors, (127), 14 states have call successors, (37), 4 states have call predecessors, (37), 2 states have return successors, (31), 14 states have call predecessors, (31), 14 states have call successors, (31) [2022-07-13 22:59:28,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:59:28,270 INFO L93 Difference]: Finished difference Result 4911 states and 7003 transitions. [2022-07-13 22:59:28,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-13 22:59:28,271 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 5.7727272727272725) internal successors, (127), 20 states have internal predecessors, (127), 14 states have call successors, (37), 4 states have call predecessors, (37), 2 states have return successors, (31), 14 states have call predecessors, (31), 14 states have call successors, (31) Word has length 152 [2022-07-13 22:59:28,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:59:28,282 INFO L225 Difference]: With dead ends: 4911 [2022-07-13 22:59:28,282 INFO L226 Difference]: Without dead ends: 2819 [2022-07-13 22:59:28,287 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 343 GetRequests, 320 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=202, Invalid=398, Unknown=0, NotChecked=0, Total=600 [2022-07-13 22:59:28,288 INFO L413 NwaCegarLoop]: 1412 mSDtfsCounter, 1069 mSDsluCounter, 7468 mSDsCounter, 0 mSdLazyCounter, 4697 mSolverCounterSat, 485 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1231 SdHoareTripleChecker+Valid, 8880 SdHoareTripleChecker+Invalid, 5182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 485 IncrementalHoareTripleChecker+Valid, 4697 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2022-07-13 22:59:28,289 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1231 Valid, 8880 Invalid, 5182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [485 Valid, 4697 Invalid, 0 Unknown, 0 Unchecked, 5.5s Time] [2022-07-13 22:59:28,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2819 states. [2022-07-13 22:59:28,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2819 to 2189. [2022-07-13 22:59:28,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2189 states, 1628 states have (on average 1.3120393120393121) internal successors, (2136), 1648 states have internal predecessors, (2136), 439 states have call successors, (439), 122 states have call predecessors, (439), 121 states have return successors, (442), 435 states have call predecessors, (442), 437 states have call successors, (442) [2022-07-13 22:59:28,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2189 states to 2189 states and 3017 transitions. [2022-07-13 22:59:28,362 INFO L78 Accepts]: Start accepts. Automaton has 2189 states and 3017 transitions. Word has length 152 [2022-07-13 22:59:28,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:59:28,363 INFO L495 AbstractCegarLoop]: Abstraction has 2189 states and 3017 transitions. [2022-07-13 22:59:28,363 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 5.7727272727272725) internal successors, (127), 20 states have internal predecessors, (127), 14 states have call successors, (37), 4 states have call predecessors, (37), 2 states have return successors, (31), 14 states have call predecessors, (31), 14 states have call successors, (31) [2022-07-13 22:59:28,363 INFO L276 IsEmpty]: Start isEmpty. Operand 2189 states and 3017 transitions. [2022-07-13 22:59:28,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2022-07-13 22:59:28,367 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:59:28,367 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-13 22:59:28,401 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-13 22:59:28,585 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-07-13 22:59:28,585 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:59:28,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:59:28,586 INFO L85 PathProgramCache]: Analyzing trace with hash 1776723700, now seen corresponding path program 2 times [2022-07-13 22:59:28,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:59:28,586 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060999029] [2022-07-13 22:59:28,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:59:28,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:59:28,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:28,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 22:59:28,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:28,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:59:28,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:28,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-13 22:59:28,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:28,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-13 22:59:28,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:28,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:59:28,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:28,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-13 22:59:28,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:28,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-13 22:59:28,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:28,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:59:28,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:28,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-13 22:59:28,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:28,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-13 22:59:28,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:28,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:59:28,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:28,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-13 22:59:28,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:28,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-13 22:59:28,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:28,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:59:28,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:28,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-13 22:59:28,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:28,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-07-13 22:59:28,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:28,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:59:28,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:28,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-13 22:59:28,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:28,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-07-13 22:59:28,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:28,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:59:28,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:28,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2022-07-13 22:59:28,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:28,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2022-07-13 22:59:28,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:28,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:59:28,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:28,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2022-07-13 22:59:28,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:28,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2022-07-13 22:59:28,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:28,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2022-07-13 22:59:28,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:28,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:59:28,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:28,929 INFO L134 CoverageAnalysis]: Checked inductivity of 712 backedges. 29 proven. 14 refuted. 0 times theorem prover too weak. 669 trivial. 0 not checked. [2022-07-13 22:59:28,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:59:28,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060999029] [2022-07-13 22:59:28,930 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060999029] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:59:28,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [670692060] [2022-07-13 22:59:28,930 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 22:59:28,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:59:28,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:59:28,931 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 22:59:28,932 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-13 22:59:29,345 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-13 22:59:29,345 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 22:59:29,349 INFO L263 TraceCheckSpWp]: Trace formula consists of 1047 conjuncts, 34 conjunts are in the unsatisfiable core [2022-07-13 22:59:29,355 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:59:29,513 INFO L134 CoverageAnalysis]: Checked inductivity of 712 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 680 trivial. 0 not checked. [2022-07-13 22:59:29,513 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 22:59:29,513 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [670692060] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:59:29,513 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 22:59:29,513 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 12 [2022-07-13 22:59:29,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456413373] [2022-07-13 22:59:29,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:59:29,514 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 22:59:29,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:59:29,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 22:59:29,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2022-07-13 22:59:29,515 INFO L87 Difference]: Start difference. First operand 2189 states and 3017 transitions. Second operand has 7 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 4 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-13 22:59:30,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:59:30,426 INFO L93 Difference]: Finished difference Result 5268 states and 7285 transitions. [2022-07-13 22:59:30,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-13 22:59:30,426 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 4 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 248 [2022-07-13 22:59:30,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:59:30,442 INFO L225 Difference]: With dead ends: 5268 [2022-07-13 22:59:30,443 INFO L226 Difference]: Without dead ends: 4209 [2022-07-13 22:59:30,447 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 297 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2022-07-13 22:59:30,448 INFO L413 NwaCegarLoop]: 2816 mSDtfsCounter, 1662 mSDsluCounter, 12218 mSDsCounter, 0 mSdLazyCounter, 579 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1685 SdHoareTripleChecker+Valid, 15034 SdHoareTripleChecker+Invalid, 626 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 579 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-13 22:59:30,448 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1685 Valid, 15034 Invalid, 626 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 579 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-13 22:59:30,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4209 states. [2022-07-13 22:59:30,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4209 to 4155. [2022-07-13 22:59:30,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4155 states, 3084 states have (on average 1.3167963683527886) internal successors, (4061), 3123 states have internal predecessors, (4061), 833 states have call successors, (833), 236 states have call predecessors, (833), 237 states have return successors, (849), 827 states have call predecessors, (849), 831 states have call successors, (849) [2022-07-13 22:59:30,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4155 states to 4155 states and 5743 transitions. [2022-07-13 22:59:30,584 INFO L78 Accepts]: Start accepts. Automaton has 4155 states and 5743 transitions. Word has length 248 [2022-07-13 22:59:30,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:59:30,584 INFO L495 AbstractCegarLoop]: Abstraction has 4155 states and 5743 transitions. [2022-07-13 22:59:30,584 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 4 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-13 22:59:30,584 INFO L276 IsEmpty]: Start isEmpty. Operand 4155 states and 5743 transitions. [2022-07-13 22:59:30,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2022-07-13 22:59:30,587 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:59:30,587 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-13 22:59:30,607 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-13 22:59:30,803 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:59:30,803 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:59:30,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:59:30,804 INFO L85 PathProgramCache]: Analyzing trace with hash 1557868982, now seen corresponding path program 1 times [2022-07-13 22:59:30,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:59:30,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539019025] [2022-07-13 22:59:30,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:59:30,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:59:30,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:31,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 22:59:31,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:31,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:59:31,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:31,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-13 22:59:31,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:31,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-13 22:59:31,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:31,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:59:31,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:31,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-13 22:59:31,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:31,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-13 22:59:31,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:31,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:59:31,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:31,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-13 22:59:31,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:31,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-13 22:59:31,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:31,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:59:31,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:31,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-13 22:59:31,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:31,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-13 22:59:31,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:31,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:59:31,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:31,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-13 22:59:31,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:31,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-07-13 22:59:31,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:31,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:59:31,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:31,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-13 22:59:31,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:31,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-07-13 22:59:31,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:31,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:59:31,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:31,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2022-07-13 22:59:31,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:31,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2022-07-13 22:59:31,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:31,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:59:31,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:31,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2022-07-13 22:59:31,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:31,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2022-07-13 22:59:31,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:31,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2022-07-13 22:59:31,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:31,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:59:31,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:31,145 INFO L134 CoverageAnalysis]: Checked inductivity of 712 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 712 trivial. 0 not checked. [2022-07-13 22:59:31,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:59:31,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539019025] [2022-07-13 22:59:31,145 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539019025] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:59:31,145 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:59:31,145 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 22:59:31,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020180754] [2022-07-13 22:59:31,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:59:31,146 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 22:59:31,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:59:31,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 22:59:31,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-13 22:59:31,146 INFO L87 Difference]: Start difference. First operand 4155 states and 5743 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 4 states have internal predecessors, (62), 4 states have call successors, (9), 6 states have call predecessors, (9), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-13 22:59:36,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:59:36,350 INFO L93 Difference]: Finished difference Result 8065 states and 11861 transitions. [2022-07-13 22:59:36,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-13 22:59:36,351 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 4 states have internal predecessors, (62), 4 states have call successors, (9), 6 states have call predecessors, (9), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 248 [2022-07-13 22:59:36,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:59:36,382 INFO L225 Difference]: With dead ends: 8065 [2022-07-13 22:59:36,382 INFO L226 Difference]: Without dead ends: 8062 [2022-07-13 22:59:36,388 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-07-13 22:59:36,392 INFO L413 NwaCegarLoop]: 2911 mSDtfsCounter, 5886 mSDsluCounter, 3326 mSDsCounter, 0 mSdLazyCounter, 3780 mSolverCounterSat, 2543 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6354 SdHoareTripleChecker+Valid, 6237 SdHoareTripleChecker+Invalid, 6323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2543 IncrementalHoareTripleChecker+Valid, 3780 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2022-07-13 22:59:36,392 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6354 Valid, 6237 Invalid, 6323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2543 Valid, 3780 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2022-07-13 22:59:36,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8062 states. [2022-07-13 22:59:36,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8062 to 6361. [2022-07-13 22:59:36,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6361 states, 4707 states have (on average 1.318249415763756) internal successors, (6205), 4778 states have internal predecessors, (6205), 1285 states have call successors, (1285), 349 states have call predecessors, (1285), 368 states have return successors, (1386), 1289 states have call predecessors, (1386), 1283 states have call successors, (1386) [2022-07-13 22:59:36,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6361 states to 6361 states and 8876 transitions. [2022-07-13 22:59:36,710 INFO L78 Accepts]: Start accepts. Automaton has 6361 states and 8876 transitions. Word has length 248 [2022-07-13 22:59:36,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:59:36,710 INFO L495 AbstractCegarLoop]: Abstraction has 6361 states and 8876 transitions. [2022-07-13 22:59:36,711 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 4 states have internal predecessors, (62), 4 states have call successors, (9), 6 states have call predecessors, (9), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-13 22:59:36,711 INFO L276 IsEmpty]: Start isEmpty. Operand 6361 states and 8876 transitions. [2022-07-13 22:59:36,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2022-07-13 22:59:36,715 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:59:36,715 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-13 22:59:36,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-13 22:59:36,715 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:59:36,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:59:36,716 INFO L85 PathProgramCache]: Analyzing trace with hash 1635323117, now seen corresponding path program 1 times [2022-07-13 22:59:36,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:59:36,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505897955] [2022-07-13 22:59:36,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:59:36,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:59:36,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:36,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 22:59:36,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:36,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:59:36,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:36,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-13 22:59:36,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:36,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-13 22:59:36,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:36,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:59:36,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:36,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-13 22:59:36,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:36,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-13 22:59:36,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:36,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:59:36,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:36,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-13 22:59:36,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:36,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-13 22:59:36,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:36,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:59:36,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:36,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-13 22:59:36,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:36,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-13 22:59:36,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:36,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:59:36,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:36,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-13 22:59:36,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:36,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-07-13 22:59:36,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:36,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:59:36,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:36,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-13 22:59:36,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:36,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-07-13 22:59:36,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:36,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:59:36,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:36,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2022-07-13 22:59:36,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:36,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2022-07-13 22:59:36,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:36,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:59:36,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:36,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2022-07-13 22:59:36,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:36,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2022-07-13 22:59:36,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:36,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2022-07-13 22:59:36,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:36,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2022-07-13 22:59:36,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:36,983 INFO L134 CoverageAnalysis]: Checked inductivity of 680 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 680 trivial. 0 not checked. [2022-07-13 22:59:36,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:59:36,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505897955] [2022-07-13 22:59:36,983 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505897955] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:59:36,983 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:59:36,983 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 22:59:36,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597517120] [2022-07-13 22:59:36,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:59:36,983 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 22:59:36,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:59:36,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 22:59:36,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-13 22:59:36,984 INFO L87 Difference]: Start difference. First operand 6361 states and 8876 transitions. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 3 states have internal predecessors, (70), 3 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-13 22:59:39,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:59:39,164 INFO L93 Difference]: Finished difference Result 14925 states and 21806 transitions. [2022-07-13 22:59:39,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 22:59:39,164 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 3 states have internal predecessors, (70), 3 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 254 [2022-07-13 22:59:39,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:59:39,195 INFO L225 Difference]: With dead ends: 14925 [2022-07-13 22:59:39,196 INFO L226 Difference]: Without dead ends: 8671 [2022-07-13 22:59:39,216 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-13 22:59:39,217 INFO L413 NwaCegarLoop]: 1459 mSDtfsCounter, 1201 mSDsluCounter, 1800 mSDsCounter, 0 mSdLazyCounter, 1238 mSolverCounterSat, 675 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1353 SdHoareTripleChecker+Valid, 3259 SdHoareTripleChecker+Invalid, 1913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 675 IncrementalHoareTripleChecker+Valid, 1238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-07-13 22:59:39,217 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1353 Valid, 3259 Invalid, 1913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [675 Valid, 1238 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-07-13 22:59:39,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8671 states. [2022-07-13 22:59:39,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8671 to 7004. [2022-07-13 22:59:39,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7004 states, 5188 states have (on average 1.3299922898997687) internal successors, (6900), 5271 states have internal predecessors, (6900), 1447 states have call successors, (1447), 349 states have call predecessors, (1447), 368 states have return successors, (1586), 1445 states have call predecessors, (1586), 1445 states have call successors, (1586) [2022-07-13 22:59:39,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7004 states to 7004 states and 9933 transitions. [2022-07-13 22:59:39,487 INFO L78 Accepts]: Start accepts. Automaton has 7004 states and 9933 transitions. Word has length 254 [2022-07-13 22:59:39,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:59:39,488 INFO L495 AbstractCegarLoop]: Abstraction has 7004 states and 9933 transitions. [2022-07-13 22:59:39,488 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 3 states have internal predecessors, (70), 3 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-13 22:59:39,488 INFO L276 IsEmpty]: Start isEmpty. Operand 7004 states and 9933 transitions. [2022-07-13 22:59:39,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2022-07-13 22:59:39,491 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:59:39,491 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-13 22:59:39,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-13 22:59:39,492 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:59:39,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:59:39,492 INFO L85 PathProgramCache]: Analyzing trace with hash -1210188346, now seen corresponding path program 1 times [2022-07-13 22:59:39,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:59:39,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474161997] [2022-07-13 22:59:39,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:59:39,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:59:39,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:39,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 22:59:39,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:39,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:59:39,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:39,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-13 22:59:39,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:39,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-13 22:59:39,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:39,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:59:39,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:39,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-13 22:59:39,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:39,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-13 22:59:39,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:39,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:59:39,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:39,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-13 22:59:39,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:39,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-13 22:59:39,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:39,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:59:39,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:39,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-13 22:59:39,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:39,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-13 22:59:39,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:39,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:59:39,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:39,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-13 22:59:39,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:39,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-07-13 22:59:39,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:39,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:59:39,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:39,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-13 22:59:39,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:39,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-07-13 22:59:39,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:39,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:59:39,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:39,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2022-07-13 22:59:39,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:39,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2022-07-13 22:59:39,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:39,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:59:39,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:39,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2022-07-13 22:59:39,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:39,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2022-07-13 22:59:39,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:39,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 232 [2022-07-13 22:59:39,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:39,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2022-07-13 22:59:39,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:39,767 INFO L134 CoverageAnalysis]: Checked inductivity of 680 backedges. 29 proven. 14 refuted. 0 times theorem prover too weak. 637 trivial. 0 not checked. [2022-07-13 22:59:39,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:59:39,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474161997] [2022-07-13 22:59:39,767 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474161997] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:59:39,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1940161913] [2022-07-13 22:59:39,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:59:39,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:59:39,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:59:39,768 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 22:59:39,770 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-13 22:59:40,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:40,425 INFO L263 TraceCheckSpWp]: Trace formula consists of 2714 conjuncts, 15 conjunts are in the unsatisfiable core [2022-07-13 22:59:40,431 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:59:40,463 INFO L134 CoverageAnalysis]: Checked inductivity of 680 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 553 trivial. 0 not checked. [2022-07-13 22:59:40,463 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 22:59:40,463 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1940161913] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:59:40,463 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 22:59:40,463 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2022-07-13 22:59:40,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690482276] [2022-07-13 22:59:40,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:59:40,464 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 22:59:40,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:59:40,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 22:59:40,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-13 22:59:40,465 INFO L87 Difference]: Start difference. First operand 7004 states and 9933 transitions. Second operand has 5 states, 5 states have (on average 17.0) internal successors, (85), 4 states have internal predecessors, (85), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-13 22:59:40,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:59:40,716 INFO L93 Difference]: Finished difference Result 14011 states and 19874 transitions. [2022-07-13 22:59:40,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 22:59:40,717 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 4 states have internal predecessors, (85), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 256 [2022-07-13 22:59:40,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:59:40,744 INFO L225 Difference]: With dead ends: 14011 [2022-07-13 22:59:40,744 INFO L226 Difference]: Without dead ends: 6993 [2022-07-13 22:59:40,764 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 310 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-13 22:59:40,765 INFO L413 NwaCegarLoop]: 1530 mSDtfsCounter, 0 mSDsluCounter, 4578 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6108 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 22:59:40,765 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6108 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 22:59:40,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6993 states. [2022-07-13 22:59:40,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6993 to 6993. [2022-07-13 22:59:40,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6993 states, 5181 states have (on average 1.3298591005597376) internal successors, (6890), 5263 states have internal predecessors, (6890), 1445 states have call successors, (1445), 347 states have call predecessors, (1445), 366 states have return successors, (1584), 1443 states have call predecessors, (1584), 1443 states have call successors, (1584) [2022-07-13 22:59:40,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6993 states to 6993 states and 9919 transitions. [2022-07-13 22:59:40,975 INFO L78 Accepts]: Start accepts. Automaton has 6993 states and 9919 transitions. Word has length 256 [2022-07-13 22:59:40,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:59:40,975 INFO L495 AbstractCegarLoop]: Abstraction has 6993 states and 9919 transitions. [2022-07-13 22:59:40,975 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 4 states have internal predecessors, (85), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-13 22:59:40,975 INFO L276 IsEmpty]: Start isEmpty. Operand 6993 states and 9919 transitions. [2022-07-13 22:59:40,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 441 [2022-07-13 22:59:40,981 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:59:40,981 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-13 22:59:41,004 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-13 22:59:41,202 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:59:41,202 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:59:41,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:59:41,203 INFO L85 PathProgramCache]: Analyzing trace with hash -1841619178, now seen corresponding path program 1 times [2022-07-13 22:59:41,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:59:41,203 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790528541] [2022-07-13 22:59:41,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:59:41,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:59:41,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:41,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 22:59:41,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:41,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:59:41,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:41,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 22:59:41,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:41,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-13 22:59:41,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:41,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-13 22:59:41,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:41,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-13 22:59:41,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:41,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-13 22:59:41,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:41,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:59:41,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:41,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 22:59:41,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:41,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-13 22:59:41,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:41,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-13 22:59:41,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:41,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-13 22:59:41,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:41,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-13 22:59:41,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:41,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:59:41,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:41,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 22:59:41,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:41,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-13 22:59:41,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:41,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-13 22:59:41,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:41,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-07-13 22:59:41,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:41,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-13 22:59:41,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:41,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:59:41,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:41,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 22:59:41,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:41,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-13 22:59:41,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:41,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-13 22:59:41,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:41,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2022-07-13 22:59:41,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:41,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2022-07-13 22:59:41,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:41,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:59:41,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:41,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 22:59:41,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:41,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-13 22:59:41,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:41,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-13 22:59:41,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:41,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2022-07-13 22:59:41,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:41,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2022-07-13 22:59:41,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:41,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:59:41,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:41,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 22:59:41,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:41,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-13 22:59:41,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:41,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-13 22:59:41,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:41,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 286 [2022-07-13 22:59:41,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:41,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 293 [2022-07-13 22:59:41,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:41,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:59:41,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:41,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 22:59:41,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:41,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-13 22:59:41,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:41,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-13 22:59:41,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:41,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 333 [2022-07-13 22:59:41,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:41,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 340 [2022-07-13 22:59:41,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:41,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:59:41,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:41,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 22:59:41,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:41,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-13 22:59:41,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:41,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-13 22:59:41,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:41,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 380 [2022-07-13 22:59:41,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:41,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 404 [2022-07-13 22:59:41,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:41,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 416 [2022-07-13 22:59:41,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:41,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 422 [2022-07-13 22:59:41,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:41,920 INFO L134 CoverageAnalysis]: Checked inductivity of 2092 backedges. 15 proven. 186 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2022-07-13 22:59:41,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:59:41,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790528541] [2022-07-13 22:59:41,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790528541] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:59:41,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1456107760] [2022-07-13 22:59:41,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:59:41,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:59:41,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:59:41,922 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 22:59:41,923 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-13 22:59:43,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:43,205 INFO L263 TraceCheckSpWp]: Trace formula consists of 4690 conjuncts, 39 conjunts are in the unsatisfiable core [2022-07-13 22:59:43,213 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:59:43,255 INFO L134 CoverageAnalysis]: Checked inductivity of 2092 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 1936 trivial. 0 not checked. [2022-07-13 22:59:43,255 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 22:59:43,255 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1456107760] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:59:43,255 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 22:59:43,256 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10] total 10 [2022-07-13 22:59:43,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397651017] [2022-07-13 22:59:43,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:59:43,256 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-13 22:59:43,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:59:43,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 22:59:43,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-07-13 22:59:43,257 INFO L87 Difference]: Start difference. First operand 6993 states and 9919 transitions. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 7 states have internal predecessors, (92), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-07-13 22:59:43,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:59:43,562 INFO L93 Difference]: Finished difference Result 13986 states and 19859 transitions. [2022-07-13 22:59:43,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-13 22:59:43,562 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 7 states have internal predecessors, (92), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 440 [2022-07-13 22:59:43,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:59:43,589 INFO L225 Difference]: With dead ends: 13986 [2022-07-13 22:59:43,589 INFO L226 Difference]: Without dead ends: 7001 [2022-07-13 22:59:43,606 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 554 GetRequests, 541 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2022-07-13 22:59:43,607 INFO L413 NwaCegarLoop]: 1517 mSDtfsCounter, 6 mSDsluCounter, 9082 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 10599 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 22:59:43,607 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 10599 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 22:59:43,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7001 states. [2022-07-13 22:59:43,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7001 to 6995. [2022-07-13 22:59:43,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6995 states, 5182 states have (on average 1.3297954457738326) internal successors, (6891), 5265 states have internal predecessors, (6891), 1445 states have call successors, (1445), 347 states have call predecessors, (1445), 367 states have return successors, (1590), 1443 states have call predecessors, (1590), 1443 states have call successors, (1590) [2022-07-13 22:59:43,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6995 states to 6995 states and 9926 transitions. [2022-07-13 22:59:43,824 INFO L78 Accepts]: Start accepts. Automaton has 6995 states and 9926 transitions. Word has length 440 [2022-07-13 22:59:43,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:59:43,825 INFO L495 AbstractCegarLoop]: Abstraction has 6995 states and 9926 transitions. [2022-07-13 22:59:43,825 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 7 states have internal predecessors, (92), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-07-13 22:59:43,825 INFO L276 IsEmpty]: Start isEmpty. Operand 6995 states and 9926 transitions. [2022-07-13 22:59:43,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 497 [2022-07-13 22:59:43,831 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:59:43,831 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 16, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-13 22:59:43,859 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-13 22:59:44,053 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-07-13 22:59:44,053 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:59:44,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:59:44,053 INFO L85 PathProgramCache]: Analyzing trace with hash -969582626, now seen corresponding path program 1 times [2022-07-13 22:59:44,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:59:44,054 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195270907] [2022-07-13 22:59:44,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:59:44,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:59:44,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:44,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 22:59:44,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:44,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:59:44,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:44,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:59:44,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:44,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 22:59:44,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:44,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-13 22:59:44,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:44,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-13 22:59:44,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:44,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-13 22:59:44,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:44,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-13 22:59:44,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:44,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:59:44,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:44,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:59:44,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:44,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 22:59:44,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:44,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-13 22:59:44,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:44,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-13 22:59:44,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:44,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-13 22:59:44,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:44,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-13 22:59:44,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:44,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:59:44,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:44,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:59:44,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:44,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 22:59:44,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:44,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-13 22:59:44,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:44,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-13 22:59:44,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:44,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2022-07-13 22:59:44,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:44,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-07-13 22:59:44,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:44,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:59:44,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:44,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:59:44,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:44,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 22:59:44,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:44,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-13 22:59:44,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:44,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-13 22:59:44,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:44,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2022-07-13 22:59:44,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:44,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 227 [2022-07-13 22:59:44,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:44,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:59:44,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:44,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:59:44,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:44,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 22:59:44,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:44,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-13 22:59:44,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:44,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-13 22:59:44,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:44,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 274 [2022-07-13 22:59:44,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:44,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 281 [2022-07-13 22:59:44,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:44,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:59:44,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:44,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:59:44,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:44,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 22:59:44,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:44,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-13 22:59:44,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:44,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-13 22:59:44,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:44,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 328 [2022-07-13 22:59:44,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:44,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 335 [2022-07-13 22:59:44,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:44,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:59:44,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:44,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:59:44,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:44,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 22:59:44,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:44,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-13 22:59:44,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:44,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-13 22:59:44,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:44,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 382 [2022-07-13 22:59:44,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:44,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 389 [2022-07-13 22:59:44,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:44,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:59:44,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:44,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:59:44,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:44,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 22:59:44,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:44,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-13 22:59:44,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:44,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-13 22:59:44,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:44,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 436 [2022-07-13 22:59:44,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:44,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 460 [2022-07-13 22:59:44,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:44,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 472 [2022-07-13 22:59:44,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:44,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 478 [2022-07-13 22:59:44,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:44,814 INFO L134 CoverageAnalysis]: Checked inductivity of 2288 backedges. 19 proven. 112 refuted. 0 times theorem prover too weak. 2157 trivial. 0 not checked. [2022-07-13 22:59:44,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:59:44,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195270907] [2022-07-13 22:59:44,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195270907] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:59:44,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1824609778] [2022-07-13 22:59:44,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:59:44,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:59:44,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:59:44,816 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 22:59:44,818 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-13 22:59:47,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:47,234 INFO L263 TraceCheckSpWp]: Trace formula consists of 4986 conjuncts, 76 conjunts are in the unsatisfiable core [2022-07-13 22:59:47,244 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:59:47,390 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-13 22:59:47,495 INFO L134 CoverageAnalysis]: Checked inductivity of 2288 backedges. 317 proven. 2 refuted. 0 times theorem prover too weak. 1969 trivial. 0 not checked. [2022-07-13 22:59:47,495 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 22:59:47,865 INFO L134 CoverageAnalysis]: Checked inductivity of 2288 backedges. 17 proven. 142 refuted. 0 times theorem prover too weak. 2129 trivial. 0 not checked. [2022-07-13 22:59:47,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1824609778] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 22:59:47,866 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 22:59:47,866 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 13, 6] total 22 [2022-07-13 22:59:47,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010185517] [2022-07-13 22:59:47,866 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 22:59:47,867 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-07-13 22:59:47,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:59:47,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-07-13 22:59:47,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=413, Unknown=0, NotChecked=0, Total=462 [2022-07-13 22:59:47,867 INFO L87 Difference]: Start difference. First operand 6995 states and 9926 transitions. Second operand has 22 states, 22 states have (on average 6.954545454545454) internal successors, (153), 16 states have internal predecessors, (153), 4 states have call successors, (35), 4 states have call predecessors, (35), 5 states have return successors, (28), 7 states have call predecessors, (28), 4 states have call successors, (28) [2022-07-13 22:59:56,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:59:56,285 INFO L93 Difference]: Finished difference Result 15645 states and 22950 transitions. [2022-07-13 22:59:56,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-13 22:59:56,286 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 6.954545454545454) internal successors, (153), 16 states have internal predecessors, (153), 4 states have call successors, (35), 4 states have call predecessors, (35), 5 states have return successors, (28), 7 states have call predecessors, (28), 4 states have call successors, (28) Word has length 496 [2022-07-13 22:59:56,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:59:56,318 INFO L225 Difference]: With dead ends: 15645 [2022-07-13 22:59:56,318 INFO L226 Difference]: Without dead ends: 8657 [2022-07-13 22:59:56,334 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1127 GetRequests, 1095 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=145, Invalid=911, Unknown=0, NotChecked=0, Total=1056 [2022-07-13 22:59:56,335 INFO L413 NwaCegarLoop]: 1385 mSDtfsCounter, 703 mSDsluCounter, 15147 mSDsCounter, 0 mSdLazyCounter, 9490 mSolverCounterSat, 347 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 805 SdHoareTripleChecker+Valid, 16532 SdHoareTripleChecker+Invalid, 9837 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 347 IncrementalHoareTripleChecker+Valid, 9490 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.8s IncrementalHoareTripleChecker+Time [2022-07-13 22:59:56,335 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [805 Valid, 16532 Invalid, 9837 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [347 Valid, 9490 Invalid, 0 Unknown, 0 Unchecked, 7.8s Time] [2022-07-13 22:59:56,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8657 states. [2022-07-13 22:59:56,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8657 to 6995. [2022-07-13 22:59:56,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6995 states, 5182 states have (on average 1.3297954457738326) internal successors, (6891), 5265 states have internal predecessors, (6891), 1445 states have call successors, (1445), 347 states have call predecessors, (1445), 367 states have return successors, (1588), 1443 states have call predecessors, (1588), 1443 states have call successors, (1588) [2022-07-13 22:59:56,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6995 states to 6995 states and 9924 transitions. [2022-07-13 22:59:56,598 INFO L78 Accepts]: Start accepts. Automaton has 6995 states and 9924 transitions. Word has length 496 [2022-07-13 22:59:56,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:59:56,598 INFO L495 AbstractCegarLoop]: Abstraction has 6995 states and 9924 transitions. [2022-07-13 22:59:56,598 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 6.954545454545454) internal successors, (153), 16 states have internal predecessors, (153), 4 states have call successors, (35), 4 states have call predecessors, (35), 5 states have return successors, (28), 7 states have call predecessors, (28), 4 states have call successors, (28) [2022-07-13 22:59:56,599 INFO L276 IsEmpty]: Start isEmpty. Operand 6995 states and 9924 transitions. [2022-07-13 22:59:56,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 609 [2022-07-13 22:59:56,606 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:59:56,607 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-13 22:59:56,637 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-13 22:59:56,831 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:59:56,832 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:59:56,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:59:56,832 INFO L85 PathProgramCache]: Analyzing trace with hash 1290540974, now seen corresponding path program 1 times [2022-07-13 22:59:56,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:59:56,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371068988] [2022-07-13 22:59:56,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:59:56,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:59:58,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:59,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-13 22:59:59,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:03,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:00:03,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:03,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 23:00:03,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:03,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 23:00:03,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:03,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 23:00:03,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:03,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 23:00:03,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:03,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 23:00:03,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:03,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-13 23:00:03,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:03,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-13 23:00:03,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:03,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-13 23:00:03,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:08,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:00:08,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:08,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 23:00:08,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:08,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 23:00:08,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:08,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 23:00:08,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:08,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 23:00:08,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:08,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 23:00:08,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:08,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-13 23:00:08,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:08,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-13 23:00:08,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:08,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-13 23:00:08,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:10,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:00:10,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:10,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 23:00:10,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:10,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 23:00:10,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:10,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 23:00:10,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:10,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 23:00:10,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:10,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 23:00:10,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:10,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-13 23:00:10,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:10,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2022-07-13 23:00:10,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:10,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2022-07-13 23:00:10,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:13,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:00:13,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:13,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 23:00:13,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:13,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 23:00:13,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:13,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 23:00:13,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:13,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 23:00:13,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:13,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 23:00:13,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:13,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-13 23:00:13,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:13,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 276 [2022-07-13 23:00:13,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:13,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 283 [2022-07-13 23:00:13,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:17,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:00:17,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:17,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 23:00:17,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:17,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 23:00:17,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:17,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 23:00:17,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:17,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 23:00:17,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:17,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 23:00:17,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:17,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-13 23:00:17,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:17,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 344 [2022-07-13 23:00:17,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:17,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 351 [2022-07-13 23:00:17,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:20,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:00:20,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:20,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 23:00:20,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:20,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 23:00:20,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:20,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 23:00:20,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:20,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 23:00:20,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:20,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 23:00:20,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:20,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-13 23:00:20,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:20,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 412 [2022-07-13 23:00:20,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:20,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 419 [2022-07-13 23:00:20,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:23,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:00:23,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:23,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 23:00:23,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:23,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 23:00:23,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:23,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 23:00:23,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:23,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 23:00:23,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:23,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 23:00:23,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:23,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-13 23:00:23,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:23,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 480 [2022-07-13 23:00:23,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:23,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 487 [2022-07-13 23:00:23,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:27,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:00:27,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:27,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 23:00:27,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:27,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 23:00:27,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:27,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 23:00:27,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:27,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 23:00:27,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:28,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 23:00:28,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:28,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-13 23:00:28,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:28,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 548 [2022-07-13 23:00:28,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:28,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 572 [2022-07-13 23:00:28,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:28,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 584 [2022-07-13 23:00:28,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:28,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 590 [2022-07-13 23:00:28,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:28,165 INFO L134 CoverageAnalysis]: Checked inductivity of 4024 backedges. 476 proven. 1497 refuted. 0 times theorem prover too weak. 2051 trivial. 0 not checked. [2022-07-13 23:00:28,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 23:00:28,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371068988] [2022-07-13 23:00:28,165 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371068988] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 23:00:28,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1469498032] [2022-07-13 23:00:28,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:00:28,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 23:00:28,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 23:00:28,167 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 23:00:28,168 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-13 23:01:06,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:01:06,873 INFO L263 TraceCheckSpWp]: Trace formula consists of 5578 conjuncts, 774 conjunts are in the unsatisfiable core [2022-07-13 23:01:06,907 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 23:01:06,937 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:01:06,938 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-13 23:01:06,943 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:01:06,943 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-13 23:01:07,165 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-13 23:01:07,170 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-13 23:01:07,596 INFO L356 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-07-13 23:01:07,596 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 22 [2022-07-13 23:01:07,871 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-07-13 23:01:10,054 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:01:10,055 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:01:10,056 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:01:10,063 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:01:10,064 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:01:10,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:01:10,070 INFO L356 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-07-13 23:01:10,070 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 25 [2022-07-13 23:01:10,281 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-07-13 23:01:11,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:01:11,532 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:01:11,533 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:01:11,535 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:01:11,535 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:01:11,536 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:01:11,541 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:01:11,542 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:01:11,542 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:01:11,543 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:01:11,544 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:01:11,545 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:01:11,551 INFO L356 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2022-07-13 23:01:11,551 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 42 treesize of output 32 [2022-07-13 23:01:11,557 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-13 23:01:11,560 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-13 23:01:11,580 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-07-13 23:01:14,654 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:01:14,655 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:01:14,656 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:01:14,663 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:01:14,664 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:01:14,664 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:01:14,669 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:01:14,670 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:01:14,671 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:01:14,678 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:01:14,679 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:01:14,692 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:01:14,693 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:01:14,694 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:01:14,695 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:01:14,696 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:01:14,697 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:01:14,698 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:01:14,747 INFO L356 Elim1Store]: treesize reduction 129, result has 17.8 percent of original size [2022-07-13 23:01:14,747 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 9 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 14 case distinctions, treesize of input 143 treesize of output 145 [2022-07-13 23:01:14,810 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-13 23:01:14,854 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-13 23:01:17,497 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:01:17,498 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:01:17,499 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:01:17,500 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:01:17,501 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:01:17,501 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:01:17,504 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:01:17,505 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:01:17,506 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:01:17,530 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:01:17,533 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:01:17,534 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:01:17,539 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:01:17,541 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:01:17,544 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:01:17,545 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:01:17,546 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:01:17,547 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:01:17,831 INFO L356 Elim1Store]: treesize reduction 573, result has 16.7 percent of original size [2022-07-13 23:01:17,831 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 9 select indices, 9 select index equivalence classes, 12 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 35 case distinctions, treesize of input 121 treesize of output 197 [2022-07-13 23:01:17,863 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:01:17,871 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2022-07-13 23:01:17,883 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:01:17,884 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2022-07-13 23:01:18,651 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 16 [2022-07-13 23:01:18,655 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-13 23:01:18,659 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-13 23:01:19,051 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-07-13 23:01:21,856 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:01:21,859 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:01:21,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:01:21,865 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-13 23:01:22,207 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-07-13 23:01:24,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:01:24,322 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:01:24,323 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:01:24,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:01:24,325 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:01:24,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:01:24,338 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-13 23:01:24,338 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 11 [2022-07-13 23:01:24,344 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-13 23:01:24,348 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-13 23:01:24,372 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-07-13 23:01:28,827 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:01:28,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:01:28,829 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:01:28,830 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:01:28,831 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:01:28,832 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:01:28,835 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:01:28,836 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:01:28,838 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:01:28,848 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:01:28,849 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:01:28,850 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:01:28,852 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:01:28,853 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:01:28,855 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:01:28,855 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:01:28,856 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:01:28,857 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:01:28,916 INFO L356 Elim1Store]: treesize reduction 101, result has 24.1 percent of original size [2022-07-13 23:01:28,917 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 49 treesize of output 63 [2022-07-13 23:01:28,932 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-13 23:01:28,942 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-13 23:01:32,283 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:01:32,284 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:01:32,285 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:01:32,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:01:32,290 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:01:32,291 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:01:32,293 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:01:32,294 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:01:32,295 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:01:32,327 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:01:32,328 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:01:32,329 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:01:32,340 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:01:32,341 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:01:32,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:01:32,345 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:01:32,346 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:01:32,346 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:01:32,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:01:32,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:01:32,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:01:32,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:01:32,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:01:32,353 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:01:32,713 INFO L356 Elim1Store]: treesize reduction 601, result has 19.7 percent of original size [2022-07-13 23:01:32,713 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 25 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 29 case distinctions, treesize of input 83 treesize of output 193 [2022-07-13 23:01:32,760 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 13 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2022-07-13 23:01:32,780 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 13 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2022-07-13 23:01:35,795 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-13 23:01:35,798 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-13 23:01:35,822 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 47 [2022-07-13 23:01:36,494 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-07-13 23:01:43,237 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:01:43,238 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:01:43,239 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:01:43,243 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-13 23:01:43,262 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-07-13 23:01:47,345 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:01:47,346 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:01:47,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:01:47,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:01:47,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:01:47,353 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:01:47,366 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-13 23:01:47,366 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 11 [2022-07-13 23:01:47,372 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-13 23:01:47,375 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-13 23:01:48,017 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-07-13 23:02:01,782 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:02:01,784 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:02:01,786 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:02:01,788 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:02:01,789 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:02:01,790 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:02:01,791 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:02:01,792 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:02:01,793 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:02:01,808 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:02:01,810 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:02:01,812 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:02:01,814 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:02:01,815 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:02:01,815 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:02:01,816 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:02:01,817 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:02:01,818 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:02:01,888 INFO L356 Elim1Store]: treesize reduction 112, result has 15.8 percent of original size [2022-07-13 23:02:01,889 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 49 treesize of output 52 [2022-07-13 23:02:01,905 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-13 23:02:01,928 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-13 23:02:10,970 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:02:10,972 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:02:10,972 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:02:10,974 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:02:10,975 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:02:10,976 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:02:10,977 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:02:10,978 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:02:10,979 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:02:11,010 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:02:11,012 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:02:11,012 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:02:11,030 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:02:11,031 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:02:11,032 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:02:11,038 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:02:11,039 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:02:11,040 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:02:11,041 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:02:11,042 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:02:11,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:02:11,044 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:02:11,046 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:02:11,046 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:02:11,047 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:02:11,048 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:02:11,049 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:02:11,050 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:02:11,051 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:02:11,052 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:02:11,053 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:02:11,054 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:02:11,054 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:02:11,742 INFO L356 Elim1Store]: treesize reduction 784, result has 20.2 percent of original size [2022-07-13 23:02:11,752 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 11 select indices, 11 select index equivalence classes, 52 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 41 case distinctions, treesize of input 126 treesize of output 275 [2022-07-13 23:02:11,816 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 19 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2022-07-13 23:02:11,862 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 19 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2022-07-13 23:02:28,645 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-13 23:02:28,679 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 10 select indices, 10 select index equivalence classes, 45 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 53 [2022-07-13 23:02:28,700 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-13 23:02:30,901 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-13 23:02:30,901 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 19 [2022-07-13 23:02:30,927 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-07-13 23:02:46,544 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:02:46,546 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:02:46,549 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:02:46,566 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:02:46,568 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:02:46,586 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-13 23:02:46,586 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 22 [2022-07-13 23:02:46,611 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-07-13 23:02:55,863 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:02:55,864 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:02:55,865 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:02:55,869 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:02:55,872 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:02:55,875 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:02:55,891 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:02:55,893 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:02:55,895 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:02:55,896 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:02:55,918 INFO L356 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-07-13 23:02:55,918 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 29 [2022-07-13 23:02:55,925 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-13 23:02:55,929 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-13 23:02:55,950 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9