./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/heap-data/process_queue.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 839c364b Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/heap-data/process_queue.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 1ad9f94c1d10f7bc5f4235ca7c5dc51413b43a0e6c48b9e48da5d2e3e751252c --- Real Ultimate output --- This is Ultimate 0.2.2-839c364b5d67a0f615c82cb70ab247790648d4a9-839c364 [2021-12-14 13:44:15,205 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-14 13:44:15,206 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-14 13:44:15,238 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-14 13:44:15,238 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-14 13:44:15,239 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-14 13:44:15,250 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-14 13:44:15,253 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-14 13:44:15,256 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-14 13:44:15,260 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-14 13:44:15,261 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-14 13:44:15,262 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-14 13:44:15,263 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-14 13:44:15,265 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-14 13:44:15,267 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-14 13:44:15,268 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-14 13:44:15,271 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-14 13:44:15,275 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-14 13:44:15,276 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-14 13:44:15,281 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-14 13:44:15,282 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-14 13:44:15,286 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-14 13:44:15,286 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-14 13:44:15,287 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-14 13:44:15,288 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-14 13:44:15,288 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-14 13:44:15,289 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-14 13:44:15,291 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-14 13:44:15,292 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-14 13:44:15,292 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-14 13:44:15,292 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-14 13:44:15,293 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-14 13:44:15,294 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-14 13:44:15,295 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-14 13:44:15,295 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-14 13:44:15,296 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-14 13:44:15,296 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-14 13:44:15,296 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-14 13:44:15,296 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-14 13:44:15,297 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-14 13:44:15,297 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-14 13:44:15,299 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-14 13:44:15,316 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-14 13:44:15,316 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-14 13:44:15,316 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-14 13:44:15,317 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-14 13:44:15,317 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-14 13:44:15,317 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-14 13:44:15,318 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-14 13:44:15,318 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-14 13:44:15,318 INFO L138 SettingsManager]: * Use SBE=true [2021-12-14 13:44:15,318 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-14 13:44:15,318 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-14 13:44:15,318 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-14 13:44:15,319 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-14 13:44:15,319 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-14 13:44:15,319 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-14 13:44:15,319 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-14 13:44:15,319 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-14 13:44:15,319 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-14 13:44:15,319 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-14 13:44:15,320 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-14 13:44:15,320 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-14 13:44:15,320 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-14 13:44:15,320 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-14 13:44:15,320 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-14 13:44:15,320 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 13:44:15,320 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-14 13:44:15,321 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-14 13:44:15,321 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-14 13:44:15,321 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-14 13:44:15,321 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-14 13:44:15,321 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-14 13:44:15,321 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-14 13:44:15,321 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-14 13:44:15,322 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-14 13:44:15,322 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 -> 1ad9f94c1d10f7bc5f4235ca7c5dc51413b43a0e6c48b9e48da5d2e3e751252c [2021-12-14 13:44:15,514 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-14 13:44:15,536 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-14 13:44:15,538 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-14 13:44:15,539 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-14 13:44:15,539 INFO L275 PluginConnector]: CDTParser initialized [2021-12-14 13:44:15,540 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/heap-data/process_queue.i [2021-12-14 13:44:15,582 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d3564dded/f23b3c5a4b534555a4e95161b7eadec2/FLAG53e155f25 [2021-12-14 13:44:15,990 INFO L306 CDTParser]: Found 1 translation units. [2021-12-14 13:44:15,990 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-data/process_queue.i [2021-12-14 13:44:15,997 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d3564dded/f23b3c5a4b534555a4e95161b7eadec2/FLAG53e155f25 [2021-12-14 13:44:16,006 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d3564dded/f23b3c5a4b534555a4e95161b7eadec2 [2021-12-14 13:44:16,008 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-14 13:44:16,009 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-14 13:44:16,011 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-14 13:44:16,012 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-14 13:44:16,014 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-14 13:44:16,014 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 01:44:16" (1/1) ... [2021-12-14 13:44:16,015 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7945cd1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:44:16, skipping insertion in model container [2021-12-14 13:44:16,016 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 01:44:16" (1/1) ... [2021-12-14 13:44:16,020 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-14 13:44:16,050 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-14 13:44:16,277 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/process_queue.i[23979,23992] [2021-12-14 13:44:16,287 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 13:44:16,296 INFO L203 MainTranslator]: Completed pre-run [2021-12-14 13:44:16,325 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/process_queue.i[23979,23992] [2021-12-14 13:44:16,327 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 13:44:16,344 INFO L208 MainTranslator]: Completed translation [2021-12-14 13:44:16,344 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:44:16 WrapperNode [2021-12-14 13:44:16,344 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-14 13:44:16,345 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-14 13:44:16,345 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-14 13:44:16,345 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-14 13:44:16,351 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:44:16" (1/1) ... [2021-12-14 13:44:16,362 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:44:16" (1/1) ... [2021-12-14 13:44:16,381 INFO L137 Inliner]: procedures = 127, calls = 32, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 111 [2021-12-14 13:44:16,382 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-14 13:44:16,382 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-14 13:44:16,382 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-14 13:44:16,382 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-14 13:44:16,392 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:44:16" (1/1) ... [2021-12-14 13:44:16,392 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:44:16" (1/1) ... [2021-12-14 13:44:16,395 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:44:16" (1/1) ... [2021-12-14 13:44:16,397 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:44:16" (1/1) ... [2021-12-14 13:44:16,405 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:44:16" (1/1) ... [2021-12-14 13:44:16,408 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:44:16" (1/1) ... [2021-12-14 13:44:16,409 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:44:16" (1/1) ... [2021-12-14 13:44:16,410 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-14 13:44:16,411 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-14 13:44:16,411 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-14 13:44:16,411 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-14 13:44:16,412 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:44:16" (1/1) ... [2021-12-14 13:44:16,416 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 13:44:16,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 13:44:16,440 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-14 13:44:16,446 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-14 13:44:16,463 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-14 13:44:16,464 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-14 13:44:16,464 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-14 13:44:16,464 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-14 13:44:16,464 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-14 13:44:16,464 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-14 13:44:16,464 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-14 13:44:16,464 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-14 13:44:16,464 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-12-14 13:44:16,465 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-14 13:44:16,465 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-14 13:44:16,465 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-14 13:44:16,529 INFO L236 CfgBuilder]: Building ICFG [2021-12-14 13:44:16,530 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-14 13:44:16,678 INFO L277 CfgBuilder]: Performing block encoding [2021-12-14 13:44:16,682 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-14 13:44:16,695 INFO L301 CfgBuilder]: Removed 3 assume(true) statements. [2021-12-14 13:44:16,697 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 01:44:16 BoogieIcfgContainer [2021-12-14 13:44:16,697 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-14 13:44:16,698 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-14 13:44:16,698 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-14 13:44:16,700 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-14 13:44:16,701 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 01:44:16" (1/3) ... [2021-12-14 13:44:16,701 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e89bc8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 01:44:16, skipping insertion in model container [2021-12-14 13:44:16,701 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:44:16" (2/3) ... [2021-12-14 13:44:16,702 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e89bc8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 01:44:16, skipping insertion in model container [2021-12-14 13:44:16,702 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 01:44:16" (3/3) ... [2021-12-14 13:44:16,703 INFO L111 eAbstractionObserver]: Analyzing ICFG process_queue.i [2021-12-14 13:44:16,706 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-14 13:44:16,706 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-14 13:44:16,735 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-14 13:44:16,739 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-14 13:44:16,739 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-14 13:44:16,747 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 24 states have (on average 1.5416666666666667) internal successors, (37), 25 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:44:16,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-14 13:44:16,751 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:44:16,752 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:44:16,752 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:44:16,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:44:16,756 INFO L85 PathProgramCache]: Analyzing trace with hash -2060272908, now seen corresponding path program 1 times [2021-12-14 13:44:16,761 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:44:16,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053562698] [2021-12-14 13:44:16,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:44:16,762 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:44:16,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:44:16,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 13:44:16,953 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:44:16,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053562698] [2021-12-14 13:44:16,964 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053562698] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 13:44:16,964 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 13:44:16,964 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 13:44:16,966 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738825678] [2021-12-14 13:44:16,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 13:44:16,969 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 13:44:16,969 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:44:16,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 13:44:16,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 13:44:16,989 INFO L87 Difference]: Start difference. First operand has 26 states, 24 states have (on average 1.5416666666666667) internal successors, (37), 25 states have internal predecessors, (37), 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) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:44:17,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:44:17,016 INFO L93 Difference]: Finished difference Result 51 states and 74 transitions. [2021-12-14 13:44:17,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 13:44:17,019 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-12-14 13:44:17,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:44:17,024 INFO L225 Difference]: With dead ends: 51 [2021-12-14 13:44:17,024 INFO L226 Difference]: Without dead ends: 23 [2021-12-14 13:44:17,026 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 13:44:17,031 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 0 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 13:44:17,032 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 59 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 13:44:17,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2021-12-14 13:44:17,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2021-12-14 13:44:17,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 22 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:44:17,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 30 transitions. [2021-12-14 13:44:17,058 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 30 transitions. Word has length 11 [2021-12-14 13:44:17,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:44:17,058 INFO L470 AbstractCegarLoop]: Abstraction has 23 states and 30 transitions. [2021-12-14 13:44:17,058 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:44:17,059 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 30 transitions. [2021-12-14 13:44:17,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-14 13:44:17,060 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:44:17,060 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:44:17,061 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-14 13:44:17,061 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:44:17,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:44:17,064 INFO L85 PathProgramCache]: Analyzing trace with hash -1911586027, now seen corresponding path program 1 times [2021-12-14 13:44:17,064 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:44:17,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821183546] [2021-12-14 13:44:17,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:44:17,065 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:44:17,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:44:17,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 13:44:17,133 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:44:17,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821183546] [2021-12-14 13:44:17,133 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821183546] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 13:44:17,134 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 13:44:17,134 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-14 13:44:17,134 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309491869] [2021-12-14 13:44:17,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 13:44:17,135 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-14 13:44:17,135 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:44:17,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-14 13:44:17,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-14 13:44:17,137 INFO L87 Difference]: Start difference. First operand 23 states and 30 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:44:17,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:44:17,183 INFO L93 Difference]: Finished difference Result 56 states and 74 transitions. [2021-12-14 13:44:17,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-14 13:44:17,184 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-12-14 13:44:17,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:44:17,185 INFO L225 Difference]: With dead ends: 56 [2021-12-14 13:44:17,185 INFO L226 Difference]: Without dead ends: 35 [2021-12-14 13:44:17,187 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-14 13:44:17,189 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 11 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 13:44:17,189 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 86 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 13:44:17,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2021-12-14 13:44:17,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2021-12-14 13:44:17,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.34375) internal successors, (43), 32 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:44:17,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 43 transitions. [2021-12-14 13:44:17,200 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 43 transitions. Word has length 11 [2021-12-14 13:44:17,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:44:17,201 INFO L470 AbstractCegarLoop]: Abstraction has 33 states and 43 transitions. [2021-12-14 13:44:17,202 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:44:17,202 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 43 transitions. [2021-12-14 13:44:17,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-14 13:44:17,202 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:44:17,203 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:44:17,203 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-14 13:44:17,206 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:44:17,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:44:17,207 INFO L85 PathProgramCache]: Analyzing trace with hash 459687026, now seen corresponding path program 1 times [2021-12-14 13:44:17,207 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:44:17,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501618908] [2021-12-14 13:44:17,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:44:17,208 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:44:17,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:44:17,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 13:44:17,392 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:44:17,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501618908] [2021-12-14 13:44:17,393 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501618908] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 13:44:17,393 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 13:44:17,393 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 13:44:17,393 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285433221] [2021-12-14 13:44:17,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 13:44:17,394 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 13:44:17,394 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:44:17,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 13:44:17,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-14 13:44:17,396 INFO L87 Difference]: Start difference. First operand 33 states and 43 transitions. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:44:17,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:44:17,540 INFO L93 Difference]: Finished difference Result 74 states and 97 transitions. [2021-12-14 13:44:17,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-14 13:44:17,540 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-12-14 13:44:17,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:44:17,543 INFO L225 Difference]: With dead ends: 74 [2021-12-14 13:44:17,543 INFO L226 Difference]: Without dead ends: 72 [2021-12-14 13:44:17,544 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-12-14 13:44:17,550 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 63 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 13:44:17,551 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [63 Valid, 105 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 13:44:17,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2021-12-14 13:44:17,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 51. [2021-12-14 13:44:17,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 50 states have (on average 1.36) internal successors, (68), 50 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:44:17,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 68 transitions. [2021-12-14 13:44:17,565 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 68 transitions. Word has length 11 [2021-12-14 13:44:17,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:44:17,566 INFO L470 AbstractCegarLoop]: Abstraction has 51 states and 68 transitions. [2021-12-14 13:44:17,566 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:44:17,566 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 68 transitions. [2021-12-14 13:44:17,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-14 13:44:17,567 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:44:17,567 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:44:17,567 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-14 13:44:17,567 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:44:17,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:44:17,568 INFO L85 PathProgramCache]: Analyzing trace with hash 608373907, now seen corresponding path program 1 times [2021-12-14 13:44:17,568 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:44:17,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528335855] [2021-12-14 13:44:17,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:44:17,568 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:44:17,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:44:17,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 13:44:17,615 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:44:17,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528335855] [2021-12-14 13:44:17,615 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528335855] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 13:44:17,616 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 13:44:17,616 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-14 13:44:17,616 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78820818] [2021-12-14 13:44:17,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 13:44:17,617 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-14 13:44:17,617 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:44:17,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-14 13:44:17,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-14 13:44:17,619 INFO L87 Difference]: Start difference. First operand 51 states and 68 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:44:17,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:44:17,672 INFO L93 Difference]: Finished difference Result 106 states and 140 transitions. [2021-12-14 13:44:17,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-14 13:44:17,673 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-12-14 13:44:17,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:44:17,673 INFO L225 Difference]: With dead ends: 106 [2021-12-14 13:44:17,673 INFO L226 Difference]: Without dead ends: 57 [2021-12-14 13:44:17,674 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-14 13:44:17,677 INFO L933 BasicCegarLoop]: 42 mSDtfsCounter, 23 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 13:44:17,677 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 74 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 13:44:17,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2021-12-14 13:44:17,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 49. [2021-12-14 13:44:17,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 1.3333333333333333) internal successors, (64), 48 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:44:17,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 64 transitions. [2021-12-14 13:44:17,682 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 64 transitions. Word has length 11 [2021-12-14 13:44:17,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:44:17,682 INFO L470 AbstractCegarLoop]: Abstraction has 49 states and 64 transitions. [2021-12-14 13:44:17,682 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:44:17,683 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 64 transitions. [2021-12-14 13:44:17,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-12-14 13:44:17,683 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:44:17,683 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:44:17,683 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-14 13:44:17,683 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:44:17,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:44:17,684 INFO L85 PathProgramCache]: Analyzing trace with hash -2110602732, now seen corresponding path program 1 times [2021-12-14 13:44:17,684 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:44:17,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189296250] [2021-12-14 13:44:17,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:44:17,684 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:44:17,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:44:17,778 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 13:44:17,778 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:44:17,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189296250] [2021-12-14 13:44:17,779 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189296250] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 13:44:17,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [520097286] [2021-12-14 13:44:17,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:44:17,779 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 13:44:17,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 13:44:17,780 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 13:44:17,781 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-14 13:44:17,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:44:17,853 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 74 conjunts are in the unsatisfiable core [2021-12-14 13:44:17,858 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 13:44:17,892 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-14 13:44:18,006 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:44:18,011 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:44:18,012 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 24 [2021-12-14 13:44:18,016 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:44:18,020 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:44:18,021 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 24 [2021-12-14 13:44:18,028 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2021-12-14 13:44:18,034 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2021-12-14 13:44:18,041 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-12-14 13:44:18,045 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-12-14 13:44:18,053 INFO L354 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2021-12-14 13:44:18,054 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2021-12-14 13:44:18,178 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 13:44:18,180 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 13:44:18,180 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 65 treesize of output 37 [2021-12-14 13:44:18,193 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-14 13:44:18,193 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 18 [2021-12-14 13:44:18,201 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 13:44:18,201 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 13:44:18,402 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 13:44:18,403 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [520097286] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 13:44:18,403 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 13:44:18,403 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2021-12-14 13:44:18,403 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001883628] [2021-12-14 13:44:18,403 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 13:44:18,404 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-14 13:44:18,404 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:44:18,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-14 13:44:18,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2021-12-14 13:44:18,406 INFO L87 Difference]: Start difference. First operand 49 states and 64 transitions. Second operand has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 12 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:44:18,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:44:18,565 INFO L93 Difference]: Finished difference Result 121 states and 160 transitions. [2021-12-14 13:44:18,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-14 13:44:18,568 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 12 states have internal predecessors, (34), 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 14 [2021-12-14 13:44:18,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:44:18,569 INFO L225 Difference]: With dead ends: 121 [2021-12-14 13:44:18,569 INFO L226 Difference]: Without dead ends: 83 [2021-12-14 13:44:18,569 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2021-12-14 13:44:18,570 INFO L933 BasicCegarLoop]: 43 mSDtfsCounter, 41 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 22 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 13:44:18,570 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 225 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 74 Invalid, 0 Unknown, 22 Unchecked, 0.1s Time] [2021-12-14 13:44:18,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2021-12-14 13:44:18,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 54. [2021-12-14 13:44:18,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 53 states have (on average 1.320754716981132) internal successors, (70), 53 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:44:18,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 70 transitions. [2021-12-14 13:44:18,577 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 70 transitions. Word has length 14 [2021-12-14 13:44:18,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:44:18,577 INFO L470 AbstractCegarLoop]: Abstraction has 54 states and 70 transitions. [2021-12-14 13:44:18,577 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 12 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:44:18,577 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 70 transitions. [2021-12-14 13:44:18,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-12-14 13:44:18,578 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:44:18,578 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:44:18,596 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2021-12-14 13:44:18,779 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 13:44:18,779 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:44:18,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:44:18,780 INFO L85 PathProgramCache]: Analyzing trace with hash 969563825, now seen corresponding path program 1 times [2021-12-14 13:44:18,780 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:44:18,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520553429] [2021-12-14 13:44:18,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:44:18,780 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:44:18,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:44:18,815 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 13:44:18,815 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:44:18,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520553429] [2021-12-14 13:44:18,815 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520553429] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 13:44:18,815 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 13:44:18,815 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-14 13:44:18,815 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465841444] [2021-12-14 13:44:18,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 13:44:18,816 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-14 13:44:18,816 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:44:18,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-14 13:44:18,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-14 13:44:18,817 INFO L87 Difference]: Start difference. First operand 54 states and 70 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:44:18,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:44:18,846 INFO L93 Difference]: Finished difference Result 117 states and 155 transitions. [2021-12-14 13:44:18,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-14 13:44:18,846 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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 19 [2021-12-14 13:44:18,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:44:18,847 INFO L225 Difference]: With dead ends: 117 [2021-12-14 13:44:18,847 INFO L226 Difference]: Without dead ends: 79 [2021-12-14 13:44:18,847 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-14 13:44:18,847 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 29 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 13:44:18,848 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 75 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 13:44:18,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2021-12-14 13:44:18,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 70. [2021-12-14 13:44:18,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 69 states have (on average 1.3043478260869565) internal successors, (90), 69 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:44:18,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 90 transitions. [2021-12-14 13:44:18,852 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 90 transitions. Word has length 19 [2021-12-14 13:44:18,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:44:18,853 INFO L470 AbstractCegarLoop]: Abstraction has 70 states and 90 transitions. [2021-12-14 13:44:18,853 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:44:18,853 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 90 transitions. [2021-12-14 13:44:18,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-12-14 13:44:18,853 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:44:18,853 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:44:18,854 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-14 13:44:18,854 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:44:18,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:44:18,854 INFO L85 PathProgramCache]: Analyzing trace with hash 1377311315, now seen corresponding path program 1 times [2021-12-14 13:44:18,854 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:44:18,854 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90389305] [2021-12-14 13:44:18,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:44:18,855 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:44:18,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:44:18,949 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-14 13:44:18,949 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:44:18,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90389305] [2021-12-14 13:44:18,950 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90389305] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 13:44:18,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1559201656] [2021-12-14 13:44:18,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:44:18,950 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 13:44:18,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 13:44:18,951 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 13:44:18,952 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-14 13:44:19,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:44:19,048 INFO L263 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 59 conjunts are in the unsatisfiable core [2021-12-14 13:44:19,051 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 13:44:19,164 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 20 treesize of output 28 [2021-12-14 13:44:19,168 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:44:19,170 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:44:19,171 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2021-12-14 13:44:19,173 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:44:19,175 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:44:19,176 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2021-12-14 13:44:19,179 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2021-12-14 13:44:19,182 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:44:19,183 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2021-12-14 13:44:19,186 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2021-12-14 13:44:19,225 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-14 13:44:19,228 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2021-12-14 13:44:19,242 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-14 13:44:19,252 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-14 13:44:19,252 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 13:44:19,307 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 13:44:19,307 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 35 [2021-12-14 13:44:19,312 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2021-12-14 13:44:19,315 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2021-12-14 13:44:19,424 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-14 13:44:19,425 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1559201656] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 13:44:19,425 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 13:44:19,425 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2021-12-14 13:44:19,425 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57130177] [2021-12-14 13:44:19,425 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 13:44:19,425 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-12-14 13:44:19,425 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:44:19,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-12-14 13:44:19,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2021-12-14 13:44:19,426 INFO L87 Difference]: Start difference. First operand 70 states and 90 transitions. Second operand has 17 states, 17 states have (on average 3.6470588235294117) internal successors, (62), 17 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:44:20,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:44:20,495 INFO L93 Difference]: Finished difference Result 323 states and 428 transitions. [2021-12-14 13:44:20,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-12-14 13:44:20,496 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.6470588235294117) internal successors, (62), 17 states have internal predecessors, (62), 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 22 [2021-12-14 13:44:20,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:44:20,497 INFO L225 Difference]: With dead ends: 323 [2021-12-14 13:44:20,497 INFO L226 Difference]: Without dead ends: 269 [2021-12-14 13:44:20,498 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 525 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=530, Invalid=1822, Unknown=0, NotChecked=0, Total=2352 [2021-12-14 13:44:20,498 INFO L933 BasicCegarLoop]: 50 mSDtfsCounter, 532 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 428 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 532 SdHoareTripleChecker+Valid, 451 SdHoareTripleChecker+Invalid, 545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-14 13:44:20,499 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [532 Valid, 451 Invalid, 545 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 428 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-14 13:44:20,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2021-12-14 13:44:20,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 116. [2021-12-14 13:44:20,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 115 states have (on average 1.3043478260869565) internal successors, (150), 115 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:44:20,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 150 transitions. [2021-12-14 13:44:20,507 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 150 transitions. Word has length 22 [2021-12-14 13:44:20,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:44:20,508 INFO L470 AbstractCegarLoop]: Abstraction has 116 states and 150 transitions. [2021-12-14 13:44:20,508 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.6470588235294117) internal successors, (62), 17 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:44:20,508 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 150 transitions. [2021-12-14 13:44:20,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-12-14 13:44:20,509 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:44:20,509 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2021-12-14 13:44:20,525 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-12-14 13:44:20,723 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2021-12-14 13:44:20,723 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:44:20,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:44:20,724 INFO L85 PathProgramCache]: Analyzing trace with hash 1662719123, now seen corresponding path program 2 times [2021-12-14 13:44:20,724 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:44:20,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509379536] [2021-12-14 13:44:20,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:44:20,724 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:44:20,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:44:20,886 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 13:44:20,886 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:44:20,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509379536] [2021-12-14 13:44:20,886 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509379536] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 13:44:20,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [267559305] [2021-12-14 13:44:20,886 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-14 13:44:20,887 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 13:44:20,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 13:44:20,887 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 13:44:20,888 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-14 13:44:20,987 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-14 13:44:20,987 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-14 13:44:20,989 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 122 conjunts are in the unsatisfiable core [2021-12-14 13:44:20,992 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 13:44:21,000 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-14 13:44:21,046 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:44:21,048 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:44:21,049 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2021-12-14 13:44:21,051 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:44:21,053 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:44:21,054 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2021-12-14 13:44:21,056 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2021-12-14 13:44:21,066 INFO L354 Elim1Store]: treesize reduction 26, result has 35.0 percent of original size [2021-12-14 13:44:21,066 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 25 treesize of output 29 [2021-12-14 13:44:21,069 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2021-12-14 13:44:21,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:44:21,327 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:44:21,327 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 47 [2021-12-14 13:44:21,331 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:44:21,333 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:44:21,334 INFO L388 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 44 treesize of output 37 [2021-12-14 13:44:21,338 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:44:21,339 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:44:21,340 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 27 [2021-12-14 13:44:21,344 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 36 [2021-12-14 13:44:21,347 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 32 [2021-12-14 13:44:21,352 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-12-14 13:44:21,358 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-12-14 13:44:21,366 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:44:21,370 INFO L354 Elim1Store]: treesize reduction 4, result has 80.0 percent of original size [2021-12-14 13:44:21,371 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 26 [2021-12-14 13:44:21,507 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 13:44:21,508 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:44:21,510 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 13:44:21,510 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 98 treesize of output 50 [2021-12-14 13:44:21,514 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:44:21,517 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-14 13:44:21,518 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 18 [2021-12-14 13:44:21,539 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-14 13:44:21,553 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 13:44:21,553 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 13:44:21,634 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_524 (Array Int Int)) (v_ArrVal_513 (Array Int Int)) (v_ArrVal_515 (Array Int Int)) (v_ArrVal_517 (Array Int Int)) (v_ArrVal_518 (Array Int Int)) (v_ArrVal_525 Int) (v_ArrVal_522 (Array Int Int))) (or (<= |c_#StackHeapBarrier| v_ArrVal_525) (not (= (select |c_#valid| v_ArrVal_525) 0)) (<= 1 (select (select (store (store |c_#memory_int| v_ArrVal_525 v_ArrVal_513) |c_ULTIMATE.start_main_~#queue~0#1.base| v_ArrVal_515) (select (select (store (store |c_#memory_$Pointer$.base| v_ArrVal_525 (store v_ArrVal_518 8 (select (select (store |c_#memory_$Pointer$.base| v_ArrVal_525 v_ArrVal_518) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|))) |c_ULTIMATE.start_main_~#queue~0#1.base| (store (select (store |c_#memory_$Pointer$.base| v_ArrVal_525 v_ArrVal_524) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset| v_ArrVal_525)) v_ArrVal_525) 8)) (+ (select (select (store (store |c_#memory_$Pointer$.offset| v_ArrVal_525 (store v_ArrVal_517 8 (select (select (store |c_#memory_$Pointer$.offset| v_ArrVal_525 v_ArrVal_517) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|))) |c_ULTIMATE.start_main_~#queue~0#1.base| (store (select (store |c_#memory_$Pointer$.offset| v_ArrVal_525 v_ArrVal_522) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset| 0)) v_ArrVal_525) 8) 4))))) is different from false [2021-12-14 13:44:21,816 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 13:44:21,817 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 811 treesize of output 752 [2021-12-14 13:44:21,825 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 678 treesize of output 550 [2021-12-14 13:44:21,834 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 307 treesize of output 243 [2021-12-14 13:44:22,662 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 13:44:22,675 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 421 treesize of output 415 [2021-12-14 13:44:22,689 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 13:44:22,691 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 404 treesize of output 402 [2021-12-14 13:44:22,700 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 374 treesize of output 368 [2021-12-14 13:44:22,709 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 391 treesize of output 385 [2021-12-14 13:44:22,718 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 401 treesize of output 397 [2021-12-14 13:44:22,723 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 397 treesize of output 393 [2021-12-14 13:44:22,731 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 393 treesize of output 389 [2021-12-14 13:44:22,737 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 394 treesize of output 392 [2021-12-14 13:44:22,746 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 409 treesize of output 405 [2021-12-14 13:44:22,753 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 411 treesize of output 409 [2021-12-14 13:44:22,762 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 405 treesize of output 401 [2021-12-14 13:44:23,057 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked. [2021-12-14 13:44:23,057 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [267559305] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 13:44:23,057 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 13:44:23,057 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 11] total 26 [2021-12-14 13:44:23,057 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468287335] [2021-12-14 13:44:23,057 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 13:44:23,057 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2021-12-14 13:44:23,057 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:44:23,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-12-14 13:44:23,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=514, Unknown=5, NotChecked=46, Total=650 [2021-12-14 13:44:23,058 INFO L87 Difference]: Start difference. First operand 116 states and 150 transitions. Second operand has 26 states, 26 states have (on average 2.6923076923076925) internal successors, (70), 26 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:44:24,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:44:24,284 INFO L93 Difference]: Finished difference Result 341 states and 446 transitions. [2021-12-14 13:44:24,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-12-14 13:44:24,285 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.6923076923076925) internal successors, (70), 26 states have internal predecessors, (70), 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 [2021-12-14 13:44:24,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:44:24,286 INFO L225 Difference]: With dead ends: 341 [2021-12-14 13:44:24,286 INFO L226 Difference]: Without dead ends: 339 [2021-12-14 13:44:24,287 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 40 SyntacticMatches, 8 SemanticMatches, 43 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 392 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=335, Invalid=1552, Unknown=9, NotChecked=84, Total=1980 [2021-12-14 13:44:24,287 INFO L933 BasicCegarLoop]: 36 mSDtfsCounter, 287 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 311 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 219 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-14 13:44:24,288 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [287 Valid, 483 Invalid, 564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 311 Invalid, 0 Unknown, 219 Unchecked, 0.3s Time] [2021-12-14 13:44:24,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2021-12-14 13:44:24,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 222. [2021-12-14 13:44:24,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 221 states have (on average 1.3122171945701357) internal successors, (290), 221 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:44:24,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 290 transitions. [2021-12-14 13:44:24,313 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 290 transitions. Word has length 25 [2021-12-14 13:44:24,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:44:24,313 INFO L470 AbstractCegarLoop]: Abstraction has 222 states and 290 transitions. [2021-12-14 13:44:24,313 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.6923076923076925) internal successors, (70), 26 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:44:24,313 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 290 transitions. [2021-12-14 13:44:24,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-12-14 13:44:24,315 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:44:24,315 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2021-12-14 13:44:24,331 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-12-14 13:44:24,515 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 13:44:24,516 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:44:24,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:44:24,516 INFO L85 PathProgramCache]: Analyzing trace with hash 211481171, now seen corresponding path program 3 times [2021-12-14 13:44:24,516 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:44:24,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010527744] [2021-12-14 13:44:24,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:44:24,516 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:44:24,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:44:24,797 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 3 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 13:44:24,798 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:44:24,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010527744] [2021-12-14 13:44:24,798 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010527744] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 13:44:24,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [457045783] [2021-12-14 13:44:24,798 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-14 13:44:24,798 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 13:44:24,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 13:44:24,799 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 13:44:24,800 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-14 13:44:25,110 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-12-14 13:44:25,110 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-14 13:44:25,114 INFO L263 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 129 conjunts are in the unsatisfiable core [2021-12-14 13:44:25,118 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 13:44:25,127 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-14 13:44:25,196 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:44:25,198 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:44:25,199 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 24 [2021-12-14 13:44:25,202 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:44:25,204 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:44:25,204 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 24 [2021-12-14 13:44:25,208 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2021-12-14 13:44:25,211 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2021-12-14 13:44:25,215 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-12-14 13:44:25,227 INFO L354 Elim1Store]: treesize reduction 26, result has 35.0 percent of original size [2021-12-14 13:44:25,228 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 25 treesize of output 29 [2021-12-14 13:44:25,231 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-12-14 13:44:25,446 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:44:25,449 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:44:25,456 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:44:25,457 INFO L388 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 0 case distinctions, treesize of input 40 treesize of output 38 [2021-12-14 13:44:25,460 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:44:25,462 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:44:25,470 INFO L354 Elim1Store]: treesize reduction 47, result has 9.6 percent of original size [2021-12-14 13:44:25,470 INFO L388 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 2 case distinctions, treesize of input 61 treesize of output 56 [2021-12-14 13:44:25,475 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 39 [2021-12-14 13:44:25,479 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2021-12-14 13:44:25,483 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-12-14 13:44:25,487 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-12-14 13:44:25,489 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:44:25,493 INFO L354 Elim1Store]: treesize reduction 4, result has 80.0 percent of original size [2021-12-14 13:44:25,494 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 26 [2021-12-14 13:44:25,716 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 13:44:25,728 INFO L354 Elim1Store]: treesize reduction 67, result has 9.5 percent of original size [2021-12-14 13:44:25,728 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 9 new quantified variables, introduced 10 case distinctions, treesize of input 153 treesize of output 83 [2021-12-14 13:44:25,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:44:25,739 INFO L354 Elim1Store]: treesize reduction 10, result has 41.2 percent of original size [2021-12-14 13:44:25,740 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 29 [2021-12-14 13:44:25,746 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 3 proven. 21 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-14 13:44:25,746 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 13:44:28,276 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 3 proven. 21 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-14 13:44:28,276 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [457045783] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 13:44:28,277 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 13:44:28,277 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 19 [2021-12-14 13:44:28,277 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097461883] [2021-12-14 13:44:28,277 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 13:44:28,277 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-12-14 13:44:28,277 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:44:28,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-12-14 13:44:28,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=294, Unknown=1, NotChecked=0, Total=342 [2021-12-14 13:44:28,278 INFO L87 Difference]: Start difference. First operand 222 states and 290 transitions. Second operand has 19 states, 19 states have (on average 3.6842105263157894) internal successors, (70), 19 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:44:28,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:44:28,815 INFO L93 Difference]: Finished difference Result 521 states and 681 transitions. [2021-12-14 13:44:28,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-14 13:44:28,815 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.6842105263157894) internal successors, (70), 19 states have internal predecessors, (70), 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 28 [2021-12-14 13:44:28,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:44:28,816 INFO L225 Difference]: With dead ends: 521 [2021-12-14 13:44:28,817 INFO L226 Difference]: Without dead ends: 315 [2021-12-14 13:44:28,817 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=83, Invalid=468, Unknown=1, NotChecked=0, Total=552 [2021-12-14 13:44:28,818 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 109 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 54 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 13:44:28,818 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [109 Valid, 359 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 158 Invalid, 0 Unknown, 54 Unchecked, 0.2s Time] [2021-12-14 13:44:28,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2021-12-14 13:44:28,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 263. [2021-12-14 13:44:28,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 262 states have (on average 1.2900763358778626) internal successors, (338), 262 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:44:28,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 338 transitions. [2021-12-14 13:44:28,828 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 338 transitions. Word has length 28 [2021-12-14 13:44:28,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:44:28,828 INFO L470 AbstractCegarLoop]: Abstraction has 263 states and 338 transitions. [2021-12-14 13:44:28,828 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.6842105263157894) internal successors, (70), 19 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:44:28,828 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 338 transitions. [2021-12-14 13:44:28,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-14 13:44:28,829 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:44:28,829 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:44:28,846 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-12-14 13:44:29,043 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 13:44:29,043 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:44:29,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:44:29,044 INFO L85 PathProgramCache]: Analyzing trace with hash -1324510600, now seen corresponding path program 1 times [2021-12-14 13:44:29,044 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:44:29,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677177515] [2021-12-14 13:44:29,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:44:29,044 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:44:29,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:44:29,084 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-14 13:44:29,084 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:44:29,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677177515] [2021-12-14 13:44:29,085 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677177515] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 13:44:29,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1454167890] [2021-12-14 13:44:29,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:44:29,085 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 13:44:29,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 13:44:29,086 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 13:44:29,087 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-14 13:44:29,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:44:29,176 INFO L263 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-14 13:44:29,177 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 13:44:29,221 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-14 13:44:29,221 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 13:44:29,271 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-14 13:44:29,271 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1454167890] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 13:44:29,271 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 13:44:29,271 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2021-12-14 13:44:29,271 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636247945] [2021-12-14 13:44:29,271 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 13:44:29,271 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-14 13:44:29,271 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:44:29,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-14 13:44:29,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2021-12-14 13:44:29,272 INFO L87 Difference]: Start difference. First operand 263 states and 338 transitions. Second operand has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:44:29,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:44:29,358 INFO L93 Difference]: Finished difference Result 639 states and 834 transitions. [2021-12-14 13:44:29,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-14 13:44:29,360 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 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 29 [2021-12-14 13:44:29,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:44:29,361 INFO L225 Difference]: With dead ends: 639 [2021-12-14 13:44:29,361 INFO L226 Difference]: Without dead ends: 406 [2021-12-14 13:44:29,362 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2021-12-14 13:44:29,362 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 96 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 13:44:29,363 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [96 Valid, 163 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 13:44:29,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2021-12-14 13:44:29,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 378. [2021-12-14 13:44:29,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 378 states, 377 states have (on average 1.2785145888594165) internal successors, (482), 377 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:44:29,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 482 transitions. [2021-12-14 13:44:29,375 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 482 transitions. Word has length 29 [2021-12-14 13:44:29,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:44:29,375 INFO L470 AbstractCegarLoop]: Abstraction has 378 states and 482 transitions. [2021-12-14 13:44:29,376 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:44:29,376 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 482 transitions. [2021-12-14 13:44:29,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-14 13:44:29,376 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:44:29,376 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:44:29,392 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-12-14 13:44:29,583 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-12-14 13:44:29,583 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:44:29,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:44:29,584 INFO L85 PathProgramCache]: Analyzing trace with hash -313393350, now seen corresponding path program 1 times [2021-12-14 13:44:29,584 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:44:29,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586184261] [2021-12-14 13:44:29,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:44:29,584 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:44:29,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:44:29,702 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 13:44:29,703 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:44:29,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586184261] [2021-12-14 13:44:29,703 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586184261] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 13:44:29,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1846673568] [2021-12-14 13:44:29,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:44:29,703 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 13:44:29,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 13:44:29,707 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 13:44:29,708 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-12-14 13:44:29,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:44:29,806 INFO L263 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 65 conjunts are in the unsatisfiable core [2021-12-14 13:44:29,808 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 13:44:29,814 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-14 13:44:29,848 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:44:29,850 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:44:29,850 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2021-12-14 13:44:29,853 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:44:29,854 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:44:29,855 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2021-12-14 13:44:29,860 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 20 treesize of output 28 [2021-12-14 13:44:29,863 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2021-12-14 13:44:29,867 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2021-12-14 13:44:29,869 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:44:29,870 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2021-12-14 13:44:29,874 INFO L354 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2021-12-14 13:44:29,875 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2021-12-14 13:44:29,971 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2021-12-14 13:44:29,994 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 13:44:29,994 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 7 [2021-12-14 13:44:30,013 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-14 13:44:30,013 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 13:44:30,071 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 13:44:30,071 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 35 [2021-12-14 13:44:30,073 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-12-14 13:44:30,075 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2021-12-14 13:44:30,126 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-14 13:44:30,126 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1846673568] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 13:44:30,126 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 13:44:30,126 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 13 [2021-12-14 13:44:30,127 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459021717] [2021-12-14 13:44:30,127 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 13:44:30,127 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-14 13:44:30,127 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:44:30,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-14 13:44:30,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2021-12-14 13:44:30,128 INFO L87 Difference]: Start difference. First operand 378 states and 482 transitions. Second operand has 13 states, 13 states have (on average 5.0) internal successors, (65), 13 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:44:30,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:44:30,343 INFO L93 Difference]: Finished difference Result 703 states and 907 transitions. [2021-12-14 13:44:30,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-14 13:44:30,343 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.0) internal successors, (65), 13 states have internal predecessors, (65), 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 29 [2021-12-14 13:44:30,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:44:30,345 INFO L225 Difference]: With dead ends: 703 [2021-12-14 13:44:30,345 INFO L226 Difference]: Without dead ends: 380 [2021-12-14 13:44:30,345 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2021-12-14 13:44:30,346 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 35 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 26 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 13:44:30,346 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 207 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 169 Invalid, 0 Unknown, 26 Unchecked, 0.1s Time] [2021-12-14 13:44:30,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2021-12-14 13:44:30,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 379. [2021-12-14 13:44:30,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 379 states, 378 states have (on average 1.2777777777777777) internal successors, (483), 378 states have internal predecessors, (483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:44:30,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 483 transitions. [2021-12-14 13:44:30,364 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 483 transitions. Word has length 29 [2021-12-14 13:44:30,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:44:30,365 INFO L470 AbstractCegarLoop]: Abstraction has 379 states and 483 transitions. [2021-12-14 13:44:30,365 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.0) internal successors, (65), 13 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:44:30,365 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 483 transitions. [2021-12-14 13:44:30,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-12-14 13:44:30,367 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:44:30,367 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:44:30,385 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-12-14 13:44:30,583 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 13:44:30,583 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:44:30,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:44:30,583 INFO L85 PathProgramCache]: Analyzing trace with hash -190827821, now seen corresponding path program 1 times [2021-12-14 13:44:30,583 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:44:30,583 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517453051] [2021-12-14 13:44:30,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:44:30,584 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:44:30,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:44:30,685 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 13:44:30,685 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:44:30,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517453051] [2021-12-14 13:44:30,685 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517453051] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 13:44:30,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2053368551] [2021-12-14 13:44:30,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:44:30,686 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 13:44:30,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 13:44:30,687 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 13:44:30,693 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-12-14 13:44:30,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:44:30,795 INFO L263 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 84 conjunts are in the unsatisfiable core [2021-12-14 13:44:30,800 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 13:44:30,804 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-14 13:44:30,830 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:44:30,831 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 17 [2021-12-14 13:44:30,834 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:44:30,834 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 21 [2021-12-14 13:44:30,838 INFO L354 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2021-12-14 13:44:30,838 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2021-12-14 13:44:30,946 INFO L354 Elim1Store]: treesize reduction 30, result has 44.4 percent of original size [2021-12-14 13:44:30,946 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 34 [2021-12-14 13:44:30,963 INFO L354 Elim1Store]: treesize reduction 45, result has 16.7 percent of original size [2021-12-14 13:44:30,964 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 24 [2021-12-14 13:44:31,120 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 10 [2021-12-14 13:44:31,122 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 10 [2021-12-14 13:44:31,126 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-14 13:44:31,127 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 13:44:31,257 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-14 13:44:31,257 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2053368551] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 13:44:31,257 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 13:44:31,257 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 7] total 19 [2021-12-14 13:44:31,258 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329628169] [2021-12-14 13:44:31,258 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 13:44:31,258 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-12-14 13:44:31,258 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:44:31,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-12-14 13:44:31,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2021-12-14 13:44:31,259 INFO L87 Difference]: Start difference. First operand 379 states and 483 transitions. Second operand has 19 states, 19 states have (on average 3.9473684210526314) internal successors, (75), 19 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:44:32,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:44:32,442 INFO L93 Difference]: Finished difference Result 1831 states and 2411 transitions. [2021-12-14 13:44:32,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2021-12-14 13:44:32,442 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.9473684210526314) internal successors, (75), 19 states have internal predecessors, (75), 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 30 [2021-12-14 13:44:32,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:44:32,446 INFO L225 Difference]: With dead ends: 1831 [2021-12-14 13:44:32,446 INFO L226 Difference]: Without dead ends: 1453 [2021-12-14 13:44:32,447 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 760 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=560, Invalid=2302, Unknown=0, NotChecked=0, Total=2862 [2021-12-14 13:44:32,448 INFO L933 BasicCegarLoop]: 64 mSDtfsCounter, 339 mSDsluCounter, 636 mSDsCounter, 0 mSdLazyCounter, 395 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 339 SdHoareTripleChecker+Valid, 700 SdHoareTripleChecker+Invalid, 514 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 56 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-14 13:44:32,448 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [339 Valid, 700 Invalid, 514 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 395 Invalid, 0 Unknown, 56 Unchecked, 0.4s Time] [2021-12-14 13:44:32,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1453 states. [2021-12-14 13:44:32,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1453 to 930. [2021-12-14 13:44:32,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 930 states, 929 states have (on average 1.3218514531754575) internal successors, (1228), 929 states have internal predecessors, (1228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:44:32,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 930 states to 930 states and 1228 transitions. [2021-12-14 13:44:32,481 INFO L78 Accepts]: Start accepts. Automaton has 930 states and 1228 transitions. Word has length 30 [2021-12-14 13:44:32,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:44:32,481 INFO L470 AbstractCegarLoop]: Abstraction has 930 states and 1228 transitions. [2021-12-14 13:44:32,481 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.9473684210526314) internal successors, (75), 19 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:44:32,481 INFO L276 IsEmpty]: Start isEmpty. Operand 930 states and 1228 transitions. [2021-12-14 13:44:32,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-12-14 13:44:32,482 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:44:32,482 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:44:32,499 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-12-14 13:44:32,698 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 13:44:32,699 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:44:32,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:44:32,699 INFO L85 PathProgramCache]: Analyzing trace with hash -583854831, now seen corresponding path program 1 times [2021-12-14 13:44:32,699 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:44:32,699 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879856514] [2021-12-14 13:44:32,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:44:32,699 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:44:32,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:44:32,725 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-14 13:44:32,726 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:44:32,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879856514] [2021-12-14 13:44:32,726 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879856514] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 13:44:32,726 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 13:44:32,726 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 13:44:32,726 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087821228] [2021-12-14 13:44:32,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 13:44:32,727 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 13:44:32,727 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:44:32,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 13:44:32,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 13:44:32,727 INFO L87 Difference]: Start difference. First operand 930 states and 1228 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:44:32,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:44:32,770 INFO L93 Difference]: Finished difference Result 2373 states and 3107 transitions. [2021-12-14 13:44:32,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 13:44:32,771 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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 30 [2021-12-14 13:44:32,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:44:32,775 INFO L225 Difference]: With dead ends: 2373 [2021-12-14 13:44:32,775 INFO L226 Difference]: Without dead ends: 1476 [2021-12-14 13:44:32,776 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 13:44:32,778 INFO L933 BasicCegarLoop]: 50 mSDtfsCounter, 22 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 13:44:32,778 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 75 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 13:44:32,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1476 states. [2021-12-14 13:44:32,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1476 to 938. [2021-12-14 13:44:32,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 938 states, 937 states have (on average 1.310565635005336) internal successors, (1228), 937 states have internal predecessors, (1228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:44:32,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 938 states to 938 states and 1228 transitions. [2021-12-14 13:44:32,815 INFO L78 Accepts]: Start accepts. Automaton has 938 states and 1228 transitions. Word has length 30 [2021-12-14 13:44:32,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:44:32,815 INFO L470 AbstractCegarLoop]: Abstraction has 938 states and 1228 transitions. [2021-12-14 13:44:32,815 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:44:32,815 INFO L276 IsEmpty]: Start isEmpty. Operand 938 states and 1228 transitions. [2021-12-14 13:44:32,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-12-14 13:44:32,816 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:44:32,816 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:44:32,816 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-14 13:44:32,816 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:44:32,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:44:32,817 INFO L85 PathProgramCache]: Analyzing trace with hash 1070079280, now seen corresponding path program 1 times [2021-12-14 13:44:32,817 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:44:32,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305832893] [2021-12-14 13:44:32,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:44:32,817 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:44:32,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:44:32,968 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 13:44:32,969 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:44:32,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305832893] [2021-12-14 13:44:32,969 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305832893] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 13:44:32,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [615635961] [2021-12-14 13:44:32,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:44:32,969 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 13:44:32,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 13:44:32,971 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 13:44:33,004 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-12-14 13:44:33,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:44:33,088 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 71 conjunts are in the unsatisfiable core [2021-12-14 13:44:33,092 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 13:44:33,097 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-14 13:44:33,155 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:44:33,158 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:44:33,158 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2021-12-14 13:44:33,161 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:44:33,162 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:44:33,163 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2021-12-14 13:44:33,165 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2021-12-14 13:44:33,168 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 25 [2021-12-14 13:44:33,170 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2021-12-14 13:44:33,173 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2021-12-14 13:44:33,178 INFO L354 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2021-12-14 13:44:33,178 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2021-12-14 13:44:33,360 INFO L388 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 48 treesize of output 44 [2021-12-14 13:44:33,368 INFO L354 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2021-12-14 13:44:33,368 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 49 [2021-12-14 13:44:33,370 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 26 [2021-12-14 13:44:33,372 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2021-12-14 13:44:33,379 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-12-14 13:44:33,380 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-12-14 13:44:33,391 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-14 13:44:33,391 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 13:44:33,413 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1118 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_choose_next_~q#1.base| v_ArrVal_1118) |c_ULTIMATE.start_choose_next_~node~0#1.base|) (+ |c_ULTIMATE.start_choose_next_~node~0#1.offset| 8)) 0)) (forall ((v_ArrVal_1119 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_choose_next_~q#1.base| v_ArrVal_1119) |c_ULTIMATE.start_choose_next_~node~0#1.base|) (+ |c_ULTIMATE.start_choose_next_~node~0#1.offset| 8)) 0))) is different from false [2021-12-14 13:44:33,426 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1119 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#queue~0#1.base| v_ArrVal_1119) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|)) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|) 8)) 0)) (forall ((v_ArrVal_1118 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#queue~0#1.base| v_ArrVal_1118) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|)) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|) 8)) 0))) is different from false [2021-12-14 13:44:33,578 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 5 not checked. [2021-12-14 13:44:33,578 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [615635961] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 13:44:33,578 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 13:44:33,578 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 16 [2021-12-14 13:44:33,579 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174617575] [2021-12-14 13:44:33,579 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 13:44:33,579 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-12-14 13:44:33,579 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:44:33,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-12-14 13:44:33,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=150, Unknown=2, NotChecked=50, Total=240 [2021-12-14 13:44:33,579 INFO L87 Difference]: Start difference. First operand 938 states and 1228 transitions. Second operand has 16 states, 16 states have (on average 4.5625) internal successors, (73), 16 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:44:33,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:44:33,984 INFO L93 Difference]: Finished difference Result 1440 states and 1880 transitions. [2021-12-14 13:44:33,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-14 13:44:33,985 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.5625) internal successors, (73), 16 states have internal predecessors, (73), 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 33 [2021-12-14 13:44:33,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:44:33,987 INFO L225 Difference]: With dead ends: 1440 [2021-12-14 13:44:33,987 INFO L226 Difference]: Without dead ends: 1017 [2021-12-14 13:44:33,988 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 61 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=87, Invalid=339, Unknown=2, NotChecked=78, Total=506 [2021-12-14 13:44:33,989 INFO L933 BasicCegarLoop]: 41 mSDtfsCounter, 58 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 114 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 13:44:33,989 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [58 Valid, 241 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 91 Invalid, 0 Unknown, 114 Unchecked, 0.1s Time] [2021-12-14 13:44:33,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1017 states. [2021-12-14 13:44:34,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1017 to 941. [2021-12-14 13:44:34,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 941 states, 940 states have (on average 1.3095744680851065) internal successors, (1231), 940 states have internal predecessors, (1231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:44:34,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 941 states to 941 states and 1231 transitions. [2021-12-14 13:44:34,019 INFO L78 Accepts]: Start accepts. Automaton has 941 states and 1231 transitions. Word has length 33 [2021-12-14 13:44:34,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:44:34,019 INFO L470 AbstractCegarLoop]: Abstraction has 941 states and 1231 transitions. [2021-12-14 13:44:34,019 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.5625) internal successors, (73), 16 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:44:34,019 INFO L276 IsEmpty]: Start isEmpty. Operand 941 states and 1231 transitions. [2021-12-14 13:44:34,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-12-14 13:44:34,020 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:44:34,020 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:44:34,039 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-12-14 13:44:34,223 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2021-12-14 13:44:34,223 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:44:34,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:44:34,224 INFO L85 PathProgramCache]: Analyzing trace with hash -1610537933, now seen corresponding path program 1 times [2021-12-14 13:44:34,224 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:44:34,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706104742] [2021-12-14 13:44:34,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:44:34,224 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:44:34,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:44:34,260 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-12-14 13:44:34,261 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:44:34,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706104742] [2021-12-14 13:44:34,261 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706104742] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 13:44:34,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [292703761] [2021-12-14 13:44:34,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:44:34,261 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 13:44:34,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 13:44:34,262 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 13:44:34,264 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-12-14 13:44:34,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:44:34,375 INFO L263 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 37 conjunts are in the unsatisfiable core [2021-12-14 13:44:34,376 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 13:44:34,435 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-14 13:44:34,437 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-14 13:44:34,442 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-12-14 13:44:34,442 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 13:44:34,519 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-12-14 13:44:34,520 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [292703761] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 13:44:34,520 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 13:44:34,520 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2021-12-14 13:44:34,520 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960432970] [2021-12-14 13:44:34,520 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 13:44:34,521 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 13:44:34,521 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:44:34,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 13:44:34,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-14 13:44:34,521 INFO L87 Difference]: Start difference. First operand 941 states and 1231 transitions. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:44:34,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:44:34,614 INFO L93 Difference]: Finished difference Result 1610 states and 2096 transitions. [2021-12-14 13:44:34,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 13:44:34,614 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 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 38 [2021-12-14 13:44:34,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:44:34,617 INFO L225 Difference]: With dead ends: 1610 [2021-12-14 13:44:34,617 INFO L226 Difference]: Without dead ends: 1158 [2021-12-14 13:44:34,617 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-12-14 13:44:34,618 INFO L933 BasicCegarLoop]: 41 mSDtfsCounter, 64 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 13:44:34,618 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [64 Valid, 99 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 13:44:34,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1158 states. [2021-12-14 13:44:34,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1158 to 857. [2021-12-14 13:44:34,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 857 states, 856 states have (on average 1.3212616822429906) internal successors, (1131), 856 states have internal predecessors, (1131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:44:34,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 857 states to 857 states and 1131 transitions. [2021-12-14 13:44:34,649 INFO L78 Accepts]: Start accepts. Automaton has 857 states and 1131 transitions. Word has length 38 [2021-12-14 13:44:34,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:44:34,649 INFO L470 AbstractCegarLoop]: Abstraction has 857 states and 1131 transitions. [2021-12-14 13:44:34,650 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:44:34,650 INFO L276 IsEmpty]: Start isEmpty. Operand 857 states and 1131 transitions. [2021-12-14 13:44:34,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-12-14 13:44:34,650 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:44:34,650 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1] [2021-12-14 13:44:34,666 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-12-14 13:44:34,864 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-12-14 13:44:34,864 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:44:34,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:44:34,864 INFO L85 PathProgramCache]: Analyzing trace with hash 325417618, now seen corresponding path program 4 times [2021-12-14 13:44:34,864 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:44:34,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861735729] [2021-12-14 13:44:34,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:44:34,865 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:44:34,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:44:34,937 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 39 proven. 9 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-14 13:44:34,938 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:44:34,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861735729] [2021-12-14 13:44:34,938 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861735729] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 13:44:34,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1471085464] [2021-12-14 13:44:34,938 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-14 13:44:34,938 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 13:44:34,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 13:44:34,939 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 13:44:34,955 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-12-14 13:44:35,074 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-14 13:44:35,075 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-14 13:44:35,077 INFO L263 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 73 conjunts are in the unsatisfiable core [2021-12-14 13:44:35,079 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 13:44:35,124 INFO L354 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2021-12-14 13:44:35,124 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 51 [2021-12-14 13:44:35,127 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2021-12-14 13:44:35,139 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-12-14 13:44:35,155 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-14 13:44:35,194 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-12-14 13:44:35,194 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 34 [2021-12-14 13:44:35,197 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2021-12-14 13:44:35,267 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:44:35,269 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:44:35,270 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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 14 [2021-12-14 13:44:35,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:44:35,273 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:44:35,273 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 27 [2021-12-14 13:44:35,276 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2021-12-14 13:44:35,282 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2021-12-14 13:44:35,284 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2021-12-14 13:44:35,308 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2021-12-14 13:44:35,338 INFO L354 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2021-12-14 13:44:35,338 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 16 [2021-12-14 13:44:35,354 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 39 proven. 9 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-14 13:44:35,354 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 13:44:35,412 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1408 Int) (v_ArrVal_1405 (Array Int Int)) (|v_ULTIMATE.start_append_to_queue_~n#1.offset_14| Int)) (or (not (= (let ((.cse1 (+ |v_ULTIMATE.start_append_to_queue_~n#1.offset_14| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| v_ArrVal_1408 (store v_ArrVal_1405 .cse1 (select (select (store |c_#memory_$Pointer$.base| v_ArrVal_1408 v_ArrVal_1405) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|))))) (store .cse0 |c_ULTIMATE.start_main_~#queue~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset| v_ArrVal_1408))) v_ArrVal_1408) .cse1)) 0)) (<= |c_#StackHeapBarrier| v_ArrVal_1408))) is different from false [2021-12-14 13:44:35,510 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 148 treesize of output 146 [2021-12-14 13:44:35,512 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 161 treesize of output 157 [2021-12-14 13:44:35,515 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 172 treesize of output 168 [2021-12-14 13:44:35,518 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 180 treesize of output 174 [2021-12-14 13:44:35,545 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 35 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 12 not checked. [2021-12-14 13:44:35,545 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1471085464] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 13:44:35,545 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 13:44:35,545 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2021-12-14 13:44:35,546 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340632422] [2021-12-14 13:44:35,546 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 13:44:35,546 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-12-14 13:44:35,546 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:44:35,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-12-14 13:44:35,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=145, Unknown=1, NotChecked=24, Total=210 [2021-12-14 13:44:35,546 INFO L87 Difference]: Start difference. First operand 857 states and 1131 transitions. Second operand has 15 states, 15 states have (on average 5.133333333333334) internal successors, (77), 15 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:44:35,568 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~#queue~0#1.offset| 0) (not (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|) 0)) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#queue~0#1.base|) (forall ((v_ArrVal_1408 Int) (v_ArrVal_1405 (Array Int Int)) (|v_ULTIMATE.start_append_to_queue_~n#1.offset_14| Int)) (or (not (= (let ((.cse1 (+ |v_ULTIMATE.start_append_to_queue_~n#1.offset_14| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| v_ArrVal_1408 (store v_ArrVal_1405 .cse1 (select (select (store |c_#memory_$Pointer$.base| v_ArrVal_1408 v_ArrVal_1405) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|))))) (store .cse0 |c_ULTIMATE.start_main_~#queue~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset| v_ArrVal_1408))) v_ArrVal_1408) .cse1)) 0)) (<= |c_#StackHeapBarrier| v_ArrVal_1408)))) is different from false [2021-12-14 13:44:35,577 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|)) (.cse2 (select |c_#memory_$Pointer$.base| .cse1))) (and (= .cse0 0) (= |c_ULTIMATE.start_main_~#queue~0#1.offset| 0) (not (= .cse1 0)) (not (= (select .cse2 (+ .cse0 8)) 0)) (not (= (select .cse2 8) 0)) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#queue~0#1.base|) (forall ((v_ArrVal_1408 Int) (v_ArrVal_1405 (Array Int Int)) (|v_ULTIMATE.start_append_to_queue_~n#1.offset_14| Int)) (or (not (= (let ((.cse4 (+ |v_ULTIMATE.start_append_to_queue_~n#1.offset_14| 8))) (select (select (let ((.cse3 (store |c_#memory_$Pointer$.base| v_ArrVal_1408 (store v_ArrVal_1405 .cse4 (select (select (store |c_#memory_$Pointer$.base| v_ArrVal_1408 v_ArrVal_1405) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|))))) (store .cse3 |c_ULTIMATE.start_main_~#queue~0#1.base| (store (select .cse3 |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset| v_ArrVal_1408))) v_ArrVal_1408) .cse4)) 0)) (<= |c_#StackHeapBarrier| v_ArrVal_1408))) (< (+ .cse1 1) |c_ULTIMATE.start_main_~#queue~0#1.base|)))) is different from false [2021-12-14 13:44:35,583 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((|ULTIMATE.start_main_~#queue~0#1.base| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#queue~0#1.base|) 0))) (and (not (= (select (select |c_#memory_$Pointer$.base| .cse0) (+ |c_ULTIMATE.start_check_queue_~n~0#1.offset| 8)) 0)) (< (+ .cse0 1) |ULTIMATE.start_main_~#queue~0#1.base|) (= .cse0 |c_ULTIMATE.start_check_queue_~n~0#1.base|)))) (= |c_ULTIMATE.start_check_queue_~n~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#queue~0#1.offset| 0) (not (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|) 0)) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#queue~0#1.base|) (forall ((v_ArrVal_1408 Int) (v_ArrVal_1405 (Array Int Int)) (|v_ULTIMATE.start_append_to_queue_~n#1.offset_14| Int)) (or (not (= (let ((.cse2 (+ |v_ULTIMATE.start_append_to_queue_~n#1.offset_14| 8))) (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| v_ArrVal_1408 (store v_ArrVal_1405 .cse2 (select (select (store |c_#memory_$Pointer$.base| v_ArrVal_1408 v_ArrVal_1405) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|))))) (store .cse1 |c_ULTIMATE.start_main_~#queue~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset| v_ArrVal_1408))) v_ArrVal_1408) .cse2)) 0)) (<= |c_#StackHeapBarrier| v_ArrVal_1408))) (not (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_check_queue_~n~0#1.base|) (+ |c_ULTIMATE.start_check_queue_~n~0#1.offset| 8)) 0))) is different from false [2021-12-14 13:44:35,589 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~#queue~0#1.offset| 0) (not (= |c_ULTIMATE.start_check_queue_~n~0#1.base| 0)) (not (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|) 0)) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#queue~0#1.base|) (forall ((v_ArrVal_1408 Int) (v_ArrVal_1405 (Array Int Int)) (|v_ULTIMATE.start_append_to_queue_~n#1.offset_14| Int)) (or (not (= (let ((.cse1 (+ |v_ULTIMATE.start_append_to_queue_~n#1.offset_14| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| v_ArrVal_1408 (store v_ArrVal_1405 .cse1 (select (select (store |c_#memory_$Pointer$.base| v_ArrVal_1408 v_ArrVal_1405) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|))))) (store .cse0 |c_ULTIMATE.start_main_~#queue~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset| v_ArrVal_1408))) v_ArrVal_1408) .cse1)) 0)) (<= |c_#StackHeapBarrier| v_ArrVal_1408)))) is different from false [2021-12-14 13:44:35,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:44:35,638 INFO L93 Difference]: Finished difference Result 1713 states and 2268 transitions. [2021-12-14 13:44:35,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 13:44:35,638 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.133333333333334) internal successors, (77), 15 states have internal predecessors, (77), 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 39 [2021-12-14 13:44:35,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:44:35,640 INFO L225 Difference]: With dead ends: 1713 [2021-12-14 13:44:35,640 INFO L226 Difference]: Without dead ends: 892 [2021-12-14 13:44:35,641 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=149, Unknown=5, NotChecked=140, Total=342 [2021-12-14 13:44:35,641 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 12 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 56 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 13:44:35,642 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 188 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 56 Unchecked, 0.0s Time] [2021-12-14 13:44:35,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 892 states. [2021-12-14 13:44:35,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 892 to 892. [2021-12-14 13:44:35,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 892 states, 891 states have (on average 1.3164983164983164) internal successors, (1173), 891 states have internal predecessors, (1173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:44:35,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 892 states to 892 states and 1173 transitions. [2021-12-14 13:44:35,672 INFO L78 Accepts]: Start accepts. Automaton has 892 states and 1173 transitions. Word has length 39 [2021-12-14 13:44:35,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:44:35,673 INFO L470 AbstractCegarLoop]: Abstraction has 892 states and 1173 transitions. [2021-12-14 13:44:35,673 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.133333333333334) internal successors, (77), 15 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:44:35,673 INFO L276 IsEmpty]: Start isEmpty. Operand 892 states and 1173 transitions. [2021-12-14 13:44:35,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-12-14 13:44:35,673 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:44:35,673 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 13:44:35,703 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2021-12-14 13:44:35,903 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2021-12-14 13:44:35,904 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:44:35,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:44:35,904 INFO L85 PathProgramCache]: Analyzing trace with hash -1871575436, now seen corresponding path program 2 times [2021-12-14 13:44:35,904 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:44:35,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038621702] [2021-12-14 13:44:35,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:44:35,904 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:44:35,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:44:35,990 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 13 proven. 12 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-12-14 13:44:35,991 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:44:35,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038621702] [2021-12-14 13:44:35,991 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038621702] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 13:44:35,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1310003976] [2021-12-14 13:44:35,991 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-14 13:44:35,991 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 13:44:35,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 13:44:35,995 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) [2021-12-14 13:44:35,996 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-12-14 13:44:36,150 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-14 13:44:36,150 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-14 13:44:36,153 INFO L263 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 83 conjunts are in the unsatisfiable core [2021-12-14 13:44:36,156 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 13:44:36,322 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:44:36,323 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:44:36,324 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 24 [2021-12-14 13:44:36,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:44:36,328 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:44:36,329 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 24 [2021-12-14 13:44:36,331 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2021-12-14 13:44:36,334 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2021-12-14 13:44:36,337 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-12-14 13:44:36,340 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-12-14 13:44:36,419 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 13:44:36,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:44:36,421 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 13:44:36,422 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 66 treesize of output 38 [2021-12-14 13:44:36,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:44:36,427 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-14 13:44:36,427 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 18 [2021-12-14 13:44:36,433 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 13 proven. 12 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-12-14 13:44:36,433 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 13:44:38,499 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1570 Int)) (or (<= |c_#StackHeapBarrier| v_ArrVal_1570) (and (forall ((v_ArrVal_1568 (Array Int Int)) (v_ArrVal_1564 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| v_ArrVal_1570 (store v_ArrVal_1568 8 (select (select (store |c_#memory_$Pointer$.offset| v_ArrVal_1570 v_ArrVal_1568) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|))) |c_ULTIMATE.start_main_~#queue~0#1.base| (store (select (store |c_#memory_$Pointer$.offset| v_ArrVal_1570 v_ArrVal_1564) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset| 0)) v_ArrVal_1570) 8) 0)) (forall ((v_ArrVal_1558 (Array Int Int)) (v_ArrVal_1561 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| v_ArrVal_1570 (store v_ArrVal_1561 8 (select (select (store |c_#memory_$Pointer$.base| v_ArrVal_1570 v_ArrVal_1561) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|))) |c_ULTIMATE.start_main_~#queue~0#1.base| (store (select (store |c_#memory_$Pointer$.base| v_ArrVal_1570 v_ArrVal_1558) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset| v_ArrVal_1570)) v_ArrVal_1570) 8) 0))))) is different from false [2021-12-14 13:44:40,632 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 95 [2021-12-14 13:44:40,639 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 13:44:40,639 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 101 treesize of output 103 [2021-12-14 13:44:40,645 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 135 treesize of output 129 [2021-12-14 13:44:40,652 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 13:44:40,652 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 139 treesize of output 141 [2021-12-14 13:44:40,657 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 34 [2021-12-14 13:44:40,660 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 37 [2021-12-14 13:44:40,807 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 7 trivial. 9 not checked. [2021-12-14 13:44:40,808 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1310003976] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 13:44:40,808 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 13:44:40,808 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2021-12-14 13:44:40,808 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105581147] [2021-12-14 13:44:40,808 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 13:44:40,808 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-12-14 13:44:40,808 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 13:44:40,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-12-14 13:44:40,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=189, Unknown=1, NotChecked=28, Total=272 [2021-12-14 13:44:40,809 INFO L87 Difference]: Start difference. First operand 892 states and 1173 transitions. Second operand has 17 states, 17 states have (on average 6.0588235294117645) internal successors, (103), 17 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:44:42,915 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|))) (and (= .cse0 0) (= |c_ULTIMATE.start_check_queue_~n~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#queue~0#1.offset| 0) (= |c_ULTIMATE.start_check_queue_~n~0#1.base| 0) (forall ((v_ArrVal_1570 Int)) (or (<= |c_#StackHeapBarrier| v_ArrVal_1570) (and (forall ((v_ArrVal_1568 (Array Int Int)) (v_ArrVal_1564 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| v_ArrVal_1570 (store v_ArrVal_1568 8 (select (select (store |c_#memory_$Pointer$.offset| v_ArrVal_1570 v_ArrVal_1568) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|))) |c_ULTIMATE.start_main_~#queue~0#1.base| (store (select (store |c_#memory_$Pointer$.offset| v_ArrVal_1570 v_ArrVal_1564) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset| 0)) v_ArrVal_1570) 8) 0)) (forall ((v_ArrVal_1558 (Array Int Int)) (v_ArrVal_1561 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| v_ArrVal_1570 (store v_ArrVal_1561 8 (select (select (store |c_#memory_$Pointer$.base| v_ArrVal_1570 v_ArrVal_1561) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|))) |c_ULTIMATE.start_main_~#queue~0#1.base| (store (select (store |c_#memory_$Pointer$.base| v_ArrVal_1570 v_ArrVal_1558) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset| v_ArrVal_1570)) v_ArrVal_1570) 8) 0))))) (= |c_ULTIMATE.start_check_queue_~n~0#1.offset| .cse0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#queue~0#1.base|) (= .cse1 0) (= .cse1 |c_ULTIMATE.start_check_queue_~n~0#1.base|))) is different from false [2021-12-14 13:44:44,917 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~#queue~0#1.offset| 0) (forall ((v_ArrVal_1570 Int)) (or (<= |c_#StackHeapBarrier| v_ArrVal_1570) (and (forall ((v_ArrVal_1568 (Array Int Int)) (v_ArrVal_1564 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| v_ArrVal_1570 (store v_ArrVal_1568 8 (select (select (store |c_#memory_$Pointer$.offset| v_ArrVal_1570 v_ArrVal_1568) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|))) |c_ULTIMATE.start_main_~#queue~0#1.base| (store (select (store |c_#memory_$Pointer$.offset| v_ArrVal_1570 v_ArrVal_1564) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset| 0)) v_ArrVal_1570) 8) 0)) (forall ((v_ArrVal_1558 (Array Int Int)) (v_ArrVal_1561 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| v_ArrVal_1570 (store v_ArrVal_1561 8 (select (select (store |c_#memory_$Pointer$.base| v_ArrVal_1570 v_ArrVal_1561) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|))) |c_ULTIMATE.start_main_~#queue~0#1.base| (store (select (store |c_#memory_$Pointer$.base| v_ArrVal_1570 v_ArrVal_1558) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset| v_ArrVal_1570)) v_ArrVal_1570) 8) 0))))) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#queue~0#1.base|) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|) 0)) is different from false [2021-12-14 13:44:45,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 13:44:45,038 INFO L93 Difference]: Finished difference Result 2835 states and 3745 transitions. [2021-12-14 13:44:45,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-14 13:44:45,038 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 6.0588235294117645) internal successors, (103), 17 states have internal predecessors, (103), 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 41 [2021-12-14 13:44:45,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 13:44:45,043 INFO L225 Difference]: With dead ends: 2835 [2021-12-14 13:44:45,043 INFO L226 Difference]: Without dead ends: 2014 [2021-12-14 13:44:45,044 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=106, Invalid=323, Unknown=3, NotChecked=120, Total=552 [2021-12-14 13:44:45,045 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 72 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 86 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 13:44:45,045 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [72 Valid, 296 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 87 Invalid, 0 Unknown, 86 Unchecked, 0.1s Time] [2021-12-14 13:44:45,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2014 states. [2021-12-14 13:44:45,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2014 to 1755. [2021-12-14 13:44:45,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1755 states, 1754 states have (on average 1.314709236031927) internal successors, (2306), 1754 states have internal predecessors, (2306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:44:45,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1755 states to 1755 states and 2306 transitions. [2021-12-14 13:44:45,120 INFO L78 Accepts]: Start accepts. Automaton has 1755 states and 2306 transitions. Word has length 41 [2021-12-14 13:44:45,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 13:44:45,121 INFO L470 AbstractCegarLoop]: Abstraction has 1755 states and 2306 transitions. [2021-12-14 13:44:45,121 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 6.0588235294117645) internal successors, (103), 17 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 13:44:45,121 INFO L276 IsEmpty]: Start isEmpty. Operand 1755 states and 2306 transitions. [2021-12-14 13:44:45,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-12-14 13:44:45,121 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 13:44:45,121 INFO L514 BasicCegarLoop]: trace histogram [6, 5, 5, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1] [2021-12-14 13:44:45,140 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2021-12-14 13:44:45,335 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-12-14 13:44:45,335 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 13:44:45,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 13:44:45,336 INFO L85 PathProgramCache]: Analyzing trace with hash -2115090350, now seen corresponding path program 5 times [2021-12-14 13:44:45,336 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 13:44:45,336 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422242092] [2021-12-14 13:44:45,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 13:44:45,336 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 13:44:45,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 13:44:45,801 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 13:44:45,802 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 13:44:45,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422242092] [2021-12-14 13:44:45,802 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422242092] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 13:44:45,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1337789462] [2021-12-14 13:44:45,802 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-12-14 13:44:45,802 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 13:44:45,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 13:44:45,803 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) [2021-12-14 13:44:45,804 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-12-14 13:44:46,035 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2021-12-14 13:44:46,035 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-14 13:44:46,040 INFO L263 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 168 conjunts are in the unsatisfiable core [2021-12-14 13:44:46,044 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 13:44:46,082 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:44:46,084 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:44:46,085 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2021-12-14 13:44:46,087 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:44:46,090 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:44:46,090 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2021-12-14 13:44:46,093 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2021-12-14 13:44:46,096 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2021-12-14 13:44:46,098 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2021-12-14 13:44:46,228 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:44:46,230 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:44:46,231 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 24 [2021-12-14 13:44:46,233 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:44:46,235 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:44:46,236 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 31 [2021-12-14 13:44:46,239 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2021-12-14 13:44:46,242 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2021-12-14 13:44:46,247 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-12-14 13:44:46,257 INFO L354 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2021-12-14 13:44:46,257 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 18 [2021-12-14 13:44:46,261 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-12-14 13:44:46,747 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:44:46,750 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:44:46,763 INFO L354 Elim1Store]: treesize reduction 47, result has 9.6 percent of original size [2021-12-14 13:44:46,763 INFO L388 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 2 case distinctions, treesize of input 114 treesize of output 95 [2021-12-14 13:44:46,768 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 80 [2021-12-14 13:44:46,776 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:44:46,777 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:44:46,778 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:44:46,779 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 47 [2021-12-14 13:44:46,782 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:44:46,785 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:44:46,785 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:44:46,786 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:44:46,787 INFO L388 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 0 case distinctions, treesize of input 69 treesize of output 61 [2021-12-14 13:44:46,792 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 44 [2021-12-14 13:44:46,796 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-12-14 13:44:46,801 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-12-14 13:44:46,812 INFO L354 Elim1Store]: treesize reduction 53, result has 27.4 percent of original size [2021-12-14 13:44:46,812 INFO L388 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 40 treesize of output 30 [2021-12-14 13:44:47,136 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 13:44:47,151 INFO L354 Elim1Store]: treesize reduction 63, result has 14.9 percent of original size [2021-12-14 13:44:47,151 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 9 new quantified variables, introduced 10 case distinctions, treesize of input 193 treesize of output 103 [2021-12-14 13:44:47,155 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:44:47,156 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 13:44:47,165 INFO L354 Elim1Store]: treesize reduction 10, result has 41.2 percent of original size [2021-12-14 13:44:47,166 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 2 case distinctions, treesize of input 54 treesize of output 38 [2021-12-14 13:44:47,191 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-14 13:44:47,210 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 25 proven. 46 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-14 13:44:47,210 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 13:44:47,349 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1802 (Array Int Int)) (v_ArrVal_1801 (Array Int Int)) (v_ArrVal_1800 (Array Int Int)) (v_ArrVal_1805 Int) (v_ArrVal_1798 (Array Int Int)) (v_ArrVal_1808 (Array Int Int))) (or (<= |c_#StackHeapBarrier| v_ArrVal_1805) (not (= (select |c_#valid| v_ArrVal_1805) 0)) (<= 1 (let ((.cse3 (let ((.cse4 (store |c_#memory_$Pointer$.offset| v_ArrVal_1805 (store v_ArrVal_1798 8 (select (select (store |c_#memory_$Pointer$.offset| v_ArrVal_1805 v_ArrVal_1798) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|))))) (store .cse4 |c_ULTIMATE.start_main_~#queue~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset| 0)))) (.cse0 (store (store |c_#memory_$Pointer$.base| v_ArrVal_1805 (store v_ArrVal_1800 8 (select (select (store |c_#memory_$Pointer$.base| v_ArrVal_1805 v_ArrVal_1800) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|))) |c_ULTIMATE.start_main_~#queue~0#1.base| (store (select (store |c_#memory_$Pointer$.base| v_ArrVal_1805 v_ArrVal_1802) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset| v_ArrVal_1805)))) (let ((.cse1 (select (select .cse0 v_ArrVal_1805) 8)) (.cse2 (+ (select (select .cse3 v_ArrVal_1805) 8) 8))) (select (select (store (store |c_#memory_int| v_ArrVal_1805 v_ArrVal_1801) |c_ULTIMATE.start_main_~#queue~0#1.base| v_ArrVal_1808) (select (select .cse0 .cse1) .cse2)) (+ (select (select .cse3 .cse1) .cse2) 4))))))) is different from false [2021-12-14 13:44:47,593 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 13:44:47,593 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1165 treesize of output 1168 [2021-12-14 13:44:47,601 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 528 treesize of output 418 [2021-12-14 13:44:47,608 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 838 treesize of output 618