./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 6c24879c 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-?-6c24879 [2022-07-12 03:38:35,862 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 03:38:35,864 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 03:38:35,901 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 03:38:35,902 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 03:38:35,902 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 03:38:35,903 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 03:38:35,905 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 03:38:35,907 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 03:38:35,908 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 03:38:35,909 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 03:38:35,910 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 03:38:35,911 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 03:38:35,914 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 03:38:35,914 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 03:38:35,915 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 03:38:35,916 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 03:38:35,917 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 03:38:35,920 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 03:38:35,921 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 03:38:35,924 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 03:38:35,925 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 03:38:35,926 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 03:38:35,927 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 03:38:35,927 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 03:38:35,929 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 03:38:35,930 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 03:38:35,931 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 03:38:35,932 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 03:38:35,932 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 03:38:35,933 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 03:38:35,933 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 03:38:35,934 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 03:38:35,934 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 03:38:35,935 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 03:38:35,935 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 03:38:35,936 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 03:38:35,936 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 03:38:35,936 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 03:38:35,936 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 03:38:35,937 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 03:38:35,938 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 03:38:35,939 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-12 03:38:35,966 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 03:38:35,967 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 03:38:35,967 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 03:38:35,967 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 03:38:35,968 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 03:38:35,968 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 03:38:35,968 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 03:38:35,968 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 03:38:35,968 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 03:38:35,969 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 03:38:35,969 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 03:38:35,969 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 03:38:35,969 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 03:38:35,970 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 03:38:35,970 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 03:38:35,970 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 03:38:35,970 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 03:38:35,970 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 03:38:35,970 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 03:38:35,970 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 03:38:35,971 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 03:38:35,971 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 03:38:35,971 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 03:38:35,972 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 03:38:35,972 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 03:38:35,972 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 03:38:35,972 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 03:38:35,972 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 03:38:35,973 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 03:38:35,973 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 03:38:35,973 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 03:38:35,973 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 03:38:35,973 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 03:38:35,973 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 [2022-07-12 03:38:36,170 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 03:38:36,193 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 03:38:36,195 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 03:38:36,196 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 03:38:36,196 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 03:38:36,197 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/heap-data/packet_filter.i [2022-07-12 03:38:36,249 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d3eb3654c/f7a7b7f6cf6d466a913a4cd29ed7351e/FLAG8b3543eb5 [2022-07-12 03:38:36,676 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 03:38:36,677 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-data/packet_filter.i [2022-07-12 03:38:36,688 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d3eb3654c/f7a7b7f6cf6d466a913a4cd29ed7351e/FLAG8b3543eb5 [2022-07-12 03:38:37,039 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d3eb3654c/f7a7b7f6cf6d466a913a4cd29ed7351e [2022-07-12 03:38:37,041 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 03:38:37,043 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 03:38:37,044 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 03:38:37,045 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 03:38:37,047 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 03:38:37,048 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 03:38:37" (1/1) ... [2022-07-12 03:38:37,048 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1687609 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:38:37, skipping insertion in model container [2022-07-12 03:38:37,049 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 03:38:37" (1/1) ... [2022-07-12 03:38:37,054 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 03:38:37,079 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 03:38:37,308 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] [2022-07-12 03:38:37,317 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] [2022-07-12 03:38:37,326 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 03:38:37,334 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 03:38:37,362 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] [2022-07-12 03:38:37,363 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] [2022-07-12 03:38:37,366 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 03:38:37,382 INFO L208 MainTranslator]: Completed translation [2022-07-12 03:38:37,383 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:38:37 WrapperNode [2022-07-12 03:38:37,383 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 03:38:37,384 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 03:38:37,384 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 03:38:37,384 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 03:38:37,390 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:38:37" (1/1) ... [2022-07-12 03:38:37,402 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:38:37" (1/1) ... [2022-07-12 03:38:37,421 INFO L137 Inliner]: procedures = 130, calls = 86, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 160 [2022-07-12 03:38:37,421 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 03:38:37,422 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 03:38:37,422 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 03:38:37,422 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 03:38:37,427 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:38:37" (1/1) ... [2022-07-12 03:38:37,428 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:38:37" (1/1) ... [2022-07-12 03:38:37,431 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:38:37" (1/1) ... [2022-07-12 03:38:37,435 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:38:37" (1/1) ... [2022-07-12 03:38:37,442 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:38:37" (1/1) ... [2022-07-12 03:38:37,445 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:38:37" (1/1) ... [2022-07-12 03:38:37,446 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:38:37" (1/1) ... [2022-07-12 03:38:37,452 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 03:38:37,455 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 03:38:37,455 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 03:38:37,455 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 03:38:37,459 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:38:37" (1/1) ... [2022-07-12 03:38:37,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 03:38:37,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:38:37,479 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-12 03:38:37,480 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-12 03:38:37,518 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-12 03:38:37,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-12 03:38:37,518 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-12 03:38:37,523 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 03:38:37,523 INFO L130 BoogieDeclarations]: Found specification of procedure append_to_queue [2022-07-12 03:38:37,523 INFO L138 BoogieDeclarations]: Found implementation of procedure append_to_queue [2022-07-12 03:38:37,523 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-12 03:38:37,523 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-12 03:38:37,523 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-12 03:38:37,524 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_charp [2022-07-12 03:38:37,524 INFO L130 BoogieDeclarations]: Found specification of procedure send [2022-07-12 03:38:37,524 INFO L138 BoogieDeclarations]: Found implementation of procedure send [2022-07-12 03:38:37,524 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 03:38:37,524 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-12 03:38:37,524 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 03:38:37,524 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 03:38:37,525 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 03:38:37,639 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 03:38:37,640 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 03:38:37,892 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 03:38:37,899 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 03:38:37,900 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-12 03:38:37,901 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 03:38:37 BoogieIcfgContainer [2022-07-12 03:38:37,901 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 03:38:37,903 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 03:38:37,903 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 03:38:37,906 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 03:38:37,906 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 03:38:37" (1/3) ... [2022-07-12 03:38:37,907 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2543a49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 03:38:37, skipping insertion in model container [2022-07-12 03:38:37,907 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:38:37" (2/3) ... [2022-07-12 03:38:37,907 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2543a49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 03:38:37, skipping insertion in model container [2022-07-12 03:38:37,907 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 03:38:37" (3/3) ... [2022-07-12 03:38:37,908 INFO L111 eAbstractionObserver]: Analyzing ICFG packet_filter.i [2022-07-12 03:38:37,918 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 03:38:37,918 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-07-12 03:38:37,965 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 03:38:37,972 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@5480868b, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@505fb2d0 [2022-07-12 03:38:37,972 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-07-12 03:38:37,987 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) [2022-07-12 03:38:37,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-07-12 03:38:37,995 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:38:37,996 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:38:37,996 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:38:38,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:38:38,000 INFO L85 PathProgramCache]: Analyzing trace with hash -1910004341, now seen corresponding path program 1 times [2022-07-12 03:38:38,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:38:38,007 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469153285] [2022-07-12 03:38:38,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:38:38,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:38:38,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:38:38,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:38:38,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:38:38,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469153285] [2022-07-12 03:38:38,148 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469153285] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:38:38,148 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:38:38,149 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 03:38:38,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488202913] [2022-07-12 03:38:38,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:38:38,155 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-12 03:38:38,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:38:38,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-12 03:38:38,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-12 03:38:38,179 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) [2022-07-12 03:38:38,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:38:38,200 INFO L93 Difference]: Finished difference Result 74 states and 98 transitions. [2022-07-12 03:38:38,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-12 03:38:38,201 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 [2022-07-12 03:38:38,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:38:38,207 INFO L225 Difference]: With dead ends: 74 [2022-07-12 03:38:38,208 INFO L226 Difference]: Without dead ends: 43 [2022-07-12 03:38:38,211 INFO L412 NwaCegarLoop]: 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 [2022-07-12 03:38:38,214 INFO L413 NwaCegarLoop]: 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 [2022-07-12 03:38:38,215 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 03:38:38,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-07-12 03:38:38,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2022-07-12 03:38:38,251 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) [2022-07-12 03:38:38,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 54 transitions. [2022-07-12 03:38:38,254 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 54 transitions. Word has length 8 [2022-07-12 03:38:38,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:38:38,255 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 54 transitions. [2022-07-12 03:38:38,255 INFO L496 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) [2022-07-12 03:38:38,256 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 54 transitions. [2022-07-12 03:38:38,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-12 03:38:38,256 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:38:38,257 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:38:38,257 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 03:38:38,257 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:38:38,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:38:38,258 INFO L85 PathProgramCache]: Analyzing trace with hash -1345079117, now seen corresponding path program 1 times [2022-07-12 03:38:38,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:38:38,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561920751] [2022-07-12 03:38:38,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:38:38,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:38:38,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:38:38,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:38:38,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:38:38,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561920751] [2022-07-12 03:38:38,348 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561920751] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:38:38,348 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:38:38,348 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 03:38:38,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26505080] [2022-07-12 03:38:38,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:38:38,350 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 03:38:38,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:38:38,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 03:38:38,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 03:38:38,351 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) [2022-07-12 03:38:38,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:38:38,436 INFO L93 Difference]: Finished difference Result 77 states and 96 transitions. [2022-07-12 03:38:38,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 03:38:38,437 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 [2022-07-12 03:38:38,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:38:38,440 INFO L225 Difference]: With dead ends: 77 [2022-07-12 03:38:38,441 INFO L226 Difference]: Without dead ends: 55 [2022-07-12 03:38:38,452 INFO L412 NwaCegarLoop]: 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 [2022-07-12 03:38:38,454 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 29 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 03:38:38,454 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 122 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 03:38:38,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-07-12 03:38:38,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 47. [2022-07-12 03:38:38,466 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) [2022-07-12 03:38:38,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 59 transitions. [2022-07-12 03:38:38,470 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 59 transitions. Word has length 9 [2022-07-12 03:38:38,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:38:38,474 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 59 transitions. [2022-07-12 03:38:38,475 INFO L496 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) [2022-07-12 03:38:38,475 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 59 transitions. [2022-07-12 03:38:38,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-12 03:38:38,475 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:38:38,476 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:38:38,476 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-12 03:38:38,477 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:38:38,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:38:38,478 INFO L85 PathProgramCache]: Analyzing trace with hash 124171370, now seen corresponding path program 1 times [2022-07-12 03:38:38,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:38:38,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303789821] [2022-07-12 03:38:38,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:38:38,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:38:38,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:38:38,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:38:38,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:38:38,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303789821] [2022-07-12 03:38:38,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303789821] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:38:38,550 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:38:38,550 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 03:38:38,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003684943] [2022-07-12 03:38:38,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:38:38,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 03:38:38,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:38:38,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 03:38:38,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 03:38:38,551 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) [2022-07-12 03:38:38,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:38:38,610 INFO L93 Difference]: Finished difference Result 61 states and 74 transitions. [2022-07-12 03:38:38,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 03:38:38,611 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 [2022-07-12 03:38:38,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:38:38,611 INFO L225 Difference]: With dead ends: 61 [2022-07-12 03:38:38,611 INFO L226 Difference]: Without dead ends: 45 [2022-07-12 03:38:38,612 INFO L412 NwaCegarLoop]: 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 [2022-07-12 03:38:38,613 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 1 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 03:38:38,613 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 136 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 03:38:38,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-07-12 03:38:38,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2022-07-12 03:38:38,616 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) [2022-07-12 03:38:38,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 56 transitions. [2022-07-12 03:38:38,617 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 56 transitions. Word has length 11 [2022-07-12 03:38:38,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:38:38,617 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 56 transitions. [2022-07-12 03:38:38,617 INFO L496 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) [2022-07-12 03:38:38,617 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 56 transitions. [2022-07-12 03:38:38,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-12 03:38:38,618 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:38:38,618 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:38:38,618 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-12 03:38:38,619 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:38:38,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:38:38,619 INFO L85 PathProgramCache]: Analyzing trace with hash 959773065, now seen corresponding path program 1 times [2022-07-12 03:38:38,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:38:38,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481553703] [2022-07-12 03:38:38,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:38:38,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:38:38,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:38:38,794 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:38:38,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:38:38,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481553703] [2022-07-12 03:38:38,795 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481553703] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:38:38,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [718109117] [2022-07-12 03:38:38,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:38:38,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:38:38,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:38:38,811 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 03:38:38,835 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-12 03:38:38,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:38:38,916 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 40 conjunts are in the unsatisfiable core [2022-07-12 03:38:38,920 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:38:38,973 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 03:38:38,974 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2022-07-12 03:38:39,026 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 03:38:39,027 INFO L390 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 [2022-07-12 03:38:39,034 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-12 03:38:39,049 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 03:38:39,050 INFO L390 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 [2022-07-12 03:38:39,056 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-12 03:38:39,067 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 03:38:39,067 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-07-12 03:38:39,106 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-12 03:38:39,112 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-12 03:38:39,165 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-12 03:38:39,176 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-12 03:38:39,181 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:38:39,181 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:38:39,219 WARN L833 $PredicateComparison]: unable to prove that (and (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)) (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))) is different from false [2022-07-12 03:38:39,698 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:38:39,699 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [718109117] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 03:38:39,699 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 03:38:39,699 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 8 [2022-07-12 03:38:39,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651394238] [2022-07-12 03:38:39,699 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 03:38:39,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 03:38:39,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:38:39,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 03:38:39,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=29, Unknown=1, NotChecked=10, Total=56 [2022-07-12 03:38:39,701 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) [2022-07-12 03:38:39,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:38:39,852 INFO L93 Difference]: Finished difference Result 90 states and 116 transitions. [2022-07-12 03:38:39,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 03:38:39,853 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 [2022-07-12 03:38:39,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:38:39,854 INFO L225 Difference]: With dead ends: 90 [2022-07-12 03:38:39,854 INFO L226 Difference]: Without dead ends: 68 [2022-07-12 03:38:39,854 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=33, Invalid=59, Unknown=2, NotChecked=16, Total=110 [2022-07-12 03:38:39,855 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 37 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 90 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 03:38:39,855 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 224 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 75 Invalid, 0 Unknown, 90 Unchecked, 0.1s Time] [2022-07-12 03:38:39,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-07-12 03:38:39,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 54. [2022-07-12 03:38:39,861 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) [2022-07-12 03:38:39,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 68 transitions. [2022-07-12 03:38:39,863 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 68 transitions. Word has length 16 [2022-07-12 03:38:39,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:38:39,863 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 68 transitions. [2022-07-12 03:38:39,864 INFO L496 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) [2022-07-12 03:38:39,866 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 68 transitions. [2022-07-12 03:38:39,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-12 03:38:39,867 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:38:39,867 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:38:39,889 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-12 03:38:40,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:38:40,080 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:38:40,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:38:40,080 INFO L85 PathProgramCache]: Analyzing trace with hash -1116006464, now seen corresponding path program 1 times [2022-07-12 03:38:40,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:38:40,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471894211] [2022-07-12 03:38:40,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:38:40,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:38:40,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:38:40,196 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:38:40,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:38:40,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471894211] [2022-07-12 03:38:40,196 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471894211] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:38:40,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [546327174] [2022-07-12 03:38:40,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:38:40,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:38:40,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:38:40,200 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 03:38:40,201 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-12 03:38:40,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:38:40,287 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 36 conjunts are in the unsatisfiable core [2022-07-12 03:38:40,289 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:38:40,312 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 03:38:40,312 INFO L390 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 [2022-07-12 03:38:40,342 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 03:38:40,342 INFO L390 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 [2022-07-12 03:38:40,349 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-12 03:38:40,357 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 03:38:40,358 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-07-12 03:38:40,372 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-12 03:38:40,403 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-12 03:38:40,408 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-12 03:38:40,438 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-12 03:38:40,441 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-12 03:38:40,444 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:38:40,444 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:38:40,472 WARN L833 $PredicateComparison]: unable to prove that (and (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)) (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))) is different from false [2022-07-12 03:38:41,236 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:38:41,238 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:38:41,240 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:38:41,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [546327174] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 03:38:41,240 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 03:38:41,240 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 10 [2022-07-12 03:38:41,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322239836] [2022-07-12 03:38:41,241 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 03:38:41,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 03:38:41,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:38:41,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 03:38:41,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=51, Unknown=1, NotChecked=14, Total=90 [2022-07-12 03:38:41,242 INFO L87 Difference]: Start difference. First operand 54 states and 68 transitions. Second operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 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) [2022-07-12 03:38:41,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:38:41,439 INFO L93 Difference]: Finished difference Result 74 states and 94 transitions. [2022-07-12 03:38:41,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 03:38:41,439 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 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 [2022-07-12 03:38:41,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:38:41,440 INFO L225 Difference]: With dead ends: 74 [2022-07-12 03:38:41,440 INFO L226 Difference]: Without dead ends: 58 [2022-07-12 03:38:41,440 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=46, Invalid=89, Unknown=1, NotChecked=20, Total=156 [2022-07-12 03:38:41,441 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 12 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 53 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 03:38:41,441 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 281 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 113 Invalid, 0 Unknown, 53 Unchecked, 0.1s Time] [2022-07-12 03:38:41,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-07-12 03:38:41,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 52. [2022-07-12 03:38:41,445 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) [2022-07-12 03:38:41,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 65 transitions. [2022-07-12 03:38:41,446 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 65 transitions. Word has length 18 [2022-07-12 03:38:41,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:38:41,446 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 65 transitions. [2022-07-12 03:38:41,446 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 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) [2022-07-12 03:38:41,446 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 65 transitions. [2022-07-12 03:38:41,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-12 03:38:41,447 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:38:41,447 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:38:41,478 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-12 03:38:41,659 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:38:41,660 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:38:41,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:38:41,660 INFO L85 PathProgramCache]: Analyzing trace with hash -2078493544, now seen corresponding path program 1 times [2022-07-12 03:38:41,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:38:41,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456772984] [2022-07-12 03:38:41,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:38:41,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:38:41,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:38:41,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 03:38:41,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:38:41,755 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:38:41,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:38:41,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456772984] [2022-07-12 03:38:41,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456772984] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:38:41,756 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:38:41,756 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 03:38:41,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694593498] [2022-07-12 03:38:41,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:38:41,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 03:38:41,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:38:41,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 03:38:41,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-12 03:38:41,758 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) [2022-07-12 03:38:41,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:38:41,936 INFO L93 Difference]: Finished difference Result 132 states and 168 transitions. [2022-07-12 03:38:41,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 03:38:41,937 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 [2022-07-12 03:38:41,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:38:41,938 INFO L225 Difference]: With dead ends: 132 [2022-07-12 03:38:41,938 INFO L226 Difference]: Without dead ends: 91 [2022-07-12 03:38:41,938 INFO L412 NwaCegarLoop]: 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 [2022-07-12 03:38:41,939 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 35 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 03:38:41,939 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 268 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 03:38:41,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-07-12 03:38:41,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 59. [2022-07-12 03:38:41,943 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) [2022-07-12 03:38:41,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 74 transitions. [2022-07-12 03:38:41,944 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 74 transitions. Word has length 22 [2022-07-12 03:38:41,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:38:41,944 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 74 transitions. [2022-07-12 03:38:41,945 INFO L496 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) [2022-07-12 03:38:41,945 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 74 transitions. [2022-07-12 03:38:41,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-12 03:38:41,945 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:38:41,945 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:38:41,946 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-12 03:38:41,946 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:38:41,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:38:41,946 INFO L85 PathProgramCache]: Analyzing trace with hash 222329046, now seen corresponding path program 1 times [2022-07-12 03:38:41,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:38:41,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215918297] [2022-07-12 03:38:41,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:38:41,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:38:42,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:38:42,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 03:38:42,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:38:42,209 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:38:42,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:38:42,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215918297] [2022-07-12 03:38:42,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215918297] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:38:42,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [269782212] [2022-07-12 03:38:42,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:38:42,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:38:42,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:38:42,236 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 03:38:42,237 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-12 03:38:42,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:38:42,352 INFO L263 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 63 conjunts are in the unsatisfiable core [2022-07-12 03:38:42,355 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:38:42,408 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2022-07-12 03:38:42,471 INFO L356 Elim1Store]: treesize reduction 40, result has 42.9 percent of original size [2022-07-12 03:38:42,471 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 64 [2022-07-12 03:38:42,505 INFO L356 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2022-07-12 03:38:42,505 INFO L390 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 74 [2022-07-12 03:38:42,530 INFO L356 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2022-07-12 03:38:42,530 INFO L390 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 74 [2022-07-12 03:38:42,537 INFO L390 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 [2022-07-12 03:38:42,569 INFO L356 Elim1Store]: treesize reduction 28, result has 58.2 percent of original size [2022-07-12 03:38:42,569 INFO L390 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 55 treesize of output 80 [2022-07-12 03:38:42,579 INFO L390 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 [2022-07-12 03:38:42,587 INFO L390 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 [2022-07-12 03:38:42,596 INFO L390 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 [2022-07-12 03:38:42,641 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-12 03:38:42,685 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-12 03:38:42,705 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-12 03:38:42,754 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 62 treesize of output 15 [2022-07-12 03:38:42,759 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-12 03:38:42,771 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:38:42,773 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 66 treesize of output 19 [2022-07-12 03:38:42,776 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-07-12 03:38:42,942 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 22 [2022-07-12 03:38:42,948 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-12 03:38:42,977 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 27 [2022-07-12 03:38:42,984 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:38:42,984 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:38:43,269 INFO L356 Elim1Store]: treesize reduction 41, result has 62.0 percent of original size [2022-07-12 03:38:43,269 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 7 case distinctions, treesize of input 57 treesize of output 79 [2022-07-12 03:38:43,277 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-12 03:38:43,277 INFO L390 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 68 treesize of output 48 [2022-07-12 03:38:43,283 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2022-07-12 03:38:43,369 INFO L356 Elim1Store]: treesize reduction 107, result has 0.9 percent of original size [2022-07-12 03:38:43,369 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 7 case distinctions, treesize of input 57 treesize of output 1 [2022-07-12 03:38:43,440 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:38:43,440 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [269782212] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 03:38:43,441 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 03:38:43,441 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 10] total 25 [2022-07-12 03:38:43,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442333883] [2022-07-12 03:38:43,441 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 03:38:43,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-07-12 03:38:43,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:38:43,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-07-12 03:38:43,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=514, Unknown=0, NotChecked=0, Total=600 [2022-07-12 03:38:43,442 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) [2022-07-12 03:38:44,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:38:44,321 INFO L93 Difference]: Finished difference Result 149 states and 191 transitions. [2022-07-12 03:38:44,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-12 03:38:44,323 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 [2022-07-12 03:38:44,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:38:44,324 INFO L225 Difference]: With dead ends: 149 [2022-07-12 03:38:44,324 INFO L226 Difference]: Without dead ends: 104 [2022-07-12 03:38:44,325 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=213, Invalid=1047, Unknown=0, NotChecked=0, Total=1260 [2022-07-12 03:38:44,325 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 204 mSDsluCounter, 571 mSDsCounter, 0 mSdLazyCounter, 686 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 636 SdHoareTripleChecker+Invalid, 728 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 686 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-12 03:38:44,326 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 636 Invalid, 728 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 686 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-12 03:38:44,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-07-12 03:38:44,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 66. [2022-07-12 03:38:44,330 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) [2022-07-12 03:38:44,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 82 transitions. [2022-07-12 03:38:44,331 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 82 transitions. Word has length 22 [2022-07-12 03:38:44,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:38:44,331 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 82 transitions. [2022-07-12 03:38:44,331 INFO L496 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) [2022-07-12 03:38:44,331 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 82 transitions. [2022-07-12 03:38:44,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-12 03:38:44,332 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:38:44,332 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:38:44,349 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-12 03:38:44,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:38:44,548 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:38:44,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:38:44,548 INFO L85 PathProgramCache]: Analyzing trace with hash -749095909, now seen corresponding path program 1 times [2022-07-12 03:38:44,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:38:44,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274952944] [2022-07-12 03:38:44,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:38:44,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:38:44,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:38:44,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 03:38:44,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:38:44,750 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:38:44,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:38:44,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274952944] [2022-07-12 03:38:44,751 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274952944] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:38:44,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1245730360] [2022-07-12 03:38:44,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:38:44,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:38:44,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:38:44,756 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 03:38:44,757 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-12 03:38:44,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:38:44,887 INFO L263 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 66 conjunts are in the unsatisfiable core [2022-07-12 03:38:44,890 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:38:44,983 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-07-12 03:38:45,043 INFO L356 Elim1Store]: treesize reduction 40, result has 42.9 percent of original size [2022-07-12 03:38:45,044 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 64 [2022-07-12 03:38:45,073 INFO L356 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2022-07-12 03:38:45,073 INFO L390 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 74 [2022-07-12 03:38:45,099 INFO L356 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2022-07-12 03:38:45,099 INFO L390 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 74 [2022-07-12 03:38:45,116 INFO L390 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 [2022-07-12 03:38:45,147 INFO L356 Elim1Store]: treesize reduction 28, result has 58.2 percent of original size [2022-07-12 03:38:45,147 INFO L390 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 55 treesize of output 80 [2022-07-12 03:38:45,157 INFO L390 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 [2022-07-12 03:38:45,166 INFO L390 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 [2022-07-12 03:38:45,175 INFO L390 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 [2022-07-12 03:38:45,222 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-12 03:38:45,242 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-12 03:38:45,278 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:38:45,279 INFO L390 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 0 case distinctions, treesize of input 47 treesize of output 5 [2022-07-12 03:38:45,284 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-12 03:38:45,312 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:38:45,313 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:38:45,314 INFO L390 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 0 case distinctions, treesize of input 51 treesize of output 9 [2022-07-12 03:38:45,317 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-07-12 03:38:45,825 INFO L356 Elim1Store]: treesize reduction 12, result has 67.6 percent of original size [2022-07-12 03:38:45,826 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 204 treesize of output 202 [2022-07-12 03:38:45,833 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:38:45,834 INFO L390 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 210 treesize of output 196 [2022-07-12 03:38:45,860 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 26 [2022-07-12 03:38:45,868 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 58 [2022-07-12 03:38:45,869 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 57 [2022-07-12 03:38:45,916 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 31 [2022-07-12 03:38:45,944 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:38:45,944 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:38:46,208 INFO L356 Elim1Store]: treesize reduction 41, result has 62.0 percent of original size [2022-07-12 03:38:46,208 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 7 case distinctions, treesize of input 57 treesize of output 79 [2022-07-12 03:38:46,215 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-12 03:38:46,215 INFO L390 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 68 treesize of output 48 [2022-07-12 03:38:46,219 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2022-07-12 03:38:46,302 INFO L356 Elim1Store]: treesize reduction 107, result has 0.9 percent of original size [2022-07-12 03:38:46,302 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 7 case distinctions, treesize of input 57 treesize of output 1 [2022-07-12 03:38:46,406 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:38:46,406 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1245730360] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 03:38:46,406 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 03:38:46,406 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 11] total 27 [2022-07-12 03:38:46,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685582297] [2022-07-12 03:38:46,407 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 03:38:46,407 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-07-12 03:38:46,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:38:46,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-07-12 03:38:46,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=596, Unknown=0, NotChecked=0, Total=702 [2022-07-12 03:38:46,408 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) [2022-07-12 03:38:47,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:38:47,043 INFO L93 Difference]: Finished difference Result 104 states and 134 transitions. [2022-07-12 03:38:47,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-12 03:38:47,044 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 [2022-07-12 03:38:47,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:38:47,044 INFO L225 Difference]: With dead ends: 104 [2022-07-12 03:38:47,044 INFO L226 Difference]: Without dead ends: 102 [2022-07-12 03:38:47,045 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=175, Invalid=1015, Unknown=0, NotChecked=0, Total=1190 [2022-07-12 03:38:47,045 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 53 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 103 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 03:38:47,046 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 399 Invalid, 409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 278 Invalid, 0 Unknown, 103 Unchecked, 0.3s Time] [2022-07-12 03:38:47,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-07-12 03:38:47,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 86. [2022-07-12 03:38:47,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 76 states have (on average 1.3026315789473684) internal successors, (99), 77 states have internal predecessors, (99), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-12 03:38:47,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 111 transitions. [2022-07-12 03:38:47,053 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 111 transitions. Word has length 23 [2022-07-12 03:38:47,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:38:47,054 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 111 transitions. [2022-07-12 03:38:47,054 INFO L496 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) [2022-07-12 03:38:47,054 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 111 transitions. [2022-07-12 03:38:47,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-12 03:38:47,055 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:38:47,055 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:38:47,091 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-12 03:38:47,273 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:38:47,274 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:38:47,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:38:47,274 INFO L85 PathProgramCache]: Analyzing trace with hash 1903920603, now seen corresponding path program 1 times [2022-07-12 03:38:47,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:38:47,275 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915771599] [2022-07-12 03:38:47,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:38:47,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:38:47,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:38:47,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 03:38:47,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:39:06,996 WARN L233 SmtUtils]: Spent 9.26s 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) [2022-07-12 03:39:16,872 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:39:16,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:39:16,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915771599] [2022-07-12 03:39:16,873 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915771599] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:39:16,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [441579548] [2022-07-12 03:39:16,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:39:16,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:39:16,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:39:16,875 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 03:39:16,875 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-12 03:39:17,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:39:17,027 INFO L263 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 68 conjunts are in the unsatisfiable core [2022-07-12 03:39:17,031 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:39:17,040 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 03:39:17,040 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2022-07-12 03:39:17,103 INFO L356 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-07-12 03:39:17,104 INFO L390 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 [2022-07-12 03:39:17,113 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-12 03:39:17,116 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-12 03:39:17,184 INFO L390 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 [2022-07-12 03:39:17,189 INFO L390 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 [2022-07-12 03:39:17,194 INFO L390 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 [2022-07-12 03:39:17,286 INFO L390 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 [2022-07-12 03:39:17,290 INFO L390 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 [2022-07-12 03:39:17,293 INFO L390 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 [2022-07-12 03:39:17,375 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1219 (Array Int Int)) (v_ArrVal_1218 (Array Int Int)) (v_ArrVal_1215 (Array Int Int)) (v_ArrVal_1214 (Array Int Int)) (v_ArrVal_1213 (Array Int Int)) (v_ArrVal_1223 (Array Int Int)) (|v_append_to_queue_~#p.base_31| Int) (append_to_queue_~node~0.base Int)) (and (= (store (store (store |c_old(#memory_$Pointer$.base)| |v_append_to_queue_~#p.base_31| v_ArrVal_1218) append_to_queue_~node~0.base v_ArrVal_1213) |c_append_to_queue_#in~q.base| v_ArrVal_1219) |c_#memory_$Pointer$.base|) (< append_to_queue_~node~0.base |c_#StackHeapBarrier|) (= (store (store (store |c_old(#memory_$Pointer$.offset)| |v_append_to_queue_~#p.base_31| v_ArrVal_1215) append_to_queue_~node~0.base v_ArrVal_1223) |c_append_to_queue_#in~q.base| v_ArrVal_1214) |c_#memory_$Pointer$.offset|) (= (select |c_old(#valid)| |v_append_to_queue_~#p.base_31|) 0))) is different from true [2022-07-12 03:39:17,401 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:39:17,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:39:17,424 INFO L356 Elim1Store]: treesize reduction 33, result has 40.0 percent of original size [2022-07-12 03:39:17,424 INFO L390 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 [2022-07-12 03:39:17,431 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:39:17,432 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:39:17,451 INFO L356 Elim1Store]: treesize reduction 33, result has 40.0 percent of original size [2022-07-12 03:39:17,451 INFO L390 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 [2022-07-12 03:39:17,466 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-07-12 03:39:17,466 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-07-12 03:39:17,507 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-12 03:39:17,509 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-12 03:39:17,512 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:39:17,512 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:39:19,648 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [441579548] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:39:19,648 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 03:39:19,648 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2022-07-12 03:39:19,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946959494] [2022-07-12 03:39:19,648 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 03:39:19,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-12 03:39:19,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:39:19,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-12 03:39:19,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=136, Unknown=2, NotChecked=24, Total=210 [2022-07-12 03:39:19,649 INFO L87 Difference]: Start difference. First operand 86 states and 111 transitions. Second operand has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 12 states have internal predecessors, (32), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-12 03:39:22,073 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse4 (@diff |c_old(#memory_$Pointer$.offset)| |c_#memory_$Pointer$.offset|)) (.cse13 (@diff |c_old(#memory_$Pointer$.base)| |c_#memory_$Pointer$.base|))) (let ((.cse6 (store |c_old(#memory_$Pointer$.base)| .cse13 (select |c_#memory_$Pointer$.base| .cse13))) (.cse25 (store |c_old(#memory_$Pointer$.offset)| .cse4 (select |c_#memory_$Pointer$.offset| .cse4)))) (let ((.cse24 (@diff .cse25 |c_#memory_$Pointer$.offset|)) (.cse5 (@diff .cse6 |c_#memory_$Pointer$.base|))) (let ((.cse7 (store .cse6 .cse5 (select |c_#memory_$Pointer$.base| .cse5))) (.cse3 (store .cse25 .cse24 (select |c_#memory_$Pointer$.offset| .cse24)))) (let ((.cse2 (@diff .cse3 |c_#memory_$Pointer$.offset|)) (.cse8 (@diff .cse7 |c_#memory_$Pointer$.base|))) (let ((.cse15 (store .cse7 .cse8 (select |c_#memory_$Pointer$.base| .cse8))) (.cse23 (store .cse3 .cse2 (select |c_#memory_$Pointer$.offset| .cse2)))) (let ((.cse22 (@diff .cse23 |c_#memory_$Pointer$.offset|)) (.cse14 (@diff .cse15 |c_#memory_$Pointer$.base|))) (let ((.cse1 (store .cse15 .cse14 (select |c_#memory_$Pointer$.base| .cse14))) (.cse21 (store .cse23 .cse22 (select |c_#memory_$Pointer$.offset| .cse22)))) (let ((.cse20 (@diff .cse21 |c_#memory_$Pointer$.offset|)) (.cse0 (@diff .cse1 |c_#memory_$Pointer$.base|))) (let ((.cse10 (store .cse1 .cse0 (select |c_#memory_$Pointer$.base| .cse0))) (.cse11 (store .cse21 .cse20 (select |c_#memory_$Pointer$.offset| .cse20)))) (let ((.cse12 (@diff .cse11 |c_#memory_$Pointer$.offset|)) (.cse9 (@diff .cse10 |c_#memory_$Pointer$.base|))) (let ((.cse18 (store .cse10 .cse9 (select |c_#memory_$Pointer$.base| .cse9))) (.cse16 (store .cse11 .cse12 (select |c_#memory_$Pointer$.offset| .cse12)))) (let ((.cse17 (@diff .cse16 |c_#memory_$Pointer$.offset|)) (.cse19 (@diff .cse18 |c_#memory_$Pointer$.base|))) (and (exists ((v_ArrVal_1219 (Array Int Int)) (v_ArrVal_1218 (Array Int Int)) (v_ArrVal_1215 (Array Int Int)) (v_ArrVal_1214 (Array Int Int)) (v_ArrVal_1213 (Array Int Int)) (v_ArrVal_1223 (Array Int Int)) (|v_append_to_queue_~#p.base_31| Int) (append_to_queue_~node~0.base Int)) (and (= (store (store (store |c_old(#memory_$Pointer$.base)| |v_append_to_queue_~#p.base_31| v_ArrVal_1218) append_to_queue_~node~0.base v_ArrVal_1213) |c_append_to_queue_#in~q.base| v_ArrVal_1219) |c_#memory_$Pointer$.base|) (< append_to_queue_~node~0.base |c_#StackHeapBarrier|) (= (store (store (store |c_old(#memory_$Pointer$.offset)| |v_append_to_queue_~#p.base_31| v_ArrVal_1215) append_to_queue_~node~0.base v_ArrVal_1223) |c_append_to_queue_#in~q.base| v_ArrVal_1214) |c_#memory_$Pointer$.offset|) (= (select |c_old(#valid)| |v_append_to_queue_~#p.base_31|) 0))) (or (= (select |c_old(#valid)| .cse0) 0) (= .cse0 |c_append_to_queue_#in~q.base|) (= |c_#memory_$Pointer$.base| .cse1) (<= (+ .cse0 1) |c_#StackHeapBarrier|)) (or (<= (+ .cse2 1) |c_#StackHeapBarrier|) (= .cse2 |c_append_to_queue_#in~q.base|) (= |c_#memory_$Pointer$.offset| .cse3) (= (select |c_old(#valid)| .cse2) 0)) (or (= (select |c_old(#valid)| .cse4) 0) (= .cse4 |c_append_to_queue_#in~q.base|) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (<= (+ .cse4 1) |c_#StackHeapBarrier|)) (or (= (select |c_old(#valid)| .cse5) 0) (= |c_#memory_$Pointer$.base| .cse6) (= .cse5 |c_append_to_queue_#in~q.base|) (<= (+ .cse5 1) |c_#StackHeapBarrier|)) (or (= |c_#memory_$Pointer$.base| .cse7) (<= (+ .cse8 1) |c_#StackHeapBarrier|) (= (select |c_old(#valid)| .cse8) 0) (= .cse8 |c_append_to_queue_#in~q.base|)) (or (= (select |c_old(#valid)| .cse9) 0) (= .cse10 |c_#memory_$Pointer$.base|) (<= (+ .cse9 1) |c_#StackHeapBarrier|) (= .cse9 |c_append_to_queue_#in~q.base|)) (or (= .cse11 |c_#memory_$Pointer$.offset|) (= (select |c_old(#valid)| .cse12) 0) (<= (+ .cse12 1) |c_#StackHeapBarrier|) (= .cse12 |c_append_to_queue_#in~q.base|)) (or (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= (select |c_old(#valid)| .cse13) 0) (= .cse13 |c_append_to_queue_#in~q.base|) (<= (+ .cse13 1) |c_#StackHeapBarrier|)) (or (= (select |c_old(#valid)| .cse14) 0) (= |c_#memory_$Pointer$.base| .cse15) (= .cse14 |c_append_to_queue_#in~q.base|) (<= (+ .cse14 1) |c_#StackHeapBarrier|)) (= |c_#memory_$Pointer$.offset| (store .cse16 .cse17 (select |c_#memory_$Pointer$.offset| .cse17))) (or (= (select |c_old(#valid)| .cse17) 0) (= .cse17 |c_append_to_queue_#in~q.base|) (<= (+ .cse17 1) |c_#StackHeapBarrier|) (= .cse16 |c_#memory_$Pointer$.offset|)) (= |c_#memory_$Pointer$.base| (store .cse18 .cse19 (select |c_#memory_$Pointer$.base| .cse19))) (or (= (select |c_old(#valid)| .cse20) 0) (<= (+ .cse20 1) |c_#StackHeapBarrier|) (= .cse21 |c_#memory_$Pointer$.offset|) (= .cse20 |c_append_to_queue_#in~q.base|)) (or (= .cse22 |c_append_to_queue_#in~q.base|) (= |c_#memory_$Pointer$.offset| .cse23) (= (select |c_old(#valid)| .cse22) 0) (<= (+ .cse22 1) |c_#StackHeapBarrier|)) (or (= |c_#memory_$Pointer$.base| .cse18) (<= (+ .cse19 1) |c_#StackHeapBarrier|) (= (select |c_old(#valid)| .cse19) 0) (= |c_append_to_queue_#in~q.base| .cse19)) (or (= .cse24 |c_append_to_queue_#in~q.base|) (= |c_#memory_$Pointer$.offset| .cse25) (= (select |c_old(#valid)| .cse24) 0) (<= (+ .cse24 1) |c_#StackHeapBarrier|)))))))))))))))) is different from true [2022-07-12 03:39:24,631 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 03:39:27,414 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 03:39:29,825 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 03:39:29,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:39:29,877 INFO L93 Difference]: Finished difference Result 127 states and 162 transitions. [2022-07-12 03:39:29,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-12 03:39:29,880 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 12 states have internal predecessors, (32), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 23 [2022-07-12 03:39:29,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:39:29,881 INFO L225 Difference]: With dead ends: 127 [2022-07-12 03:39:29,881 INFO L226 Difference]: Without dead ends: 104 [2022-07-12 03:39:29,883 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 14.2s TimeCoverageRelationStatistics Valid=71, Invalid=206, Unknown=3, NotChecked=62, Total=342 [2022-07-12 03:39:29,885 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 29 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 15 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 89 IncrementalHoareTripleChecker+Unchecked, 8.0s IncrementalHoareTripleChecker+Time [2022-07-12 03:39:29,885 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 250 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 110 Invalid, 3 Unknown, 89 Unchecked, 8.0s Time] [2022-07-12 03:39:29,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-07-12 03:39:29,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 95. [2022-07-12 03:39:29,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 84 states have (on average 1.2976190476190477) internal successors, (109), 85 states have internal predecessors, (109), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-07-12 03:39:29,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 123 transitions. [2022-07-12 03:39:29,897 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 123 transitions. Word has length 23 [2022-07-12 03:39:29,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:39:29,898 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 123 transitions. [2022-07-12 03:39:29,898 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 12 states have internal predecessors, (32), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-12 03:39:29,898 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 123 transitions. [2022-07-12 03:39:29,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-12 03:39:29,899 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:39:29,899 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:39:29,921 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-12 03:39:30,107 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:39:30,108 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:39:30,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:39:30,108 INFO L85 PathProgramCache]: Analyzing trace with hash -1306051597, now seen corresponding path program 2 times [2022-07-12 03:39:30,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:39:30,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747235509] [2022-07-12 03:39:30,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:39:30,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:39:30,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:39:30,218 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-12 03:39:30,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:39:30,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747235509] [2022-07-12 03:39:30,219 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747235509] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:39:30,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1465734148] [2022-07-12 03:39:30,219 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 03:39:30,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:39:30,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:39:30,221 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 03:39:30,222 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-12 03:39:30,357 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 03:39:30,358 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 03:39:30,359 INFO L263 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 59 conjunts are in the unsatisfiable core [2022-07-12 03:39:30,367 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:39:30,377 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 03:39:30,377 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2022-07-12 03:39:30,409 INFO L356 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-07-12 03:39:30,410 INFO L390 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 [2022-07-12 03:39:30,420 INFO L390 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 [2022-07-12 03:39:30,424 INFO L390 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 [2022-07-12 03:39:30,466 INFO L390 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 [2022-07-12 03:39:30,470 INFO L390 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 [2022-07-12 03:39:30,473 INFO L390 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 [2022-07-12 03:39:30,508 INFO L390 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 [2022-07-12 03:39:30,528 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 03:39:30,528 INFO L390 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 [2022-07-12 03:39:30,533 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-12 03:39:30,544 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 03:39:30,544 INFO L390 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 [2022-07-12 03:39:30,550 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-12 03:39:30,564 INFO L356 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-07-12 03:39:30,564 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-07-12 03:39:30,579 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-12 03:39:30,581 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-12 03:39:30,601 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-12 03:39:30,603 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-12 03:39:30,606 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-12 03:39:30,606 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:39:30,631 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1378 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_receive_~#packet~0#1.base| v_ArrVal_1378) |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0)) (forall ((v_ArrVal_1376 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_receive_~#packet~0#1.base| v_ArrVal_1376) |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0))) is different from false [2022-07-12 03:39:31,035 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1370 Int) (v_ArrVal_1365 (Array Int Int)) (v_ArrVal_1369 Int) (|v_ULTIMATE.start_main_~#new_packet~0#1.base_20| Int)) (or (not (= (select (store (store |c_#valid| |c_ULTIMATE.start_receive_~#packet~0#1.base| v_ArrVal_1369) |c_ULTIMATE.start_main_~#new_packet~0#1.base| v_ArrVal_1370) |v_ULTIMATE.start_main_~#new_packet~0#1.base_20|) 0)) (forall ((|v_ULTIMATE.start_receive_~#packet~0#1.base_15| Int)) (or (forall ((v_ArrVal_1376 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_receive_~#packet~0#1.base| v_ArrVal_1365) |v_ULTIMATE.start_receive_~#packet~0#1.base_15| v_ArrVal_1376) |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_1369) |c_ULTIMATE.start_main_~#new_packet~0#1.base| v_ArrVal_1370) |v_ULTIMATE.start_main_~#new_packet~0#1.base_20| 1) |v_ULTIMATE.start_receive_~#packet~0#1.base_15|) 0)))))) (forall ((v_ArrVal_1370 Int) (v_ArrVal_1366 (Array Int Int)) (v_ArrVal_1369 Int) (|v_ULTIMATE.start_main_~#new_packet~0#1.base_20| Int)) (or (forall ((|v_ULTIMATE.start_receive_~#packet~0#1.base_15| Int)) (or (forall ((v_ArrVal_1378 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_receive_~#packet~0#1.base| v_ArrVal_1366) |v_ULTIMATE.start_receive_~#packet~0#1.base_15| v_ArrVal_1378) |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_1369) |c_ULTIMATE.start_main_~#new_packet~0#1.base| v_ArrVal_1370) |v_ULTIMATE.start_main_~#new_packet~0#1.base_20| 1) |v_ULTIMATE.start_receive_~#packet~0#1.base_15|) 0)))) (not (= (select (store (store |c_#valid| |c_ULTIMATE.start_receive_~#packet~0#1.base| v_ArrVal_1369) |c_ULTIMATE.start_main_~#new_packet~0#1.base| v_ArrVal_1370) |v_ULTIMATE.start_main_~#new_packet~0#1.base_20|) 0))))) is different from false [2022-07-12 03:39:31,712 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-07-12 03:39:31,712 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1465734148] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 03:39:31,712 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 03:39:31,713 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 9] total 15 [2022-07-12 03:39:31,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971435168] [2022-07-12 03:39:31,714 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 03:39:31,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-12 03:39:31,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:39:31,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-12 03:39:31,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=100, Unknown=3, NotChecked=46, Total=210 [2022-07-12 03:39:31,717 INFO L87 Difference]: Start difference. First operand 95 states and 123 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) [2022-07-12 03:39:31,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:39:31,859 INFO L93 Difference]: Finished difference Result 131 states and 168 transitions. [2022-07-12 03:39:31,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 03:39:31,860 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 [2022-07-12 03:39:31,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:39:31,860 INFO L225 Difference]: With dead ends: 131 [2022-07-12 03:39:31,860 INFO L226 Difference]: Without dead ends: 108 [2022-07-12 03:39:31,861 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 39 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=68, Invalid=119, Unknown=3, NotChecked=50, Total=240 [2022-07-12 03:39:31,861 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 60 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 198 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 03:39:31,861 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 328 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 90 Invalid, 0 Unknown, 198 Unchecked, 0.1s Time] [2022-07-12 03:39:31,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2022-07-12 03:39:31,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 95. [2022-07-12 03:39:31,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 84 states have (on average 1.2976190476190477) internal successors, (109), 85 states have internal predecessors, (109), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-07-12 03:39:31,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 123 transitions. [2022-07-12 03:39:31,872 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 123 transitions. Word has length 23 [2022-07-12 03:39:31,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:39:31,872 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 123 transitions. [2022-07-12 03:39:31,872 INFO L496 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) [2022-07-12 03:39:31,872 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 123 transitions. [2022-07-12 03:39:31,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-12 03:39:31,873 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:39:31,874 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:39:31,894 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-12 03:39:32,081 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:39:32,082 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:39:32,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:39:32,082 INFO L85 PathProgramCache]: Analyzing trace with hash -1130104883, now seen corresponding path program 1 times [2022-07-12 03:39:32,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:39:32,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874848043] [2022-07-12 03:39:32,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:39:32,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:39:32,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:39:32,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 03:39:32,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:39:32,160 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:39:32,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:39:32,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874848043] [2022-07-12 03:39:32,161 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874848043] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:39:32,161 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:39:32,161 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 03:39:32,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139815123] [2022-07-12 03:39:32,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:39:32,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 03:39:32,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:39:32,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 03:39:32,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 03:39:32,163 INFO L87 Difference]: Start difference. First operand 95 states and 123 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) [2022-07-12 03:39:32,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:39:32,281 INFO L93 Difference]: Finished difference Result 122 states and 155 transitions. [2022-07-12 03:39:32,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 03:39:32,282 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 [2022-07-12 03:39:32,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:39:32,282 INFO L225 Difference]: With dead ends: 122 [2022-07-12 03:39:32,282 INFO L226 Difference]: Without dead ends: 109 [2022-07-12 03:39:32,283 INFO L412 NwaCegarLoop]: 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 [2022-07-12 03:39:32,283 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 17 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 03:39:32,283 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 186 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 03:39:32,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-07-12 03:39:32,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 100. [2022-07-12 03:39:32,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 89 states have (on average 1.2696629213483146) internal successors, (113), 90 states have internal predecessors, (113), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-07-12 03:39:32,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 127 transitions. [2022-07-12 03:39:32,289 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 127 transitions. Word has length 24 [2022-07-12 03:39:32,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:39:32,289 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 127 transitions. [2022-07-12 03:39:32,289 INFO L496 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) [2022-07-12 03:39:32,289 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 127 transitions. [2022-07-12 03:39:32,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-12 03:39:32,289 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:39:32,289 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:39:32,289 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-12 03:39:32,290 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:39:32,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:39:32,290 INFO L85 PathProgramCache]: Analyzing trace with hash -28321902, now seen corresponding path program 1 times [2022-07-12 03:39:32,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:39:32,290 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637249262] [2022-07-12 03:39:32,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:39:32,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:39:32,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:39:32,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 03:39:32,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:39:32,470 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:39:32,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:39:32,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637249262] [2022-07-12 03:39:32,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637249262] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:39:32,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1752518511] [2022-07-12 03:39:32,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:39:32,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:39:32,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:39:32,472 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 03:39:32,473 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-12 03:39:32,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:39:32,641 INFO L263 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 66 conjunts are in the unsatisfiable core [2022-07-12 03:39:32,644 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:39:32,725 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2022-07-12 03:39:32,780 INFO L356 Elim1Store]: treesize reduction 40, result has 42.9 percent of original size [2022-07-12 03:39:32,780 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 64 [2022-07-12 03:39:32,805 INFO L356 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2022-07-12 03:39:32,805 INFO L390 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 74 [2022-07-12 03:39:32,827 INFO L356 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2022-07-12 03:39:32,827 INFO L390 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 74 [2022-07-12 03:39:32,856 INFO L356 Elim1Store]: treesize reduction 20, result has 57.4 percent of original size [2022-07-12 03:39:32,856 INFO L390 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 43 treesize of output 60 [2022-07-12 03:39:32,865 INFO L390 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 [2022-07-12 03:39:32,883 INFO L390 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 [2022-07-12 03:39:32,892 INFO L390 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 [2022-07-12 03:39:32,899 INFO L390 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 [2022-07-12 03:39:32,944 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-12 03:39:32,957 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-12 03:39:32,965 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:39:32,965 INFO L390 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 0 case distinctions, treesize of input 47 treesize of output 5 [2022-07-12 03:39:32,969 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-12 03:39:33,019 INFO L356 Elim1Store]: treesize reduction 25, result has 3.8 percent of original size [2022-07-12 03:39:33,019 INFO L390 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 1 case distinctions, treesize of input 129 treesize of output 79 [2022-07-12 03:39:33,024 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 14 [2022-07-12 03:39:33,252 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-12 03:39:33,252 INFO L390 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 111 treesize of output 84 [2022-07-12 03:39:33,256 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 59 [2022-07-12 03:39:33,260 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:39:33,263 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:39:33,263 INFO L390 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 14 [2022-07-12 03:39:33,268 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 03:39:33,272 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2022-07-12 03:39:33,298 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:39:33,298 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:39:33,529 INFO L356 Elim1Store]: treesize reduction 41, result has 62.0 percent of original size [2022-07-12 03:39:33,529 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 7 case distinctions, treesize of input 115 treesize of output 92 [2022-07-12 03:39:33,536 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-12 03:39:33,536 INFO L390 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 86 treesize of output 62 [2022-07-12 03:39:33,540 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2022-07-12 03:39:33,625 INFO L356 Elim1Store]: treesize reduction 107, result has 0.9 percent of original size [2022-07-12 03:39:33,625 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 7 case distinctions, treesize of input 115 treesize of output 1 [2022-07-12 03:39:33,733 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:39:33,733 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1752518511] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 03:39:33,733 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 03:39:33,733 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 11] total 24 [2022-07-12 03:39:33,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015086265] [2022-07-12 03:39:33,734 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 03:39:33,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-07-12 03:39:33,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:39:33,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-07-12 03:39:33,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=457, Unknown=0, NotChecked=0, Total=552 [2022-07-12 03:39:33,735 INFO L87 Difference]: Start difference. First operand 100 states and 127 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) [2022-07-12 03:39:34,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:39:34,125 INFO L93 Difference]: Finished difference Result 139 states and 176 transitions. [2022-07-12 03:39:34,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-12 03:39:34,126 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 [2022-07-12 03:39:34,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:39:34,127 INFO L225 Difference]: With dead ends: 139 [2022-07-12 03:39:34,127 INFO L226 Difference]: Without dead ends: 137 [2022-07-12 03:39:34,127 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=119, Invalid=583, Unknown=0, NotChecked=0, Total=702 [2022-07-12 03:39:34,128 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 114 mSDsluCounter, 493 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 555 SdHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 123 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 03:39:34,128 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 555 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 291 Invalid, 0 Unknown, 123 Unchecked, 0.3s Time] [2022-07-12 03:39:34,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2022-07-12 03:39:34,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 113. [2022-07-12 03:39:34,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 101 states have (on average 1.2673267326732673) internal successors, (128), 102 states have internal predecessors, (128), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-07-12 03:39:34,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 144 transitions. [2022-07-12 03:39:34,138 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 144 transitions. Word has length 25 [2022-07-12 03:39:34,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:39:34,138 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 144 transitions. [2022-07-12 03:39:34,139 INFO L496 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) [2022-07-12 03:39:34,139 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 144 transitions. [2022-07-12 03:39:34,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-12 03:39:34,139 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:39:34,139 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:39:34,173 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-12 03:39:34,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:39:34,355 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:39:34,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:39:34,356 INFO L85 PathProgramCache]: Analyzing trace with hash -28319980, now seen corresponding path program 1 times [2022-07-12 03:39:34,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:39:34,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075913915] [2022-07-12 03:39:34,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:39:34,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:39:34,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:39:34,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 03:39:34,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:39:34,552 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:39:34,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:39:34,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075913915] [2022-07-12 03:39:34,552 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075913915] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:39:34,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [109835402] [2022-07-12 03:39:34,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:39:34,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:39:34,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:39:34,554 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) [2022-07-12 03:39:34,599 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-12 03:39:34,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:39:34,758 INFO L263 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 72 conjunts are in the unsatisfiable core [2022-07-12 03:39:34,764 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:39:34,835 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 15 [2022-07-12 03:39:34,958 INFO L356 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2022-07-12 03:39:34,958 INFO L390 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 [2022-07-12 03:39:35,011 INFO L356 Elim1Store]: treesize reduction 40, result has 42.9 percent of original size [2022-07-12 03:39:35,011 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 64 [2022-07-12 03:39:35,035 INFO L356 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2022-07-12 03:39:35,036 INFO L390 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 74 [2022-07-12 03:39:35,061 INFO L356 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2022-07-12 03:39:35,061 INFO L390 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 74 [2022-07-12 03:39:35,088 INFO L356 Elim1Store]: treesize reduction 20, result has 57.4 percent of original size [2022-07-12 03:39:35,088 INFO L390 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 43 treesize of output 60 [2022-07-12 03:39:35,097 INFO L390 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 [2022-07-12 03:39:35,114 INFO L390 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 [2022-07-12 03:39:35,122 INFO L390 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 [2022-07-12 03:39:35,130 INFO L390 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 [2022-07-12 03:39:35,197 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-12 03:39:35,204 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-12 03:39:35,239 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 62 treesize of output 15 [2022-07-12 03:39:35,243 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-12 03:39:35,295 INFO L356 Elim1Store]: treesize reduction 33, result has 2.9 percent of original size [2022-07-12 03:39:35,296 INFO L390 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 151 treesize of output 93 [2022-07-12 03:39:35,299 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2022-07-12 03:39:35,496 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-07-12 03:39:35,498 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-12 03:39:35,516 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2022-07-12 03:39:35,517 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:39:35,517 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:39:35,836 INFO L356 Elim1Store]: treesize reduction 41, result has 62.0 percent of original size [2022-07-12 03:39:35,838 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 7 case distinctions, treesize of input 57 treesize of output 79 [2022-07-12 03:39:35,846 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-12 03:39:35,846 INFO L390 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 68 treesize of output 48 [2022-07-12 03:39:35,849 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2022-07-12 03:39:35,931 INFO L356 Elim1Store]: treesize reduction 107, result has 0.9 percent of original size [2022-07-12 03:39:35,932 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 7 case distinctions, treesize of input 57 treesize of output 1 [2022-07-12 03:39:36,080 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 301 treesize of output 283 [2022-07-12 03:39:36,178 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 198 treesize of output 186 [2022-07-12 03:39:36,284 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:39:36,285 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [109835402] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 03:39:36,285 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 03:39:36,285 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 13] total 32 [2022-07-12 03:39:36,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131176756] [2022-07-12 03:39:36,285 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 03:39:36,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-07-12 03:39:36,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:39:36,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-07-12 03:39:36,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=867, Unknown=0, NotChecked=0, Total=992 [2022-07-12 03:39:36,286 INFO L87 Difference]: Start difference. First operand 113 states and 144 transitions. Second operand has 32 states, 29 states have (on average 2.103448275862069) internal successors, (61), 31 states have internal predecessors, (61), 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) [2022-07-12 03:39:36,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:39:36,904 INFO L93 Difference]: Finished difference Result 134 states and 168 transitions. [2022-07-12 03:39:36,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-12 03:39:36,904 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 29 states have (on average 2.103448275862069) internal successors, (61), 31 states have internal predecessors, (61), 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 25 [2022-07-12 03:39:36,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:39:36,905 INFO L225 Difference]: With dead ends: 134 [2022-07-12 03:39:36,905 INFO L226 Difference]: Without dead ends: 122 [2022-07-12 03:39:36,905 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 362 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=178, Invalid=1228, Unknown=0, NotChecked=0, Total=1406 [2022-07-12 03:39:36,906 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 21 mSDsluCounter, 561 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 600 SdHoareTripleChecker+Invalid, 450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 57 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-12 03:39:36,906 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 600 Invalid, 450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 375 Invalid, 0 Unknown, 57 Unchecked, 0.5s Time] [2022-07-12 03:39:36,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2022-07-12 03:39:36,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 116. [2022-07-12 03:39:36,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 104 states have (on average 1.2596153846153846) internal successors, (131), 105 states have internal predecessors, (131), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-07-12 03:39:36,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 147 transitions. [2022-07-12 03:39:36,914 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 147 transitions. Word has length 25 [2022-07-12 03:39:36,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:39:36,914 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 147 transitions. [2022-07-12 03:39:36,915 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 29 states have (on average 2.103448275862069) internal successors, (61), 31 states have internal predecessors, (61), 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) [2022-07-12 03:39:36,915 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 147 transitions. [2022-07-12 03:39:36,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-12 03:39:36,917 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:39:36,917 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:39:36,935 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-07-12 03:39:37,134 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-07-12 03:39:37,135 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:39:37,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:39:37,135 INFO L85 PathProgramCache]: Analyzing trace with hash -1025087574, now seen corresponding path program 2 times [2022-07-12 03:39:37,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:39:37,135 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613883376] [2022-07-12 03:39:37,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:39:37,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:39:37,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:39:37,249 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:39:37,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:39:37,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613883376] [2022-07-12 03:39:37,250 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613883376] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:39:37,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1038894765] [2022-07-12 03:39:37,250 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 03:39:37,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:39:37,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:39:37,251 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) [2022-07-12 03:39:37,252 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-12 03:39:37,428 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 03:39:37,428 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 03:39:37,430 INFO L263 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 55 conjunts are in the unsatisfiable core [2022-07-12 03:39:37,432 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:39:37,442 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 03:39:37,442 INFO L390 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 [2022-07-12 03:39:37,482 INFO L356 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-07-12 03:39:37,482 INFO L390 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 [2022-07-12 03:39:37,491 INFO L390 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 [2022-07-12 03:39:37,496 INFO L390 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 [2022-07-12 03:39:37,530 INFO L390 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 [2022-07-12 03:39:37,534 INFO L390 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 [2022-07-12 03:39:37,539 INFO L390 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 [2022-07-12 03:39:37,574 INFO L390 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 [2022-07-12 03:39:37,594 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 03:39:37,595 INFO L390 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 [2022-07-12 03:39:37,598 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-12 03:39:37,608 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 03:39:37,608 INFO L390 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 [2022-07-12 03:39:37,610 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-12 03:39:37,622 INFO L356 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-07-12 03:39:37,622 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-07-12 03:39:37,637 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-12 03:39:37,641 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-12 03:39:37,661 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-12 03:39:37,663 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-12 03:39:37,665 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-12 03:39:37,665 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:39:37,701 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2297 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_receive_~#packet~0#1.base| v_ArrVal_2297) |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) |c_ULTIMATE.start_main_~#normal_queue~0#1.offset|) 0)) (forall ((v_ArrVal_2294 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_receive_~#packet~0#1.base| v_ArrVal_2294) |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) |c_ULTIMATE.start_main_~#normal_queue~0#1.offset|) 0))) is different from false [2022-07-12 03:39:40,915 INFO L356 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2022-07-12 03:39:40,916 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 29735 treesize of output 1 [2022-07-12 03:39:40,960 INFO L356 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2022-07-12 03:39:40,960 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 29735 treesize of output 1 [2022-07-12 03:39:40,961 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-07-12 03:39:40,962 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1038894765] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 03:39:40,962 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 03:39:40,962 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 16 [2022-07-12 03:39:40,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934698938] [2022-07-12 03:39:40,962 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 03:39:40,963 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-12 03:39:40,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:39:40,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-12 03:39:40,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=137, Unknown=4, NotChecked=26, Total=240 [2022-07-12 03:39:40,964 INFO L87 Difference]: Start difference. First operand 116 states and 147 transitions. Second operand has 16 states, 16 states have (on average 2.75) internal successors, (44), 16 states have internal predecessors, (44), 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) [2022-07-12 03:39:41,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:39:41,128 INFO L93 Difference]: Finished difference Result 132 states and 165 transitions. [2022-07-12 03:39:41,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 03:39:41,128 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.75) internal successors, (44), 16 states have internal predecessors, (44), 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 25 [2022-07-12 03:39:41,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:39:41,129 INFO L225 Difference]: With dead ends: 132 [2022-07-12 03:39:41,129 INFO L226 Difference]: Without dead ends: 116 [2022-07-12 03:39:41,129 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=81, Invalid=159, Unknown=4, NotChecked=28, Total=272 [2022-07-12 03:39:41,130 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 28 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 74 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 03:39:41,130 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 278 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 100 Invalid, 0 Unknown, 74 Unchecked, 0.1s Time] [2022-07-12 03:39:41,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-07-12 03:39:41,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 108. [2022-07-12 03:39:41,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 96 states have (on average 1.2604166666666667) internal successors, (121), 97 states have internal predecessors, (121), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-07-12 03:39:41,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 137 transitions. [2022-07-12 03:39:41,141 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 137 transitions. Word has length 25 [2022-07-12 03:39:41,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:39:41,141 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 137 transitions. [2022-07-12 03:39:41,141 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.75) internal successors, (44), 16 states have internal predecessors, (44), 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) [2022-07-12 03:39:41,141 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 137 transitions. [2022-07-12 03:39:41,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-12 03:39:41,142 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:39:41,142 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:39:41,162 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-07-12 03:39:41,360 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-07-12 03:39:41,360 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:39:41,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:39:41,361 INFO L85 PathProgramCache]: Analyzing trace with hash 1069112326, now seen corresponding path program 1 times [2022-07-12 03:39:41,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:39:41,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445269684] [2022-07-12 03:39:41,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:39:41,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:39:41,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:39:41,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 03:39:41,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:39:41,755 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:39:41,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:39:41,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445269684] [2022-07-12 03:39:41,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445269684] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:39:41,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1921379329] [2022-07-12 03:39:41,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:39:41,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:39:41,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:39:41,757 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) [2022-07-12 03:39:41,783 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-12 03:39:41,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:39:41,996 INFO L263 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 101 conjunts are in the unsatisfiable core [2022-07-12 03:39:42,002 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:39:42,017 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 03:39:42,017 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2022-07-12 03:39:42,064 INFO L356 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-07-12 03:39:42,065 INFO L390 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 [2022-07-12 03:39:42,116 INFO L390 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 [2022-07-12 03:39:42,199 INFO L390 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 21 treesize of output 9 [2022-07-12 03:39:42,235 INFO L390 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 [2022-07-12 03:39:42,286 INFO L356 Elim1Store]: treesize reduction 40, result has 42.9 percent of original size [2022-07-12 03:39:42,287 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 64 [2022-07-12 03:39:42,320 INFO L356 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2022-07-12 03:39:42,320 INFO L390 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 74 [2022-07-12 03:39:42,350 INFO L356 Elim1Store]: treesize reduction 20, result has 57.4 percent of original size [2022-07-12 03:39:42,350 INFO L390 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 43 treesize of output 60 [2022-07-12 03:39:42,358 INFO L390 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 [2022-07-12 03:39:42,383 INFO L356 Elim1Store]: treesize reduction 42, result has 45.5 percent of original size [2022-07-12 03:39:42,383 INFO L390 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 52 treesize of output 114 [2022-07-12 03:39:42,390 INFO L390 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 [2022-07-12 03:39:42,397 INFO L390 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 [2022-07-12 03:39:42,404 INFO L390 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 [2022-07-12 03:39:42,449 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-12 03:39:42,462 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-12 03:39:42,492 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 66 treesize of output 19 [2022-07-12 03:39:42,496 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-07-12 03:39:42,514 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 62 treesize of output 15 [2022-07-12 03:39:42,519 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-12 03:39:46,067 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:39:46,102 INFO L356 Elim1Store]: treesize reduction 70, result has 38.6 percent of original size [2022-07-12 03:39:46,102 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 32 treesize of output 58 [2022-07-12 03:39:46,254 INFO L390 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 25 treesize of output 25 [2022-07-12 03:39:46,355 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 03:39:46,356 INFO L390 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 42 treesize of output 44 [2022-07-12 03:39:46,377 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:39:46,378 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-07-12 03:39:46,383 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2022-07-12 03:39:46,403 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 03:39:46,404 INFO L390 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 [2022-07-12 03:39:46,408 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-12 03:39:46,416 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 03:39:46,417 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-07-12 03:39:46,486 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 40 [2022-07-12 03:39:46,491 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-12 03:39:46,494 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:39:46,495 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2022-07-12 03:39:46,568 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 22 [2022-07-12 03:39:46,572 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-12 03:39:46,606 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 27 [2022-07-12 03:39:46,630 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:39:46,630 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:39:46,702 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2637 (Array Int Int)) (v_ArrVal_2640 (Array Int Int)) (v_ArrVal_2639 (Array Int Int))) (= (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_receive_~#packet~0#1.base| v_ArrVal_2637) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_receive_~#packet~0#1.base| v_ArrVal_2639) |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|)) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_receive_~#packet~0#1.base| v_ArrVal_2640) |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 4)) 4294967296) 1)) is different from false [2022-07-12 03:39:46,718 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2637 (Array Int Int)) (|v_ULTIMATE.start_main_~#new_packet~0#1.base_32| Int) (|v_ULTIMATE.start_receive_~#packet~0#1.base_27| Int) (v_ArrVal_2640 (Array Int Int)) (v_ArrVal_2639 (Array Int Int))) (or (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_receive_~#packet~0#1.base_27|)) (not (= (select (store |c_#valid| |v_ULTIMATE.start_main_~#new_packet~0#1.base_32| 1) |v_ULTIMATE.start_receive_~#packet~0#1.base_27|) 0)) (= (mod (select (select (store |c_#memory_int| |v_ULTIMATE.start_receive_~#packet~0#1.base_27| v_ArrVal_2637) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_receive_~#packet~0#1.base_27| v_ArrVal_2639) |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|)) (+ (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_receive_~#packet~0#1.base_27| v_ArrVal_2640) |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 4)) 4294967296) 1))) is different from false [2022-07-12 03:39:46,737 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2637 (Array Int Int)) (|v_ULTIMATE.start_main_~#new_packet~0#1.base_32| Int) (|v_ULTIMATE.start_receive_~#packet~0#1.base_27| Int) (v_ArrVal_2640 (Array Int Int)) (v_ArrVal_2631 Int) (v_ArrVal_2639 (Array Int Int))) (or (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_receive_~#packet~0#1.base_27|)) (not (= (select (store (store |c_#valid| |c_ULTIMATE.start_main_~#new_packet~0#1.base| v_ArrVal_2631) |v_ULTIMATE.start_main_~#new_packet~0#1.base_32| 1) |v_ULTIMATE.start_receive_~#packet~0#1.base_27|) 0)) (= (mod (select (select (store |c_#memory_int| |v_ULTIMATE.start_receive_~#packet~0#1.base_27| v_ArrVal_2637) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_receive_~#packet~0#1.base_27| v_ArrVal_2639) |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|)) (+ (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_receive_~#packet~0#1.base_27| v_ArrVal_2640) |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 4)) 4294967296) 1))) is different from false [2022-07-12 03:39:47,100 INFO L356 Elim1Store]: treesize reduction 41, result has 62.0 percent of original size [2022-07-12 03:39:47,100 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 7 case distinctions, treesize of input 104 treesize of output 126 [2022-07-12 03:39:47,118 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:39:47,253 INFO L356 Elim1Store]: treesize reduction 82, result has 57.5 percent of original size [2022-07-12 03:39:47,253 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 3 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 18 case distinctions, treesize of input 488 treesize of output 538 [2022-07-12 03:39:47,268 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 482 treesize of output 456 [2022-07-12 03:39:47,285 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:39:47,285 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 388 treesize of output 380 [2022-07-12 03:39:47,295 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 373 treesize of output 307 [2022-07-12 03:39:47,322 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:39:47,322 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 258 treesize of output 245 [2022-07-12 03:39:47,538 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1921379329] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:39:47,538 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 03:39:47,539 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 29 [2022-07-12 03:39:47,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390808055] [2022-07-12 03:39:47,539 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 03:39:47,539 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-07-12 03:39:47,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:39:47,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-07-12 03:39:47,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=887, Unknown=3, NotChecked=186, Total=1190 [2022-07-12 03:39:47,540 INFO L87 Difference]: Start difference. First operand 108 states and 137 transitions. Second operand has 29 states, 27 states have (on average 1.8888888888888888) internal successors, (51), 27 states have internal predecessors, (51), 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) [2022-07-12 03:39:49,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:39:49,811 INFO L93 Difference]: Finished difference Result 194 states and 247 transitions. [2022-07-12 03:39:49,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-07-12 03:39:49,812 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 27 states have (on average 1.8888888888888888) internal successors, (51), 27 states have internal predecessors, (51), 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 29 [2022-07-12 03:39:49,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:39:49,813 INFO L225 Difference]: With dead ends: 194 [2022-07-12 03:39:49,813 INFO L226 Difference]: Without dead ends: 171 [2022-07-12 03:39:49,814 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 455 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=360, Invalid=2198, Unknown=4, NotChecked=300, Total=2862 [2022-07-12 03:39:49,814 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 144 mSDsluCounter, 624 mSDsCounter, 0 mSdLazyCounter, 926 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 675 SdHoareTripleChecker+Invalid, 1005 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 926 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 36 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-07-12 03:39:49,815 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 675 Invalid, 1005 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 926 Invalid, 0 Unknown, 36 Unchecked, 1.3s Time] [2022-07-12 03:39:49,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2022-07-12 03:39:49,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 126. [2022-07-12 03:39:49,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 113 states have (on average 1.2743362831858407) internal successors, (144), 114 states have internal predecessors, (144), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-07-12 03:39:49,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 162 transitions. [2022-07-12 03:39:49,823 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 162 transitions. Word has length 29 [2022-07-12 03:39:49,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:39:49,824 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 162 transitions. [2022-07-12 03:39:49,824 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 27 states have (on average 1.8888888888888888) internal successors, (51), 27 states have internal predecessors, (51), 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) [2022-07-12 03:39:49,824 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 162 transitions. [2022-07-12 03:39:49,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-12 03:39:49,825 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:39:49,825 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:39:49,845 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-07-12 03:39:50,045 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-07-12 03:39:50,045 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:39:50,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:39:50,045 INFO L85 PathProgramCache]: Analyzing trace with hash 8968481, now seen corresponding path program 1 times [2022-07-12 03:39:50,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:39:50,046 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086095370] [2022-07-12 03:39:50,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:39:50,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:39:50,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:39:50,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 03:39:50,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:39:50,495 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:39:50,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:39:50,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086095370] [2022-07-12 03:39:50,496 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086095370] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:39:50,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1751954312] [2022-07-12 03:39:50,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:39:50,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:39:50,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:39:50,500 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 03:39:50,501 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-07-12 03:39:50,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:39:50,718 INFO L263 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 104 conjunts are in the unsatisfiable core [2022-07-12 03:39:50,724 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:39:50,734 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 03:39:50,735 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2022-07-12 03:39:50,779 INFO L356 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-07-12 03:39:50,779 INFO L390 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 [2022-07-12 03:39:50,825 INFO L390 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 [2022-07-12 03:39:50,970 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 28 treesize of output 12 [2022-07-12 03:39:51,014 INFO L390 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 [2022-07-12 03:39:51,073 INFO L356 Elim1Store]: treesize reduction 40, result has 42.9 percent of original size [2022-07-12 03:39:51,074 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 64 [2022-07-12 03:39:51,114 INFO L356 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2022-07-12 03:39:51,114 INFO L390 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 74 [2022-07-12 03:39:51,142 INFO L390 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 [2022-07-12 03:39:51,168 INFO L356 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2022-07-12 03:39:51,168 INFO L390 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 74 [2022-07-12 03:39:51,176 INFO L390 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 [2022-07-12 03:39:51,198 INFO L390 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 [2022-07-12 03:39:51,240 INFO L356 Elim1Store]: treesize reduction 28, result has 58.2 percent of original size [2022-07-12 03:39:51,240 INFO L390 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 55 treesize of output 80 [2022-07-12 03:39:51,253 INFO L390 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 [2022-07-12 03:39:51,300 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-12 03:39:51,329 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-12 03:39:51,342 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-12 03:39:51,367 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:39:51,369 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 62 treesize of output 15 [2022-07-12 03:39:51,373 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-12 03:39:51,392 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 66 treesize of output 19 [2022-07-12 03:39:51,395 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-07-12 03:39:55,198 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:39:55,229 INFO L356 Elim1Store]: treesize reduction 70, result has 38.6 percent of original size [2022-07-12 03:39:55,229 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 32 treesize of output 58 [2022-07-12 03:39:55,348 INFO L390 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 25 treesize of output 25 [2022-07-12 03:39:55,431 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 03:39:55,431 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-07-12 03:39:55,434 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-12 03:39:55,438 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 38 [2022-07-12 03:39:55,442 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:39:55,450 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-07-12 03:39:55,450 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 42 treesize of output 47 [2022-07-12 03:39:55,455 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2022-07-12 03:39:55,544 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50 [2022-07-12 03:39:55,548 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:39:55,549 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 32 [2022-07-12 03:39:55,552 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-12 03:39:55,628 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 30 [2022-07-12 03:39:55,631 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-12 03:39:55,671 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 31 [2022-07-12 03:39:55,692 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:39:55,692 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:39:55,766 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3032 (Array Int Int)) (v_ArrVal_3033 (Array Int Int)) (v_ArrVal_3029 (Array Int Int))) (< (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_receive_~#packet~0#1.base| v_ArrVal_3029) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_receive_~#packet~0#1.base| v_ArrVal_3032) |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|)) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_receive_~#packet~0#1.base| v_ArrVal_3033) |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|)) 4294967296) 500)) is different from false [2022-07-12 03:39:55,780 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~#new_packet~0#1.base_34| Int) (v_ArrVal_3032 (Array Int Int)) (v_ArrVal_3033 (Array Int Int)) (v_ArrVal_3029 (Array Int Int)) (|v_ULTIMATE.start_receive_~#packet~0#1.base_30| Int)) (or (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_receive_~#packet~0#1.base_30|)) (not (= (select (store |c_#valid| |v_ULTIMATE.start_main_~#new_packet~0#1.base_34| 1) |v_ULTIMATE.start_receive_~#packet~0#1.base_30|) 0)) (< (mod (select (select (store |c_#memory_int| |v_ULTIMATE.start_receive_~#packet~0#1.base_30| v_ArrVal_3029) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_receive_~#packet~0#1.base_30| v_ArrVal_3032) |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|)) (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_receive_~#packet~0#1.base_30| v_ArrVal_3033) |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|)) 4294967296) 500))) is different from false [2022-07-12 03:39:55,804 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~#new_packet~0#1.base_34| Int) (v_ArrVal_3032 (Array Int Int)) (v_ArrVal_3033 (Array Int Int)) (v_ArrVal_3029 (Array Int Int)) (v_ArrVal_3023 Int) (|v_ULTIMATE.start_receive_~#packet~0#1.base_30| Int)) (or (not (< |c_#StackHeapBarrier| |v_ULTIMATE.start_receive_~#packet~0#1.base_30|)) (not (= (select (store (store |c_#valid| |c_ULTIMATE.start_main_~#new_packet~0#1.base| v_ArrVal_3023) |v_ULTIMATE.start_main_~#new_packet~0#1.base_34| 1) |v_ULTIMATE.start_receive_~#packet~0#1.base_30|) 0)) (< (mod (select (select (store |c_#memory_int| |v_ULTIMATE.start_receive_~#packet~0#1.base_30| v_ArrVal_3029) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_receive_~#packet~0#1.base_30| v_ArrVal_3032) |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|)) (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_receive_~#packet~0#1.base_30| v_ArrVal_3033) |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|)) 4294967296) 500))) is different from false [2022-07-12 03:39:56,081 INFO L356 Elim1Store]: treesize reduction 41, result has 62.0 percent of original size [2022-07-12 03:39:56,082 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 7 case distinctions, treesize of input 102 treesize of output 124 [2022-07-12 03:39:56,103 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:39:56,224 INFO L356 Elim1Store]: treesize reduction 66, result has 61.8 percent of original size [2022-07-12 03:39:56,225 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 3 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 18 case distinctions, treesize of input 468 treesize of output 520 [2022-07-12 03:39:56,240 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 464 treesize of output 438 [2022-07-12 03:39:56,249 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 371 treesize of output 305 [2022-07-12 03:39:56,266 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:39:56,266 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 318 treesize of output 314 [2022-07-12 03:39:56,287 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:39:56,287 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 250 treesize of output 243 [2022-07-12 03:39:56,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1751954312] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:39:56,550 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 03:39:56,550 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 30 [2022-07-12 03:39:56,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435503937] [2022-07-12 03:39:56,550 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 03:39:56,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-07-12 03:39:56,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:39:56,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-07-12 03:39:56,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=940, Unknown=3, NotChecked=192, Total=1260 [2022-07-12 03:39:56,552 INFO L87 Difference]: Start difference. First operand 126 states and 162 transitions. Second operand has 30 states, 28 states have (on average 1.8928571428571428) internal successors, (53), 28 states have internal predecessors, (53), 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) [2022-07-12 03:40:06,355 WARN L233 SmtUtils]: Spent 9.21s on a formula simplification. DAG size of input: 113 DAG size of output: 96 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-12 03:40:07,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:40:07,651 INFO L93 Difference]: Finished difference Result 202 states and 262 transitions. [2022-07-12 03:40:07,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-07-12 03:40:07,651 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 28 states have (on average 1.8928571428571428) internal successors, (53), 28 states have internal predecessors, (53), 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 30 [2022-07-12 03:40:07,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:40:07,653 INFO L225 Difference]: With dead ends: 202 [2022-07-12 03:40:07,653 INFO L226 Difference]: Without dead ends: 200 [2022-07-12 03:40:07,654 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 629 ImplicationChecksByTransitivity, 14.6s TimeCoverageRelationStatistics Valid=343, Invalid=2422, Unknown=3, NotChecked=312, Total=3080 [2022-07-12 03:40:07,655 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 114 mSDsluCounter, 904 mSDsCounter, 0 mSdLazyCounter, 690 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 969 SdHoareTripleChecker+Invalid, 876 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 690 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 161 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-12 03:40:07,655 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 969 Invalid, 876 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 690 Invalid, 0 Unknown, 161 Unchecked, 0.7s Time] [2022-07-12 03:40:07,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2022-07-12 03:40:07,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 145. [2022-07-12 03:40:07,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 131 states have (on average 1.2900763358778626) internal successors, (169), 132 states have internal predecessors, (169), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-07-12 03:40:07,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 189 transitions. [2022-07-12 03:40:07,673 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 189 transitions. Word has length 30 [2022-07-12 03:40:07,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:40:07,674 INFO L495 AbstractCegarLoop]: Abstraction has 145 states and 189 transitions. [2022-07-12 03:40:07,674 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 28 states have (on average 1.8928571428571428) internal successors, (53), 28 states have internal predecessors, (53), 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) [2022-07-12 03:40:07,674 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 189 transitions. [2022-07-12 03:40:07,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-12 03:40:07,674 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:40:07,674 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:40:07,694 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-07-12 03:40:07,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-07-12 03:40:07,876 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:40:07,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:40:07,876 INFO L85 PathProgramCache]: Analyzing trace with hash 701206369, now seen corresponding path program 1 times [2022-07-12 03:40:07,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:40:07,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768687320] [2022-07-12 03:40:07,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:40:07,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:40:07,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:40:08,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 03:40:08,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:40:40,123 WARN L233 SmtUtils]: Spent 13.97s on a formula simplification that was a NOOP. DAG size: 181 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-12 03:40:57,723 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:40:57,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:40:57,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768687320] [2022-07-12 03:40:57,724 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768687320] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:40:57,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [157590193] [2022-07-12 03:40:57,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:40:57,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:40:57,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:40:57,725 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 03:40:57,726 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-07-12 03:40:57,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:40:57,955 INFO L263 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 99 conjunts are in the unsatisfiable core [2022-07-12 03:40:57,959 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:40:57,969 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 03:40:57,970 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2022-07-12 03:40:58,006 INFO L356 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-07-12 03:40:58,006 INFO L390 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 [2022-07-12 03:40:58,016 INFO L390 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 [2022-07-12 03:40:58,020 INFO L390 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 [2022-07-12 03:40:58,106 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 25 [2022-07-12 03:40:58,110 INFO L390 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 [2022-07-12 03:40:58,113 INFO L390 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 [2022-07-12 03:40:58,315 INFO L390 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 23 treesize of output 7 [2022-07-12 03:40:58,318 INFO L390 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 [2022-07-12 03:40:58,321 INFO L390 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 [2022-07-12 03:40:58,474 INFO L390 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2022-07-12 03:40:58,489 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3409 (Array Int Int)) (v_ArrVal_3410 Int) (v_ArrVal_3411 Int) (v_ArrVal_3400 Int) (|v_append_to_queue_~#p.base_85| Int) (v_ArrVal_3404 (Array Int Int)) (append_to_queue_~node~0.base Int) (v_ArrVal_3405 (Array Int Int)) (v_ArrVal_3406 (Array Int Int)) (v_ArrVal_3418 (Array Int Int)) (v_arrayElimArr_41 (Array Int Int))) (and (= |c_#valid| (store (store (store |c_old(#valid)| |v_append_to_queue_~#p.base_85| v_ArrVal_3411) append_to_queue_~node~0.base v_ArrVal_3410) |v_append_to_queue_~#p.base_85| v_ArrVal_3400)) (= |c_#memory_$Pointer$.base| (store (store (store |c_old(#memory_$Pointer$.base)| |v_append_to_queue_~#p.base_85| v_ArrVal_3404) append_to_queue_~node~0.base v_ArrVal_3405) |c_append_to_queue_#in~q.base| v_ArrVal_3409)) (= |c_append_to_queue_#in~p.payload.offset| (select v_arrayElimArr_41 8)) (< append_to_queue_~node~0.base |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.offset| (store (store (store |c_old(#memory_$Pointer$.offset)| |v_append_to_queue_~#p.base_85| v_arrayElimArr_41) append_to_queue_~node~0.base v_ArrVal_3418) |c_append_to_queue_#in~q.base| v_ArrVal_3406)) (= (select |c_old(#valid)| |v_append_to_queue_~#p.base_85|) 0))) is different from true [2022-07-12 03:40:58,525 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:40:58,526 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:40:58,526 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:40:58,577 INFO L356 Elim1Store]: treesize reduction 95, result has 34.0 percent of original size [2022-07-12 03:40:58,577 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 46 treesize of output 84 [2022-07-12 03:40:58,600 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:40:58,601 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:40:58,622 INFO L356 Elim1Store]: treesize reduction 33, result has 40.0 percent of original size [2022-07-12 03:40:58,622 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 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 [2022-07-12 03:40:58,633 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:40:58,664 INFO L356 Elim1Store]: treesize reduction 58, result has 35.6 percent of original size [2022-07-12 03:40:58,664 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 28 treesize of output 46 [2022-07-12 03:40:58,688 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-07-12 03:40:58,695 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-07-12 03:40:58,710 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2022-07-12 03:40:58,713 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-07-12 03:40:58,716 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 03:40:58,725 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2022-07-12 03:40:58,730 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2022-07-12 03:40:58,733 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 03:40:58,740 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-07-12 03:40:58,745 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2022-07-12 03:40:58,749 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 03:40:58,770 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2022-07-12 03:40:58,776 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2022-07-12 03:40:58,781 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-07-12 03:40:58,784 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2022-07-12 03:40:58,794 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2022-07-12 03:40:58,803 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2022-07-12 03:40:58,810 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-07-12 03:40:58,818 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2022-07-12 03:40:58,824 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2022-07-12 03:40:58,831 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2022-07-12 03:40:59,004 INFO L390 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 21 treesize of output 21 [2022-07-12 03:40:59,061 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 03:40:59,061 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-07-12 03:40:59,064 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-12 03:40:59,067 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-12 03:40:59,075 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-12 03:40:59,076 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-12 03:40:59,105 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-12 03:40:59,107 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-12 03:40:59,110 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:40:59,110 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:40:59,128 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3424 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_receive_~#packet~0#1.base| v_ArrVal_3424) |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0)) (forall ((v_ArrVal_3426 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_receive_~#packet~0#1.base| v_ArrVal_3426) |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0))) is different from false [2022-07-12 03:41:04,525 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:41:04,525 INFO L390 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 26 [2022-07-12 03:41:08,656 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [157590193] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:41:08,656 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 03:41:08,656 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14] total 20 [2022-07-12 03:41:08,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87693753] [2022-07-12 03:41:08,657 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 03:41:08,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-12 03:41:08,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:41:08,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-12 03:41:08,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=335, Unknown=10, NotChecked=82, Total=552 [2022-07-12 03:41:08,658 INFO L87 Difference]: Start difference. First operand 145 states and 189 transitions. Second operand has 20 states, 19 states have (on average 2.1578947368421053) internal successors, (41), 18 states have internal predecessors, (41), 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) [2022-07-12 03:41:11,127 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse6 (@diff |c_old(#memory_$Pointer$.offset)| |c_#memory_$Pointer$.offset|)) (.cse17 (@diff |c_old(#memory_$Pointer$.base)| |c_#memory_$Pointer$.base|))) (let ((.cse8 (store |c_old(#memory_$Pointer$.base)| .cse17 (select |c_#memory_$Pointer$.base| .cse17))) (.cse30 (store |c_old(#memory_$Pointer$.offset)| .cse6 (select |c_#memory_$Pointer$.offset| .cse6)))) (let ((.cse29 (@diff .cse30 |c_#memory_$Pointer$.offset|)) (.cse7 (@diff .cse8 |c_#memory_$Pointer$.base|))) (let ((.cse9 (store .cse8 .cse7 (select |c_#memory_$Pointer$.base| .cse7))) (.cse5 (store .cse30 .cse29 (select |c_#memory_$Pointer$.offset| .cse29)))) (let ((.cse4 (@diff .cse5 |c_#memory_$Pointer$.offset|)) (.cse10 (@diff .cse9 |c_#memory_$Pointer$.base|))) (let ((.cse19 (store .cse9 .cse10 (select |c_#memory_$Pointer$.base| .cse10))) (.cse28 (store .cse5 .cse4 (select |c_#memory_$Pointer$.offset| .cse4)))) (let ((.cse27 (@diff .cse28 |c_#memory_$Pointer$.offset|)) (.cse18 (@diff .cse19 |c_#memory_$Pointer$.base|))) (let ((.cse3 (store .cse19 .cse18 (select |c_#memory_$Pointer$.base| .cse18))) (.cse26 (store .cse28 .cse27 (select |c_#memory_$Pointer$.offset| .cse27)))) (let ((.cse25 (@diff .cse26 |c_#memory_$Pointer$.offset|)) (.cse24 (@diff |c_old(#valid)| |c_#valid|)) (.cse2 (@diff .cse3 |c_#memory_$Pointer$.base|))) (let ((.cse14 (store .cse3 .cse2 (select |c_#memory_$Pointer$.base| .cse2))) (.cse1 (store |c_old(#valid)| .cse24 (select |c_#valid| .cse24))) (.cse15 (store .cse26 .cse25 (select |c_#memory_$Pointer$.offset| .cse25)))) (let ((.cse16 (@diff .cse15 |c_#memory_$Pointer$.offset|)) (.cse0 (@diff .cse1 |c_#valid|)) (.cse13 (@diff .cse14 |c_#memory_$Pointer$.base|))) (let ((.cse22 (store .cse14 .cse13 (select |c_#memory_$Pointer$.base| .cse13))) (.cse11 (store .cse1 .cse0 (select |c_#valid| .cse0))) (.cse20 (store .cse15 .cse16 (select |c_#memory_$Pointer$.offset| .cse16)))) (let ((.cse21 (@diff .cse20 |c_#memory_$Pointer$.offset|)) (.cse12 (@diff .cse11 |c_#valid|)) (.cse23 (@diff .cse22 |c_#memory_$Pointer$.base|))) (and (or (<= (+ .cse0 1) |c_#StackHeapBarrier|) (= (select |c_old(#valid)| .cse0) 0) (= |c_#valid| .cse1)) (or (= (select |c_old(#valid)| .cse2) 0) (= .cse2 |c_append_to_queue_#in~q.base|) (= |c_#memory_$Pointer$.base| .cse3) (<= (+ .cse2 1) |c_#StackHeapBarrier|)) (or (<= (+ .cse4 1) |c_#StackHeapBarrier|) (= .cse4 |c_append_to_queue_#in~q.base|) (= |c_#memory_$Pointer$.offset| .cse5) (= (select |c_old(#valid)| .cse4) 0)) (or (= (select |c_old(#valid)| .cse6) 0) (= .cse6 |c_append_to_queue_#in~q.base|) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (<= (+ .cse6 1) |c_#StackHeapBarrier|)) (or (= (select |c_old(#valid)| .cse7) 0) (= |c_#memory_$Pointer$.base| .cse8) (= .cse7 |c_append_to_queue_#in~q.base|) (<= (+ .cse7 1) |c_#StackHeapBarrier|)) (exists ((v_ArrVal_3409 (Array Int Int)) (v_ArrVal_3410 Int) (v_ArrVal_3411 Int) (v_ArrVal_3400 Int) (|v_append_to_queue_~#p.base_85| Int) (v_ArrVal_3404 (Array Int Int)) (append_to_queue_~node~0.base Int) (v_ArrVal_3405 (Array Int Int)) (v_ArrVal_3406 (Array Int Int)) (v_ArrVal_3418 (Array Int Int)) (v_arrayElimArr_41 (Array Int Int))) (and (= |c_#valid| (store (store (store |c_old(#valid)| |v_append_to_queue_~#p.base_85| v_ArrVal_3411) append_to_queue_~node~0.base v_ArrVal_3410) |v_append_to_queue_~#p.base_85| v_ArrVal_3400)) (= |c_#memory_$Pointer$.base| (store (store (store |c_old(#memory_$Pointer$.base)| |v_append_to_queue_~#p.base_85| v_ArrVal_3404) append_to_queue_~node~0.base v_ArrVal_3405) |c_append_to_queue_#in~q.base| v_ArrVal_3409)) (= |c_append_to_queue_#in~p.payload.offset| (select v_arrayElimArr_41 8)) (< append_to_queue_~node~0.base |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.offset| (store (store (store |c_old(#memory_$Pointer$.offset)| |v_append_to_queue_~#p.base_85| v_arrayElimArr_41) append_to_queue_~node~0.base v_ArrVal_3418) |c_append_to_queue_#in~q.base| v_ArrVal_3406)) (= (select |c_old(#valid)| |v_append_to_queue_~#p.base_85|) 0))) (or (= |c_#memory_$Pointer$.base| .cse9) (<= (+ .cse10 1) |c_#StackHeapBarrier|) (= (select |c_old(#valid)| .cse10) 0) (= .cse10 |c_append_to_queue_#in~q.base|)) (= |c_#valid| (store .cse11 .cse12 (select |c_#valid| .cse12))) (or (= (select |c_old(#valid)| .cse13) 0) (= .cse14 |c_#memory_$Pointer$.base|) (<= (+ .cse13 1) |c_#StackHeapBarrier|) (= .cse13 |c_append_to_queue_#in~q.base|)) (or (= .cse15 |c_#memory_$Pointer$.offset|) (= (select |c_old(#valid)| .cse16) 0) (<= (+ .cse16 1) |c_#StackHeapBarrier|) (= .cse16 |c_append_to_queue_#in~q.base|)) (or (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= (select |c_old(#valid)| .cse17) 0) (= .cse17 |c_append_to_queue_#in~q.base|) (<= (+ .cse17 1) |c_#StackHeapBarrier|)) (or (= (select |c_old(#valid)| .cse18) 0) (= |c_#memory_$Pointer$.base| .cse19) (= .cse18 |c_append_to_queue_#in~q.base|) (<= (+ .cse18 1) |c_#StackHeapBarrier|)) (= |c_#memory_$Pointer$.offset| (store .cse20 .cse21 (select |c_#memory_$Pointer$.offset| .cse21))) (or (= (select |c_old(#valid)| .cse21) 0) (= .cse21 |c_append_to_queue_#in~q.base|) (<= (+ .cse21 1) |c_#StackHeapBarrier|) (= .cse20 |c_#memory_$Pointer$.offset|)) (= |c_#memory_$Pointer$.base| (store .cse22 .cse23 (select |c_#memory_$Pointer$.base| .cse23))) (or (= |c_#valid| |c_old(#valid)|) (= (select |c_old(#valid)| .cse24) 0) (<= (+ .cse24 1) |c_#StackHeapBarrier|)) (or (= (select |c_old(#valid)| .cse25) 0) (<= (+ .cse25 1) |c_#StackHeapBarrier|) (= .cse26 |c_#memory_$Pointer$.offset|) (= .cse25 |c_append_to_queue_#in~q.base|)) (or (= .cse27 |c_append_to_queue_#in~q.base|) (= |c_#memory_$Pointer$.offset| .cse28) (= (select |c_old(#valid)| .cse27) 0) (<= (+ .cse27 1) |c_#StackHeapBarrier|)) (or (<= (+ .cse12 1) |c_#StackHeapBarrier|) (= (select |c_old(#valid)| .cse12) 0) (= |c_#valid| .cse11)) (or (= |c_#memory_$Pointer$.base| .cse22) (<= (+ .cse23 1) |c_#StackHeapBarrier|) (= (select |c_old(#valid)| .cse23) 0) (= |c_append_to_queue_#in~q.base| .cse23)) (or (= .cse29 |c_append_to_queue_#in~q.base|) (= |c_#memory_$Pointer$.offset| .cse30) (= (select |c_old(#valid)| .cse29) 0) (<= (+ .cse29 1) |c_#StackHeapBarrier|)))))))))))))))) is different from true [2022-07-12 03:41:12,833 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 03:41:15,036 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 03:41:17,989 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 03:41:21,487 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 03:41:25,775 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 03:41:27,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:41:27,854 INFO L93 Difference]: Finished difference Result 211 states and 270 transitions. [2022-07-12 03:41:27,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-12 03:41:27,854 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.1578947368421053) internal successors, (41), 18 states have internal predecessors, (41), 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 30 [2022-07-12 03:41:27,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:41:27,855 INFO L225 Difference]: With dead ends: 211 [2022-07-12 03:41:27,855 INFO L226 Difference]: Without dead ends: 188 [2022-07-12 03:41:27,856 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 26.5s TimeCoverageRelationStatistics Valid=164, Invalid=487, Unknown=11, NotChecked=150, Total=812 [2022-07-12 03:41:27,856 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 53 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 25 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 98 IncrementalHoareTripleChecker+Unchecked, 17.0s IncrementalHoareTripleChecker+Time [2022-07-12 03:41:27,856 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 283 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 156 Invalid, 4 Unknown, 98 Unchecked, 17.0s Time] [2022-07-12 03:41:27,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2022-07-12 03:41:27,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 160. [2022-07-12 03:41:27,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 145 states have (on average 1.289655172413793) internal successors, (187), 146 states have internal predecessors, (187), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-07-12 03:41:27,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 207 transitions. [2022-07-12 03:41:27,866 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 207 transitions. Word has length 30 [2022-07-12 03:41:27,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:41:27,866 INFO L495 AbstractCegarLoop]: Abstraction has 160 states and 207 transitions. [2022-07-12 03:41:27,867 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.1578947368421053) internal successors, (41), 18 states have internal predecessors, (41), 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) [2022-07-12 03:41:27,867 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 207 transitions. [2022-07-12 03:41:27,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-12 03:41:27,867 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:41:27,867 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:41:27,886 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-07-12 03:41:28,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-07-12 03:41:28,081 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:41:28,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:41:28,081 INFO L85 PathProgramCache]: Analyzing trace with hash 1964480561, now seen corresponding path program 2 times [2022-07-12 03:41:28,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:41:28,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72951305] [2022-07-12 03:41:28,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:41:28,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:41:28,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:41:28,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 03:41:28,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:41:51,257 WARN L233 SmtUtils]: Spent 11.64s 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) [2022-07-12 03:42:01,568 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-12 03:42:01,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:42:01,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72951305] [2022-07-12 03:42:01,569 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72951305] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:42:01,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [701625212] [2022-07-12 03:42:01,569 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 03:42:01,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:42:01,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:42:01,570 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 03:42:01,572 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-07-12 03:42:01,816 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 03:42:01,816 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 03:42:01,819 INFO L263 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 110 conjunts are in the unsatisfiable core [2022-07-12 03:42:01,824 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:42:01,836 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 03:42:01,837 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2022-07-12 03:42:01,930 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 03:42:01,930 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-07-12 03:42:01,936 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-12 03:42:01,959 INFO L356 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-07-12 03:42:01,959 INFO L390 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 [2022-07-12 03:42:01,972 INFO L390 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 [2022-07-12 03:42:02,059 INFO L390 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 [2022-07-12 03:42:02,064 INFO L390 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 [2022-07-12 03:42:02,067 INFO L390 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 [2022-07-12 03:42:02,139 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 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 [2022-07-12 03:42:02,161 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 03:42:02,161 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-07-12 03:42:02,165 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-12 03:42:02,175 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 03:42:02,175 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-07-12 03:42:02,181 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-12 03:42:02,207 INFO L356 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-07-12 03:42:02,208 INFO L390 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 [2022-07-12 03:42:02,271 INFO L390 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 [2022-07-12 03:42:02,276 INFO L390 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 [2022-07-12 03:42:02,279 INFO L390 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 [2022-07-12 03:42:02,541 INFO L390 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 23 treesize of output 7 [2022-07-12 03:42:02,544 INFO L390 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 [2022-07-12 03:42:02,547 INFO L390 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 [2022-07-12 03:42:02,634 INFO L390 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2022-07-12 03:42:02,650 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3806 (Array Int Int)) (v_arrayElimArr_43 (Array Int Int)) (v_ArrVal_3808 (Array Int Int)) (|v_append_to_queue_~#p.base_95| Int) (v_ArrVal_3801 (Array Int Int)) (append_to_queue_~node~0.base Int) (v_ArrVal_3802 (Array Int Int)) (v_ArrVal_3803 (Array Int Int))) (and (= (select |c_old(#valid)| |v_append_to_queue_~#p.base_95|) 0) (< |c_#StackHeapBarrier| |v_append_to_queue_~#p.base_95|) (< append_to_queue_~node~0.base |c_#StackHeapBarrier|) (= (store (store (store |c_old(#memory_$Pointer$.offset)| |v_append_to_queue_~#p.base_95| v_arrayElimArr_43) append_to_queue_~node~0.base v_ArrVal_3803) |c_append_to_queue_#in~q.base| v_ArrVal_3808) |c_#memory_$Pointer$.offset|) (= (select (store |c_old(#valid)| |v_append_to_queue_~#p.base_95| 1) append_to_queue_~node~0.base) 0) (= (store (store (store |c_old(#memory_$Pointer$.base)| |v_append_to_queue_~#p.base_95| v_ArrVal_3801) append_to_queue_~node~0.base v_ArrVal_3802) |c_append_to_queue_#in~q.base| v_ArrVal_3806) |c_#memory_$Pointer$.base|) (= |c_append_to_queue_#in~p.payload.offset| (select v_arrayElimArr_43 8)))) is different from true [2022-07-12 03:42:02,690 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:42:02,692 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:42:02,693 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:42:02,696 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:42:02,711 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 03:42:02,711 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 30 [2022-07-12 03:42:02,719 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:42:02,720 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:42:02,721 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:42:02,722 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:42:02,723 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:42:02,724 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:42:02,726 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:42:02,753 INFO L356 Elim1Store]: treesize reduction 43, result has 41.9 percent of original size [2022-07-12 03:42:02,754 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 11 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 71 [2022-07-12 03:42:02,760 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:42:02,764 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:42:02,765 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:42:02,780 INFO L356 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2022-07-12 03:42:02,780 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 3 case distinctions, treesize of input 21 treesize of output 25 [2022-07-12 03:42:02,795 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-07-12 03:42:02,799 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 03:42:02,805 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 03:42:02,834 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2022-07-12 03:42:02,838 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-07-12 03:42:02,843 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 03:42:02,846 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-07-12 03:42:02,934 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-12 03:42:02,936 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-12 03:42:02,939 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-12 03:42:02,939 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:42:03,075 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:42:03,076 INFO L390 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 23 [2022-07-12 03:42:05,170 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [701625212] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:42:05,170 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 03:42:05,170 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 19 [2022-07-12 03:42:05,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711528896] [2022-07-12 03:42:05,170 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 03:42:05,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-12 03:42:05,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:42:05,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-12 03:42:05,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=267, Unknown=2, NotChecked=34, Total=380 [2022-07-12 03:42:05,171 INFO L87 Difference]: Start difference. First operand 160 states and 207 transitions. Second operand has 19 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 17 states have internal predecessors, (42), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-12 03:42:07,767 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse4 (@diff |c_old(#memory_$Pointer$.offset)| |c_#memory_$Pointer$.offset|)) (.cse13 (@diff |c_old(#memory_$Pointer$.base)| |c_#memory_$Pointer$.base|))) (let ((.cse6 (store |c_old(#memory_$Pointer$.base)| .cse13 (select |c_#memory_$Pointer$.base| .cse13))) (.cse25 (store |c_old(#memory_$Pointer$.offset)| .cse4 (select |c_#memory_$Pointer$.offset| .cse4)))) (let ((.cse24 (@diff .cse25 |c_#memory_$Pointer$.offset|)) (.cse5 (@diff .cse6 |c_#memory_$Pointer$.base|))) (let ((.cse7 (store .cse6 .cse5 (select |c_#memory_$Pointer$.base| .cse5))) (.cse3 (store .cse25 .cse24 (select |c_#memory_$Pointer$.offset| .cse24)))) (let ((.cse2 (@diff .cse3 |c_#memory_$Pointer$.offset|)) (.cse8 (@diff .cse7 |c_#memory_$Pointer$.base|))) (let ((.cse15 (store .cse7 .cse8 (select |c_#memory_$Pointer$.base| .cse8))) (.cse23 (store .cse3 .cse2 (select |c_#memory_$Pointer$.offset| .cse2)))) (let ((.cse22 (@diff .cse23 |c_#memory_$Pointer$.offset|)) (.cse14 (@diff .cse15 |c_#memory_$Pointer$.base|))) (let ((.cse1 (store .cse15 .cse14 (select |c_#memory_$Pointer$.base| .cse14))) (.cse21 (store .cse23 .cse22 (select |c_#memory_$Pointer$.offset| .cse22)))) (let ((.cse20 (@diff .cse21 |c_#memory_$Pointer$.offset|)) (.cse0 (@diff .cse1 |c_#memory_$Pointer$.base|))) (let ((.cse10 (store .cse1 .cse0 (select |c_#memory_$Pointer$.base| .cse0))) (.cse11 (store .cse21 .cse20 (select |c_#memory_$Pointer$.offset| .cse20)))) (let ((.cse12 (@diff .cse11 |c_#memory_$Pointer$.offset|)) (.cse9 (@diff .cse10 |c_#memory_$Pointer$.base|))) (let ((.cse18 (store .cse10 .cse9 (select |c_#memory_$Pointer$.base| .cse9))) (.cse16 (store .cse11 .cse12 (select |c_#memory_$Pointer$.offset| .cse12)))) (let ((.cse17 (@diff .cse16 |c_#memory_$Pointer$.offset|)) (.cse19 (@diff .cse18 |c_#memory_$Pointer$.base|))) (and (or (= (select |c_old(#valid)| .cse0) 0) (= .cse0 |c_append_to_queue_#in~q.base|) (= |c_#memory_$Pointer$.base| .cse1) (<= (+ .cse0 1) |c_#StackHeapBarrier|)) (or (<= (+ .cse2 1) |c_#StackHeapBarrier|) (= .cse2 |c_append_to_queue_#in~q.base|) (= |c_#memory_$Pointer$.offset| .cse3) (= (select |c_old(#valid)| .cse2) 0)) (or (= (select |c_old(#valid)| .cse4) 0) (= .cse4 |c_append_to_queue_#in~q.base|) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (<= (+ .cse4 1) |c_#StackHeapBarrier|)) (or (= (select |c_old(#valid)| .cse5) 0) (= |c_#memory_$Pointer$.base| .cse6) (= .cse5 |c_append_to_queue_#in~q.base|) (<= (+ .cse5 1) |c_#StackHeapBarrier|)) (or (= |c_#memory_$Pointer$.base| .cse7) (<= (+ .cse8 1) |c_#StackHeapBarrier|) (= (select |c_old(#valid)| .cse8) 0) (= .cse8 |c_append_to_queue_#in~q.base|)) (or (= (select |c_old(#valid)| .cse9) 0) (= .cse10 |c_#memory_$Pointer$.base|) (<= (+ .cse9 1) |c_#StackHeapBarrier|) (= .cse9 |c_append_to_queue_#in~q.base|)) (or (= .cse11 |c_#memory_$Pointer$.offset|) (= (select |c_old(#valid)| .cse12) 0) (<= (+ .cse12 1) |c_#StackHeapBarrier|) (= .cse12 |c_append_to_queue_#in~q.base|)) (or (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= (select |c_old(#valid)| .cse13) 0) (= .cse13 |c_append_to_queue_#in~q.base|) (<= (+ .cse13 1) |c_#StackHeapBarrier|)) (or (= (select |c_old(#valid)| .cse14) 0) (= |c_#memory_$Pointer$.base| .cse15) (= .cse14 |c_append_to_queue_#in~q.base|) (<= (+ .cse14 1) |c_#StackHeapBarrier|)) (= |c_#memory_$Pointer$.offset| (store .cse16 .cse17 (select |c_#memory_$Pointer$.offset| .cse17))) (or (= (select |c_old(#valid)| .cse17) 0) (= .cse17 |c_append_to_queue_#in~q.base|) (<= (+ .cse17 1) |c_#StackHeapBarrier|) (= .cse16 |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3806 (Array Int Int)) (v_arrayElimArr_43 (Array Int Int)) (v_ArrVal_3808 (Array Int Int)) (|v_append_to_queue_~#p.base_95| Int) (v_ArrVal_3801 (Array Int Int)) (append_to_queue_~node~0.base Int) (v_ArrVal_3802 (Array Int Int)) (v_ArrVal_3803 (Array Int Int))) (and (= (select |c_old(#valid)| |v_append_to_queue_~#p.base_95|) 0) (< |c_#StackHeapBarrier| |v_append_to_queue_~#p.base_95|) (< append_to_queue_~node~0.base |c_#StackHeapBarrier|) (= (store (store (store |c_old(#memory_$Pointer$.offset)| |v_append_to_queue_~#p.base_95| v_arrayElimArr_43) append_to_queue_~node~0.base v_ArrVal_3803) |c_append_to_queue_#in~q.base| v_ArrVal_3808) |c_#memory_$Pointer$.offset|) (= (select (store |c_old(#valid)| |v_append_to_queue_~#p.base_95| 1) append_to_queue_~node~0.base) 0) (= (store (store (store |c_old(#memory_$Pointer$.base)| |v_append_to_queue_~#p.base_95| v_ArrVal_3801) append_to_queue_~node~0.base v_ArrVal_3802) |c_append_to_queue_#in~q.base| v_ArrVal_3806) |c_#memory_$Pointer$.base|) (= |c_append_to_queue_#in~p.payload.offset| (select v_arrayElimArr_43 8)))) (= |c_#memory_$Pointer$.base| (store .cse18 .cse19 (select |c_#memory_$Pointer$.base| .cse19))) (or (= (select |c_old(#valid)| .cse20) 0) (<= (+ .cse20 1) |c_#StackHeapBarrier|) (= .cse21 |c_#memory_$Pointer$.offset|) (= .cse20 |c_append_to_queue_#in~q.base|)) (or (= .cse22 |c_append_to_queue_#in~q.base|) (= |c_#memory_$Pointer$.offset| .cse23) (= (select |c_old(#valid)| .cse22) 0) (<= (+ .cse22 1) |c_#StackHeapBarrier|)) (or (= |c_#memory_$Pointer$.base| .cse18) (<= (+ .cse19 1) |c_#StackHeapBarrier|) (= (select |c_old(#valid)| .cse19) 0) (= |c_append_to_queue_#in~q.base| .cse19)) (or (= .cse24 |c_append_to_queue_#in~q.base|) (= |c_#memory_$Pointer$.offset| .cse25) (= (select |c_old(#valid)| .cse24) 0) (<= (+ .cse24 1) |c_#StackHeapBarrier|)))))))))))))))) is different from true [2022-07-12 03:42:10,361 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 03:42:13,180 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 03:42:16,413 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 03:42:16,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:42:16,762 INFO L93 Difference]: Finished difference Result 189 states and 241 transitions. [2022-07-12 03:42:16,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-12 03:42:16,762 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 17 states have internal predecessors, (42), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 30 [2022-07-12 03:42:16,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:42:16,763 INFO L225 Difference]: With dead ends: 189 [2022-07-12 03:42:16,764 INFO L226 Difference]: Without dead ends: 166 [2022-07-12 03:42:16,764 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 16.8s TimeCoverageRelationStatistics Valid=134, Invalid=471, Unknown=3, NotChecked=94, Total=702 [2022-07-12 03:42:16,764 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 37 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 14 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 112 IncrementalHoareTripleChecker+Unchecked, 9.3s IncrementalHoareTripleChecker+Time [2022-07-12 03:42:16,765 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 324 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 184 Invalid, 3 Unknown, 112 Unchecked, 9.3s Time] [2022-07-12 03:42:16,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2022-07-12 03:42:16,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 160. [2022-07-12 03:42:16,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 145 states have (on average 1.282758620689655) internal successors, (186), 146 states have internal predecessors, (186), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-07-12 03:42:16,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 206 transitions. [2022-07-12 03:42:16,785 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 206 transitions. Word has length 30 [2022-07-12 03:42:16,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:42:16,785 INFO L495 AbstractCegarLoop]: Abstraction has 160 states and 206 transitions. [2022-07-12 03:42:16,785 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 17 states have internal predecessors, (42), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-12 03:42:16,786 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 206 transitions. [2022-07-12 03:42:16,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-12 03:42:16,786 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:42:16,786 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:42:16,808 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-07-12 03:42:16,986 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-07-12 03:42:16,987 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:42:16,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:42:16,987 INFO L85 PathProgramCache]: Analyzing trace with hash -825884899, now seen corresponding path program 1 times [2022-07-12 03:42:16,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:42:16,987 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189463237] [2022-07-12 03:42:16,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:42:16,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:42:17,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:42:17,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 03:42:17,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:42:17,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 03:42:17,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:42:17,477 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:42:17,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:42:17,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189463237] [2022-07-12 03:42:17,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189463237] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:42:17,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [300110039] [2022-07-12 03:42:17,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:42:17,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:42:17,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:42:17,479 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 03:42:17,480 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-07-12 03:42:17,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:42:17,734 INFO L263 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 142 conjunts are in the unsatisfiable core [2022-07-12 03:42:17,740 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:42:17,750 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 03:42:17,750 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2022-07-12 03:42:17,815 INFO L356 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-07-12 03:42:17,816 INFO L390 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 [2022-07-12 03:42:17,826 INFO L390 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 [2022-07-12 03:42:17,829 INFO L390 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 [2022-07-12 03:42:17,876 INFO L390 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 [2022-07-12 03:42:17,880 INFO L390 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 [2022-07-12 03:42:17,884 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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 [2022-07-12 03:42:18,049 INFO L390 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 23 treesize of output 7 [2022-07-12 03:42:18,053 INFO L390 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 [2022-07-12 03:42:18,055 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-12 03:42:18,085 INFO L390 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 45 [2022-07-12 03:42:18,089 INFO L390 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-07-12 03:42:18,093 INFO L390 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 67 [2022-07-12 03:42:18,097 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 62 [2022-07-12 03:42:18,442 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:42:18,443 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:42:18,446 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:42:18,447 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:42:18,448 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:42:18,478 INFO L356 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-07-12 03:42:18,478 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 53 [2022-07-12 03:42:18,484 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:42:18,485 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:42:18,487 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:42:18,488 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:42:18,490 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:42:18,517 INFO L356 Elim1Store]: treesize reduction 43, result has 41.9 percent of original size [2022-07-12 03:42:18,517 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 76 [2022-07-12 03:42:18,527 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2022-07-12 03:42:18,535 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2022-07-12 03:42:18,543 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 39 treesize of output 5 [2022-07-12 03:42:18,560 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-07-12 03:42:18,560 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 16 treesize of output 18 [2022-07-12 03:42:18,578 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-07-12 03:42:18,588 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-07-12 03:42:18,601 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 03:42:18,617 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 51 [2022-07-12 03:42:18,648 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 03:42:18,657 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 03:42:18,662 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 03:42:18,669 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-07-12 03:42:18,676 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-07-12 03:42:18,681 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 03:42:19,254 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:42:19,254 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 34 [2022-07-12 03:42:19,258 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:42:19,258 INFO L390 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 0 case distinctions, treesize of input 28 treesize of output 10 [2022-07-12 03:42:19,292 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_4204 (Array Int Int)) (v_ArrVal_4207 (Array Int Int)) (|v_send_~#p.base_7| Int)) (and (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |v_send_~#p.base_7| v_ArrVal_4207)) (< |c_#StackHeapBarrier| |v_send_~#p.base_7|) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |v_send_~#p.base_7| v_ArrVal_4204)))) is different from true [2022-07-12 03:42:19,327 INFO L356 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2022-07-12 03:42:19,328 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 79 treesize of output 79 [2022-07-12 03:42:19,334 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:42:19,335 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:42:19,350 INFO L356 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-07-12 03:42:19,350 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 55 [2022-07-12 03:42:19,356 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 03:42:19,364 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 03:42:19,404 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 40 [2022-07-12 03:42:20,059 INFO L356 Elim1Store]: treesize reduction 35, result has 25.5 percent of original size [2022-07-12 03:42:20,060 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 99 treesize of output 83 [2022-07-12 03:42:20,098 INFO L356 Elim1Store]: treesize reduction 79, result has 38.8 percent of original size [2022-07-12 03:42:20,099 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 92 treesize of output 109 [2022-07-12 03:42:20,203 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:42:20,203 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:42:22,245 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_send_~#p.base_13| Int)) (or (forall ((v_ArrVal_4217 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |v_send_~#p.base_13| v_ArrVal_4217) |c_ULTIMATE.start_process_prio_queue_~node~1#1.base|) (+ |c_ULTIMATE.start_process_prio_queue_~node~1#1.offset| 12)) 0)) (not (< |c_#StackHeapBarrier| |v_send_~#p.base_13|)))) (forall ((|v_send_~#p.base_13| Int)) (or (not (< |c_#StackHeapBarrier| |v_send_~#p.base_13|)) (forall ((v_ArrVal_4216 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |v_send_~#p.base_13| v_ArrVal_4216) |c_ULTIMATE.start_process_prio_queue_~node~1#1.base|) (+ |c_ULTIMATE.start_process_prio_queue_~node~1#1.offset| 12)) 0))))) is different from false [2022-07-12 03:42:22,247 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [300110039] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:42:22,247 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 03:42:22,247 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15] total 25 [2022-07-12 03:42:22,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276135598] [2022-07-12 03:42:22,247 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 03:42:22,248 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-07-12 03:42:22,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:42:22,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-07-12 03:42:22,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=473, Unknown=8, NotChecked=90, Total=650 [2022-07-12 03:42:22,248 INFO L87 Difference]: Start difference. First operand 160 states and 206 transitions. Second operand has 25 states, 24 states have (on average 2.125) internal successors, (51), 22 states have internal predecessors, (51), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-12 03:42:22,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:42:22,797 INFO L93 Difference]: Finished difference Result 205 states and 259 transitions. [2022-07-12 03:42:22,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-12 03:42:22,797 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.125) internal successors, (51), 22 states have internal predecessors, (51), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 32 [2022-07-12 03:42:22,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:42:22,798 INFO L225 Difference]: With dead ends: 205 [2022-07-12 03:42:22,798 INFO L226 Difference]: Without dead ends: 182 [2022-07-12 03:42:22,799 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=101, Invalid=651, Unknown=12, NotChecked=106, Total=870 [2022-07-12 03:42:22,799 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 40 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 149 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 03:42:22,799 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 311 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 118 Invalid, 0 Unknown, 149 Unchecked, 0.3s Time] [2022-07-12 03:42:22,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2022-07-12 03:42:22,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 180. [2022-07-12 03:42:22,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 162 states have (on average 1.2654320987654322) internal successors, (205), 163 states have internal predecessors, (205), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-07-12 03:42:22,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 229 transitions. [2022-07-12 03:42:22,810 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 229 transitions. Word has length 32 [2022-07-12 03:42:22,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:42:22,811 INFO L495 AbstractCegarLoop]: Abstraction has 180 states and 229 transitions. [2022-07-12 03:42:22,811 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.125) internal successors, (51), 22 states have internal predecessors, (51), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-12 03:42:22,811 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 229 transitions. [2022-07-12 03:42:22,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-07-12 03:42:22,812 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:42:22,812 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:42:22,833 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-07-12 03:42:23,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:42:23,032 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:42:23,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:42:23,032 INFO L85 PathProgramCache]: Analyzing trace with hash 879808253, now seen corresponding path program 1 times [2022-07-12 03:42:23,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:42:23,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395305061] [2022-07-12 03:42:23,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:42:23,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:42:23,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:42:23,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 03:42:23,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:42:23,304 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:42:23,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:42:23,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395305061] [2022-07-12 03:42:23,304 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395305061] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:42:23,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1386067906] [2022-07-12 03:42:23,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:42:23,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:42:23,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:42:23,306 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 03:42:23,327 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-07-12 03:42:23,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:42:23,631 INFO L263 TraceCheckSpWp]: Trace formula consists of 459 conjuncts, 96 conjunts are in the unsatisfiable core [2022-07-12 03:42:23,635 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:42:23,649 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 03:42:23,649 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2022-07-12 03:42:23,698 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 03:42:23,699 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-07-12 03:42:23,703 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-12 03:42:23,750 INFO L356 Elim1Store]: treesize reduction 98, result has 24.6 percent of original size [2022-07-12 03:42:23,750 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 34 treesize of output 53 [2022-07-12 03:42:23,766 INFO L390 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 [2022-07-12 03:42:23,851 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-12 03:42:23,857 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-12 03:42:23,861 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2022-07-12 03:42:23,959 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-12 03:42:23,965 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-12 03:42:23,968 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 16 treesize of output 10 [2022-07-12 03:42:23,995 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_4541 (Array Int Int)) (v_ArrVal_4544 (Array Int Int)) (v_ArrVal_4546 (Array Int Int)) (v_ArrVal_4536 (Array Int Int)) (|v_append_to_queue_~#p.base_109| Int) (v_ArrVal_4537 (Array Int Int)) (v_ArrVal_4548 (Array Int Int)) (append_to_queue_~node~0.base Int)) (and (= (store (store (store |c_old(#memory_$Pointer$.offset)| |v_append_to_queue_~#p.base_109| v_ArrVal_4541) append_to_queue_~node~0.base v_ArrVal_4546) |c_append_to_queue_#in~q.base| v_ArrVal_4536) |c_#memory_$Pointer$.offset|) (not (= append_to_queue_~node~0.base 0)) (= (select |c_old(#valid)| |v_append_to_queue_~#p.base_109|) 0) (< append_to_queue_~node~0.base |c_#StackHeapBarrier|) (= (let ((.cse0 (store |c_old(#memory_$Pointer$.base)| |v_append_to_queue_~#p.base_109| v_ArrVal_4537))) (store (store .cse0 append_to_queue_~node~0.base v_ArrVal_4544) |c_append_to_queue_#in~q.base| (store (select (store .cse0 append_to_queue_~node~0.base v_ArrVal_4548) |c_append_to_queue_#in~q.base|) |c_append_to_queue_#in~q.offset| append_to_queue_~node~0.base))) |c_#memory_$Pointer$.base|))) is different from true [2022-07-12 03:42:24,020 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:42:24,023 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:42:24,024 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:42:24,025 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:42:24,056 INFO L356 Elim1Store]: treesize reduction 46, result has 44.6 percent of original size [2022-07-12 03:42:24,057 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 50 treesize of output 117 [2022-07-12 03:42:24,064 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:42:24,064 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:42:24,066 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:42:24,090 INFO L356 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-07-12 03:42:24,090 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 34 [2022-07-12 03:42:24,111 INFO L356 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2022-07-12 03:42:24,111 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 25 [2022-07-12 03:42:24,120 INFO L390 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 7 [2022-07-12 03:42:24,126 INFO L390 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 12 treesize of output 11 [2022-07-12 03:42:24,146 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:42:24,148 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 28 [2022-07-12 03:42:24,150 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-07-12 03:42:26,416 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 03:42:26,416 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-07-12 03:42:26,422 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-12 03:42:26,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:42:26,509 INFO L356 Elim1Store]: treesize reduction 44, result has 66.4 percent of original size [2022-07-12 03:42:26,510 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 4497 treesize of output 4524 [2022-07-12 03:42:27,053 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 87 [2022-07-12 03:42:27,132 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-07-12 03:42:27,138 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-12 03:42:27,202 INFO L356 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-07-12 03:42:27,203 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 40 treesize of output 51 [2022-07-12 03:42:27,213 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 03:42:27,214 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 24 [2022-07-12 03:42:27,387 INFO L390 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 [2022-07-12 03:42:27,389 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-12 03:42:27,409 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:42:27,409 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:42:27,509 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4554 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_receive_~#packet~0#1.base| v_ArrVal_4554))) (or (not (= (select (select .cse0 |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0)) (= (select (select .cse0 |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) |c_ULTIMATE.start_main_~#normal_queue~0#1.offset|) 0)))) (or (forall ((v_ArrVal_4554 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_receive_~#packet~0#1.base| v_ArrVal_4554) |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0))) (forall ((v_ArrVal_4555 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_receive_~#packet~0#1.base| v_ArrVal_4555) |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) |c_ULTIMATE.start_main_~#normal_queue~0#1.offset|) 0)))) is different from false [2022-07-12 03:42:27,523 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_receive_~#packet~0#1.base_39| Int)) (or (forall ((v_ArrVal_4554 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_receive_~#packet~0#1.base_39| v_ArrVal_4554) |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0))) (forall ((v_ArrVal_4555 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_receive_~#packet~0#1.base_39| v_ArrVal_4555) |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) |c_ULTIMATE.start_main_~#normal_queue~0#1.offset|) 0)))) (forall ((v_ArrVal_4554 (Array Int Int)) (|v_ULTIMATE.start_receive_~#packet~0#1.base_39| Int)) (let ((.cse0 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_receive_~#packet~0#1.base_39| v_ArrVal_4554))) (or (= (select (select .cse0 |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) |c_ULTIMATE.start_main_~#normal_queue~0#1.offset|) 0) (not (= (select (select .cse0 |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0)))))) is different from false [2022-07-12 03:42:27,743 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1386067906] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:42:27,743 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 03:42:27,743 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 23 [2022-07-12 03:42:27,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290743384] [2022-07-12 03:42:27,744 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 03:42:27,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-07-12 03:42:27,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:42:27,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-07-12 03:42:27,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=557, Unknown=4, NotChecked=150, Total=812 [2022-07-12 03:42:27,745 INFO L87 Difference]: Start difference. First operand 180 states and 229 transitions. Second operand has 23 states, 23 states have (on average 2.347826086956522) internal successors, (54), 21 states have internal predecessors, (54), 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) [2022-07-12 03:42:34,187 WARN L233 SmtUtils]: Spent 6.11s on a formula simplification. DAG size of input: 67 DAG size of output: 67 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-12 03:42:40,307 WARN L233 SmtUtils]: Spent 6.08s on a formula simplification. DAG size of input: 64 DAG size of output: 64 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-12 03:42:40,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:42:40,454 INFO L93 Difference]: Finished difference Result 208 states and 263 transitions. [2022-07-12 03:42:40,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-12 03:42:40,454 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.347826086956522) internal successors, (54), 21 states have internal predecessors, (54), 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 31 [2022-07-12 03:42:40,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:42:40,455 INFO L225 Difference]: With dead ends: 208 [2022-07-12 03:42:40,455 INFO L226 Difference]: Without dead ends: 195 [2022-07-12 03:42:40,456 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 15.1s TimeCoverageRelationStatistics Valid=182, Invalid=1015, Unknown=5, NotChecked=204, Total=1406 [2022-07-12 03:42:40,456 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 23 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 521 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 117 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 03:42:40,456 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 521 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 101 Invalid, 0 Unknown, 117 Unchecked, 0.2s Time] [2022-07-12 03:42:40,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2022-07-12 03:42:40,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 187. [2022-07-12 03:42:40,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 169 states have (on average 1.272189349112426) internal successors, (215), 170 states have internal predecessors, (215), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-07-12 03:42:40,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 239 transitions. [2022-07-12 03:42:40,475 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 239 transitions. Word has length 31 [2022-07-12 03:42:40,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:42:40,475 INFO L495 AbstractCegarLoop]: Abstraction has 187 states and 239 transitions. [2022-07-12 03:42:40,475 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.347826086956522) internal successors, (54), 21 states have internal predecessors, (54), 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) [2022-07-12 03:42:40,475 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 239 transitions. [2022-07-12 03:42:40,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-07-12 03:42:40,476 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:42:40,476 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:42:40,495 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-07-12 03:42:40,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:42:40,680 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:42:40,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:42:40,680 INFO L85 PathProgramCache]: Analyzing trace with hash 1031517476, now seen corresponding path program 1 times [2022-07-12 03:42:40,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:42:40,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898078107] [2022-07-12 03:42:40,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:42:40,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:42:40,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:42:40,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 03:42:40,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:42:40,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 03:42:40,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:42:41,173 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:42:41,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:42:41,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898078107] [2022-07-12 03:42:41,173 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898078107] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:42:41,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2061151398] [2022-07-12 03:42:41,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:42:41,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:42:41,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:42:41,175 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 03:42:41,175 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-07-12 03:42:41,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:42:41,484 INFO L263 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 145 conjunts are in the unsatisfiable core [2022-07-12 03:42:41,490 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:42:41,501 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 03:42:41,502 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2022-07-12 03:42:41,555 INFO L356 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-07-12 03:42:41,555 INFO L390 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 [2022-07-12 03:42:41,566 INFO L390 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 [2022-07-12 03:42:41,569 INFO L390 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 [2022-07-12 03:42:41,620 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 22 treesize of output 25 [2022-07-12 03:42:41,624 INFO L390 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 [2022-07-12 03:42:41,627 INFO L390 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 [2022-07-12 03:42:41,821 INFO L390 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 23 treesize of output 7 [2022-07-12 03:42:41,825 INFO L390 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 [2022-07-12 03:42:41,828 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-12 03:42:41,858 INFO L390 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 48 [2022-07-12 03:42:41,862 INFO L390 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 48 [2022-07-12 03:42:41,867 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 62 [2022-07-12 03:42:41,872 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 62 [2022-07-12 03:42:42,111 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:42:42,113 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:42:42,117 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:42:42,118 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:42:42,119 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:42:42,156 INFO L356 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-07-12 03:42:42,157 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 53 [2022-07-12 03:42:42,165 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:42:42,166 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:42:42,170 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:42:42,171 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:42:42,172 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:42:42,202 INFO L356 Elim1Store]: treesize reduction 43, result has 41.9 percent of original size [2022-07-12 03:42:42,202 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 76 [2022-07-12 03:42:42,213 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2022-07-12 03:42:42,230 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2022-07-12 03:42:42,247 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 48 treesize of output 13 [2022-07-12 03:42:42,265 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-07-12 03:42:42,266 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 16 treesize of output 18 [2022-07-12 03:42:42,274 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 39 treesize of output 5 [2022-07-12 03:42:42,288 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-07-12 03:42:42,301 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2022-07-12 03:42:42,315 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2022-07-12 03:42:42,322 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 03:42:42,325 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-07-12 03:42:42,332 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 03:42:42,336 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2022-07-12 03:42:42,368 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2022-07-12 03:42:42,374 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-07-12 03:42:42,377 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-07-12 03:42:42,382 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2022-07-12 03:42:42,582 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:42:42,582 INFO L390 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 17 [2022-07-12 03:42:42,585 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:42:42,585 INFO L390 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 7 [2022-07-12 03:42:42,614 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_4950 (Array Int Int)) (|v_send_~#p.base_17| Int) (v_ArrVal_4945 (Array Int Int))) (and (< |c_#StackHeapBarrier| |v_send_~#p.base_17|) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |v_send_~#p.base_17| v_ArrVal_4945)) (= (store |c_old(#memory_$Pointer$.offset)| |v_send_~#p.base_17| v_ArrVal_4950) |c_#memory_$Pointer$.offset|))) is different from true [2022-07-12 03:42:42,648 INFO L356 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2022-07-12 03:42:42,648 INFO L390 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 58 [2022-07-12 03:42:42,654 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:42:42,656 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:42:42,662 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 03:42:42,663 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 37 [2022-07-12 03:42:42,670 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 03:42:42,693 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2022-07-12 03:42:42,788 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-12 03:42:42,790 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-12 03:42:42,792 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:42:42,792 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:42:44,837 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_send_~#p.base_23| Int)) (or (forall ((v_ArrVal_4960 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |v_send_~#p.base_23| v_ArrVal_4960) |c_ULTIMATE.start_process_prio_queue_~node~1#1.base|) (+ |c_ULTIMATE.start_process_prio_queue_~node~1#1.offset| 12)) 0)) (not (< |c_#StackHeapBarrier| |v_send_~#p.base_23|)))) (forall ((|v_send_~#p.base_23| Int)) (or (forall ((v_ArrVal_4959 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |v_send_~#p.base_23| v_ArrVal_4959) |c_ULTIMATE.start_process_prio_queue_~node~1#1.base|) (+ |c_ULTIMATE.start_process_prio_queue_~node~1#1.offset| 12)) 0)) (not (< |c_#StackHeapBarrier| |v_send_~#p.base_23|))))) is different from false [2022-07-12 03:42:44,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2061151398] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:42:44,838 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 03:42:44,838 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15] total 24 [2022-07-12 03:42:44,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655227764] [2022-07-12 03:42:44,839 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 03:42:44,839 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-07-12 03:42:44,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:42:44,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-07-12 03:42:44,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=434, Unknown=6, NotChecked=86, Total=600 [2022-07-12 03:42:44,840 INFO L87 Difference]: Start difference. First operand 187 states and 239 transitions. Second operand has 24 states, 23 states have (on average 2.3043478260869565) internal successors, (53), 21 states have internal predecessors, (53), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-12 03:42:45,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:42:45,432 INFO L93 Difference]: Finished difference Result 228 states and 288 transitions. [2022-07-12 03:42:45,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-12 03:42:45,433 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.3043478260869565) internal successors, (53), 21 states have internal predecessors, (53), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 33 [2022-07-12 03:42:45,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:42:45,433 INFO L225 Difference]: With dead ends: 228 [2022-07-12 03:42:45,433 INFO L226 Difference]: Without dead ends: 205 [2022-07-12 03:42:45,434 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=91, Invalid=557, Unknown=10, NotChecked=98, Total=756 [2022-07-12 03:42:45,434 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 22 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 102 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-12 03:42:45,435 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 392 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 192 Invalid, 0 Unknown, 102 Unchecked, 0.4s Time] [2022-07-12 03:42:45,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2022-07-12 03:42:45,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 201. [2022-07-12 03:42:45,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 180 states have (on average 1.2666666666666666) internal successors, (228), 182 states have internal predecessors, (228), 14 states have call successors, (14), 5 states have call predecessors, (14), 5 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-07-12 03:42:45,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 256 transitions. [2022-07-12 03:42:45,448 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 256 transitions. Word has length 33 [2022-07-12 03:42:45,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:42:45,449 INFO L495 AbstractCegarLoop]: Abstraction has 201 states and 256 transitions. [2022-07-12 03:42:45,449 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.3043478260869565) internal successors, (53), 21 states have internal predecessors, (53), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-12 03:42:45,449 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 256 transitions. [2022-07-12 03:42:45,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-12 03:42:45,450 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:42:45,450 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:42:45,469 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-07-12 03:42:45,663 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:42:45,664 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:42:45,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:42:45,664 INFO L85 PathProgramCache]: Analyzing trace with hash -11177640, now seen corresponding path program 1 times [2022-07-12 03:42:45,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:42:45,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947933980] [2022-07-12 03:42:45,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:42:45,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:42:45,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:42:45,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 03:42:45,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat