./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/heap-data/packet_filter.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 839c364b 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/heap-data/packet_filter.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-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 32bit --witnessprinter.graph.data.programhash d604fdd8f7c4d34db0106d8a0ff422218ae80e9ee6eb03f691b84d2fcc8ad49f --- Real Ultimate output --- This is Ultimate 0.2.2-839c364b5d67a0f615c82cb70ab247790648d4a9-839c364 [2021-12-14 13:44:08,712 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-14 13:44:08,714 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-14 13:44:08,767 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-14 13:44:08,767 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-14 13:44:08,770 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-14 13:44:08,771 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-14 13:44:08,775 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-14 13:44:08,776 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-14 13:44:08,779 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-14 13:44:08,780 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-14 13:44:08,781 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-14 13:44:08,781 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-14 13:44:08,783 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-14 13:44:08,784 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-14 13:44:08,788 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-14 13:44:08,789 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-14 13:44:08,790 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-14 13:44:08,792 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-14 13:44:08,795 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-14 13:44:08,796 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-14 13:44:08,797 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-14 13:44:08,798 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-14 13:44:08,798 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-14 13:44:08,802 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-14 13:44:08,803 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-14 13:44:08,803 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-14 13:44:08,804 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-14 13:44:08,804 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-14 13:44:08,805 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-14 13:44:08,805 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-14 13:44:08,805 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-14 13:44:08,807 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-14 13:44:08,807 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-14 13:44:08,808 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-14 13:44:08,808 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-14 13:44:08,809 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-14 13:44:08,809 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-14 13:44:08,809 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-14 13:44:08,810 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-14 13:44:08,810 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-14 13:44:08,811 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-14 13:44:08,833 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-14 13:44:08,833 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-14 13:44:08,833 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-14 13:44:08,833 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-14 13:44:08,834 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-14 13:44:08,834 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-14 13:44:08,835 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-14 13:44:08,835 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-14 13:44:08,835 INFO L138 SettingsManager]: * Use SBE=true [2021-12-14 13:44:08,835 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-14 13:44:08,836 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-14 13:44:08,836 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-14 13:44:08,836 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-14 13:44:08,836 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-14 13:44:08,836 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-14 13:44:08,837 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-14 13:44:08,837 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-14 13:44:08,837 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-14 13:44:08,837 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-14 13:44:08,837 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-14 13:44:08,837 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-14 13:44:08,837 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-14 13:44:08,838 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-14 13:44:08,838 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-14 13:44:08,838 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 13:44:08,838 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-14 13:44:08,838 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-14 13:44:08,839 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-14 13:44:08,839 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-14 13:44:08,839 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-14 13:44:08,840 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-14 13:44:08,840 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-14 13:44:08,840 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-14 13:44:08,840 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-14 13:44:08,840 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d604fdd8f7c4d34db0106d8a0ff422218ae80e9ee6eb03f691b84d2fcc8ad49f [2021-12-14 13:44:09,037 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-14 13:44:09,050 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-14 13:44:09,052 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-14 13:44:09,054 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-14 13:44:09,054 INFO L275 PluginConnector]: CDTParser initialized [2021-12-14 13:44:09,055 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/heap-data/packet_filter.i [2021-12-14 13:44:09,108 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba42358c5/49c306c4f5af41bca81c40127b7f279e/FLAG4f41df68f [2021-12-14 13:44:09,497 INFO L306 CDTParser]: Found 1 translation units. [2021-12-14 13:44:09,498 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-data/packet_filter.i [2021-12-14 13:44:09,507 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba42358c5/49c306c4f5af41bca81c40127b7f279e/FLAG4f41df68f [2021-12-14 13:44:09,516 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba42358c5/49c306c4f5af41bca81c40127b7f279e [2021-12-14 13:44:09,518 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-14 13:44:09,519 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-14 13:44:09,523 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-14 13:44:09,524 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-14 13:44:09,526 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-14 13:44:09,526 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 01:44:09" (1/1) ... [2021-12-14 13:44:09,527 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@711e8882 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:44:09, skipping insertion in model container [2021-12-14 13:44:09,527 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 01:44:09" (1/1) ... [2021-12-14 13:44:09,531 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-14 13:44:09,565 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-14 13:44:09,746 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/heap-data/packet_filter.i[23925,23938] [2021-12-14 13:44:09,756 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/heap-data/packet_filter.i[24159,24172] [2021-12-14 13:44:09,763 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 13:44:09,771 INFO L203 MainTranslator]: Completed pre-run [2021-12-14 13:44:09,804 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/heap-data/packet_filter.i[23925,23938] [2021-12-14 13:44:09,805 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/heap-data/packet_filter.i[24159,24172] [2021-12-14 13:44:09,809 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 13:44:09,826 INFO L208 MainTranslator]: Completed translation [2021-12-14 13:44:09,826 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:44:09 WrapperNode [2021-12-14 13:44:09,826 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-14 13:44:09,827 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-14 13:44:09,827 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-14 13:44:09,827 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-14 13:44:09,831 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:44:09" (1/1) ... [2021-12-14 13:44:09,842 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:44:09" (1/1) ... [2021-12-14 13:44:09,860 INFO L137 Inliner]: procedures = 130, calls = 86, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 160 [2021-12-14 13:44:09,860 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-14 13:44:09,862 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-14 13:44:09,862 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-14 13:44:09,862 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-14 13:44:09,867 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:44:09" (1/1) ... [2021-12-14 13:44:09,867 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:44:09" (1/1) ... [2021-12-14 13:44:09,871 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:44:09" (1/1) ... [2021-12-14 13:44:09,874 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:44:09" (1/1) ... [2021-12-14 13:44:09,880 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:44:09" (1/1) ... [2021-12-14 13:44:09,883 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:44:09" (1/1) ... [2021-12-14 13:44:09,884 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:44:09" (1/1) ... [2021-12-14 13:44:09,887 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-14 13:44:09,896 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-14 13:44:09,897 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-14 13:44:09,897 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-14 13:44:09,898 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:44:09" (1/1) ... [2021-12-14 13:44:09,904 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 13:44:09,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 13:44:09,920 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) [2021-12-14 13:44:09,921 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 [2021-12-14 13:44:09,945 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-14 13:44:09,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-14 13:44:09,945 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-14 13:44:09,949 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-14 13:44:09,949 INFO L130 BoogieDeclarations]: Found specification of procedure append_to_queue [2021-12-14 13:44:09,949 INFO L138 BoogieDeclarations]: Found implementation of procedure append_to_queue [2021-12-14 13:44:09,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-14 13:44:09,949 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-14 13:44:09,949 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-14 13:44:09,949 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_charp [2021-12-14 13:44:09,949 INFO L130 BoogieDeclarations]: Found specification of procedure send [2021-12-14 13:44:09,950 INFO L138 BoogieDeclarations]: Found implementation of procedure send [2021-12-14 13:44:09,950 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-14 13:44:09,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-12-14 13:44:09,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-14 13:44:09,950 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-14 13:44:09,950 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-14 13:44:10,037 INFO L236 CfgBuilder]: Building ICFG [2021-12-14 13:44:10,038 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-14 13:44:10,297 INFO L277 CfgBuilder]: Performing block encoding [2021-12-14 13:44:10,302 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-14 13:44:10,302 INFO L301 CfgBuilder]: Removed 3 assume(true) statements. [2021-12-14 13:44:10,303 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 01:44:10 BoogieIcfgContainer [2021-12-14 13:44:10,303 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-14 13:44:10,304 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-14 13:44:10,304 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-14 13:44:10,307 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-14 13:44:10,307 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 01:44:09" (1/3) ... [2021-12-14 13:44:10,309 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49ec8b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 01:44:10, skipping insertion in model container [2021-12-14 13:44:10,309 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:44:09" (2/3) ... [2021-12-14 13:44:10,309 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49ec8b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 01:44:10, skipping insertion in model container [2021-12-14 13:44:10,310 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 01:44:10" (3/3) ... [2021-12-14 13:44:10,310 INFO L111 eAbstractionObserver]: Analyzing ICFG packet_filter.i [2021-12-14 13:44:10,313 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-14 13:44:10,314 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-12-14 13:44:10,342 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-14 13:44:10,349 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-14 13:44:10,350 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-12-14 13:44:10,368 INFO L276 IsEmpty]: Start isEmpty. Operand has 47 states, 37 states have (on average 1.4324324324324325) internal successors, (53), 39 states have internal predecessors, (53), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-12-14 13:44:10,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-12-14 13:44:10,377 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:44:10,377 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:44:10,377 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:44:10,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:44:10,385 INFO L85 PathProgramCache]: Analyzing trace with hash -1910004341, now seen corresponding path program 1 times [2021-12-14 13:44:10,391 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:44:10,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066060560] [2021-12-14 13:44:10,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:44:10,393 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:44:10,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:44:10,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 13:44:10,515 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:44:10,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066060560] [2021-12-14 13:44:10,516 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066060560] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 13:44:10,517 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 13:44:10,517 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-14 13:44:10,518 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276915699] [2021-12-14 13:44:10,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 13:44:10,521 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-14 13:44:10,522 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:44:10,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-14 13:44:10,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-14 13:44:10,545 INFO L87 Difference]: Start difference. First operand has 47 states, 37 states have (on average 1.4324324324324325) internal successors, (53), 39 states have internal predecessors, (53), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:44:10,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:44:10,563 INFO L93 Difference]: Finished difference Result 74 states and 98 transitions. [2021-12-14 13:44:10,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-14 13:44:10,564 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2021-12-14 13:44:10,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:44:10,570 INFO L225 Difference]: With dead ends: 74 [2021-12-14 13:44:10,571 INFO L226 Difference]: Without dead ends: 43 [2021-12-14 13:44:10,573 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-14 13:44:10,575 INFO L933 BasicCegarLoop]: 58 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 13:44:10,576 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 13:44:10,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2021-12-14 13:44:10,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2021-12-14 13:44:10,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 35 states have internal predecessors, (44), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-12-14 13:44:10,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 54 transitions. [2021-12-14 13:44:10,608 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 54 transitions. Word has length 8 [2021-12-14 13:44:10,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:44:10,609 INFO L470 AbstractCegarLoop]: Abstraction has 43 states and 54 transitions. [2021-12-14 13:44:10,609 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:44:10,609 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 54 transitions. [2021-12-14 13:44:10,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-12-14 13:44:10,610 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:44:10,610 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:44:10,610 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-14 13:44:10,611 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:44:10,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:44:10,613 INFO L85 PathProgramCache]: Analyzing trace with hash -1345079117, now seen corresponding path program 1 times [2021-12-14 13:44:10,613 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:44:10,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255590821] [2021-12-14 13:44:10,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:44:10,614 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:44:10,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:44:10,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 13:44:10,721 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:44:10,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255590821] [2021-12-14 13:44:10,721 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255590821] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 13:44:10,722 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 13:44:10,722 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-14 13:44:10,723 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224880627] [2021-12-14 13:44:10,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 13:44:10,724 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-14 13:44:10,724 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:44:10,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-14 13:44:10,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-14 13:44:10,726 INFO L87 Difference]: Start difference. First operand 43 states and 54 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:44:10,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:44:10,828 INFO L93 Difference]: Finished difference Result 77 states and 96 transitions. [2021-12-14 13:44:10,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-14 13:44:10,836 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2021-12-14 13:44:10,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:44:10,840 INFO L225 Difference]: With dead ends: 77 [2021-12-14 13:44:10,840 INFO L226 Difference]: Without dead ends: 55 [2021-12-14 13:44:10,842 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-14 13:44:10,845 INFO L933 BasicCegarLoop]: 50 mSDtfsCounter, 29 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 13:44:10,845 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 124 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 13:44:10,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2021-12-14 13:44:10,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 47. [2021-12-14 13:44:10,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 38 states have (on average 1.2894736842105263) internal successors, (49), 39 states have internal predecessors, (49), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-12-14 13:44:10,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 59 transitions. [2021-12-14 13:44:10,854 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 59 transitions. Word has length 9 [2021-12-14 13:44:10,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:44:10,858 INFO L470 AbstractCegarLoop]: Abstraction has 47 states and 59 transitions. [2021-12-14 13:44:10,859 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:44:10,859 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 59 transitions. [2021-12-14 13:44:10,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-14 13:44:10,860 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:44:10,860 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:44:10,860 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-14 13:44:10,861 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:44:10,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:44:10,861 INFO L85 PathProgramCache]: Analyzing trace with hash 124171370, now seen corresponding path program 1 times [2021-12-14 13:44:10,861 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:44:10,862 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704726047] [2021-12-14 13:44:10,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:44:10,862 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:44:10,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:44:10,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 13:44:10,928 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:44:10,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704726047] [2021-12-14 13:44:10,929 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704726047] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 13:44:10,929 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 13:44:10,929 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-14 13:44:10,929 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421246333] [2021-12-14 13:44:10,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 13:44:10,930 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-14 13:44:10,930 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:44:10,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-14 13:44:10,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-14 13:44:10,931 INFO L87 Difference]: Start difference. First operand 47 states and 59 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:44:11,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:44:11,022 INFO L93 Difference]: Finished difference Result 61 states and 74 transitions. [2021-12-14 13:44:11,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-14 13:44:11,023 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-12-14 13:44:11,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:44:11,024 INFO L225 Difference]: With dead ends: 61 [2021-12-14 13:44:11,024 INFO L226 Difference]: Without dead ends: 45 [2021-12-14 13:44:11,024 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-14 13:44:11,025 INFO L933 BasicCegarLoop]: 51 mSDtfsCounter, 1 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 13:44:11,025 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 137 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 13:44:11,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2021-12-14 13:44:11,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2021-12-14 13:44:11,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 37 states have internal predecessors, (46), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-12-14 13:44:11,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 56 transitions. [2021-12-14 13:44:11,036 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 56 transitions. Word has length 11 [2021-12-14 13:44:11,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:44:11,037 INFO L470 AbstractCegarLoop]: Abstraction has 45 states and 56 transitions. [2021-12-14 13:44:11,037 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:44:11,037 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 56 transitions. [2021-12-14 13:44:11,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-14 13:44:11,038 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:44:11,038 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:44:11,039 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-14 13:44:11,039 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:44:11,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:44:11,040 INFO L85 PathProgramCache]: Analyzing trace with hash 959773065, now seen corresponding path program 1 times [2021-12-14 13:44:11,040 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:44:11,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586623430] [2021-12-14 13:44:11,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:44:11,041 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:44:11,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:44:11,215 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 13:44:11,216 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:44:11,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586623430] [2021-12-14 13:44:11,216 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586623430] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 13:44:11,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1625446355] [2021-12-14 13:44:11,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:44:11,218 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 13:44:11,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 13:44:11,220 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) [2021-12-14 13:44:11,223 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-14 13:44:11,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:44:11,311 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 40 conjunts are in the unsatisfiable core [2021-12-14 13:44:11,315 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 13:44:11,363 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 13:44:11,364 INFO L388 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 1 case distinctions, treesize of input 19 treesize of output 18 [2021-12-14 13:44:11,436 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-14 13:44:11,437 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 14 treesize of output 20 [2021-12-14 13:44:11,443 INFO L388 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 [2021-12-14 13:44:11,487 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-14 13:44:11,488 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 14 treesize of output 20 [2021-12-14 13:44:11,499 INFO L388 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 [2021-12-14 13:44:11,515 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-14 13:44:11,516 INFO L388 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 15 [2021-12-14 13:44:11,546 INFO L388 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 [2021-12-14 13:44:11,550 INFO L388 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 [2021-12-14 13:44:11,588 INFO L388 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 15 treesize of output 7 [2021-12-14 13:44:11,593 INFO L388 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 15 treesize of output 7 [2021-12-14 13:44:11,600 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 13:44:11,600 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 13:44:11,655 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_83 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_receive_~#packet~0#1.base| v_ArrVal_83) |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0)) (forall ((v_ArrVal_84 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_receive_~#packet~0#1.base| v_ArrVal_84) |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0))) is different from false [2021-12-14 13:44:11,808 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 13:44:11,808 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1625446355] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 13:44:11,809 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 13:44:11,809 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 8 [2021-12-14 13:44:11,809 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273590242] [2021-12-14 13:44:11,810 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 13:44:11,811 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-14 13:44:11,811 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:44:11,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-14 13:44:11,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=29, Unknown=1, NotChecked=10, Total=56 [2021-12-14 13:44:11,812 INFO L87 Difference]: Start difference. First operand 45 states and 56 transitions. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:44:11,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:44:11,991 INFO L93 Difference]: Finished difference Result 90 states and 116 transitions. [2021-12-14 13:44:11,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-14 13:44:11,992 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-12-14 13:44:11,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:44:11,993 INFO L225 Difference]: With dead ends: 90 [2021-12-14 13:44:11,993 INFO L226 Difference]: Without dead ends: 68 [2021-12-14 13:44:11,993 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=59, Unknown=1, NotChecked=16, Total=110 [2021-12-14 13:44:11,994 INFO L933 BasicCegarLoop]: 48 mSDtfsCounter, 37 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 86 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 13:44:11,994 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 230 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 73 Invalid, 0 Unknown, 86 Unchecked, 0.1s Time] [2021-12-14 13:44:11,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2021-12-14 13:44:11,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 54. [2021-12-14 13:44:11,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 45 states have (on average 1.288888888888889) internal successors, (58), 46 states have internal predecessors, (58), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-12-14 13:44:12,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 68 transitions. [2021-12-14 13:44:12,000 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 68 transitions. Word has length 16 [2021-12-14 13:44:12,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:44:12,000 INFO L470 AbstractCegarLoop]: Abstraction has 54 states and 68 transitions. [2021-12-14 13:44:12,000 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:44:12,000 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 68 transitions. [2021-12-14 13:44:12,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-12-14 13:44:12,001 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:44:12,001 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:44:12,019 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-14 13:44:12,209 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 13:44:12,210 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:44:12,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:44:12,210 INFO L85 PathProgramCache]: Analyzing trace with hash -1116006464, now seen corresponding path program 1 times [2021-12-14 13:44:12,210 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:44:12,211 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564793670] [2021-12-14 13:44:12,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:44:12,211 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:44:12,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:44:12,308 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 13:44:12,308 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:44:12,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564793670] [2021-12-14 13:44:12,308 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564793670] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 13:44:12,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [501237682] [2021-12-14 13:44:12,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:44:12,309 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 13:44:12,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 13:44:12,310 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) [2021-12-14 13:44:12,311 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-14 13:44:12,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:44:12,388 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 36 conjunts are in the unsatisfiable core [2021-12-14 13:44:12,391 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 13:44:12,404 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-14 13:44:12,405 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 9 treesize of output 15 [2021-12-14 13:44:12,435 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-14 13:44:12,435 INFO L388 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 15 [2021-12-14 13:44:12,441 INFO L388 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 [2021-12-14 13:44:12,447 INFO L388 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 [2021-12-14 13:44:12,478 INFO L388 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 [2021-12-14 13:44:12,482 INFO L388 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 [2021-12-14 13:44:12,523 INFO L388 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 15 treesize of output 7 [2021-12-14 13:44:12,525 INFO L388 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 15 treesize of output 7 [2021-12-14 13:44:12,530 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 13:44:12,531 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 13:44:12,571 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_150 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_receive_~#packet~0#1.base| v_ArrVal_150) |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) |c_ULTIMATE.start_main_~#normal_queue~0#1.offset|) 0)) (forall ((v_ArrVal_152 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_receive_~#packet~0#1.base| v_ArrVal_152) |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) |c_ULTIMATE.start_main_~#normal_queue~0#1.offset|) 0))) is different from false [2021-12-14 13:44:12,605 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_receive_~#packet~0#1.base_10| Int) (|v_ULTIMATE.start_main_~#new_packet~0#1.base_15| Int)) (or (and (forall ((v_ArrVal_152 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_receive_~#packet~0#1.base_10| v_ArrVal_152) |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) |c_ULTIMATE.start_main_~#normal_queue~0#1.offset|) 0)) (forall ((v_ArrVal_150 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_receive_~#packet~0#1.base_10| v_ArrVal_150) |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) |c_ULTIMATE.start_main_~#normal_queue~0#1.offset|) 0))) (not (= (select (store |c_#valid| |v_ULTIMATE.start_main_~#new_packet~0#1.base_15| 1) |v_ULTIMATE.start_receive_~#packet~0#1.base_10|) 0)))) is different from false [2021-12-14 13:44:12,652 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2021-12-14 13:44:12,653 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [501237682] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 13:44:12,653 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 13:44:12,653 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 8 [2021-12-14 13:44:12,653 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532777173] [2021-12-14 13:44:12,653 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 13:44:12,654 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-14 13:44:12,654 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:44:12,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-14 13:44:12,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=21, Unknown=2, NotChecked=18, Total=56 [2021-12-14 13:44:12,655 INFO L87 Difference]: Start difference. First operand 54 states and 68 transitions. Second operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:44:12,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:44:12,794 INFO L93 Difference]: Finished difference Result 74 states and 94 transitions. [2021-12-14 13:44:12,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 13:44:12,794 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-12-14 13:44:12,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:44:12,795 INFO L225 Difference]: With dead ends: 74 [2021-12-14 13:44:12,795 INFO L226 Difference]: Without dead ends: 58 [2021-12-14 13:44:12,795 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=47, Unknown=3, NotChecked=30, Total=110 [2021-12-14 13:44:12,796 INFO L933 BasicCegarLoop]: 49 mSDtfsCounter, 9 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 60 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 13:44:12,796 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 225 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 65 Invalid, 0 Unknown, 60 Unchecked, 0.1s Time] [2021-12-14 13:44:12,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2021-12-14 13:44:12,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 52. [2021-12-14 13:44:12,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 43 states have (on average 1.2790697674418605) internal successors, (55), 44 states have internal predecessors, (55), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-12-14 13:44:12,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 65 transitions. [2021-12-14 13:44:12,800 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 65 transitions. Word has length 18 [2021-12-14 13:44:12,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:44:12,800 INFO L470 AbstractCegarLoop]: Abstraction has 52 states and 65 transitions. [2021-12-14 13:44:12,801 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:44:12,801 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 65 transitions. [2021-12-14 13:44:12,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-12-14 13:44:12,801 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:44:12,801 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:44:12,820 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-12-14 13:44:13,011 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 13:44:13,011 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:44:13,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:44:13,012 INFO L85 PathProgramCache]: Analyzing trace with hash -2078493544, now seen corresponding path program 1 times [2021-12-14 13:44:13,012 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:44:13,012 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037384465] [2021-12-14 13:44:13,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:44:13,012 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:44:13,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:44:13,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-14 13:44:13,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:44:13,123 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 13:44:13,123 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:44:13,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037384465] [2021-12-14 13:44:13,123 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037384465] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 13:44:13,124 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 13:44:13,124 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-14 13:44:13,124 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307041096] [2021-12-14 13:44:13,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 13:44:13,125 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-14 13:44:13,125 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:44:13,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-14 13:44:13,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-14 13:44:13,125 INFO L87 Difference]: Start difference. First operand 52 states and 65 transitions. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-14 13:44:13,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:44:13,311 INFO L93 Difference]: Finished difference Result 132 states and 168 transitions. [2021-12-14 13:44:13,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 13:44:13,311 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2021-12-14 13:44:13,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:44:13,312 INFO L225 Difference]: With dead ends: 132 [2021-12-14 13:44:13,312 INFO L226 Difference]: Without dead ends: 91 [2021-12-14 13:44:13,312 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-12-14 13:44:13,313 INFO L933 BasicCegarLoop]: 53 mSDtfsCounter, 35 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 13:44:13,313 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 272 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 13:44:13,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2021-12-14 13:44:13,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 59. [2021-12-14 13:44:13,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 50 states have (on average 1.28) internal successors, (64), 51 states have internal predecessors, (64), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-12-14 13:44:13,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 74 transitions. [2021-12-14 13:44:13,317 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 74 transitions. Word has length 22 [2021-12-14 13:44:13,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:44:13,317 INFO L470 AbstractCegarLoop]: Abstraction has 59 states and 74 transitions. [2021-12-14 13:44:13,317 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-14 13:44:13,317 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 74 transitions. [2021-12-14 13:44:13,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-12-14 13:44:13,318 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:44:13,318 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:44:13,318 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-14 13:44:13,318 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:44:13,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:44:13,318 INFO L85 PathProgramCache]: Analyzing trace with hash 222329046, now seen corresponding path program 1 times [2021-12-14 13:44:13,318 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:44:13,318 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350928764] [2021-12-14 13:44:13,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:44:13,319 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:44:13,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:44:13,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-14 13:44:13,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:44:13,591 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 13:44:13,592 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:44:13,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350928764] [2021-12-14 13:44:13,592 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350928764] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 13:44:13,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1245278740] [2021-12-14 13:44:13,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:44:13,592 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 13:44:13,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 13:44:13,593 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) [2021-12-14 13:44:13,594 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-14 13:44:13,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:44:13,739 INFO L263 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 63 conjunts are in the unsatisfiable core [2021-12-14 13:44:13,741 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 13:44:13,834 INFO L388 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 21 treesize of output 9 [2021-12-14 13:44:13,874 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 49 [2021-12-14 13:44:13,881 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 45 [2021-12-14 13:44:13,895 INFO L354 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2021-12-14 13:44:13,895 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 45 [2021-12-14 13:44:13,921 INFO L354 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2021-12-14 13:44:13,921 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 51 [2021-12-14 13:44:13,943 INFO L354 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2021-12-14 13:44:13,944 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 51 [2021-12-14 13:44:13,973 INFO L354 Elim1Store]: treesize reduction 20, result has 57.4 percent of original size [2021-12-14 13:44:13,973 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 42 [2021-12-14 13:44:13,984 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2021-12-14 13:44:14,019 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2021-12-14 13:44:14,028 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 11 [2021-12-14 13:44:14,038 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2021-12-14 13:44:14,115 INFO L388 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 [2021-12-14 13:44:14,151 INFO L388 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 [2021-12-14 13:44:14,171 INFO L388 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 11 treesize of output 7 [2021-12-14 13:44:14,198 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2021-12-14 13:44:14,203 INFO L388 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 [2021-12-14 13:44:14,240 INFO L388 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 [2021-12-14 13:44:14,276 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-12-14 13:44:14,277 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 42 [2021-12-14 13:44:14,280 INFO L388 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 30 treesize of output 22 [2021-12-14 13:44:14,430 INFO L388 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 34 treesize of output 22 [2021-12-14 13:44:14,437 INFO L388 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 15 treesize of output 7 [2021-12-14 13:44:14,480 INFO L388 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 39 treesize of output 27 [2021-12-14 13:44:14,494 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 13:44:14,494 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 13:44:14,724 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 13:44:14,724 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 70 treesize of output 56 [2021-12-14 13:44:14,734 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 13:44:14,734 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 54 [2021-12-14 13:44:14,753 INFO L354 Elim1Store]: treesize reduction 17, result has 70.7 percent of original size [2021-12-14 13:44:14,754 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 38 treesize of output 57 [2021-12-14 13:44:14,759 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-12-14 13:44:14,759 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 42 treesize of output 30 [2021-12-14 13:44:14,762 INFO L388 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 11 treesize of output 9 [2021-12-14 13:44:14,858 INFO L354 Elim1Store]: treesize reduction 14, result has 6.7 percent of original size [2021-12-14 13:44:14,859 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 70 treesize of output 1 [2021-12-14 13:44:14,936 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 13:44:14,937 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1245278740] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 13:44:14,937 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 13:44:14,937 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 10] total 25 [2021-12-14 13:44:14,937 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504319013] [2021-12-14 13:44:14,937 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 13:44:14,938 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-12-14 13:44:14,938 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:44:14,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-12-14 13:44:14,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=514, Unknown=0, NotChecked=0, Total=600 [2021-12-14 13:44:14,939 INFO L87 Difference]: Start difference. First operand 59 states and 74 transitions. Second operand has 25 states, 22 states have (on average 2.3636363636363638) internal successors, (52), 24 states have internal predecessors, (52), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-14 13:44:15,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:44:15,849 INFO L93 Difference]: Finished difference Result 149 states and 191 transitions. [2021-12-14 13:44:15,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-14 13:44:15,850 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 22 states have (on average 2.3636363636363638) internal successors, (52), 24 states have internal predecessors, (52), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 22 [2021-12-14 13:44:15,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:44:15,851 INFO L225 Difference]: With dead ends: 149 [2021-12-14 13:44:15,851 INFO L226 Difference]: Without dead ends: 104 [2021-12-14 13:44:15,851 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=213, Invalid=1047, Unknown=0, NotChecked=0, Total=1260 [2021-12-14 13:44:15,852 INFO L933 BasicCegarLoop]: 67 mSDtfsCounter, 160 mSDsluCounter, 696 mSDsCounter, 0 mSdLazyCounter, 716 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 763 SdHoareTripleChecker+Invalid, 757 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 716 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-12-14 13:44:15,852 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [164 Valid, 763 Invalid, 757 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 716 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-12-14 13:44:15,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2021-12-14 13:44:15,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 66. [2021-12-14 13:44:15,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 57 states have (on average 1.263157894736842) internal successors, (72), 58 states have internal predecessors, (72), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-12-14 13:44:15,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 82 transitions. [2021-12-14 13:44:15,857 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 82 transitions. Word has length 22 [2021-12-14 13:44:15,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:44:15,858 INFO L470 AbstractCegarLoop]: Abstraction has 66 states and 82 transitions. [2021-12-14 13:44:15,858 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 22 states have (on average 2.3636363636363638) internal successors, (52), 24 states have internal predecessors, (52), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-14 13:44:15,858 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 82 transitions. [2021-12-14 13:44:15,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-12-14 13:44:15,859 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:44:15,859 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:44:15,877 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-12-14 13:44:16,065 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 13:44:16,065 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:44:16,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:44:16,066 INFO L85 PathProgramCache]: Analyzing trace with hash -749095909, now seen corresponding path program 1 times [2021-12-14 13:44:16,066 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:44:16,066 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569790396] [2021-12-14 13:44:16,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:44:16,066 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:44:16,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:44:16,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 13:44:16,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:44:16,256 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 13:44:16,257 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:44:16,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569790396] [2021-12-14 13:44:16,257 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569790396] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 13:44:16,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [769532064] [2021-12-14 13:44:16,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:44:16,257 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 13:44:16,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 13:44:16,258 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) [2021-12-14 13:44:16,259 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-14 13:44:16,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:44:16,383 INFO L263 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 66 conjunts are in the unsatisfiable core [2021-12-14 13:44:16,385 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 13:44:16,490 INFO L388 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 17 treesize of output 9 [2021-12-14 13:44:16,530 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 49 [2021-12-14 13:44:16,535 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 45 [2021-12-14 13:44:16,547 INFO L354 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2021-12-14 13:44:16,547 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 45 [2021-12-14 13:44:16,567 INFO L354 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2021-12-14 13:44:16,567 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 51 [2021-12-14 13:44:16,589 INFO L354 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2021-12-14 13:44:16,590 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 51 [2021-12-14 13:44:16,596 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2021-12-14 13:44:16,602 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2021-12-14 13:44:16,630 INFO L354 Elim1Store]: treesize reduction 28, result has 58.2 percent of original size [2021-12-14 13:44:16,630 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 54 [2021-12-14 13:44:16,640 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2021-12-14 13:44:16,648 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 11 [2021-12-14 13:44:16,725 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2021-12-14 13:44:16,728 INFO L388 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 9 treesize of output 7 [2021-12-14 13:44:16,784 INFO L388 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 26 treesize of output 14 [2021-12-14 13:44:16,817 INFO L388 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 [2021-12-14 13:44:16,834 INFO L388 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 [2021-12-14 13:44:16,870 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:44:16,871 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2021-12-14 13:44:16,874 INFO L388 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 [2021-12-14 13:44:17,011 INFO L388 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 30 treesize of output 18 [2021-12-14 13:44:17,014 INFO L388 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 15 treesize of output 7 [2021-12-14 13:44:17,044 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 13:44:17,044 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 13:44:17,289 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 13:44:17,290 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 70 treesize of output 56 [2021-12-14 13:44:17,305 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 13:44:17,306 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 54 [2021-12-14 13:44:17,335 INFO L354 Elim1Store]: treesize reduction 17, result has 70.7 percent of original size [2021-12-14 13:44:17,336 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 38 treesize of output 57 [2021-12-14 13:44:17,344 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-12-14 13:44:17,344 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 42 treesize of output 30 [2021-12-14 13:44:17,347 INFO L388 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 11 treesize of output 9 [2021-12-14 13:44:17,440 INFO L354 Elim1Store]: treesize reduction 14, result has 6.7 percent of original size [2021-12-14 13:44:17,441 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 70 treesize of output 1 [2021-12-14 13:44:17,556 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 13:44:17,556 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [769532064] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 13:44:17,556 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 13:44:17,556 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 11] total 27 [2021-12-14 13:44:17,556 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269837990] [2021-12-14 13:44:17,556 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 13:44:17,556 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2021-12-14 13:44:17,557 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:44:17,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-12-14 13:44:17,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=596, Unknown=0, NotChecked=0, Total=702 [2021-12-14 13:44:17,557 INFO L87 Difference]: Start difference. First operand 66 states and 82 transitions. Second operand has 27 states, 24 states have (on average 2.375) internal successors, (57), 26 states have internal predecessors, (57), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-14 13:44:18,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:44:18,401 INFO L93 Difference]: Finished difference Result 87 states and 109 transitions. [2021-12-14 13:44:18,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-14 13:44:18,402 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 24 states have (on average 2.375) internal successors, (57), 26 states have internal predecessors, (57), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 23 [2021-12-14 13:44:18,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:44:18,402 INFO L225 Difference]: With dead ends: 87 [2021-12-14 13:44:18,403 INFO L226 Difference]: Without dead ends: 85 [2021-12-14 13:44:18,403 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=221, Invalid=1111, Unknown=0, NotChecked=0, Total=1332 [2021-12-14 13:44:18,404 INFO L933 BasicCegarLoop]: 34 mSDtfsCounter, 152 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 480 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 567 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 480 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 44 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-14 13:44:18,404 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [154 Valid, 366 Invalid, 567 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 480 Invalid, 0 Unknown, 44 Unchecked, 0.5s Time] [2021-12-14 13:44:18,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2021-12-14 13:44:18,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 72. [2021-12-14 13:44:18,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 63 states have (on average 1.2857142857142858) internal successors, (81), 64 states have internal predecessors, (81), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-12-14 13:44:18,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 91 transitions. [2021-12-14 13:44:18,409 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 91 transitions. Word has length 23 [2021-12-14 13:44:18,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:44:18,410 INFO L470 AbstractCegarLoop]: Abstraction has 72 states and 91 transitions. [2021-12-14 13:44:18,410 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 24 states have (on average 2.375) internal successors, (57), 26 states have internal predecessors, (57), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-14 13:44:18,410 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 91 transitions. [2021-12-14 13:44:18,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-12-14 13:44:18,411 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:44:18,411 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:44:18,430 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-12-14 13:44:18,623 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 13:44:18,623 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:44:18,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:44:18,624 INFO L85 PathProgramCache]: Analyzing trace with hash 1903920603, now seen corresponding path program 1 times [2021-12-14 13:44:18,624 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:44:18,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542186056] [2021-12-14 13:44:18,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:44:18,624 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:44:18,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:44:18,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 13:44:18,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:44:40,030 WARN L227 SmtUtils]: Spent 10.73s on a formula simplification that was a NOOP. DAG size: 152 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-14 13:44:52,033 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 13:44:52,033 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:44:52,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542186056] [2021-12-14 13:44:52,033 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542186056] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 13:44:52,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [189223595] [2021-12-14 13:44:52,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:44:52,034 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 13:44:52,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 13:44:52,035 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) [2021-12-14 13:44:52,035 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-14 13:44:52,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:44:52,194 INFO L263 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 81 conjunts are in the unsatisfiable core [2021-12-14 13:44:52,198 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 13:44:52,219 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 13:44:52,219 INFO L388 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 1 case distinctions, treesize of input 19 treesize of output 18 [2021-12-14 13:44:52,290 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-14 13:44:52,291 INFO L388 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 1 case distinctions, treesize of input 14 treesize of output 20 [2021-12-14 13:44:52,297 INFO L388 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 [2021-12-14 13:44:52,311 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-14 13:44:52,312 INFO L388 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 1 case distinctions, treesize of input 14 treesize of output 20 [2021-12-14 13:44:52,318 INFO L388 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 [2021-12-14 13:44:52,350 INFO L354 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2021-12-14 13:44:52,350 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 29 treesize of output 37 [2021-12-14 13:44:52,469 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2021-12-14 13:44:52,474 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 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 [2021-12-14 13:44:52,479 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 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 [2021-12-14 13:44:52,647 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2021-12-14 13:44:52,650 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-14 13:44:52,653 INFO L388 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 [2021-12-14 13:44:52,735 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1226 (Array Int Int)) (v_ArrVal_1225 (Array Int Int)) (v_ArrVal_1213 (Array Int Int)) (v_ArrVal_1212 (Array Int Int)) (v_ArrVal_1223 (Array Int Int)) (v_ArrVal_1222 (Array Int Int)) (|v_append_to_queue_~#p.base_31| Int) (append_to_queue_~node~0.base Int)) (and (= (select |c_old(#valid)| |v_append_to_queue_~#p.base_31|) 0) (< append_to_queue_~node~0.base |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.offset| (let ((.cse0 (store |c_old(#memory_$Pointer$.offset)| |v_append_to_queue_~#p.base_31| v_ArrVal_1212))) (store (store .cse0 append_to_queue_~node~0.base v_ArrVal_1226) |c_append_to_queue_#in~q.base| (store (select (store .cse0 append_to_queue_~node~0.base v_ArrVal_1222) |c_append_to_queue_#in~q.base|) |c_append_to_queue_#in~q.offset| 0)))) (= (store (store (store |c_old(#memory_$Pointer$.base)| |v_append_to_queue_~#p.base_31| v_ArrVal_1223) append_to_queue_~node~0.base v_ArrVal_1213) |c_append_to_queue_#in~q.base| v_ArrVal_1225) |c_#memory_$Pointer$.base|))) is different from true [2021-12-14 13:44:52,800 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:44:52,801 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:44:52,825 INFO L354 Elim1Store]: treesize reduction 33, result has 40.0 percent of original size [2021-12-14 13:44:52,825 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 37 [2021-12-14 13:44:52,833 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:44:52,834 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:44:52,888 INFO L354 Elim1Store]: treesize reduction 117, result has 35.4 percent of original size [2021-12-14 13:44:52,889 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 3 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 202 treesize of output 202 [2021-12-14 13:44:52,909 INFO L354 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2021-12-14 13:44:52,909 INFO L388 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 2 case distinctions, treesize of input 16 treesize of output 18 [2021-12-14 13:44:52,923 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2021-12-14 13:44:52,933 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2021-12-14 13:44:52,987 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-12-14 13:44:53,016 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:44:53,017 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 14 [2021-12-14 13:44:53,078 WARN L220 Elim1Store]: Array PQE input equivalent to false [2021-12-14 13:44:53,111 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-12-14 13:44:53,140 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-12-14 13:44:53,173 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:44:53,174 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2021-12-14 13:44:53,273 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:44:53,273 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 14 [2021-12-14 13:44:53,299 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-12-14 13:44:53,431 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 14 [2021-12-14 13:44:53,529 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:44:53,530 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 14 [2021-12-14 13:44:53,559 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:44:53,560 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:44:53,561 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2021-12-14 13:44:53,596 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-12-14 13:44:53,834 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2021-12-14 13:44:53,876 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2021-12-14 13:44:53,892 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:44:53,892 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 1 [2021-12-14 13:44:53,900 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:44:53,900 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 1 [2021-12-14 13:44:54,192 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:44:54,200 INFO L354 Elim1Store]: treesize reduction 9, result has 47.1 percent of original size [2021-12-14 13:44:54,200 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 39 treesize of output 37 [2021-12-14 13:44:54,213 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-14 13:44:54,214 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 29 treesize of output 24 [2021-12-14 13:44:54,224 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-12-14 13:44:54,224 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 66 treesize of output 54 [2021-12-14 13:44:54,350 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 15 treesize of output 7 [2021-12-14 13:44:54,353 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2021-12-14 13:44:54,359 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 13:44:54,360 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 13:44:56,628 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [189223595] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 13:44:56,628 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-14 13:44:56,628 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2021-12-14 13:44:56,629 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826364337] [2021-12-14 13:44:56,629 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-14 13:44:56,629 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-12-14 13:44:56,629 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:44:56,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-12-14 13:44:56,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=160, Unknown=2, NotChecked=26, Total=240 [2021-12-14 13:44:56,630 INFO L87 Difference]: Start difference. First operand 72 states and 91 transitions. Second operand has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 13 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 13:44:58,956 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse14 (@diff |c_old(#memory_$Pointer$.base)| |c_#memory_$Pointer$.base|)) (.cse15 (@diff |c_old(#memory_$Pointer$.offset)| |c_#memory_$Pointer$.offset|))) (let ((.cse5 (store |c_old(#memory_$Pointer$.offset)| .cse15 (select |c_#memory_$Pointer$.offset| .cse15))) (.cse17 (store |c_old(#memory_$Pointer$.base)| .cse14 (select |c_#memory_$Pointer$.base| .cse14)))) (let ((.cse16 (@diff .cse17 |c_#memory_$Pointer$.base|)) (.cse4 (@diff .cse5 |c_#memory_$Pointer$.offset|))) (let ((.cse26 (store .cse5 .cse4 (select |c_#memory_$Pointer$.offset| .cse4))) (.cse9 (store .cse17 .cse16 (select |c_#memory_$Pointer$.base| .cse16)))) (let ((.cse8 (@diff .cse9 |c_#memory_$Pointer$.base|)) (.cse25 (@diff .cse26 |c_#memory_$Pointer$.offset|))) (let ((.cse19 (store .cse26 .cse25 (select |c_#memory_$Pointer$.offset| .cse25))) (.cse7 (store .cse9 .cse8 (select |c_#memory_$Pointer$.base| .cse8)))) (let ((.cse6 (@diff .cse7 |c_#memory_$Pointer$.base|)) (.cse18 (@diff .cse19 |c_#memory_$Pointer$.offset|))) (let ((.cse24 (store .cse19 .cse18 (select |c_#memory_$Pointer$.offset| .cse18))) (.cse2 (store .cse7 .cse6 (select |c_#memory_$Pointer$.base| .cse6)))) (let ((.cse3 (@diff .cse2 |c_#memory_$Pointer$.base|)) (.cse23 (@diff .cse24 |c_#memory_$Pointer$.offset|))) (let ((.cse22 (store .cse24 .cse23 (select |c_#memory_$Pointer$.offset| .cse23))) (.cse12 (store .cse2 .cse3 (select |c_#memory_$Pointer$.base| .cse3)))) (let ((.cse13 (@diff .cse12 |c_#memory_$Pointer$.base|)) (.cse21 (@diff .cse22 |c_#memory_$Pointer$.offset|))) (let ((.cse10 (store .cse22 .cse21 (select |c_#memory_$Pointer$.offset| .cse21))) (.cse0 (store .cse12 .cse13 (select |c_#memory_$Pointer$.base| .cse13)))) (let ((.cse1 (@diff .cse0 |c_#memory_$Pointer$.base|)) (.cse11 (@diff .cse10 |c_#memory_$Pointer$.offset|))) (and (= |c_#memory_$Pointer$.base| (store .cse0 .cse1 (select |c_#memory_$Pointer$.base| .cse1))) (or (= .cse2 |c_#memory_$Pointer$.base|) (= .cse3 |c_append_to_queue_#in~q.base|) (= (select |c_old(#valid)| .cse3) 0) (<= (+ .cse3 1) |c_#StackHeapBarrier|)) (or (<= (+ .cse4 1) |c_#StackHeapBarrier|) (= (select |c_old(#valid)| .cse4) 0) (= |c_#memory_$Pointer$.offset| .cse5) (= |c_append_to_queue_#in~q.base| .cse4)) (or (= (select |c_old(#valid)| .cse6) 0) (= .cse7 |c_#memory_$Pointer$.base|) (= .cse6 |c_append_to_queue_#in~q.base|) (<= (+ .cse6 1) |c_#StackHeapBarrier|)) (or (= (select |c_old(#valid)| .cse8) 0) (<= (+ .cse8 1) |c_#StackHeapBarrier|) (= |c_append_to_queue_#in~q.base| .cse8) (= .cse9 |c_#memory_$Pointer$.base|)) (= |c_#memory_$Pointer$.offset| (store .cse10 .cse11 (select |c_#memory_$Pointer$.offset| .cse11))) (or (= |c_#memory_$Pointer$.base| .cse12) (<= (+ .cse13 1) |c_#StackHeapBarrier|) (= |c_append_to_queue_#in~q.base| .cse13) (= (select |c_old(#valid)| .cse13) 0)) (or (<= (+ .cse14 1) |c_#StackHeapBarrier|) (= |c_append_to_queue_#in~q.base| .cse14) (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= (select |c_old(#valid)| .cse14) 0)) (or (= (select |c_old(#valid)| .cse15) 0) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (<= (+ .cse15 1) |c_#StackHeapBarrier|) (= |c_append_to_queue_#in~q.base| .cse15)) (or (= (select |c_old(#valid)| .cse16) 0) (= |c_append_to_queue_#in~q.base| .cse16) (<= (+ .cse16 1) |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.base| .cse17)) (or (= (select |c_old(#valid)| .cse18) 0) (<= (+ .cse18 1) |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.offset| .cse19) (= |c_append_to_queue_#in~q.base| .cse18)) (or (<= (+ .cse1 1) |c_#StackHeapBarrier|) (= .cse0 |c_#memory_$Pointer$.base|) (= (select |c_old(#valid)| .cse1) 0) (= |c_append_to_queue_#in~q.base| .cse1)) (or (= |c_append_to_queue_#in~q.base| .cse11) (<= (+ .cse11 1) |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.offset| .cse10) (= 0 (select |c_old(#valid)| .cse11))) (exists ((v_ArrVal_1226 (Array Int Int)) (v_ArrVal_1225 (Array Int Int)) (v_ArrVal_1213 (Array Int Int)) (v_ArrVal_1212 (Array Int Int)) (v_ArrVal_1223 (Array Int Int)) (v_ArrVal_1222 (Array Int Int)) (|v_append_to_queue_~#p.base_31| Int) (append_to_queue_~node~0.base Int)) (and (= (select |c_old(#valid)| |v_append_to_queue_~#p.base_31|) 0) (< append_to_queue_~node~0.base |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.offset| (let ((.cse20 (store |c_old(#memory_$Pointer$.offset)| |v_append_to_queue_~#p.base_31| v_ArrVal_1212))) (store (store .cse20 append_to_queue_~node~0.base v_ArrVal_1226) |c_append_to_queue_#in~q.base| (store (select (store .cse20 append_to_queue_~node~0.base v_ArrVal_1222) |c_append_to_queue_#in~q.base|) |c_append_to_queue_#in~q.offset| 0)))) (= (store (store (store |c_old(#memory_$Pointer$.base)| |v_append_to_queue_~#p.base_31| v_ArrVal_1223) append_to_queue_~node~0.base v_ArrVal_1213) |c_append_to_queue_#in~q.base| v_ArrVal_1225) |c_#memory_$Pointer$.base|))) (or (= |c_append_to_queue_#in~q.base| .cse21) (= |c_#memory_$Pointer$.offset| .cse22) (= (select |c_old(#valid)| .cse21) 0) (<= (+ .cse21 1) |c_#StackHeapBarrier|)) (or (<= (+ .cse23 1) |c_#StackHeapBarrier|) (= |c_append_to_queue_#in~q.base| .cse23) (= (select |c_old(#valid)| .cse23) 0) (= |c_#memory_$Pointer$.offset| .cse24)) (or (= |c_append_to_queue_#in~q.base| .cse25) (= |c_#memory_$Pointer$.offset| .cse26) (<= (+ .cse25 1) |c_#StackHeapBarrier|) (= (select |c_old(#valid)| .cse25) 0)))))))))))))))) is different from true [2021-12-14 13:45:01,277 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.76s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-14 13:45:03,742 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 [] [2021-12-14 13:45:03,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:45:03,788 INFO L93 Difference]: Finished difference Result 108 states and 134 transitions. [2021-12-14 13:45:03,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-14 13:45:03,791 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 13 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 23 [2021-12-14 13:45:03,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:45:03,791 INFO L225 Difference]: With dead ends: 108 [2021-12-14 13:45:03,791 INFO L226 Difference]: Without dead ends: 85 [2021-12-14 13:45:03,792 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 15.6s TimeCoverageRelationStatistics Valid=73, Invalid=204, Unknown=3, NotChecked=62, Total=342 [2021-12-14 13:45:03,792 INFO L933 BasicCegarLoop]: 41 mSDtfsCounter, 23 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 79 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2021-12-14 13:45:03,792 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 192 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 66 Invalid, 1 Unknown, 79 Unchecked, 5.0s Time] [2021-12-14 13:45:03,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2021-12-14 13:45:03,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 84. [2021-12-14 13:45:03,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 73 states have (on average 1.273972602739726) internal successors, (93), 74 states have internal predecessors, (93), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-12-14 13:45:03,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 105 transitions. [2021-12-14 13:45:03,797 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 105 transitions. Word has length 23 [2021-12-14 13:45:03,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:45:03,798 INFO L470 AbstractCegarLoop]: Abstraction has 84 states and 105 transitions. [2021-12-14 13:45:03,798 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 13 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 13:45:03,798 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 105 transitions. [2021-12-14 13:45:03,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-12-14 13:45:03,798 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:45:03,799 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:45:03,820 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-12-14 13:45:04,010 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 13:45:04,010 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:45:04,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:45:04,011 INFO L85 PathProgramCache]: Analyzing trace with hash -1306051597, now seen corresponding path program 2 times [2021-12-14 13:45:04,011 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:45:04,011 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588768493] [2021-12-14 13:45:04,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:45:04,011 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:45:04,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:45:04,132 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-14 13:45:04,132 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:45:04,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588768493] [2021-12-14 13:45:04,133 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588768493] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 13:45:04,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [638034509] [2021-12-14 13:45:04,133 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-14 13:45:04,133 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 13:45:04,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 13:45:04,134 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) [2021-12-14 13:45:04,138 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-12-14 13:45:04,273 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-14 13:45:04,273 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-14 13:45:04,275 INFO L263 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 57 conjunts are in the unsatisfiable core [2021-12-14 13:45:04,281 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 13:45:04,295 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 13:45:04,295 INFO L388 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 1 case distinctions, treesize of input 19 treesize of output 18 [2021-12-14 13:45:04,318 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-14 13:45:04,318 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 14 treesize of output 20 [2021-12-14 13:45:04,323 INFO L388 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 [2021-12-14 13:45:04,348 INFO L354 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2021-12-14 13:45:04,348 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 29 treesize of output 37 [2021-12-14 13:45:04,357 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 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 [2021-12-14 13:45:04,405 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 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 [2021-12-14 13:45:04,408 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2021-12-14 13:45:04,411 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 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 [2021-12-14 13:45:04,455 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2021-12-14 13:45:04,480 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-14 13:45:04,480 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 14 treesize of output 20 [2021-12-14 13:45:04,485 INFO L388 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 [2021-12-14 13:45:04,500 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-14 13:45:04,501 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 14 treesize of output 20 [2021-12-14 13:45:04,505 INFO L388 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 [2021-12-14 13:45:04,517 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-14 13:45:04,517 INFO L388 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 15 [2021-12-14 13:45:04,534 INFO L388 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 [2021-12-14 13:45:04,536 INFO L388 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 [2021-12-14 13:45:04,564 INFO L388 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 15 treesize of output 7 [2021-12-14 13:45:04,566 INFO L388 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 15 treesize of output 7 [2021-12-14 13:45:04,574 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-14 13:45:04,575 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 13:45:04,626 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1379 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_receive_~#packet~0#1.base| v_ArrVal_1379) |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0)) (forall ((v_ArrVal_1381 (Array Int Int))) (= 0 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_receive_~#packet~0#1.base| v_ArrVal_1381) |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|)))) is different from false [2021-12-14 13:45:04,659 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_receive_~#packet~0#1.base_20| Int) (|v_ULTIMATE.start_main_~#new_packet~0#1.base_26| Int)) (or (and (forall ((v_ArrVal_1379 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_receive_~#packet~0#1.base_20| v_ArrVal_1379) |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0)) (forall ((v_ArrVal_1381 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_receive_~#packet~0#1.base_20| v_ArrVal_1381) |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0))) (not (= (select (store |c_#valid| |v_ULTIMATE.start_main_~#new_packet~0#1.base_26| 1) |v_ULTIMATE.start_receive_~#packet~0#1.base_20|) 0)))) is different from false [2021-12-14 13:45:04,717 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_receive_~#packet~0#1.base_20| Int) (v_ArrVal_1374 Int) (|v_ULTIMATE.start_main_~#new_packet~0#1.base_26| Int)) (or (and (forall ((v_ArrVal_1379 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_receive_~#packet~0#1.base_20| v_ArrVal_1379) |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0)) (forall ((v_ArrVal_1381 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_receive_~#packet~0#1.base_20| v_ArrVal_1381) |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0))) (not (= (select (store (store |c_#valid| |c_ULTIMATE.start_main_~#new_packet~0#1.base| v_ArrVal_1374) |v_ULTIMATE.start_main_~#new_packet~0#1.base_26| 1) |v_ULTIMATE.start_receive_~#packet~0#1.base_20|) 0)))) is different from false [2021-12-14 13:45:04,799 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_receive_~#packet~0#1.base_20| Int) (v_ArrVal_1374 Int) (v_ArrVal_1373 Int) (|v_ULTIMATE.start_main_~#new_packet~0#1.base_26| Int)) (or (not (= (select (store (store (store |c_#valid| |c_ULTIMATE.start_receive_~#packet~0#1.base| v_ArrVal_1373) |c_ULTIMATE.start_main_~#new_packet~0#1.base| v_ArrVal_1374) |v_ULTIMATE.start_main_~#new_packet~0#1.base_26| 1) |v_ULTIMATE.start_receive_~#packet~0#1.base_20|) 0)) (and (forall ((v_ArrVal_1369 (Array Int Int)) (v_ArrVal_1381 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_receive_~#packet~0#1.base| v_ArrVal_1369) |v_ULTIMATE.start_receive_~#packet~0#1.base_20| v_ArrVal_1381) |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0)) (forall ((v_ArrVal_1379 (Array Int Int)) (v_ArrVal_1372 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_receive_~#packet~0#1.base| v_ArrVal_1372) |v_ULTIMATE.start_receive_~#packet~0#1.base_20| v_ArrVal_1379) |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0))))) is different from false [2021-12-14 13:45:05,287 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2021-12-14 13:45:05,287 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [638034509] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 13:45:05,288 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 13:45:05,288 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 9] total 15 [2021-12-14 13:45:05,290 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445956677] [2021-12-14 13:45:05,290 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 13:45:05,291 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-12-14 13:45:05,291 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:45:05,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-12-14 13:45:05,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=73, Unknown=4, NotChecked=84, Total=210 [2021-12-14 13:45:05,292 INFO L87 Difference]: Start difference. First operand 84 states and 105 transitions. Second operand has 15 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 15 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:45:06,028 WARN L838 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_main_~#new_packet~0#1.base| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|)) (= 1 (select |c_#valid| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|)) (not (= |c_ULTIMATE.start_main_~#new_packet~0#1.base| |c_ULTIMATE.start_receive_~#packet~0#1.base|)) (not (= |c_ULTIMATE.start_main_~#prio_queue~0#1.base| |c_ULTIMATE.start_receive_~#packet~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_main_~#new_packet~0#1.base|) 1) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0) (forall ((|v_ULTIMATE.start_receive_~#packet~0#1.base_20| Int) (v_ArrVal_1374 Int) (v_ArrVal_1373 Int) (|v_ULTIMATE.start_main_~#new_packet~0#1.base_26| Int)) (or (not (= (select (store (store (store |c_#valid| |c_ULTIMATE.start_receive_~#packet~0#1.base| v_ArrVal_1373) |c_ULTIMATE.start_main_~#new_packet~0#1.base| v_ArrVal_1374) |v_ULTIMATE.start_main_~#new_packet~0#1.base_26| 1) |v_ULTIMATE.start_receive_~#packet~0#1.base_20|) 0)) (and (forall ((v_ArrVal_1369 (Array Int Int)) (v_ArrVal_1381 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_receive_~#packet~0#1.base| v_ArrVal_1369) |v_ULTIMATE.start_receive_~#packet~0#1.base_20| v_ArrVal_1381) |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0)) (forall ((v_ArrVal_1379 (Array Int Int)) (v_ArrVal_1372 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_receive_~#packet~0#1.base| v_ArrVal_1372) |v_ULTIMATE.start_receive_~#packet~0#1.base_20| v_ArrVal_1379) |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0)))))) is different from false [2021-12-14 13:45:06,555 WARN L838 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_main_~#new_packet~0#1.base| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|)) (= 1 (select |c_#valid| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|)) (forall ((|v_ULTIMATE.start_receive_~#packet~0#1.base_20| Int) (v_ArrVal_1374 Int) (|v_ULTIMATE.start_main_~#new_packet~0#1.base_26| Int)) (or (and (forall ((v_ArrVal_1379 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_receive_~#packet~0#1.base_20| v_ArrVal_1379) |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0)) (forall ((v_ArrVal_1381 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_receive_~#packet~0#1.base_20| v_ArrVal_1381) |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0))) (not (= (select (store (store |c_#valid| |c_ULTIMATE.start_main_~#new_packet~0#1.base| v_ArrVal_1374) |v_ULTIMATE.start_main_~#new_packet~0#1.base_26| 1) |v_ULTIMATE.start_receive_~#packet~0#1.base_20|) 0)))) (= (select |c_#valid| |c_ULTIMATE.start_main_~#new_packet~0#1.base|) 1) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0)) is different from false [2021-12-14 13:45:06,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:45:06,698 INFO L93 Difference]: Finished difference Result 127 states and 158 transitions. [2021-12-14 13:45:06,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 13:45:06,698 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 15 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-12-14 13:45:06,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:45:06,699 INFO L225 Difference]: With dead ends: 127 [2021-12-14 13:45:06,699 INFO L226 Difference]: Without dead ends: 104 [2021-12-14 13:45:06,699 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=59, Invalid=91, Unknown=6, NotChecked=150, Total=306 [2021-12-14 13:45:06,700 INFO L933 BasicCegarLoop]: 55 mSDtfsCounter, 21 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 163 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 13:45:06,700 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 365 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 80 Invalid, 0 Unknown, 163 Unchecked, 0.1s Time] [2021-12-14 13:45:06,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2021-12-14 13:45:06,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 94. [2021-12-14 13:45:06,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 83 states have (on average 1.2771084337349397) internal successors, (106), 84 states have internal predecessors, (106), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-12-14 13:45:06,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 118 transitions. [2021-12-14 13:45:06,705 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 118 transitions. Word has length 23 [2021-12-14 13:45:06,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:45:06,705 INFO L470 AbstractCegarLoop]: Abstraction has 94 states and 118 transitions. [2021-12-14 13:45:06,705 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 15 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:45:06,705 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 118 transitions. [2021-12-14 13:45:06,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-12-14 13:45:06,706 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:45:06,706 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:45:06,745 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-12-14 13:45:06,907 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 13:45:06,908 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:45:06,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:45:06,908 INFO L85 PathProgramCache]: Analyzing trace with hash -1047886159, now seen corresponding path program 1 times [2021-12-14 13:45:06,908 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:45:06,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330738092] [2021-12-14 13:45:06,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:45:06,908 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:45:06,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:45:07,039 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-14 13:45:07,039 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:45:07,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330738092] [2021-12-14 13:45:07,039 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330738092] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 13:45:07,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [463879289] [2021-12-14 13:45:07,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:45:07,040 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 13:45:07,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 13:45:07,052 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) [2021-12-14 13:45:07,053 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-12-14 13:45:07,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:45:07,192 INFO L263 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 57 conjunts are in the unsatisfiable core [2021-12-14 13:45:07,195 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 13:45:07,209 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 13:45:07,210 INFO L388 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 1 case distinctions, treesize of input 19 treesize of output 18 [2021-12-14 13:45:07,246 INFO L354 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2021-12-14 13:45:07,247 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 29 treesize of output 37 [2021-12-14 13:45:07,257 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 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 [2021-12-14 13:45:07,262 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 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 [2021-12-14 13:45:07,317 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 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 [2021-12-14 13:45:07,321 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 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 [2021-12-14 13:45:07,324 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2021-12-14 13:45:07,375 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2021-12-14 13:45:07,394 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-14 13:45:07,394 INFO L388 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 15 [2021-12-14 13:45:07,397 INFO L388 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 [2021-12-14 13:45:07,401 INFO L388 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 [2021-12-14 13:45:07,414 INFO L388 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 [2021-12-14 13:45:07,418 INFO L388 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 [2021-12-14 13:45:07,445 INFO L388 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 15 treesize of output 7 [2021-12-14 13:45:07,451 INFO L388 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 15 treesize of output 7 [2021-12-14 13:45:07,462 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-14 13:45:07,462 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 13:45:07,498 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1509 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_receive_~#packet~0#1.base| v_ArrVal_1509) |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0)) (forall ((v_ArrVal_1508 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_receive_~#packet~0#1.base| v_ArrVal_1508) |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0))) is different from false [2021-12-14 13:45:07,584 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~#new_packet~0#1.base_32| Int) (|v_ULTIMATE.start_receive_~#packet~0#1.base_26| Int) (v_ArrVal_1502 Int)) (or (not (= (select (store (store |c_#valid| |c_ULTIMATE.start_main_~#new_packet~0#1.base| v_ArrVal_1502) |v_ULTIMATE.start_main_~#new_packet~0#1.base_32| 1) |v_ULTIMATE.start_receive_~#packet~0#1.base_26|) 0)) (and (forall ((v_ArrVal_1508 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_receive_~#packet~0#1.base_26| v_ArrVal_1508) |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0)) (forall ((v_ArrVal_1509 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_receive_~#packet~0#1.base_26| v_ArrVal_1509) |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0))))) is different from false [2021-12-14 13:45:08,436 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~#new_packet~0#1.base_32| Int) (|v_ULTIMATE.start_receive_~#packet~0#1.base_26| Int) (v_ArrVal_1498 Int) (v_ArrVal_1502 Int)) (or (and (forall ((v_ArrVal_1501 (Array Int Int)) (v_ArrVal_1508 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_receive_~#packet~0#1.base| v_ArrVal_1501) |v_ULTIMATE.start_receive_~#packet~0#1.base_26| v_ArrVal_1508) |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0)) (forall ((v_ArrVal_1499 (Array Int Int)) (v_ArrVal_1509 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_receive_~#packet~0#1.base| v_ArrVal_1499) |v_ULTIMATE.start_receive_~#packet~0#1.base_26| v_ArrVal_1509) |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0))) (not (= (select (store (store (store |c_#valid| |c_ULTIMATE.start_receive_~#packet~0#1.base| v_ArrVal_1498) |c_ULTIMATE.start_main_~#new_packet~0#1.base| v_ArrVal_1502) |v_ULTIMATE.start_main_~#new_packet~0#1.base_32| 1) |v_ULTIMATE.start_receive_~#packet~0#1.base_26|) 0)))) is different from false [2021-12-14 13:45:08,674 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~#new_packet~0#1.base_34| Int) (|v_ULTIMATE.start_main_~#new_packet~0#1.base_32| Int) (|v_ULTIMATE.start_receive_~#packet~0#1.base_26| Int) (|v_ULTIMATE.start_receive_~#packet~0#1.base_28| Int) (v_ArrVal_1498 Int) (v_ArrVal_1502 Int)) (let ((.cse0 (store |c_#valid| |v_ULTIMATE.start_main_~#new_packet~0#1.base_34| 1))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~#new_packet~0#1.base_34|) 0)) (and (forall ((v_ArrVal_1501 (Array Int Int)) (v_ArrVal_1508 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_receive_~#packet~0#1.base_28| v_ArrVal_1501) |v_ULTIMATE.start_receive_~#packet~0#1.base_26| v_ArrVal_1508) |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0)) (forall ((v_ArrVal_1499 (Array Int Int)) (v_ArrVal_1509 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_receive_~#packet~0#1.base_28| v_ArrVal_1499) |v_ULTIMATE.start_receive_~#packet~0#1.base_26| v_ArrVal_1509) |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0))) (not (= (select .cse0 |v_ULTIMATE.start_receive_~#packet~0#1.base_28|) 0)) (not (= (select (store (store (store .cse0 |v_ULTIMATE.start_receive_~#packet~0#1.base_28| v_ArrVal_1498) |v_ULTIMATE.start_main_~#new_packet~0#1.base_34| v_ArrVal_1502) |v_ULTIMATE.start_main_~#new_packet~0#1.base_32| 1) |v_ULTIMATE.start_receive_~#packet~0#1.base_26|) 0))))) is different from false [2021-12-14 13:45:08,921 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2021-12-14 13:45:08,922 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [463879289] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 13:45:08,922 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 13:45:08,922 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 9] total 15 [2021-12-14 13:45:08,922 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068021725] [2021-12-14 13:45:08,922 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 13:45:08,923 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-12-14 13:45:08,923 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:45:08,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-12-14 13:45:08,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=73, Unknown=4, NotChecked=84, Total=210 [2021-12-14 13:45:08,924 INFO L87 Difference]: Start difference. First operand 94 states and 118 transitions. Second operand has 15 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 15 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:45:09,460 WARN L838 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_main_~#new_packet~0#1.base| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|)) (= 1 (select |c_#valid| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|)) (not (= |c_ULTIMATE.start_main_~#new_packet~0#1.base| |c_ULTIMATE.start_receive_~#packet~0#1.base|)) (forall ((v_ArrVal_1509 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_receive_~#packet~0#1.base| v_ArrVal_1509) |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0)) (not (= |c_ULTIMATE.start_main_~#prio_queue~0#1.base| |c_ULTIMATE.start_receive_~#packet~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_main_~#new_packet~0#1.base|) 1) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0) (forall ((|v_ULTIMATE.start_main_~#new_packet~0#1.base_32| Int) (|v_ULTIMATE.start_receive_~#packet~0#1.base_26| Int) (v_ArrVal_1498 Int) (v_ArrVal_1502 Int)) (or (and (forall ((v_ArrVal_1501 (Array Int Int)) (v_ArrVal_1508 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_receive_~#packet~0#1.base| v_ArrVal_1501) |v_ULTIMATE.start_receive_~#packet~0#1.base_26| v_ArrVal_1508) |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0)) (forall ((v_ArrVal_1499 (Array Int Int)) (v_ArrVal_1509 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_receive_~#packet~0#1.base| v_ArrVal_1499) |v_ULTIMATE.start_receive_~#packet~0#1.base_26| v_ArrVal_1509) |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0))) (not (= (select (store (store (store |c_#valid| |c_ULTIMATE.start_receive_~#packet~0#1.base| v_ArrVal_1498) |c_ULTIMATE.start_main_~#new_packet~0#1.base| v_ArrVal_1502) |v_ULTIMATE.start_main_~#new_packet~0#1.base_32| 1) |v_ULTIMATE.start_receive_~#packet~0#1.base_26|) 0)))) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0) (forall ((v_ArrVal_1508 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_receive_~#packet~0#1.base| v_ArrVal_1508) |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0))) is different from false [2021-12-14 13:45:09,974 WARN L838 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_main_~#new_packet~0#1.base| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|)) (= 1 (select |c_#valid| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|)) (not (= |c_ULTIMATE.start_main_~#new_packet~0#1.base| |c_ULTIMATE.start_receive_~#packet~0#1.base|)) (not (= |c_ULTIMATE.start_main_~#prio_queue~0#1.base| |c_ULTIMATE.start_receive_~#packet~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_main_~#new_packet~0#1.base|) 1) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0) (forall ((|v_ULTIMATE.start_main_~#new_packet~0#1.base_32| Int) (|v_ULTIMATE.start_receive_~#packet~0#1.base_26| Int) (v_ArrVal_1498 Int) (v_ArrVal_1502 Int)) (or (and (forall ((v_ArrVal_1501 (Array Int Int)) (v_ArrVal_1508 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_receive_~#packet~0#1.base| v_ArrVal_1501) |v_ULTIMATE.start_receive_~#packet~0#1.base_26| v_ArrVal_1508) |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0)) (forall ((v_ArrVal_1499 (Array Int Int)) (v_ArrVal_1509 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_receive_~#packet~0#1.base| v_ArrVal_1499) |v_ULTIMATE.start_receive_~#packet~0#1.base_26| v_ArrVal_1509) |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0))) (not (= (select (store (store (store |c_#valid| |c_ULTIMATE.start_receive_~#packet~0#1.base| v_ArrVal_1498) |c_ULTIMATE.start_main_~#new_packet~0#1.base| v_ArrVal_1502) |v_ULTIMATE.start_main_~#new_packet~0#1.base_32| 1) |v_ULTIMATE.start_receive_~#packet~0#1.base_26|) 0)))) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0)) is different from false [2021-12-14 13:45:10,620 WARN L838 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_main_~#new_packet~0#1.base| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|)) (= 1 (select |c_#valid| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_main_~#new_packet~0#1.base|) 1) (forall ((|v_ULTIMATE.start_main_~#new_packet~0#1.base_32| Int) (|v_ULTIMATE.start_receive_~#packet~0#1.base_26| Int) (v_ArrVal_1502 Int)) (or (not (= (select (store (store |c_#valid| |c_ULTIMATE.start_main_~#new_packet~0#1.base| v_ArrVal_1502) |v_ULTIMATE.start_main_~#new_packet~0#1.base_32| 1) |v_ULTIMATE.start_receive_~#packet~0#1.base_26|) 0)) (and (forall ((v_ArrVal_1508 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_receive_~#packet~0#1.base_26| v_ArrVal_1508) |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0)) (forall ((v_ArrVal_1509 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_receive_~#packet~0#1.base_26| v_ArrVal_1509) |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0))))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0)) is different from false [2021-12-14 13:45:10,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:45:10,740 INFO L93 Difference]: Finished difference Result 145 states and 181 transitions. [2021-12-14 13:45:10,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-14 13:45:10,741 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 15 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-12-14 13:45:10,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:45:10,741 INFO L225 Difference]: With dead ends: 145 [2021-12-14 13:45:10,742 INFO L226 Difference]: Without dead ends: 122 [2021-12-14 13:45:10,742 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 40 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=66, Invalid=111, Unknown=7, NotChecked=196, Total=380 [2021-12-14 13:45:10,743 INFO L933 BasicCegarLoop]: 59 mSDtfsCounter, 33 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 245 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 13:45:10,743 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 357 Invalid, 335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 84 Invalid, 0 Unknown, 245 Unchecked, 0.1s Time] [2021-12-14 13:45:10,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2021-12-14 13:45:10,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 97. [2021-12-14 13:45:10,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 86 states have (on average 1.2790697674418605) internal successors, (110), 87 states have internal predecessors, (110), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-12-14 13:45:10,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 122 transitions. [2021-12-14 13:45:10,756 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 122 transitions. Word has length 23 [2021-12-14 13:45:10,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:45:10,756 INFO L470 AbstractCegarLoop]: Abstraction has 97 states and 122 transitions. [2021-12-14 13:45:10,756 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 15 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:45:10,756 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 122 transitions. [2021-12-14 13:45:10,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-12-14 13:45:10,757 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:45:10,757 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:45:10,774 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-12-14 13:45:10,959 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 13:45:10,959 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:45:10,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:45:10,960 INFO L85 PathProgramCache]: Analyzing trace with hash -1130104883, now seen corresponding path program 1 times [2021-12-14 13:45:10,960 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:45:10,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340845623] [2021-12-14 13:45:10,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:45:10,960 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:45:10,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:45:11,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-14 13:45:11,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:45:11,040 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 13:45:11,041 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:45:11,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340845623] [2021-12-14 13:45:11,041 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340845623] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 13:45:11,041 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 13:45:11,041 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 13:45:11,041 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515962834] [2021-12-14 13:45:11,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 13:45:11,042 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 13:45:11,042 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:45:11,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 13:45:11,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-14 13:45:11,043 INFO L87 Difference]: Start difference. First operand 97 states and 122 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-14 13:45:11,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:45:11,233 INFO L93 Difference]: Finished difference Result 115 states and 142 transitions. [2021-12-14 13:45:11,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 13:45:11,233 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2021-12-14 13:45:11,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:45:11,234 INFO L225 Difference]: With dead ends: 115 [2021-12-14 13:45:11,234 INFO L226 Difference]: Without dead ends: 102 [2021-12-14 13:45:11,234 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-12-14 13:45:11,234 INFO L933 BasicCegarLoop]: 47 mSDtfsCounter, 13 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 13:45:11,234 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 182 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 13:45:11,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2021-12-14 13:45:11,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 97. [2021-12-14 13:45:11,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 86 states have (on average 1.255813953488372) internal successors, (108), 87 states have internal predecessors, (108), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-12-14 13:45:11,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 120 transitions. [2021-12-14 13:45:11,240 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 120 transitions. Word has length 24 [2021-12-14 13:45:11,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:45:11,241 INFO L470 AbstractCegarLoop]: Abstraction has 97 states and 120 transitions. [2021-12-14 13:45:11,242 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-14 13:45:11,242 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 120 transitions. [2021-12-14 13:45:11,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-12-14 13:45:11,242 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:45:11,242 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:45:11,243 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-14 13:45:11,243 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:45:11,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:45:11,243 INFO L85 PathProgramCache]: Analyzing trace with hash 1299971957, now seen corresponding path program 2 times [2021-12-14 13:45:11,243 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:45:11,243 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384823656] [2021-12-14 13:45:11,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:45:11,244 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:45:11,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:45:11,343 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-14 13:45:11,344 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:45:11,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384823656] [2021-12-14 13:45:11,344 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384823656] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 13:45:11,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1565856967] [2021-12-14 13:45:11,344 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-14 13:45:11,344 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 13:45:11,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 13:45:11,345 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 13:45:11,347 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-12-14 13:45:11,495 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-14 13:45:11,496 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-14 13:45:11,497 INFO L263 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 57 conjunts are in the unsatisfiable core [2021-12-14 13:45:11,501 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 13:45:11,515 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 13:45:11,515 INFO L388 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 1 case distinctions, treesize of input 19 treesize of output 18 [2021-12-14 13:45:11,546 INFO L354 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2021-12-14 13:45:11,547 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 29 treesize of output 37 [2021-12-14 13:45:11,556 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 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 [2021-12-14 13:45:11,559 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 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 [2021-12-14 13:45:11,597 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 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 [2021-12-14 13:45:11,600 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 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 [2021-12-14 13:45:11,602 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2021-12-14 13:45:11,648 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2021-12-14 13:45:11,671 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-14 13:45:11,671 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 14 treesize of output 20 [2021-12-14 13:45:11,674 INFO L388 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 [2021-12-14 13:45:11,687 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-14 13:45:11,687 INFO L388 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 15 [2021-12-14 13:45:11,691 INFO L388 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 [2021-12-14 13:45:11,707 INFO L388 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 [2021-12-14 13:45:11,709 INFO L388 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 [2021-12-14 13:45:11,747 INFO L388 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 15 treesize of output 7 [2021-12-14 13:45:11,749 INFO L388 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 15 treesize of output 7 [2021-12-14 13:45:11,755 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-14 13:45:11,755 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 13:45:11,786 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1796 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_receive_~#packet~0#1.base| v_ArrVal_1796) |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0)) (forall ((v_ArrVal_1799 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_receive_~#packet~0#1.base| v_ArrVal_1799) |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0))) is different from false [2021-12-14 13:45:11,868 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_receive_~#packet~0#1.base_32| Int) (|v_ULTIMATE.start_main_~#new_packet~0#1.base_38| Int) (v_ArrVal_1791 Int)) (or (not (= (select (store (store |c_#valid| |c_ULTIMATE.start_main_~#new_packet~0#1.base| v_ArrVal_1791) |v_ULTIMATE.start_main_~#new_packet~0#1.base_38| 1) |v_ULTIMATE.start_receive_~#packet~0#1.base_32|) 0)) (and (forall ((v_ArrVal_1799 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_receive_~#packet~0#1.base_32| v_ArrVal_1799) |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0)) (forall ((v_ArrVal_1796 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_receive_~#packet~0#1.base_32| v_ArrVal_1796) |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0))))) is different from false [2021-12-14 13:45:11,967 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_receive_~#packet~0#1.base_32| Int) (|v_ULTIMATE.start_main_~#new_packet~0#1.base_38| Int) (v_ArrVal_1791 Int) (v_ArrVal_1789 Int)) (or (and (forall ((v_ArrVal_1788 (Array Int Int)) (v_ArrVal_1796 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_receive_~#packet~0#1.base| v_ArrVal_1788) |v_ULTIMATE.start_receive_~#packet~0#1.base_32| v_ArrVal_1796) |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0)) (forall ((v_ArrVal_1799 (Array Int Int)) (v_ArrVal_1790 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_receive_~#packet~0#1.base| v_ArrVal_1790) |v_ULTIMATE.start_receive_~#packet~0#1.base_32| v_ArrVal_1799) |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0))) (not (= (select (store (store (store |c_#valid| |c_ULTIMATE.start_receive_~#packet~0#1.base| v_ArrVal_1789) |c_ULTIMATE.start_main_~#new_packet~0#1.base| v_ArrVal_1791) |v_ULTIMATE.start_main_~#new_packet~0#1.base_38| 1) |v_ULTIMATE.start_receive_~#packet~0#1.base_32|) 0)))) is different from false [2021-12-14 13:45:12,191 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_receive_~#packet~0#1.base_32| Int) (|v_ULTIMATE.start_receive_~#packet~0#1.base_34| Int) (|v_ULTIMATE.start_main_~#new_packet~0#1.base_38| Int) (v_ArrVal_1791 Int) (v_ArrVal_1789 Int) (|v_ULTIMATE.start_main_~#new_packet~0#1.base_40| Int)) (let ((.cse0 (store |c_#valid| |v_ULTIMATE.start_main_~#new_packet~0#1.base_40| 1))) (or (not (= (select (store (store (store .cse0 |v_ULTIMATE.start_receive_~#packet~0#1.base_34| v_ArrVal_1789) |v_ULTIMATE.start_main_~#new_packet~0#1.base_40| v_ArrVal_1791) |v_ULTIMATE.start_main_~#new_packet~0#1.base_38| 1) |v_ULTIMATE.start_receive_~#packet~0#1.base_32|) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~#new_packet~0#1.base_40|) 0)) (and (forall ((v_ArrVal_1788 (Array Int Int)) (v_ArrVal_1796 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_receive_~#packet~0#1.base_34| v_ArrVal_1788) |v_ULTIMATE.start_receive_~#packet~0#1.base_32| v_ArrVal_1796) |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0)) (forall ((v_ArrVal_1799 (Array Int Int)) (v_ArrVal_1790 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_receive_~#packet~0#1.base_34| v_ArrVal_1790) |v_ULTIMATE.start_receive_~#packet~0#1.base_32| v_ArrVal_1799) |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0))) (not (= (select .cse0 |v_ULTIMATE.start_receive_~#packet~0#1.base_34|) 0))))) is different from false [2021-12-14 13:45:12,427 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2021-12-14 13:45:12,428 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1565856967] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 13:45:12,428 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 13:45:12,428 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 9] total 15 [2021-12-14 13:45:12,428 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694991744] [2021-12-14 13:45:12,428 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 13:45:12,428 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-12-14 13:45:12,428 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:45:12,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-12-14 13:45:12,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=73, Unknown=4, NotChecked=84, Total=210 [2021-12-14 13:45:12,429 INFO L87 Difference]: Start difference. First operand 97 states and 120 transitions. Second operand has 15 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 15 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:45:13,087 WARN L838 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_main_~#new_packet~0#1.base| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|)) (= 1 (select |c_#valid| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|)) (not (= |c_ULTIMATE.start_main_~#new_packet~0#1.base| |c_ULTIMATE.start_receive_~#packet~0#1.base|)) (not (= |c_ULTIMATE.start_main_~#prio_queue~0#1.base| |c_ULTIMATE.start_receive_~#packet~0#1.base|)) (forall ((v_ArrVal_1796 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_receive_~#packet~0#1.base| v_ArrVal_1796) |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0)) (= (select |c_#valid| |c_ULTIMATE.start_main_~#new_packet~0#1.base|) 1) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0) (forall ((|v_ULTIMATE.start_receive_~#packet~0#1.base_32| Int) (|v_ULTIMATE.start_main_~#new_packet~0#1.base_38| Int) (v_ArrVal_1791 Int) (v_ArrVal_1789 Int)) (or (and (forall ((v_ArrVal_1788 (Array Int Int)) (v_ArrVal_1796 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_receive_~#packet~0#1.base| v_ArrVal_1788) |v_ULTIMATE.start_receive_~#packet~0#1.base_32| v_ArrVal_1796) |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0)) (forall ((v_ArrVal_1799 (Array Int Int)) (v_ArrVal_1790 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_receive_~#packet~0#1.base| v_ArrVal_1790) |v_ULTIMATE.start_receive_~#packet~0#1.base_32| v_ArrVal_1799) |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0))) (not (= (select (store (store (store |c_#valid| |c_ULTIMATE.start_receive_~#packet~0#1.base| v_ArrVal_1789) |c_ULTIMATE.start_main_~#new_packet~0#1.base| v_ArrVal_1791) |v_ULTIMATE.start_main_~#new_packet~0#1.base_38| 1) |v_ULTIMATE.start_receive_~#packet~0#1.base_32|) 0)))) (forall ((v_ArrVal_1799 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_receive_~#packet~0#1.base| v_ArrVal_1799) |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0))) is different from false [2021-12-14 13:45:13,705 WARN L838 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_main_~#new_packet~0#1.base| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|)) (= 1 (select |c_#valid| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|)) (not (= |c_ULTIMATE.start_main_~#new_packet~0#1.base| |c_ULTIMATE.start_receive_~#packet~0#1.base|)) (not (= |c_ULTIMATE.start_main_~#prio_queue~0#1.base| |c_ULTIMATE.start_receive_~#packet~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_main_~#new_packet~0#1.base|) 1) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0) (forall ((|v_ULTIMATE.start_receive_~#packet~0#1.base_32| Int) (|v_ULTIMATE.start_main_~#new_packet~0#1.base_38| Int) (v_ArrVal_1791 Int) (v_ArrVal_1789 Int)) (or (and (forall ((v_ArrVal_1788 (Array Int Int)) (v_ArrVal_1796 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_receive_~#packet~0#1.base| v_ArrVal_1788) |v_ULTIMATE.start_receive_~#packet~0#1.base_32| v_ArrVal_1796) |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0)) (forall ((v_ArrVal_1799 (Array Int Int)) (v_ArrVal_1790 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_receive_~#packet~0#1.base| v_ArrVal_1790) |v_ULTIMATE.start_receive_~#packet~0#1.base_32| v_ArrVal_1799) |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0))) (not (= (select (store (store (store |c_#valid| |c_ULTIMATE.start_receive_~#packet~0#1.base| v_ArrVal_1789) |c_ULTIMATE.start_main_~#new_packet~0#1.base| v_ArrVal_1791) |v_ULTIMATE.start_main_~#new_packet~0#1.base_38| 1) |v_ULTIMATE.start_receive_~#packet~0#1.base_32|) 0))))) is different from false [2021-12-14 13:45:14,327 WARN L838 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_main_~#new_packet~0#1.base| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|)) (= 1 (select |c_#valid| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|)) (forall ((|v_ULTIMATE.start_receive_~#packet~0#1.base_32| Int) (|v_ULTIMATE.start_main_~#new_packet~0#1.base_38| Int) (v_ArrVal_1791 Int)) (or (not (= (select (store (store |c_#valid| |c_ULTIMATE.start_main_~#new_packet~0#1.base| v_ArrVal_1791) |v_ULTIMATE.start_main_~#new_packet~0#1.base_38| 1) |v_ULTIMATE.start_receive_~#packet~0#1.base_32|) 0)) (and (forall ((v_ArrVal_1799 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_receive_~#packet~0#1.base_32| v_ArrVal_1799) |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0)) (forall ((v_ArrVal_1796 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_receive_~#packet~0#1.base_32| v_ArrVal_1796) |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0))))) (= (select |c_#valid| |c_ULTIMATE.start_main_~#new_packet~0#1.base|) 1) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0)) is different from false [2021-12-14 13:45:14,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:45:14,527 INFO L93 Difference]: Finished difference Result 157 states and 198 transitions. [2021-12-14 13:45:14,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-14 13:45:14,527 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 15 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-12-14 13:45:14,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:45:14,528 INFO L225 Difference]: With dead ends: 157 [2021-12-14 13:45:14,528 INFO L226 Difference]: Without dead ends: 134 [2021-12-14 13:45:14,529 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 39 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=66, Invalid=111, Unknown=7, NotChecked=196, Total=380 [2021-12-14 13:45:14,529 INFO L933 BasicCegarLoop]: 67 mSDtfsCounter, 46 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 253 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 13:45:14,529 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 376 Invalid, 393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 134 Invalid, 0 Unknown, 253 Unchecked, 0.2s Time] [2021-12-14 13:45:14,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2021-12-14 13:45:14,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 107. [2021-12-14 13:45:14,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 96 states have (on average 1.2708333333333333) internal successors, (122), 97 states have internal predecessors, (122), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-12-14 13:45:14,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 134 transitions. [2021-12-14 13:45:14,535 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 134 transitions. Word has length 23 [2021-12-14 13:45:14,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:45:14,535 INFO L470 AbstractCegarLoop]: Abstraction has 107 states and 134 transitions. [2021-12-14 13:45:14,535 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 15 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:45:14,535 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 134 transitions. [2021-12-14 13:45:14,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-12-14 13:45:14,536 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:45:14,536 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:45:14,553 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-12-14 13:45:14,747 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-12-14 13:45:14,748 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:45:14,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:45:14,748 INFO L85 PathProgramCache]: Analyzing trace with hash -28321902, now seen corresponding path program 1 times [2021-12-14 13:45:14,748 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:45:14,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393229103] [2021-12-14 13:45:14,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:45:14,748 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:45:14,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:45:14,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 13:45:14,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:45:14,902 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 13:45:14,903 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:45:14,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393229103] [2021-12-14 13:45:14,903 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393229103] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 13:45:14,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [71642367] [2021-12-14 13:45:14,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:45:14,903 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 13:45:14,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 13:45:14,907 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 13:45:14,908 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-12-14 13:45:15,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:45:15,088 INFO L263 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 66 conjunts are in the unsatisfiable core [2021-12-14 13:45:15,091 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 13:45:15,210 INFO L388 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 17 treesize of output 9 [2021-12-14 13:45:15,251 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 49 [2021-12-14 13:45:15,257 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 45 [2021-12-14 13:45:15,270 INFO L354 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2021-12-14 13:45:15,270 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 45 [2021-12-14 13:45:15,292 INFO L354 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2021-12-14 13:45:15,292 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 51 [2021-12-14 13:45:15,314 INFO L354 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2021-12-14 13:45:15,314 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 51 [2021-12-14 13:45:15,321 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2021-12-14 13:45:15,348 INFO L354 Elim1Store]: treesize reduction 28, result has 58.2 percent of original size [2021-12-14 13:45:15,348 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 54 [2021-12-14 13:45:15,355 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2021-12-14 13:45:15,361 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 11 [2021-12-14 13:45:15,368 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2021-12-14 13:45:15,431 INFO L388 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 [2021-12-14 13:45:15,476 INFO L388 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 [2021-12-14 13:45:15,492 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2021-12-14 13:45:15,536 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-12-14 13:45:15,536 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 40 [2021-12-14 13:45:15,539 INFO L388 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 28 treesize of output 20 [2021-12-14 13:45:15,560 INFO L388 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 [2021-12-14 13:45:15,744 INFO L388 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 48 treesize of output 32 [2021-12-14 13:45:15,748 INFO L388 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 15 treesize of output 7 [2021-12-14 13:45:15,786 INFO L388 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 48 treesize of output 32 [2021-12-14 13:45:15,849 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 13:45:15,849 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 13:45:16,086 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 13:45:16,086 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 141 treesize of output 97 [2021-12-14 13:45:16,096 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 13:45:16,096 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 75 treesize of output 84 [2021-12-14 13:45:16,117 INFO L354 Elim1Store]: treesize reduction 17, result has 70.7 percent of original size [2021-12-14 13:45:16,117 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 68 treesize of output 70 [2021-12-14 13:45:16,123 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-12-14 13:45:16,123 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 60 treesize of output 44 [2021-12-14 13:45:16,126 INFO L388 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 19 treesize of output 15 [2021-12-14 13:45:16,233 INFO L354 Elim1Store]: treesize reduction 14, result has 6.7 percent of original size [2021-12-14 13:45:16,233 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 141 treesize of output 1 [2021-12-14 13:45:16,349 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 13:45:16,349 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [71642367] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 13:45:16,349 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 13:45:16,349 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 11] total 24 [2021-12-14 13:45:16,349 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702772010] [2021-12-14 13:45:16,349 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 13:45:16,349 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2021-12-14 13:45:16,349 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:45:16,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-12-14 13:45:16,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=457, Unknown=0, NotChecked=0, Total=552 [2021-12-14 13:45:16,350 INFO L87 Difference]: Start difference. First operand 107 states and 134 transitions. Second operand has 24 states, 21 states have (on average 2.5714285714285716) internal successors, (54), 23 states have internal predecessors, (54), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-14 13:45:16,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:45:16,937 INFO L93 Difference]: Finished difference Result 135 states and 169 transitions. [2021-12-14 13:45:16,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-14 13:45:16,937 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 2.5714285714285716) internal successors, (54), 23 states have internal predecessors, (54), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 25 [2021-12-14 13:45:16,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:45:16,938 INFO L225 Difference]: With dead ends: 135 [2021-12-14 13:45:16,938 INFO L226 Difference]: Without dead ends: 133 [2021-12-14 13:45:16,938 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 35 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=162, Invalid=708, Unknown=0, NotChecked=0, Total=870 [2021-12-14 13:45:16,939 INFO L933 BasicCegarLoop]: 48 mSDtfsCounter, 105 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 43 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-14 13:45:16,939 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [109 Valid, 391 Invalid, 423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 351 Invalid, 0 Unknown, 43 Unchecked, 0.4s Time] [2021-12-14 13:45:16,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2021-12-14 13:45:16,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 121. [2021-12-14 13:45:16,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 110 states have (on average 1.2727272727272727) internal successors, (140), 111 states have internal predecessors, (140), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-12-14 13:45:16,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 152 transitions. [2021-12-14 13:45:16,945 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 152 transitions. Word has length 25 [2021-12-14 13:45:16,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:45:16,945 INFO L470 AbstractCegarLoop]: Abstraction has 121 states and 152 transitions. [2021-12-14 13:45:16,945 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 2.5714285714285716) internal successors, (54), 23 states have internal predecessors, (54), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-14 13:45:16,946 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 152 transitions. [2021-12-14 13:45:16,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-12-14 13:45:16,946 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:45:16,946 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:45:16,971 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-12-14 13:45:17,171 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2021-12-14 13:45:17,171 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:45:17,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:45:17,172 INFO L85 PathProgramCache]: Analyzing trace with hash -28319980, now seen corresponding path program 1 times [2021-12-14 13:45:17,172 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:45:17,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720053937] [2021-12-14 13:45:17,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:45:17,172 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:45:17,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:45:17,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 13:45:17,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:45:17,331 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 13:45:17,331 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:45:17,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720053937] [2021-12-14 13:45:17,332 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720053937] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 13:45:17,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [462996354] [2021-12-14 13:45:17,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:45:17,333 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 13:45:17,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 13:45:17,334 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 13:45:17,335 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-12-14 13:45:17,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:45:17,500 INFO L263 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 72 conjunts are in the unsatisfiable core [2021-12-14 13:45:17,503 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 13:45:17,578 INFO L388 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 14 treesize of output 15 [2021-12-14 13:45:17,704 INFO L354 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2021-12-14 13:45:17,704 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 30 treesize of output 10 [2021-12-14 13:45:17,733 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 49 [2021-12-14 13:45:17,739 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 45 [2021-12-14 13:45:17,752 INFO L354 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2021-12-14 13:45:17,752 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 45 [2021-12-14 13:45:17,774 INFO L354 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2021-12-14 13:45:17,774 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 51 [2021-12-14 13:45:17,795 INFO L354 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2021-12-14 13:45:17,795 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 51 [2021-12-14 13:45:17,801 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2021-12-14 13:45:17,828 INFO L354 Elim1Store]: treesize reduction 28, result has 58.2 percent of original size [2021-12-14 13:45:17,828 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 54 [2021-12-14 13:45:17,835 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2021-12-14 13:45:17,843 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2021-12-14 13:45:17,849 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 11 [2021-12-14 13:45:17,968 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:45:17,969 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2021-12-14 13:45:17,972 INFO L388 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 [2021-12-14 13:45:17,989 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2021-12-14 13:45:17,992 INFO L388 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 9 treesize of output 7 [2021-12-14 13:45:18,010 INFO L388 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 26 treesize of output 14 [2021-12-14 13:45:18,023 INFO L388 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 26 treesize of output 14 [2021-12-14 13:45:18,057 INFO L388 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 [2021-12-14 13:45:18,080 INFO L388 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 [2021-12-14 13:45:18,217 INFO L388 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 28 treesize of output 16 [2021-12-14 13:45:18,220 INFO L388 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 15 treesize of output 7 [2021-12-14 13:45:18,242 INFO L388 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 33 treesize of output 21 [2021-12-14 13:45:18,246 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 13:45:18,246 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 13:45:18,498 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 13:45:18,498 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 70 treesize of output 56 [2021-12-14 13:45:18,507 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 13:45:18,508 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 54 [2021-12-14 13:45:18,529 INFO L354 Elim1Store]: treesize reduction 17, result has 70.7 percent of original size [2021-12-14 13:45:18,529 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 38 treesize of output 57 [2021-12-14 13:45:18,534 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-12-14 13:45:18,535 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 42 treesize of output 30 [2021-12-14 13:45:18,537 INFO L388 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 11 treesize of output 9 [2021-12-14 13:45:18,637 INFO L354 Elim1Store]: treesize reduction 14, result has 6.7 percent of original size [2021-12-14 13:45:18,638 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 70 treesize of output 1 [2021-12-14 13:45:18,815 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 13:45:18,816 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 376 treesize of output 370 [2021-12-14 13:45:18,856 INFO L173 IndexEqualityManager]: detected equality via solver