./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-ext/tree_of_cslls.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) 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/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety-ext/tree_of_cslls.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e174a1790a7df4dcba920aa7097618d66c8703aa13de1aa6af1a2c5f7cb0971c --- Real Ultimate output --- This is Ultimate 0.2.2-839c364b5d67a0f615c82cb70ab247790648d4a9-839c364 [2021-12-14 19:38:16,313 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-14 19:38:16,315 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-14 19:38:16,377 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-14 19:38:16,377 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-14 19:38:16,378 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-14 19:38:16,378 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-14 19:38:16,379 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-14 19:38:16,380 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-14 19:38:16,381 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-14 19:38:16,381 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-14 19:38:16,382 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-14 19:38:16,382 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-14 19:38:16,383 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-14 19:38:16,384 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-14 19:38:16,385 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-14 19:38:16,388 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-14 19:38:16,388 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-14 19:38:16,389 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-14 19:38:16,391 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-14 19:38:16,392 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-14 19:38:16,392 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-14 19:38:16,393 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-14 19:38:16,394 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-14 19:38:16,395 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-14 19:38:16,396 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-14 19:38:16,396 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-14 19:38:16,397 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-14 19:38:16,397 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-14 19:38:16,398 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-14 19:38:16,398 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-14 19:38:16,398 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-14 19:38:16,399 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-14 19:38:16,399 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-14 19:38:16,400 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-14 19:38:16,400 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-14 19:38:16,401 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-14 19:38:16,401 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-14 19:38:16,401 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-14 19:38:16,402 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-14 19:38:16,402 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-14 19:38:16,403 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2021-12-14 19:38:16,419 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-14 19:38:16,419 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-14 19:38:16,419 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-14 19:38:16,419 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-14 19:38:16,420 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-14 19:38:16,420 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-14 19:38:16,421 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-14 19:38:16,421 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-14 19:38:16,421 INFO L138 SettingsManager]: * Use SBE=true [2021-12-14 19:38:16,421 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-14 19:38:16,421 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-14 19:38:16,421 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-14 19:38:16,421 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-14 19:38:16,422 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-14 19:38:16,422 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-14 19:38:16,422 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-14 19:38:16,422 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-14 19:38:16,422 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-12-14 19:38:16,422 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-14 19:38:16,422 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-14 19:38:16,423 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-14 19:38:16,423 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-14 19:38:16,423 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-14 19:38:16,423 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-14 19:38:16,423 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-14 19:38:16,423 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 19:38:16,423 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-14 19:38:16,424 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-14 19:38:16,424 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-14 19:38:16,424 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-14 19:38:16,424 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-14 19:38:16,424 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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> e174a1790a7df4dcba920aa7097618d66c8703aa13de1aa6af1a2c5f7cb0971c [2021-12-14 19:38:16,578 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-14 19:38:16,595 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-14 19:38:16,597 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-14 19:38:16,598 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-14 19:38:16,599 INFO L275 PluginConnector]: CDTParser initialized [2021-12-14 19:38:16,600 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext/tree_of_cslls.i [2021-12-14 19:38:16,650 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c4d62c028/7162c92cf29d419e8f0b8450e9d26a20/FLAG4d3035b87 [2021-12-14 19:38:17,086 INFO L306 CDTParser]: Found 1 translation units. [2021-12-14 19:38:17,086 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext/tree_of_cslls.i [2021-12-14 19:38:17,095 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c4d62c028/7162c92cf29d419e8f0b8450e9d26a20/FLAG4d3035b87 [2021-12-14 19:38:17,106 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c4d62c028/7162c92cf29d419e8f0b8450e9d26a20 [2021-12-14 19:38:17,111 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-14 19:38:17,112 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-14 19:38:17,113 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-14 19:38:17,113 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-14 19:38:17,116 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-14 19:38:17,117 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 07:38:17" (1/1) ... [2021-12-14 19:38:17,118 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@580b0c18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:38:17, skipping insertion in model container [2021-12-14 19:38:17,118 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 07:38:17" (1/1) ... [2021-12-14 19:38:17,122 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-14 19:38:17,148 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-14 19:38:17,425 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 19:38:17,432 INFO L203 MainTranslator]: Completed pre-run [2021-12-14 19:38:17,472 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 19:38:17,494 INFO L208 MainTranslator]: Completed translation [2021-12-14 19:38:17,495 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:38:17 WrapperNode [2021-12-14 19:38:17,495 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-14 19:38:17,496 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-14 19:38:17,496 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-14 19:38:17,497 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-14 19:38:17,502 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:38:17" (1/1) ... [2021-12-14 19:38:17,529 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:38:17" (1/1) ... [2021-12-14 19:38:17,557 INFO L137 Inliner]: procedures = 123, calls = 63, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 216 [2021-12-14 19:38:17,558 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-14 19:38:17,559 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-14 19:38:17,559 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-14 19:38:17,559 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-14 19:38:17,565 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:38:17" (1/1) ... [2021-12-14 19:38:17,565 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:38:17" (1/1) ... [2021-12-14 19:38:17,576 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:38:17" (1/1) ... [2021-12-14 19:38:17,576 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:38:17" (1/1) ... [2021-12-14 19:38:17,590 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:38:17" (1/1) ... [2021-12-14 19:38:17,600 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:38:17" (1/1) ... [2021-12-14 19:38:17,602 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:38:17" (1/1) ... [2021-12-14 19:38:17,607 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-14 19:38:17,609 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-14 19:38:17,610 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-14 19:38:17,610 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-14 19:38:17,611 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:38:17" (1/1) ... [2021-12-14 19:38:17,618 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 19:38:17,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:38:17,641 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 19:38:17,647 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 19:38:17,673 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-14 19:38:17,673 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-14 19:38:17,674 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-14 19:38:17,674 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-14 19:38:17,674 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-14 19:38:17,674 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-14 19:38:17,674 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-14 19:38:17,675 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-14 19:38:17,775 INFO L236 CfgBuilder]: Building ICFG [2021-12-14 19:38:17,776 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-14 19:38:18,153 INFO L277 CfgBuilder]: Performing block encoding [2021-12-14 19:38:18,158 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-14 19:38:18,158 INFO L301 CfgBuilder]: Removed 7 assume(true) statements. [2021-12-14 19:38:18,160 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 07:38:18 BoogieIcfgContainer [2021-12-14 19:38:18,160 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-14 19:38:18,161 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-14 19:38:18,161 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-14 19:38:18,164 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-14 19:38:18,164 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 07:38:17" (1/3) ... [2021-12-14 19:38:18,164 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@508188e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 07:38:18, skipping insertion in model container [2021-12-14 19:38:18,165 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:38:17" (2/3) ... [2021-12-14 19:38:18,165 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@508188e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 07:38:18, skipping insertion in model container [2021-12-14 19:38:18,165 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 07:38:18" (3/3) ... [2021-12-14 19:38:18,166 INFO L111 eAbstractionObserver]: Analyzing ICFG tree_of_cslls.i [2021-12-14 19:38:18,170 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-14 19:38:18,170 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 104 error locations. [2021-12-14 19:38:18,197 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-14 19:38:18,202 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=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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 19:38:18,202 INFO L340 AbstractCegarLoop]: Starting to check reachability of 104 error locations. [2021-12-14 19:38:18,213 INFO L276 IsEmpty]: Start isEmpty. Operand has 210 states, 105 states have (on average 2.219047619047619) internal successors, (233), 209 states have internal predecessors, (233), 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 19:38:18,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-12-14 19:38:18,217 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:38:18,218 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-12-14 19:38:18,218 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-14 19:38:18,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:38:18,222 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2021-12-14 19:38:18,227 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:38:18,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527741716] [2021-12-14 19:38:18,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:38:18,228 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:38:18,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:38:18,350 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 19:38:18,351 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:38:18,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527741716] [2021-12-14 19:38:18,351 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527741716] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:38:18,352 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:38:18,352 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-14 19:38:18,354 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707236497] [2021-12-14 19:38:18,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:38:18,357 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 19:38:18,358 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:38:18,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 19:38:18,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:38:18,381 INFO L87 Difference]: Start difference. First operand has 210 states, 105 states have (on average 2.219047619047619) internal successors, (233), 209 states have internal predecessors, (233), 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, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 19:38:18,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:38:18,614 INFO L93 Difference]: Finished difference Result 282 states and 304 transitions. [2021-12-14 19:38:18,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 19:38:18,617 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 3 [2021-12-14 19:38:18,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:38:18,630 INFO L225 Difference]: With dead ends: 282 [2021-12-14 19:38:18,630 INFO L226 Difference]: Without dead ends: 278 [2021-12-14 19:38:18,632 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:38:18,635 INFO L933 BasicCegarLoop]: 151 mSDtfsCounter, 200 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 19:38:18,636 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [200 Valid, 199 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 19:38:18,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2021-12-14 19:38:18,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 199. [2021-12-14 19:38:18,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 104 states have (on average 2.0673076923076925) internal successors, (215), 198 states have internal predecessors, (215), 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 19:38:18,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 215 transitions. [2021-12-14 19:38:18,679 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 215 transitions. Word has length 3 [2021-12-14 19:38:18,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:38:18,679 INFO L470 AbstractCegarLoop]: Abstraction has 199 states and 215 transitions. [2021-12-14 19:38:18,679 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 19:38:18,680 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 215 transitions. [2021-12-14 19:38:18,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-12-14 19:38:18,680 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:38:18,680 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-12-14 19:38:18,680 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-14 19:38:18,680 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-14 19:38:18,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:38:18,683 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2021-12-14 19:38:18,683 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:38:18,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976883850] [2021-12-14 19:38:18,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:38:18,684 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:38:18,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:38:18,726 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 19:38:18,727 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:38:18,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976883850] [2021-12-14 19:38:18,727 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976883850] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:38:18,727 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:38:18,727 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-14 19:38:18,728 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386109856] [2021-12-14 19:38:18,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:38:18,728 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 19:38:18,729 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:38:18,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 19:38:18,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:38:18,729 INFO L87 Difference]: Start difference. First operand 199 states and 215 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 19:38:18,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:38:18,843 INFO L93 Difference]: Finished difference Result 197 states and 213 transitions. [2021-12-14 19:38:18,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 19:38:18,843 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 3 [2021-12-14 19:38:18,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:38:18,844 INFO L225 Difference]: With dead ends: 197 [2021-12-14 19:38:18,844 INFO L226 Difference]: Without dead ends: 197 [2021-12-14 19:38:18,844 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:38:18,845 INFO L933 BasicCegarLoop]: 210 mSDtfsCounter, 2 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:38:18,846 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 319 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 19:38:18,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2021-12-14 19:38:18,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2021-12-14 19:38:18,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 104 states have (on average 2.048076923076923) internal successors, (213), 196 states have internal predecessors, (213), 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 19:38:18,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 213 transitions. [2021-12-14 19:38:18,851 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 213 transitions. Word has length 3 [2021-12-14 19:38:18,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:38:18,851 INFO L470 AbstractCegarLoop]: Abstraction has 197 states and 213 transitions. [2021-12-14 19:38:18,851 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 19:38:18,851 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 213 transitions. [2021-12-14 19:38:18,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-12-14 19:38:18,852 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:38:18,852 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-12-14 19:38:18,852 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-14 19:38:18,852 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-14 19:38:18,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:38:18,852 INFO L85 PathProgramCache]: Analyzing trace with hash 889446153, now seen corresponding path program 1 times [2021-12-14 19:38:18,853 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:38:18,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119763881] [2021-12-14 19:38:18,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:38:18,853 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:38:18,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:38:18,906 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 19:38:18,906 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:38:18,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119763881] [2021-12-14 19:38:18,907 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119763881] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:38:18,907 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:38:18,907 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 19:38:18,907 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004621607] [2021-12-14 19:38:18,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:38:18,908 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-14 19:38:18,908 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:38:18,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-14 19:38:18,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-14 19:38:18,908 INFO L87 Difference]: Start difference. First operand 197 states and 213 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 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 19:38:19,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:38:19,198 INFO L93 Difference]: Finished difference Result 354 states and 382 transitions. [2021-12-14 19:38:19,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-14 19:38:19,199 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 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 6 [2021-12-14 19:38:19,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:38:19,201 INFO L225 Difference]: With dead ends: 354 [2021-12-14 19:38:19,201 INFO L226 Difference]: Without dead ends: 354 [2021-12-14 19:38:19,201 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-14 19:38:19,206 INFO L933 BasicCegarLoop]: 118 mSDtfsCounter, 279 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-14 19:38:19,207 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [279 Valid, 232 Invalid, 312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-14 19:38:19,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2021-12-14 19:38:19,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 190. [2021-12-14 19:38:19,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 104 states have (on average 1.9807692307692308) internal successors, (206), 189 states have internal predecessors, (206), 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 19:38:19,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 206 transitions. [2021-12-14 19:38:19,224 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 206 transitions. Word has length 6 [2021-12-14 19:38:19,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:38:19,224 INFO L470 AbstractCegarLoop]: Abstraction has 190 states and 206 transitions. [2021-12-14 19:38:19,224 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 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 19:38:19,224 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 206 transitions. [2021-12-14 19:38:19,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-12-14 19:38:19,225 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:38:19,225 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:38:19,225 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-14 19:38:19,225 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-14 19:38:19,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:38:19,226 INFO L85 PathProgramCache]: Analyzing trace with hash 1113924364, now seen corresponding path program 1 times [2021-12-14 19:38:19,226 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:38:19,227 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580949479] [2021-12-14 19:38:19,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:38:19,227 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:38:19,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:38:19,303 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 19:38:19,303 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:38:19,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580949479] [2021-12-14 19:38:19,303 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580949479] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:38:19,304 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:38:19,304 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-14 19:38:19,304 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322386699] [2021-12-14 19:38:19,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:38:19,304 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-14 19:38:19,304 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:38:19,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 19:38:19,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-14 19:38:19,306 INFO L87 Difference]: Start difference. First operand 190 states and 206 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 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 19:38:19,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:38:19,466 INFO L93 Difference]: Finished difference Result 189 states and 205 transitions. [2021-12-14 19:38:19,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 19:38:19,466 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 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 10 [2021-12-14 19:38:19,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:38:19,467 INFO L225 Difference]: With dead ends: 189 [2021-12-14 19:38:19,467 INFO L226 Difference]: Without dead ends: 189 [2021-12-14 19:38:19,467 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-14 19:38:19,468 INFO L933 BasicCegarLoop]: 200 mSDtfsCounter, 5 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 301 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 508 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:38:19,468 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 508 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 301 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 19:38:19,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2021-12-14 19:38:19,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2021-12-14 19:38:19,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 104 states have (on average 1.9711538461538463) internal successors, (205), 188 states have internal predecessors, (205), 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 19:38:19,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 205 transitions. [2021-12-14 19:38:19,471 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 205 transitions. Word has length 10 [2021-12-14 19:38:19,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:38:19,472 INFO L470 AbstractCegarLoop]: Abstraction has 189 states and 205 transitions. [2021-12-14 19:38:19,472 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 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 19:38:19,472 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 205 transitions. [2021-12-14 19:38:19,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-12-14 19:38:19,472 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:38:19,472 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:38:19,473 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-14 19:38:19,473 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-14 19:38:19,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:38:19,473 INFO L85 PathProgramCache]: Analyzing trace with hash 1113924365, now seen corresponding path program 1 times [2021-12-14 19:38:19,473 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:38:19,474 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266177249] [2021-12-14 19:38:19,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:38:19,474 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:38:19,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:38:19,524 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 19:38:19,525 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:38:19,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266177249] [2021-12-14 19:38:19,525 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266177249] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:38:19,525 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:38:19,525 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-14 19:38:19,525 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785637884] [2021-12-14 19:38:19,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:38:19,526 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-14 19:38:19,526 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:38:19,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 19:38:19,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-14 19:38:19,527 INFO L87 Difference]: Start difference. First operand 189 states and 205 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 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 19:38:19,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:38:19,696 INFO L93 Difference]: Finished difference Result 188 states and 204 transitions. [2021-12-14 19:38:19,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 19:38:19,698 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 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 10 [2021-12-14 19:38:19,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:38:19,698 INFO L225 Difference]: With dead ends: 188 [2021-12-14 19:38:19,698 INFO L226 Difference]: Without dead ends: 188 [2021-12-14 19:38:19,699 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-14 19:38:19,699 INFO L933 BasicCegarLoop]: 200 mSDtfsCounter, 3 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 529 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:38:19,699 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 529 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 19:38:19,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2021-12-14 19:38:19,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 188. [2021-12-14 19:38:19,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 104 states have (on average 1.9615384615384615) internal successors, (204), 187 states have internal predecessors, (204), 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 19:38:19,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 204 transitions. [2021-12-14 19:38:19,702 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 204 transitions. Word has length 10 [2021-12-14 19:38:19,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:38:19,702 INFO L470 AbstractCegarLoop]: Abstraction has 188 states and 204 transitions. [2021-12-14 19:38:19,702 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 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 19:38:19,702 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 204 transitions. [2021-12-14 19:38:19,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-12-14 19:38:19,702 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:38:19,703 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:38:19,703 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-14 19:38:19,703 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-14 19:38:19,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:38:19,706 INFO L85 PathProgramCache]: Analyzing trace with hash 1114596085, now seen corresponding path program 1 times [2021-12-14 19:38:19,706 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:38:19,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917871106] [2021-12-14 19:38:19,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:38:19,710 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:38:19,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:38:19,818 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 19:38:19,819 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:38:19,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917871106] [2021-12-14 19:38:19,819 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917871106] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:38:19,819 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:38:19,819 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-14 19:38:19,819 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317111587] [2021-12-14 19:38:19,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:38:19,820 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-14 19:38:19,820 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:38:19,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-14 19:38:19,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-12-14 19:38:19,821 INFO L87 Difference]: Start difference. First operand 188 states and 204 transitions. Second operand has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 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 19:38:20,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:38:20,187 INFO L93 Difference]: Finished difference Result 353 states and 389 transitions. [2021-12-14 19:38:20,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-14 19:38:20,188 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 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 15 [2021-12-14 19:38:20,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:38:20,189 INFO L225 Difference]: With dead ends: 353 [2021-12-14 19:38:20,189 INFO L226 Difference]: Without dead ends: 353 [2021-12-14 19:38:20,189 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2021-12-14 19:38:20,190 INFO L933 BasicCegarLoop]: 148 mSDtfsCounter, 470 mSDsluCounter, 527 mSDsCounter, 0 mSdLazyCounter, 639 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 470 SdHoareTripleChecker+Valid, 675 SdHoareTripleChecker+Invalid, 665 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 639 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-14 19:38:20,190 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [470 Valid, 675 Invalid, 665 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 639 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-14 19:38:20,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2021-12-14 19:38:20,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 192. [2021-12-14 19:38:20,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 108 states have (on average 1.9444444444444444) internal successors, (210), 191 states have internal predecessors, (210), 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 19:38:20,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 210 transitions. [2021-12-14 19:38:20,194 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 210 transitions. Word has length 15 [2021-12-14 19:38:20,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:38:20,195 INFO L470 AbstractCegarLoop]: Abstraction has 192 states and 210 transitions. [2021-12-14 19:38:20,195 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 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 19:38:20,195 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 210 transitions. [2021-12-14 19:38:20,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-12-14 19:38:20,196 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:38:20,196 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:38:20,196 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-14 19:38:20,196 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-14 19:38:20,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:38:20,196 INFO L85 PathProgramCache]: Analyzing trace with hash 1114596086, now seen corresponding path program 1 times [2021-12-14 19:38:20,197 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:38:20,197 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881757741] [2021-12-14 19:38:20,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:38:20,197 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:38:20,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:38:20,288 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 19:38:20,289 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:38:20,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881757741] [2021-12-14 19:38:20,289 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881757741] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:38:20,289 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:38:20,289 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-14 19:38:20,289 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026253967] [2021-12-14 19:38:20,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:38:20,290 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-14 19:38:20,290 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:38:20,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-14 19:38:20,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-12-14 19:38:20,291 INFO L87 Difference]: Start difference. First operand 192 states and 210 transitions. Second operand has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 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 19:38:20,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:38:20,672 INFO L93 Difference]: Finished difference Result 347 states and 383 transitions. [2021-12-14 19:38:20,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-14 19:38:20,672 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 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 15 [2021-12-14 19:38:20,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:38:20,673 INFO L225 Difference]: With dead ends: 347 [2021-12-14 19:38:20,673 INFO L226 Difference]: Without dead ends: 347 [2021-12-14 19:38:20,674 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2021-12-14 19:38:20,674 INFO L933 BasicCegarLoop]: 134 mSDtfsCounter, 452 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 674 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 452 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 693 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 674 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-14 19:38:20,674 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [452 Valid, 490 Invalid, 693 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 674 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-14 19:38:20,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2021-12-14 19:38:20,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 192. [2021-12-14 19:38:20,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 108 states have (on average 1.9351851851851851) internal successors, (209), 191 states have internal predecessors, (209), 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 19:38:20,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 209 transitions. [2021-12-14 19:38:20,678 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 209 transitions. Word has length 15 [2021-12-14 19:38:20,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:38:20,678 INFO L470 AbstractCegarLoop]: Abstraction has 192 states and 209 transitions. [2021-12-14 19:38:20,678 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 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 19:38:20,678 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 209 transitions. [2021-12-14 19:38:20,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-14 19:38:20,679 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:38:20,679 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:38:20,679 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-14 19:38:20,679 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-14 19:38:20,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:38:20,680 INFO L85 PathProgramCache]: Analyzing trace with hash 192740277, now seen corresponding path program 1 times [2021-12-14 19:38:20,680 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:38:20,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766057482] [2021-12-14 19:38:20,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:38:20,680 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:38:20,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:38:20,705 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 19:38:20,705 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:38:20,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766057482] [2021-12-14 19:38:20,706 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766057482] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:38:20,706 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:38:20,706 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-14 19:38:20,706 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716761263] [2021-12-14 19:38:20,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:38:20,707 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 19:38:20,707 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:38:20,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 19:38:20,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:38:20,707 INFO L87 Difference]: Start difference. First operand 192 states and 209 transitions. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 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 19:38:20,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:38:20,822 INFO L93 Difference]: Finished difference Result 316 states and 348 transitions. [2021-12-14 19:38:20,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 19:38:20,822 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-12-14 19:38:20,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:38:20,823 INFO L225 Difference]: With dead ends: 316 [2021-12-14 19:38:20,824 INFO L226 Difference]: Without dead ends: 316 [2021-12-14 19:38:20,824 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:38:20,824 INFO L933 BasicCegarLoop]: 261 mSDtfsCounter, 168 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:38:20,825 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [168 Valid, 348 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 19:38:20,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2021-12-14 19:38:20,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 189. [2021-12-14 19:38:20,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 108 states have (on average 1.9074074074074074) internal successors, (206), 188 states have internal predecessors, (206), 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 19:38:20,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 206 transitions. [2021-12-14 19:38:20,828 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 206 transitions. Word has length 16 [2021-12-14 19:38:20,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:38:20,828 INFO L470 AbstractCegarLoop]: Abstraction has 189 states and 206 transitions. [2021-12-14 19:38:20,828 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 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 19:38:20,828 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 206 transitions. [2021-12-14 19:38:20,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-14 19:38:20,829 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:38:20,829 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:38:20,829 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-14 19:38:20,829 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-14 19:38:20,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:38:20,830 INFO L85 PathProgramCache]: Analyzing trace with hash 192740278, now seen corresponding path program 1 times [2021-12-14 19:38:20,830 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:38:20,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310270790] [2021-12-14 19:38:20,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:38:20,830 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:38:20,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:38:20,856 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 19:38:20,856 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:38:20,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310270790] [2021-12-14 19:38:20,856 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310270790] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:38:20,857 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:38:20,857 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-14 19:38:20,857 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467117695] [2021-12-14 19:38:20,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:38:20,857 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 19:38:20,857 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:38:20,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 19:38:20,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:38:20,858 INFO L87 Difference]: Start difference. First operand 189 states and 206 transitions. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 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 19:38:20,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:38:20,965 INFO L93 Difference]: Finished difference Result 293 states and 325 transitions. [2021-12-14 19:38:20,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 19:38:20,965 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-12-14 19:38:20,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:38:20,966 INFO L225 Difference]: With dead ends: 293 [2021-12-14 19:38:20,966 INFO L226 Difference]: Without dead ends: 293 [2021-12-14 19:38:20,967 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:38:20,967 INFO L933 BasicCegarLoop]: 265 mSDtfsCounter, 139 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:38:20,967 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [139 Valid, 359 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 19:38:20,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2021-12-14 19:38:20,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 187. [2021-12-14 19:38:20,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 108 states have (on average 1.8888888888888888) internal successors, (204), 186 states have internal predecessors, (204), 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 19:38:20,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 204 transitions. [2021-12-14 19:38:20,970 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 204 transitions. Word has length 16 [2021-12-14 19:38:20,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:38:20,970 INFO L470 AbstractCegarLoop]: Abstraction has 187 states and 204 transitions. [2021-12-14 19:38:20,970 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 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 19:38:20,970 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 204 transitions. [2021-12-14 19:38:20,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-12-14 19:38:20,971 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:38:20,971 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:38:20,971 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-14 19:38:20,971 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-14 19:38:20,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:38:20,971 INFO L85 PathProgramCache]: Analyzing trace with hash 1678809590, now seen corresponding path program 1 times [2021-12-14 19:38:20,971 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:38:20,971 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345093151] [2021-12-14 19:38:20,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:38:20,971 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:38:20,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:38:20,995 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 19:38:20,996 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:38:20,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345093151] [2021-12-14 19:38:20,996 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345093151] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:38:20,996 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:38:20,996 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 19:38:20,996 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880040971] [2021-12-14 19:38:20,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:38:20,997 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-14 19:38:20,997 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:38:20,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-14 19:38:20,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-14 19:38:20,997 INFO L87 Difference]: Start difference. First operand 187 states and 204 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 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 19:38:21,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:38:21,151 INFO L93 Difference]: Finished difference Result 254 states and 278 transitions. [2021-12-14 19:38:21,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-14 19:38:21,152 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 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 17 [2021-12-14 19:38:21,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:38:21,152 INFO L225 Difference]: With dead ends: 254 [2021-12-14 19:38:21,152 INFO L226 Difference]: Without dead ends: 254 [2021-12-14 19:38:21,153 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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 19:38:21,153 INFO L933 BasicCegarLoop]: 104 mSDtfsCounter, 327 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 327 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:38:21,153 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [327 Valid, 153 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 19:38:21,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2021-12-14 19:38:21,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 176. [2021-12-14 19:38:21,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 112 states have (on average 1.7589285714285714) internal successors, (197), 175 states have internal predecessors, (197), 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 19:38:21,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 197 transitions. [2021-12-14 19:38:21,156 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 197 transitions. Word has length 17 [2021-12-14 19:38:21,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:38:21,156 INFO L470 AbstractCegarLoop]: Abstraction has 176 states and 197 transitions. [2021-12-14 19:38:21,156 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 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 19:38:21,156 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 197 transitions. [2021-12-14 19:38:21,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-12-14 19:38:21,156 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:38:21,156 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:38:21,156 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-14 19:38:21,156 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-14 19:38:21,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:38:21,157 INFO L85 PathProgramCache]: Analyzing trace with hash 1678809591, now seen corresponding path program 1 times [2021-12-14 19:38:21,157 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:38:21,157 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104713345] [2021-12-14 19:38:21,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:38:21,157 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:38:21,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:38:21,193 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 19:38:21,193 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:38:21,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104713345] [2021-12-14 19:38:21,193 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104713345] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:38:21,193 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:38:21,194 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-14 19:38:21,194 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579250226] [2021-12-14 19:38:21,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:38:21,194 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-14 19:38:21,194 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:38:21,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 19:38:21,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-12-14 19:38:21,195 INFO L87 Difference]: Start difference. First operand 176 states and 197 transitions. Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 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 19:38:21,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:38:21,433 INFO L93 Difference]: Finished difference Result 438 states and 492 transitions. [2021-12-14 19:38:21,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-14 19:38:21,434 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 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 17 [2021-12-14 19:38:21,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:38:21,435 INFO L225 Difference]: With dead ends: 438 [2021-12-14 19:38:21,435 INFO L226 Difference]: Without dead ends: 438 [2021-12-14 19:38:21,435 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-12-14 19:38:21,436 INFO L933 BasicCegarLoop]: 124 mSDtfsCounter, 712 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 712 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 19:38:21,436 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [712 Valid, 293 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 329 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 19:38:21,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2021-12-14 19:38:21,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 318. [2021-12-14 19:38:21,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 254 states have (on average 1.7598425196850394) internal successors, (447), 317 states have internal predecessors, (447), 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 19:38:21,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 447 transitions. [2021-12-14 19:38:21,440 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 447 transitions. Word has length 17 [2021-12-14 19:38:21,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:38:21,441 INFO L470 AbstractCegarLoop]: Abstraction has 318 states and 447 transitions. [2021-12-14 19:38:21,441 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 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 19:38:21,441 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 447 transitions. [2021-12-14 19:38:21,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-12-14 19:38:21,441 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:38:21,441 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:38:21,441 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-14 19:38:21,441 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-14 19:38:21,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:38:21,442 INFO L85 PathProgramCache]: Analyzing trace with hash -445669701, now seen corresponding path program 1 times [2021-12-14 19:38:21,442 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:38:21,442 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764079218] [2021-12-14 19:38:21,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:38:21,442 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:38:21,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:38:21,493 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 19:38:21,494 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:38:21,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764079218] [2021-12-14 19:38:21,494 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764079218] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:38:21,494 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:38:21,494 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-14 19:38:21,495 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692859882] [2021-12-14 19:38:21,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:38:21,495 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-14 19:38:21,496 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:38:21,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-14 19:38:21,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-14 19:38:21,496 INFO L87 Difference]: Start difference. First operand 318 states and 447 transitions. Second operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 8 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 19:38:21,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:38:21,928 INFO L93 Difference]: Finished difference Result 784 states and 1126 transitions. [2021-12-14 19:38:21,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-14 19:38:21,929 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 8 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 19:38:21,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:38:21,931 INFO L225 Difference]: With dead ends: 784 [2021-12-14 19:38:21,931 INFO L226 Difference]: Without dead ends: 784 [2021-12-14 19:38:21,931 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2021-12-14 19:38:21,932 INFO L933 BasicCegarLoop]: 224 mSDtfsCounter, 363 mSDsluCounter, 994 mSDsCounter, 0 mSdLazyCounter, 894 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 363 SdHoareTripleChecker+Valid, 1218 SdHoareTripleChecker+Invalid, 914 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 894 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-14 19:38:21,932 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [363 Valid, 1218 Invalid, 914 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 894 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-14 19:38:21,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 784 states. [2021-12-14 19:38:21,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 784 to 317. [2021-12-14 19:38:21,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 254 states have (on average 1.7559055118110236) internal successors, (446), 316 states have internal predecessors, (446), 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 19:38:21,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 446 transitions. [2021-12-14 19:38:21,938 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 446 transitions. Word has length 19 [2021-12-14 19:38:21,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:38:21,938 INFO L470 AbstractCegarLoop]: Abstraction has 317 states and 446 transitions. [2021-12-14 19:38:21,938 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 8 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 19:38:21,938 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 446 transitions. [2021-12-14 19:38:21,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-12-14 19:38:21,939 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:38:21,939 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:38:21,939 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-14 19:38:21,939 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-14 19:38:21,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:38:21,940 INFO L85 PathProgramCache]: Analyzing trace with hash -445669700, now seen corresponding path program 1 times [2021-12-14 19:38:21,940 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:38:21,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343615807] [2021-12-14 19:38:21,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:38:21,940 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:38:21,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:38:22,066 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 19:38:22,066 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:38:22,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343615807] [2021-12-14 19:38:22,067 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343615807] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:38:22,067 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:38:22,067 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-14 19:38:22,067 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211836370] [2021-12-14 19:38:22,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:38:22,067 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-14 19:38:22,068 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:38:22,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-14 19:38:22,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-12-14 19:38:22,068 INFO L87 Difference]: Start difference. First operand 317 states and 446 transitions. Second operand has 12 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 12 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 19:38:22,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:38:22,541 INFO L93 Difference]: Finished difference Result 603 states and 842 transitions. [2021-12-14 19:38:22,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-14 19:38:22,541 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 12 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 19:38:22,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:38:22,543 INFO L225 Difference]: With dead ends: 603 [2021-12-14 19:38:22,543 INFO L226 Difference]: Without dead ends: 603 [2021-12-14 19:38:22,543 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=107, Invalid=355, Unknown=0, NotChecked=0, Total=462 [2021-12-14 19:38:22,543 INFO L933 BasicCegarLoop]: 142 mSDtfsCounter, 392 mSDsluCounter, 784 mSDsCounter, 0 mSdLazyCounter, 810 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 392 SdHoareTripleChecker+Valid, 926 SdHoareTripleChecker+Invalid, 842 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 810 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-14 19:38:22,544 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [392 Valid, 926 Invalid, 842 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 810 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-14 19:38:22,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2021-12-14 19:38:22,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 321. [2021-12-14 19:38:22,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 321 states, 258 states have (on average 1.744186046511628) internal successors, (450), 320 states have internal predecessors, (450), 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 19:38:22,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 450 transitions. [2021-12-14 19:38:22,557 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 450 transitions. Word has length 19 [2021-12-14 19:38:22,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:38:22,557 INFO L470 AbstractCegarLoop]: Abstraction has 321 states and 450 transitions. [2021-12-14 19:38:22,557 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 12 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 19:38:22,557 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 450 transitions. [2021-12-14 19:38:22,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-12-14 19:38:22,558 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:38:22,558 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:38:22,558 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-14 19:38:22,558 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr103ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-14 19:38:22,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:38:22,559 INFO L85 PathProgramCache]: Analyzing trace with hash -1571609538, now seen corresponding path program 1 times [2021-12-14 19:38:22,559 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:38:22,559 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212487887] [2021-12-14 19:38:22,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:38:22,559 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:38:22,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:38:22,578 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 19:38:22,578 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:38:22,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212487887] [2021-12-14 19:38:22,578 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [212487887] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:38:22,578 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:38:22,578 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 19:38:22,578 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818326318] [2021-12-14 19:38:22,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:38:22,579 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 19:38:22,579 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:38:22,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 19:38:22,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:38:22,580 INFO L87 Difference]: Start difference. First operand 321 states and 450 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 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 19:38:22,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:38:22,592 INFO L93 Difference]: Finished difference Result 395 states and 528 transitions. [2021-12-14 19:38:22,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 19:38:22,592 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 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 19:38:22,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:38:22,593 INFO L225 Difference]: With dead ends: 395 [2021-12-14 19:38:22,594 INFO L226 Difference]: Without dead ends: 395 [2021-12-14 19:38:22,594 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 19:38:22,594 INFO L933 BasicCegarLoop]: 216 mSDtfsCounter, 163 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 19:38:22,594 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [163 Valid, 296 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 19:38:22,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2021-12-14 19:38:22,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 361. [2021-12-14 19:38:22,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 298 states have (on average 1.7718120805369129) internal successors, (528), 360 states have internal predecessors, (528), 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 19:38:22,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 528 transitions. [2021-12-14 19:38:22,599 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 528 transitions. Word has length 19 [2021-12-14 19:38:22,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:38:22,599 INFO L470 AbstractCegarLoop]: Abstraction has 361 states and 528 transitions. [2021-12-14 19:38:22,599 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 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 19:38:22,600 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 528 transitions. [2021-12-14 19:38:22,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-12-14 19:38:22,600 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:38:22,600 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:38:22,600 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-14 19:38:22,600 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-14 19:38:22,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:38:22,601 INFO L85 PathProgramCache]: Analyzing trace with hash -727311539, now seen corresponding path program 1 times [2021-12-14 19:38:22,601 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:38:22,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241724911] [2021-12-14 19:38:22,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:38:22,601 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:38:22,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:38:22,619 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 19:38:22,619 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:38:22,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241724911] [2021-12-14 19:38:22,635 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241724911] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:38:22,635 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:38:22,635 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 19:38:22,635 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890230569] [2021-12-14 19:38:22,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:38:22,636 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 19:38:22,636 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:38:22,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 19:38:22,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:38:22,636 INFO L87 Difference]: Start difference. First operand 361 states and 528 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:38:22,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:38:22,643 INFO L93 Difference]: Finished difference Result 365 states and 532 transitions. [2021-12-14 19:38:22,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 19:38:22,643 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-12-14 19:38:22,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:38:22,645 INFO L225 Difference]: With dead ends: 365 [2021-12-14 19:38:22,645 INFO L226 Difference]: Without dead ends: 365 [2021-12-14 19:38:22,645 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 19:38:22,645 INFO L933 BasicCegarLoop]: 182 mSDtfsCounter, 0 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 19:38:22,646 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 358 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 19:38:22,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2021-12-14 19:38:22,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 365. [2021-12-14 19:38:22,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 302 states have (on average 1.7615894039735098) internal successors, (532), 364 states have internal predecessors, (532), 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 19:38:22,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 532 transitions. [2021-12-14 19:38:22,650 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 532 transitions. Word has length 23 [2021-12-14 19:38:22,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:38:22,650 INFO L470 AbstractCegarLoop]: Abstraction has 365 states and 532 transitions. [2021-12-14 19:38:22,650 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:38:22,650 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 532 transitions. [2021-12-14 19:38:22,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-12-14 19:38:22,651 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:38:22,651 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:38:22,651 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-12-14 19:38:22,651 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-14 19:38:22,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:38:22,652 INFO L85 PathProgramCache]: Analyzing trace with hash 97933121, now seen corresponding path program 1 times [2021-12-14 19:38:22,652 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:38:22,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928538071] [2021-12-14 19:38:22,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:38:22,652 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:38:22,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:38:22,793 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:38:22,794 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:38:22,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928538071] [2021-12-14 19:38:22,794 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928538071] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:38:22,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1358185514] [2021-12-14 19:38:22,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:38:22,794 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:38:22,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:38:22,796 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 19:38:22,808 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 19:38:22,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:38:22,883 INFO L263 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 31 conjunts are in the unsatisfiable core [2021-12-14 19:38:22,894 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:38:22,955 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 19:38:22,990 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-14 19:38:22,990 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 11 treesize of output 11 [2021-12-14 19:38:23,021 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-14 19:38:23,088 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 19:38:23,088 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 26 [2021-12-14 19:38:23,112 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-14 19:38:23,112 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 17 treesize of output 21 [2021-12-14 19:38:23,161 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 17 treesize of output 19 [2021-12-14 19:38:23,256 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 19:38:23,256 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 35 [2021-12-14 19:38:23,316 INFO L354 Elim1Store]: treesize reduction 54, result has 36.5 percent of original size [2021-12-14 19:38:23,317 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 28 treesize of output 45 [2021-12-14 19:38:23,358 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 31 treesize of output 13 [2021-12-14 19:38:23,375 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:38:23,375 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:38:23,768 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~tmpList~0#1.base_21| Int) (v_ArrVal_464 Int) (|v_ULTIMATE.start_main_~tmpList~0#1.base_22| Int) (v_ArrVal_460 (Array Int Int)) (v_ArrVal_463 (Array Int Int)) (v_ArrVal_462 (Array Int Int))) (let ((.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_460) |v_ULTIMATE.start_main_~tmpList~0#1.base_22| v_ArrVal_462)) (.cse3 (+ 8 |c_ULTIMATE.start_main_~tree~0#1.offset|))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse3)) (.cse0 (store |c_#valid| |v_ULTIMATE.start_main_~tmpList~0#1.base_22| 1))) (or (= (select (store .cse0 |v_ULTIMATE.start_main_~tmpList~0#1.base_21| v_ArrVal_464) (select (select (store .cse1 .cse2 v_ArrVal_463) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse3)) 1) (not (= (select .cse0 .cse2) 1)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~tmpList~0#1.base_22|) 0)) (not (= (select .cse0 |v_ULTIMATE.start_main_~tmpList~0#1.base_21|) 0)))))) is different from false [2021-12-14 19:38:23,828 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~tmpList~0#1.base_21| Int) (v_ArrVal_464 Int) (|v_ULTIMATE.start_main_~tmpList~0#1.base_22| Int) (v_ArrVal_460 (Array Int Int)) (v_ArrVal_463 (Array Int Int)) (v_ArrVal_462 (Array Int Int))) (let ((.cse3 (+ 8 |c_ULTIMATE.start_main_~tree~0#1.offset|))) (let ((.cse1 (store (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tree~0#1.base|) .cse3) v_ArrVal_460) |v_ULTIMATE.start_main_~tmpList~0#1.base_22| v_ArrVal_462))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse3)) (.cse0 (store |c_#valid| |v_ULTIMATE.start_main_~tmpList~0#1.base_22| 1))) (or (= (select (store .cse0 |v_ULTIMATE.start_main_~tmpList~0#1.base_21| v_ArrVal_464) (select (select (store .cse1 .cse2 v_ArrVal_463) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse3)) 1) (not (= (select .cse0 .cse2) 1)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~tmpList~0#1.base_22|) 0)) (not (= (select .cse0 |v_ULTIMATE.start_main_~tmpList~0#1.base_21|) 0))))))) is different from false [2021-12-14 19:38:23,876 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:38:23,876 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 90 treesize of output 70 [2021-12-14 19:38:23,879 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:38:23,882 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 380 treesize of output 320 [2021-12-14 19:38:23,921 INFO L354 Elim1Store]: treesize reduction 124, result has 23.0 percent of original size [2021-12-14 19:38:23,922 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 851 treesize of output 821 [2021-12-14 19:38:23,984 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 653 treesize of output 565 [2021-12-14 19:38:23,995 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 577 treesize of output 449 [2021-12-14 19:38:25,360 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:38:25,361 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1358185514] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 19:38:25,361 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 19:38:25,361 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 12] total 26 [2021-12-14 19:38:25,361 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112464124] [2021-12-14 19:38:25,361 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 19:38:25,362 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2021-12-14 19:38:25,362 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:38:25,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-12-14 19:38:25,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=489, Unknown=4, NotChecked=94, Total=702 [2021-12-14 19:38:25,363 INFO L87 Difference]: Start difference. First operand 365 states and 532 transitions. Second operand has 27 states, 26 states have (on average 2.3846153846153846) internal successors, (62), 27 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 19:38:25,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:38:25,657 INFO L93 Difference]: Finished difference Result 459 states and 657 transitions. [2021-12-14 19:38:25,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-14 19:38:25,658 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.3846153846153846) internal successors, (62), 27 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 24 [2021-12-14 19:38:25,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:38:25,659 INFO L225 Difference]: With dead ends: 459 [2021-12-14 19:38:25,659 INFO L226 Difference]: Without dead ends: 459 [2021-12-14 19:38:25,659 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=203, Invalid=731, Unknown=4, NotChecked=118, Total=1056 [2021-12-14 19:38:25,660 INFO L933 BasicCegarLoop]: 144 mSDtfsCounter, 186 mSDsluCounter, 1217 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 1361 SdHoareTripleChecker+Invalid, 993 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 631 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 19:38:25,660 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [186 Valid, 1361 Invalid, 993 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 357 Invalid, 0 Unknown, 631 Unchecked, 0.2s Time] [2021-12-14 19:38:25,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2021-12-14 19:38:25,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 364. [2021-12-14 19:38:25,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 302 states have (on average 1.7582781456953642) internal successors, (531), 363 states have internal predecessors, (531), 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 19:38:25,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 531 transitions. [2021-12-14 19:38:25,664 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 531 transitions. Word has length 24 [2021-12-14 19:38:25,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:38:25,664 INFO L470 AbstractCegarLoop]: Abstraction has 364 states and 531 transitions. [2021-12-14 19:38:25,664 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.3846153846153846) internal successors, (62), 27 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 19:38:25,664 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 531 transitions. [2021-12-14 19:38:25,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-12-14 19:38:25,665 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:38:25,665 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:38:25,685 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-14 19:38:25,875 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2021-12-14 19:38:25,875 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-14 19:38:25,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:38:25,876 INFO L85 PathProgramCache]: Analyzing trace with hash 97933122, now seen corresponding path program 1 times [2021-12-14 19:38:25,876 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:38:25,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923405713] [2021-12-14 19:38:25,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:38:25,876 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:38:25,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:38:26,205 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:38:26,206 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:38:26,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923405713] [2021-12-14 19:38:26,206 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923405713] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:38:26,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1445625903] [2021-12-14 19:38:26,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:38:26,206 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:38:26,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:38:26,207 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 19:38:26,208 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 19:38:26,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:38:26,293 INFO L263 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 43 conjunts are in the unsatisfiable core [2021-12-14 19:38:26,296 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:38:26,299 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 19:38:26,319 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-14 19:38:26,320 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 11 treesize of output 11 [2021-12-14 19:38:26,336 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-14 19:38:26,339 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-14 19:38:26,392 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 19:38:26,392 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 36 [2021-12-14 19:38:26,395 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 22 treesize of output 24 [2021-12-14 19:38:26,417 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-14 19:38:26,417 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 11 treesize of output 11 [2021-12-14 19:38:26,492 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 37 [2021-12-14 19:38:26,495 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 16 treesize of output 18 [2021-12-14 19:38:26,562 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 19:38:26,563 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 54 [2021-12-14 19:38:26,567 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 22 treesize of output 24 [2021-12-14 19:38:26,596 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:38:26,597 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 18 treesize of output 20 [2021-12-14 19:38:26,603 INFO L354 Elim1Store]: treesize reduction 4, result has 71.4 percent of original size [2021-12-14 19:38:26,603 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2021-12-14 19:38:26,626 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 31 treesize of output 13 [2021-12-14 19:38:26,629 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-12-14 19:38:26,642 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:38:26,642 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:38:26,782 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~tmpList~0#1.base_24| Int)) (or (and (forall ((v_ArrVal_564 Int) (v_ArrVal_562 (Array Int Int)) (v_ArrVal_563 (Array Int Int))) (let ((.cse0 (+ 8 |c_ULTIMATE.start_main_~tree~0#1.offset|))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_562) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse0) 4) (select (store |c_#length| |v_ULTIMATE.start_main_~tmpList~0#1.base_24| v_ArrVal_564) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_563) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse0))))) (forall ((v_ArrVal_562 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_562) |c_ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~tree~0#1.offset|))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~tmpList~0#1.base_24|) 0)))) is different from false [2021-12-14 19:38:26,932 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:38:26,932 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 158 treesize of output 162 [2021-12-14 19:38:26,936 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-14 19:38:26,937 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 13 treesize of output 12 [2021-12-14 19:38:27,031 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_560 (Array Int Int)) (v_ArrVal_563 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~mem9#1.base| (let ((.cse1 (+ 8 |c_ULTIMATE.start_main_~tree~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_560))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1) v_ArrVal_563)) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1)))) (forall ((v_ArrVal_560 (Array Int Int)) (v_ArrVal_562 (Array Int Int)) (v_ArrVal_561 (Array Int Int))) (<= (let ((.cse2 (+ 8 |c_ULTIMATE.start_main_~tree~0#1.offset|))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_561) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_560) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse2) v_ArrVal_562) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse2)) 0)) (forall ((v_prenex_3 (Array Int Int)) (v_prenex_4 (Array Int Int)) (v_prenex_5 (Array Int Int))) (<= 0 (let ((.cse3 (+ 8 |c_ULTIMATE.start_main_~tree~0#1.offset|))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_prenex_5) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_prenex_3) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse3) v_prenex_4) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse3))))) is different from false [2021-12-14 19:38:27,042 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_560 (Array Int Int)) (v_ArrVal_563 (Array Int Int))) (let ((.cse0 (+ 8 |c_ULTIMATE.start_main_~tree~0#1.offset|))) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tree~0#1.base|) .cse0) (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_560))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse0) v_ArrVal_563)) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse0)))) (forall ((v_ArrVal_560 (Array Int Int)) (v_ArrVal_562 (Array Int Int)) (v_ArrVal_561 (Array Int Int))) (<= (let ((.cse2 (+ 8 |c_ULTIMATE.start_main_~tree~0#1.offset|))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_561) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_560) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse2) v_ArrVal_562) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse2)) 0)) (forall ((v_prenex_3 (Array Int Int)) (v_prenex_4 (Array Int Int)) (v_prenex_5 (Array Int Int))) (<= 0 (let ((.cse3 (+ 8 |c_ULTIMATE.start_main_~tree~0#1.offset|))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_prenex_5) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_prenex_3) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse3) v_prenex_4) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse3))))) is different from false [2021-12-14 19:38:27,497 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:38:27,497 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 170 treesize of output 161 [2021-12-14 19:38:27,503 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:38:27,504 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 161 treesize of output 121 [2021-12-14 19:38:27,506 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:38:27,509 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 704 treesize of output 566 [2021-12-14 19:38:27,521 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:38:27,524 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 966 treesize of output 918 [2021-12-14 19:38:27,541 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-14 19:38:27,541 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 13 treesize of output 12 [2021-12-14 19:38:27,559 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 206 treesize of output 182 [2021-12-14 19:38:27,562 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 182 treesize of output 170 [2021-12-14 19:38:27,565 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 122 treesize of output 98 [2021-12-14 19:38:27,623 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 319 treesize of output 239 [2021-12-14 19:38:27,626 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 239 treesize of output 207 [2021-12-14 19:38:27,787 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 270 treesize of output 254 [2021-12-14 19:38:27,792 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 138 treesize of output 114 [2021-12-14 19:38:27,795 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 230 treesize of output 198 [2021-12-14 19:38:27,850 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2021-12-14 19:38:27,850 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1445625903] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 19:38:27,850 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 19:38:27,850 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 14] total 36 [2021-12-14 19:38:27,850 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31383322] [2021-12-14 19:38:27,850 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 19:38:27,850 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2021-12-14 19:38:27,851 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:38:27,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2021-12-14 19:38:27,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=971, Unknown=21, NotChecked=198, Total=1332 [2021-12-14 19:38:27,851 INFO L87 Difference]: Start difference. First operand 364 states and 531 transitions. Second operand has 37 states, 36 states have (on average 1.9444444444444444) internal successors, (70), 37 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 19:38:29,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:38:29,429 INFO L93 Difference]: Finished difference Result 1105 states and 1577 transitions. [2021-12-14 19:38:29,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-14 19:38:29,430 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 1.9444444444444444) internal successors, (70), 37 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 24 [2021-12-14 19:38:29,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:38:29,434 INFO L225 Difference]: With dead ends: 1105 [2021-12-14 19:38:29,434 INFO L226 Difference]: Without dead ends: 1105 [2021-12-14 19:38:29,435 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 25 SyntacticMatches, 3 SemanticMatches, 47 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 597 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=352, Invalid=1709, Unknown=21, NotChecked=270, Total=2352 [2021-12-14 19:38:29,435 INFO L933 BasicCegarLoop]: 163 mSDtfsCounter, 1349 mSDsluCounter, 2344 mSDsCounter, 0 mSdLazyCounter, 2456 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1349 SdHoareTripleChecker+Valid, 2507 SdHoareTripleChecker+Invalid, 4814 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 2456 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2269 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:38:29,435 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1349 Valid, 2507 Invalid, 4814 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 2456 Invalid, 0 Unknown, 2269 Unchecked, 1.1s Time] [2021-12-14 19:38:29,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1105 states. [2021-12-14 19:38:29,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1105 to 363. [2021-12-14 19:38:29,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 363 states, 302 states have (on average 1.7549668874172186) internal successors, (530), 362 states have internal predecessors, (530), 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 19:38:29,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 530 transitions. [2021-12-14 19:38:29,443 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 530 transitions. Word has length 24 [2021-12-14 19:38:29,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:38:29,444 INFO L470 AbstractCegarLoop]: Abstraction has 363 states and 530 transitions. [2021-12-14 19:38:29,444 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 1.9444444444444444) internal successors, (70), 37 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 19:38:29,444 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 530 transitions. [2021-12-14 19:38:29,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-12-14 19:38:29,444 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:38:29,444 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:38:29,466 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 19:38:29,655 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,SelfDestructingSolverStorable16 [2021-12-14 19:38:29,655 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-14 19:38:29,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:38:29,656 INFO L85 PathProgramCache]: Analyzing trace with hash -354718400, now seen corresponding path program 1 times [2021-12-14 19:38:29,656 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:38:29,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874548450] [2021-12-14 19:38:29,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:38:29,656 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:38:29,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:38:29,691 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:38:29,691 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:38:29,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874548450] [2021-12-14 19:38:29,691 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874548450] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:38:29,692 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:38:29,692 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 19:38:29,692 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993234128] [2021-12-14 19:38:29,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:38:29,692 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 19:38:29,692 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:38:29,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 19:38:29,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:38:29,693 INFO L87 Difference]: Start difference. First operand 363 states and 530 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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 19:38:29,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:38:29,699 INFO L93 Difference]: Finished difference Result 366 states and 533 transitions. [2021-12-14 19:38:29,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 19:38:29,699 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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 24 [2021-12-14 19:38:29,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:38:29,700 INFO L225 Difference]: With dead ends: 366 [2021-12-14 19:38:29,700 INFO L226 Difference]: Without dead ends: 366 [2021-12-14 19:38:29,700 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 19:38:29,701 INFO L933 BasicCegarLoop]: 180 mSDtfsCounter, 0 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 19:38:29,701 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 354 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 19:38:29,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2021-12-14 19:38:29,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 366. [2021-12-14 19:38:29,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 305 states have (on average 1.7475409836065574) internal successors, (533), 365 states have internal predecessors, (533), 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 19:38:29,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 533 transitions. [2021-12-14 19:38:29,707 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 533 transitions. Word has length 24 [2021-12-14 19:38:29,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:38:29,707 INFO L470 AbstractCegarLoop]: Abstraction has 366 states and 533 transitions. [2021-12-14 19:38:29,707 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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 19:38:29,708 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 533 transitions. [2021-12-14 19:38:29,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-12-14 19:38:29,708 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:38:29,708 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:38:29,708 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-12-14 19:38:29,708 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-14 19:38:29,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:38:29,709 INFO L85 PathProgramCache]: Analyzing trace with hash 1183191976, now seen corresponding path program 1 times [2021-12-14 19:38:29,709 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:38:29,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307260168] [2021-12-14 19:38:29,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:38:29,709 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:38:29,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:38:29,731 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 19:38:29,731 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:38:29,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307260168] [2021-12-14 19:38:29,732 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307260168] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:38:29,732 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:38:29,732 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 19:38:29,732 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763174861] [2021-12-14 19:38:29,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:38:29,733 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 19:38:29,734 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:38:29,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 19:38:29,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:38:29,734 INFO L87 Difference]: Start difference. First operand 366 states and 533 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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 19:38:29,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:38:29,745 INFO L93 Difference]: Finished difference Result 409 states and 562 transitions. [2021-12-14 19:38:29,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 19:38:29,746 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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 19:38:29,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:38:29,747 INFO L225 Difference]: With dead ends: 409 [2021-12-14 19:38:29,747 INFO L226 Difference]: Without dead ends: 409 [2021-12-14 19:38:29,747 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 19:38:29,748 INFO L933 BasicCegarLoop]: 184 mSDtfsCounter, 52 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 19:38:29,748 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [52 Valid, 351 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 19:38:29,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2021-12-14 19:38:29,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 355. [2021-12-14 19:38:29,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 355 states, 294 states have (on average 1.7312925170068028) internal successors, (509), 354 states have internal predecessors, (509), 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 19:38:29,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 509 transitions. [2021-12-14 19:38:29,754 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 509 transitions. Word has length 25 [2021-12-14 19:38:29,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:38:29,755 INFO L470 AbstractCegarLoop]: Abstraction has 355 states and 509 transitions. [2021-12-14 19:38:29,755 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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 19:38:29,755 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 509 transitions. [2021-12-14 19:38:29,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-14 19:38:29,756 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:38:29,756 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:38:29,756 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-12-14 19:38:29,756 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-14 19:38:29,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:38:29,757 INFO L85 PathProgramCache]: Analyzing trace with hash 808555227, now seen corresponding path program 1 times [2021-12-14 19:38:29,757 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:38:29,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122352897] [2021-12-14 19:38:29,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:38:29,757 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:38:29,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:38:29,863 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:38:29,864 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:38:29,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122352897] [2021-12-14 19:38:29,864 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122352897] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:38:29,865 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:38:29,865 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-14 19:38:29,865 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557749269] [2021-12-14 19:38:29,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:38:29,865 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-14 19:38:29,866 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:38:29,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-14 19:38:29,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-12-14 19:38:29,866 INFO L87 Difference]: Start difference. First operand 355 states and 509 transitions. Second operand has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 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 19:38:30,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:38:30,373 INFO L93 Difference]: Finished difference Result 615 states and 802 transitions. [2021-12-14 19:38:30,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-12-14 19:38:30,373 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 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 26 [2021-12-14 19:38:30,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:38:30,375 INFO L225 Difference]: With dead ends: 615 [2021-12-14 19:38:30,375 INFO L226 Difference]: Without dead ends: 615 [2021-12-14 19:38:30,375 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=350, Unknown=0, NotChecked=0, Total=462 [2021-12-14 19:38:30,375 INFO L933 BasicCegarLoop]: 161 mSDtfsCounter, 445 mSDsluCounter, 1097 mSDsCounter, 0 mSdLazyCounter, 758 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 445 SdHoareTripleChecker+Valid, 1258 SdHoareTripleChecker+Invalid, 793 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 758 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-14 19:38:30,375 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [445 Valid, 1258 Invalid, 793 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 758 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-14 19:38:30,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2021-12-14 19:38:30,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 440. [2021-12-14 19:38:30,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 440 states, 379 states have (on average 1.7097625329815302) internal successors, (648), 439 states have internal predecessors, (648), 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 19:38:30,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 648 transitions. [2021-12-14 19:38:30,381 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 648 transitions. Word has length 26 [2021-12-14 19:38:30,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:38:30,381 INFO L470 AbstractCegarLoop]: Abstraction has 440 states and 648 transitions. [2021-12-14 19:38:30,381 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 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 19:38:30,382 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 648 transitions. [2021-12-14 19:38:30,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-14 19:38:30,382 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:38:30,382 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:38:30,382 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-12-14 19:38:30,382 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-14 19:38:30,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:38:30,383 INFO L85 PathProgramCache]: Analyzing trace with hash -645242845, now seen corresponding path program 1 times [2021-12-14 19:38:30,383 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:38:30,383 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108875190] [2021-12-14 19:38:30,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:38:30,383 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:38:30,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:38:30,474 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:38:30,475 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:38:30,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108875190] [2021-12-14 19:38:30,475 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108875190] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:38:30,475 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:38:30,475 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-14 19:38:30,477 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560742797] [2021-12-14 19:38:30,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:38:30,477 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-14 19:38:30,477 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:38:30,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-14 19:38:30,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-12-14 19:38:30,478 INFO L87 Difference]: Start difference. First operand 440 states and 648 transitions. Second operand has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 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 19:38:30,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:38:30,885 INFO L93 Difference]: Finished difference Result 575 states and 752 transitions. [2021-12-14 19:38:30,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-14 19:38:30,885 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 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 26 [2021-12-14 19:38:30,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:38:30,887 INFO L225 Difference]: With dead ends: 575 [2021-12-14 19:38:30,887 INFO L226 Difference]: Without dead ends: 575 [2021-12-14 19:38:30,887 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2021-12-14 19:38:30,888 INFO L933 BasicCegarLoop]: 164 mSDtfsCounter, 437 mSDsluCounter, 763 mSDsCounter, 0 mSdLazyCounter, 550 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 437 SdHoareTripleChecker+Valid, 927 SdHoareTripleChecker+Invalid, 588 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 550 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-14 19:38:30,888 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [437 Valid, 927 Invalid, 588 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 550 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-14 19:38:30,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2021-12-14 19:38:30,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 413. [2021-12-14 19:38:30,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 413 states, 352 states have (on average 1.7159090909090908) internal successors, (604), 412 states have internal predecessors, (604), 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 19:38:30,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 604 transitions. [2021-12-14 19:38:30,893 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 604 transitions. Word has length 26 [2021-12-14 19:38:30,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:38:30,893 INFO L470 AbstractCegarLoop]: Abstraction has 413 states and 604 transitions. [2021-12-14 19:38:30,893 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 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 19:38:30,893 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 604 transitions. [2021-12-14 19:38:30,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-12-14 19:38:30,894 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:38:30,894 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:38:30,894 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-12-14 19:38:30,894 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-14 19:38:30,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:38:30,895 INFO L85 PathProgramCache]: Analyzing trace with hash -1118310097, now seen corresponding path program 1 times [2021-12-14 19:38:30,895 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:38:30,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094770821] [2021-12-14 19:38:30,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:38:30,895 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:38:30,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:38:30,963 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 19:38:30,963 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:38:30,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094770821] [2021-12-14 19:38:30,963 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094770821] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:38:30,964 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:38:30,964 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-14 19:38:30,964 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005705834] [2021-12-14 19:38:30,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:38:30,964 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-14 19:38:30,964 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:38:30,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-14 19:38:30,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-12-14 19:38:30,965 INFO L87 Difference]: Start difference. First operand 413 states and 604 transitions. Second operand has 10 states, 9 states have (on average 3.0) internal successors, (27), 10 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 19:38:31,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:38:31,372 INFO L93 Difference]: Finished difference Result 614 states and 871 transitions. [2021-12-14 19:38:31,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-14 19:38:31,372 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.0) internal successors, (27), 10 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 27 [2021-12-14 19:38:31,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:38:31,374 INFO L225 Difference]: With dead ends: 614 [2021-12-14 19:38:31,374 INFO L226 Difference]: Without dead ends: 614 [2021-12-14 19:38:31,374 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=96, Invalid=324, Unknown=0, NotChecked=0, Total=420 [2021-12-14 19:38:31,375 INFO L933 BasicCegarLoop]: 129 mSDtfsCounter, 509 mSDsluCounter, 746 mSDsCounter, 0 mSdLazyCounter, 753 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 509 SdHoareTripleChecker+Valid, 875 SdHoareTripleChecker+Invalid, 792 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 753 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-14 19:38:31,375 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [509 Valid, 875 Invalid, 792 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 753 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-14 19:38:31,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2021-12-14 19:38:31,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 422. [2021-12-14 19:38:31,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 422 states, 361 states have (on average 1.703601108033241) internal successors, (615), 421 states have internal predecessors, (615), 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 19:38:31,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 615 transitions. [2021-12-14 19:38:31,381 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 615 transitions. Word has length 27 [2021-12-14 19:38:31,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:38:31,381 INFO L470 AbstractCegarLoop]: Abstraction has 422 states and 615 transitions. [2021-12-14 19:38:31,381 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.0) internal successors, (27), 10 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 19:38:31,382 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 615 transitions. [2021-12-14 19:38:31,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-12-14 19:38:31,382 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:38:31,382 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:38:31,382 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-12-14 19:38:31,382 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-14 19:38:31,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:38:31,383 INFO L85 PathProgramCache]: Analyzing trace with hash -1118310096, now seen corresponding path program 1 times [2021-12-14 19:38:31,383 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:38:31,383 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425231267] [2021-12-14 19:38:31,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:38:31,383 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:38:31,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:38:31,495 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 19:38:31,495 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:38:31,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425231267] [2021-12-14 19:38:31,495 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425231267] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:38:31,495 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:38:31,496 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-14 19:38:31,496 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719686353] [2021-12-14 19:38:31,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:38:31,496 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-14 19:38:31,496 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:38:31,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-14 19:38:31,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-12-14 19:38:31,497 INFO L87 Difference]: Start difference. First operand 422 states and 615 transitions. Second operand has 10 states, 9 states have (on average 3.0) internal successors, (27), 10 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 19:38:32,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:38:32,017 INFO L93 Difference]: Finished difference Result 617 states and 874 transitions. [2021-12-14 19:38:32,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-14 19:38:32,026 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.0) internal successors, (27), 10 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 27 [2021-12-14 19:38:32,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:38:32,028 INFO L225 Difference]: With dead ends: 617 [2021-12-14 19:38:32,028 INFO L226 Difference]: Without dead ends: 617 [2021-12-14 19:38:32,029 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=201, Unknown=0, NotChecked=0, Total=272 [2021-12-14 19:38:32,029 INFO L933 BasicCegarLoop]: 119 mSDtfsCounter, 453 mSDsluCounter, 530 mSDsCounter, 0 mSdLazyCounter, 981 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 453 SdHoareTripleChecker+Valid, 649 SdHoareTripleChecker+Invalid, 1005 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 981 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-14 19:38:32,029 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [453 Valid, 649 Invalid, 1005 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 981 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-14 19:38:32,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2021-12-14 19:38:32,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 422. [2021-12-14 19:38:32,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 422 states, 361 states have (on average 1.700831024930748) internal successors, (614), 421 states have internal predecessors, (614), 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 19:38:32,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 614 transitions. [2021-12-14 19:38:32,036 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 614 transitions. Word has length 27 [2021-12-14 19:38:32,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:38:32,036 INFO L470 AbstractCegarLoop]: Abstraction has 422 states and 614 transitions. [2021-12-14 19:38:32,036 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.0) internal successors, (27), 10 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 19:38:32,036 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 614 transitions. [2021-12-14 19:38:32,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-12-14 19:38:32,037 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:38:32,037 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:38:32,037 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-12-14 19:38:32,037 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-14 19:38:32,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:38:32,037 INFO L85 PathProgramCache]: Analyzing trace with hash -114590158, now seen corresponding path program 1 times [2021-12-14 19:38:32,038 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:38:32,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043814893] [2021-12-14 19:38:32,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:38:32,038 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:38:32,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:38:32,059 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 19:38:32,060 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:38:32,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043814893] [2021-12-14 19:38:32,060 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043814893] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:38:32,060 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:38:32,060 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 19:38:32,060 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105222228] [2021-12-14 19:38:32,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:38:32,060 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 19:38:32,061 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:38:32,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 19:38:32,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:38:32,061 INFO L87 Difference]: Start difference. First operand 422 states and 614 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 19:38:32,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:38:32,066 INFO L93 Difference]: Finished difference Result 426 states and 618 transitions. [2021-12-14 19:38:32,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 19:38:32,067 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 27 [2021-12-14 19:38:32,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:38:32,068 INFO L225 Difference]: With dead ends: 426 [2021-12-14 19:38:32,068 INFO L226 Difference]: Without dead ends: 426 [2021-12-14 19:38:32,068 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 19:38:32,069 INFO L933 BasicCegarLoop]: 180 mSDtfsCounter, 0 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 355 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 19:38:32,069 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 355 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 19:38:32,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2021-12-14 19:38:32,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 426. [2021-12-14 19:38:32,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 426 states, 365 states have (on average 1.6931506849315068) internal successors, (618), 425 states have internal predecessors, (618), 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 19:38:32,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 618 transitions. [2021-12-14 19:38:32,074 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 618 transitions. Word has length 27 [2021-12-14 19:38:32,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:38:32,075 INFO L470 AbstractCegarLoop]: Abstraction has 426 states and 618 transitions. [2021-12-14 19:38:32,075 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 19:38:32,075 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 618 transitions. [2021-12-14 19:38:32,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-12-14 19:38:32,075 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:38:32,075 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:38:32,076 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-12-14 19:38:32,076 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-14 19:38:32,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:38:32,076 INFO L85 PathProgramCache]: Analyzing trace with hash -114649740, now seen corresponding path program 1 times [2021-12-14 19:38:32,076 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:38:32,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301512932] [2021-12-14 19:38:32,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:38:32,077 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:38:32,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:38:32,095 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 19:38:32,095 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:38:32,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301512932] [2021-12-14 19:38:32,095 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301512932] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:38:32,095 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:38:32,095 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-14 19:38:32,095 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860674784] [2021-12-14 19:38:32,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:38:32,096 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 19:38:32,096 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:38:32,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 19:38:32,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:38:32,097 INFO L87 Difference]: Start difference. First operand 426 states and 618 transitions. Second operand has 3 states, 2 states have (on average 13.5) 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 19:38:32,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:38:32,182 INFO L93 Difference]: Finished difference Result 628 states and 919 transitions. [2021-12-14 19:38:32,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 19:38:32,182 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 13.5) 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 27 [2021-12-14 19:38:32,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:38:32,184 INFO L225 Difference]: With dead ends: 628 [2021-12-14 19:38:32,184 INFO L226 Difference]: Without dead ends: 628 [2021-12-14 19:38:32,184 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:38:32,184 INFO L933 BasicCegarLoop]: 216 mSDtfsCounter, 124 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:38:32,185 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [124 Valid, 301 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 19:38:32,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states. [2021-12-14 19:38:32,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 421. [2021-12-14 19:38:32,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 365 states have (on average 1.6794520547945206) internal successors, (613), 420 states have internal predecessors, (613), 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 19:38:32,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 613 transitions. [2021-12-14 19:38:32,194 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 613 transitions. Word has length 27 [2021-12-14 19:38:32,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:38:32,194 INFO L470 AbstractCegarLoop]: Abstraction has 421 states and 613 transitions. [2021-12-14 19:38:32,195 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 13.5) 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 19:38:32,195 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 613 transitions. [2021-12-14 19:38:32,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-12-14 19:38:32,196 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:38:32,196 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:38:32,196 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-12-14 19:38:32,196 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr39REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-14 19:38:32,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:38:32,196 INFO L85 PathProgramCache]: Analyzing trace with hash -114649739, now seen corresponding path program 1 times [2021-12-14 19:38:32,197 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:38:32,197 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515732366] [2021-12-14 19:38:32,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:38:32,197 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:38:32,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:38:32,227 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 19:38:32,227 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:38:32,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515732366] [2021-12-14 19:38:32,228 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515732366] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:38:32,228 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:38:32,228 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-14 19:38:32,228 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74966159] [2021-12-14 19:38:32,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:38:32,228 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 19:38:32,228 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:38:32,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 19:38:32,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:38:32,229 INFO L87 Difference]: Start difference. First operand 421 states and 613 transitions. Second operand has 3 states, 2 states have (on average 13.5) 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 19:38:32,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:38:32,301 INFO L93 Difference]: Finished difference Result 419 states and 611 transitions. [2021-12-14 19:38:32,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 19:38:32,302 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 13.5) 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 27 [2021-12-14 19:38:32,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:38:32,303 INFO L225 Difference]: With dead ends: 419 [2021-12-14 19:38:32,303 INFO L226 Difference]: Without dead ends: 419 [2021-12-14 19:38:32,303 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:38:32,304 INFO L933 BasicCegarLoop]: 167 mSDtfsCounter, 5 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:38:32,305 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 253 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 19:38:32,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2021-12-14 19:38:32,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 419. [2021-12-14 19:38:32,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 419 states, 365 states have (on average 1.673972602739726) internal successors, (611), 418 states have internal predecessors, (611), 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 19:38:32,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 611 transitions. [2021-12-14 19:38:32,310 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 611 transitions. Word has length 27 [2021-12-14 19:38:32,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:38:32,311 INFO L470 AbstractCegarLoop]: Abstraction has 419 states and 611 transitions. [2021-12-14 19:38:32,311 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 13.5) 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 19:38:32,311 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 611 transitions. [2021-12-14 19:38:32,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-12-14 19:38:32,312 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:38:32,312 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] [2021-12-14 19:38:32,312 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-12-14 19:38:32,312 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-14 19:38:32,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:38:32,313 INFO L85 PathProgramCache]: Analyzing trace with hash -127169272, now seen corresponding path program 1 times [2021-12-14 19:38:32,313 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:38:32,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325038563] [2021-12-14 19:38:32,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:38:32,313 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:38:32,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:38:32,404 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:38:32,404 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:38:32,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325038563] [2021-12-14 19:38:32,404 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325038563] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:38:32,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1736640502] [2021-12-14 19:38:32,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:38:32,404 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:38:32,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:38:32,405 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 19:38:32,406 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 19:38:32,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:38:32,503 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 17 conjunts are in the unsatisfiable core [2021-12-14 19:38:32,504 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:38:32,530 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-14 19:38:32,530 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 11 treesize of output 11 [2021-12-14 19:38:32,553 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 26 treesize of output 28 [2021-12-14 19:38:32,556 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 35 [2021-12-14 19:38:32,569 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 17 [2021-12-14 19:38:32,573 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 32 treesize of output 14 [2021-12-14 19:38:32,575 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:38:32,576 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:38:32,594 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_942 (Array Int Int)) (v_ArrVal_941 (Array Int Int))) (let ((.cse0 (+ 8 |c_ULTIMATE.start_main_~tree~0#1.offset|))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_942) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse0) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_941) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse0))))) (forall ((v_ArrVal_942 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_942) |c_ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~tree~0#1.offset|))))) is different from false [2021-12-14 19:38:32,607 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:38:32,607 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 46 treesize of output 50 [2021-12-14 19:38:32,658 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 53 treesize of output 47 [2021-12-14 19:38:32,662 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 71 treesize of output 53 [2021-12-14 19:38:32,665 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 45 treesize of output 41 [2021-12-14 19:38:32,667 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 41 treesize of output 37 [2021-12-14 19:38:32,669 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 37 treesize of output 33 [2021-12-14 19:38:32,700 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2021-12-14 19:38:32,701 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1736640502] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 19:38:32,701 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 19:38:32,701 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 10 [2021-12-14 19:38:32,701 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219510529] [2021-12-14 19:38:32,701 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 19:38:32,702 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-14 19:38:32,702 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:38:32,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-14 19:38:32,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=69, Unknown=1, NotChecked=16, Total=110 [2021-12-14 19:38:32,702 INFO L87 Difference]: Start difference. First operand 419 states and 611 transitions. Second operand has 11 states, 10 states have (on average 4.0) internal successors, (40), 11 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:38:33,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:38:33,166 INFO L93 Difference]: Finished difference Result 880 states and 1268 transitions. [2021-12-14 19:38:33,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-14 19:38:33,166 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.0) internal successors, (40), 11 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2021-12-14 19:38:33,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:38:33,169 INFO L225 Difference]: With dead ends: 880 [2021-12-14 19:38:33,169 INFO L226 Difference]: Without dead ends: 880 [2021-12-14 19:38:33,169 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=176, Unknown=1, NotChecked=28, Total=272 [2021-12-14 19:38:33,169 INFO L933 BasicCegarLoop]: 219 mSDtfsCounter, 330 mSDsluCounter, 1004 mSDsCounter, 0 mSdLazyCounter, 831 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 330 SdHoareTripleChecker+Valid, 1223 SdHoareTripleChecker+Invalid, 1319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 831 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 473 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-14 19:38:33,169 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [330 Valid, 1223 Invalid, 1319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 831 Invalid, 0 Unknown, 473 Unchecked, 0.4s Time] [2021-12-14 19:38:33,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 880 states. [2021-12-14 19:38:33,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 880 to 412. [2021-12-14 19:38:33,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 412 states, 359 states have (on average 1.682451253481894) internal successors, (604), 411 states have internal predecessors, (604), 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 19:38:33,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 604 transitions. [2021-12-14 19:38:33,176 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 604 transitions. Word has length 28 [2021-12-14 19:38:33,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:38:33,176 INFO L470 AbstractCegarLoop]: Abstraction has 412 states and 604 transitions. [2021-12-14 19:38:33,177 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.0) internal successors, (40), 11 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:38:33,177 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 604 transitions. [2021-12-14 19:38:33,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-12-14 19:38:33,177 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:38:33,177 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:38:33,209 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 19:38:33,385 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:38:33,385 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-14 19:38:33,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:38:33,385 INFO L85 PathProgramCache]: Analyzing trace with hash -287836000, now seen corresponding path program 1 times [2021-12-14 19:38:33,385 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:38:33,385 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027996787] [2021-12-14 19:38:33,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:38:33,386 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:38:33,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:38:33,438 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:38:33,438 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:38:33,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027996787] [2021-12-14 19:38:33,438 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027996787] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:38:33,438 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:38:33,439 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 19:38:33,439 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17567952] [2021-12-14 19:38:33,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:38:33,439 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 19:38:33,439 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:38:33,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 19:38:33,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-14 19:38:33,440 INFO L87 Difference]: Start difference. First operand 412 states and 604 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 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 19:38:33,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:38:33,619 INFO L93 Difference]: Finished difference Result 519 states and 766 transitions. [2021-12-14 19:38:33,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 19:38:33,620 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 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 19:38:33,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:38:33,621 INFO L225 Difference]: With dead ends: 519 [2021-12-14 19:38:33,621 INFO L226 Difference]: Without dead ends: 519 [2021-12-14 19:38:33,622 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2021-12-14 19:38:33,622 INFO L933 BasicCegarLoop]: 140 mSDtfsCounter, 66 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 513 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 19:38:33,622 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [66 Valid, 513 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 318 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 19:38:33,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2021-12-14 19:38:33,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 421. [2021-12-14 19:38:33,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 368 states have (on average 1.673913043478261) internal successors, (616), 420 states have internal predecessors, (616), 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 19:38:33,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 616 transitions. [2021-12-14 19:38:33,627 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 616 transitions. Word has length 28 [2021-12-14 19:38:33,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:38:33,627 INFO L470 AbstractCegarLoop]: Abstraction has 421 states and 616 transitions. [2021-12-14 19:38:33,628 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 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 19:38:33,628 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 616 transitions. [2021-12-14 19:38:33,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-12-14 19:38:33,628 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:38:33,628 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:38:33,628 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-12-14 19:38:33,628 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-14 19:38:33,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:38:33,628 INFO L85 PathProgramCache]: Analyzing trace with hash -287651302, now seen corresponding path program 1 times [2021-12-14 19:38:33,628 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:38:33,629 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254511419] [2021-12-14 19:38:33,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:38:33,629 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:38:33,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:38:33,743 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:38:33,744 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:38:33,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254511419] [2021-12-14 19:38:33,744 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254511419] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:38:33,744 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:38:33,744 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-14 19:38:33,744 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359538958] [2021-12-14 19:38:33,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:38:33,745 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-14 19:38:33,745 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:38:33,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-14 19:38:33,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2021-12-14 19:38:33,745 INFO L87 Difference]: Start difference. First operand 421 states and 616 transitions. Second operand has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 states have internal predecessors, (28), 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 19:38:34,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:38:34,163 INFO L93 Difference]: Finished difference Result 547 states and 761 transitions. [2021-12-14 19:38:34,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-14 19:38:34,163 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 states have internal predecessors, (28), 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 19:38:34,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:38:34,164 INFO L225 Difference]: With dead ends: 547 [2021-12-14 19:38:34,164 INFO L226 Difference]: Without dead ends: 547 [2021-12-14 19:38:34,165 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=96, Invalid=284, Unknown=0, NotChecked=0, Total=380 [2021-12-14 19:38:34,165 INFO L933 BasicCegarLoop]: 126 mSDtfsCounter, 265 mSDsluCounter, 757 mSDsCounter, 0 mSdLazyCounter, 714 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 883 SdHoareTripleChecker+Invalid, 757 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 714 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-14 19:38:34,165 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [265 Valid, 883 Invalid, 757 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 714 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-14 19:38:34,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2021-12-14 19:38:34,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 380. [2021-12-14 19:38:34,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 380 states, 327 states have (on average 1.657492354740061) internal successors, (542), 379 states have internal predecessors, (542), 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 19:38:34,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 542 transitions. [2021-12-14 19:38:34,170 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 542 transitions. Word has length 28 [2021-12-14 19:38:34,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:38:34,170 INFO L470 AbstractCegarLoop]: Abstraction has 380 states and 542 transitions. [2021-12-14 19:38:34,170 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 states have internal predecessors, (28), 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 19:38:34,170 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 542 transitions. [2021-12-14 19:38:34,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-12-14 19:38:34,171 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:38:34,171 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:38:34,171 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-12-14 19:38:34,171 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr97ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-14 19:38:34,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:38:34,172 INFO L85 PathProgramCache]: Analyzing trace with hash 485465518, now seen corresponding path program 1 times [2021-12-14 19:38:34,172 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:38:34,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455017703] [2021-12-14 19:38:34,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:38:34,172 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:38:34,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:38:34,245 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 19:38:34,246 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:38:34,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455017703] [2021-12-14 19:38:34,246 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455017703] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:38:34,246 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:38:34,246 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-14 19:38:34,246 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108241621] [2021-12-14 19:38:34,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:38:34,247 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-14 19:38:34,247 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:38:34,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-14 19:38:34,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-12-14 19:38:34,247 INFO L87 Difference]: Start difference. First operand 380 states and 542 transitions. Second operand has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 10 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 19:38:34,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:38:34,632 INFO L93 Difference]: Finished difference Result 546 states and 760 transitions. [2021-12-14 19:38:34,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-14 19:38:34,632 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 10 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) Word has length 30 [2021-12-14 19:38:34,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:38:34,634 INFO L225 Difference]: With dead ends: 546 [2021-12-14 19:38:34,634 INFO L226 Difference]: Without dead ends: 546 [2021-12-14 19:38:34,634 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=290, Unknown=0, NotChecked=0, Total=380 [2021-12-14 19:38:34,634 INFO L933 BasicCegarLoop]: 126 mSDtfsCounter, 407 mSDsluCounter, 521 mSDsCounter, 0 mSdLazyCounter, 537 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 407 SdHoareTripleChecker+Valid, 647 SdHoareTripleChecker+Invalid, 585 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 537 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-14 19:38:34,635 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [407 Valid, 647 Invalid, 585 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 537 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-14 19:38:34,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2021-12-14 19:38:34,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 383. [2021-12-14 19:38:34,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 383 states, 330 states have (on average 1.6545454545454545) internal successors, (546), 382 states have internal predecessors, (546), 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 19:38:34,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 546 transitions. [2021-12-14 19:38:34,640 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 546 transitions. Word has length 30 [2021-12-14 19:38:34,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:38:34,640 INFO L470 AbstractCegarLoop]: Abstraction has 383 states and 546 transitions. [2021-12-14 19:38:34,640 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 10 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 19:38:34,640 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 546 transitions. [2021-12-14 19:38:34,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-12-14 19:38:34,640 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:38:34,640 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:38:34,641 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-12-14 19:38:34,641 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr84REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-14 19:38:34,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:38:34,641 INFO L85 PathProgramCache]: Analyzing trace with hash 485466609, now seen corresponding path program 1 times [2021-12-14 19:38:34,641 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:38:34,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847968404] [2021-12-14 19:38:34,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:38:34,642 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:38:34,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:38:34,665 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 19:38:34,665 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:38:34,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847968404] [2021-12-14 19:38:34,665 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847968404] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:38:34,665 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:38:34,665 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-14 19:38:34,665 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354647105] [2021-12-14 19:38:34,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:38:34,666 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-14 19:38:34,666 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:38:34,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 19:38:34,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-14 19:38:34,667 INFO L87 Difference]: Start difference. First operand 383 states and 546 transitions. Second operand has 5 states, 4 states have (on average 7.5) internal successors, (30), 5 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 19:38:34,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:38:34,809 INFO L93 Difference]: Finished difference Result 382 states and 542 transitions. [2021-12-14 19:38:34,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-14 19:38:34,810 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.5) internal successors, (30), 5 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) Word has length 30 [2021-12-14 19:38:34,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:38:34,811 INFO L225 Difference]: With dead ends: 382 [2021-12-14 19:38:34,811 INFO L226 Difference]: Without dead ends: 382 [2021-12-14 19:38:34,811 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-14 19:38:34,811 INFO L933 BasicCegarLoop]: 155 mSDtfsCounter, 25 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:38:34,811 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 384 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 19:38:34,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2021-12-14 19:38:34,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 382. [2021-12-14 19:38:34,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 382 states, 330 states have (on average 1.6424242424242423) internal successors, (542), 381 states have internal predecessors, (542), 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 19:38:34,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 542 transitions. [2021-12-14 19:38:34,815 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 542 transitions. Word has length 30 [2021-12-14 19:38:34,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:38:34,815 INFO L470 AbstractCegarLoop]: Abstraction has 382 states and 542 transitions. [2021-12-14 19:38:34,815 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.5) internal successors, (30), 5 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 19:38:34,816 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 542 transitions. [2021-12-14 19:38:34,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-12-14 19:38:34,816 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:38:34,816 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:38:34,816 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-12-14 19:38:34,816 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr85REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-14 19:38:34,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:38:34,816 INFO L85 PathProgramCache]: Analyzing trace with hash 485466610, now seen corresponding path program 1 times [2021-12-14 19:38:34,816 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:38:34,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176705821] [2021-12-14 19:38:34,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:38:34,816 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:38:34,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:38:34,860 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 19:38:34,860 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:38:34,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176705821] [2021-12-14 19:38:34,860 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176705821] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:38:34,860 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:38:34,860 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-14 19:38:34,860 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234679003] [2021-12-14 19:38:34,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:38:34,861 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-14 19:38:34,861 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:38:34,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 19:38:34,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-14 19:38:34,861 INFO L87 Difference]: Start difference. First operand 382 states and 542 transitions. Second operand has 5 states, 4 states have (on average 7.5) internal successors, (30), 5 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 19:38:35,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:38:35,026 INFO L93 Difference]: Finished difference Result 381 states and 538 transitions. [2021-12-14 19:38:35,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-14 19:38:35,027 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.5) internal successors, (30), 5 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) Word has length 30 [2021-12-14 19:38:35,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:38:35,028 INFO L225 Difference]: With dead ends: 381 [2021-12-14 19:38:35,028 INFO L226 Difference]: Without dead ends: 381 [2021-12-14 19:38:35,028 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-14 19:38:35,028 INFO L933 BasicCegarLoop]: 152 mSDtfsCounter, 33 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:38:35,028 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 365 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 19:38:35,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2021-12-14 19:38:35,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 381. [2021-12-14 19:38:35,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 330 states have (on average 1.6303030303030304) internal successors, (538), 380 states have internal predecessors, (538), 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 19:38:35,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 538 transitions. [2021-12-14 19:38:35,033 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 538 transitions. Word has length 30 [2021-12-14 19:38:35,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:38:35,033 INFO L470 AbstractCegarLoop]: Abstraction has 381 states and 538 transitions. [2021-12-14 19:38:35,033 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.5) internal successors, (30), 5 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 19:38:35,033 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 538 transitions. [2021-12-14 19:38:35,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-12-14 19:38:35,034 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:38:35,034 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:38:35,034 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-12-14 19:38:35,034 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-14 19:38:35,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:38:35,034 INFO L85 PathProgramCache]: Analyzing trace with hash -1031290720, now seen corresponding path program 1 times [2021-12-14 19:38:35,034 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:38:35,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995430028] [2021-12-14 19:38:35,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:38:35,035 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:38:35,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:38:35,066 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 19:38:35,067 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:38:35,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995430028] [2021-12-14 19:38:35,067 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995430028] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:38:35,067 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:38:35,067 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 19:38:35,067 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057810303] [2021-12-14 19:38:35,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:38:35,068 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-14 19:38:35,068 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:38:35,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-14 19:38:35,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-14 19:38:35,068 INFO L87 Difference]: Start difference. First operand 381 states and 538 transitions. Second operand has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 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 19:38:35,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:38:35,241 INFO L93 Difference]: Finished difference Result 800 states and 1167 transitions. [2021-12-14 19:38:35,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-14 19:38:35,241 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 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) Word has length 30 [2021-12-14 19:38:35,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:38:35,243 INFO L225 Difference]: With dead ends: 800 [2021-12-14 19:38:35,243 INFO L226 Difference]: Without dead ends: 800 [2021-12-14 19:38:35,244 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-14 19:38:35,244 INFO L933 BasicCegarLoop]: 197 mSDtfsCounter, 198 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 19:38:35,244 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [198 Valid, 367 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 19:38:35,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2021-12-14 19:38:35,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 378. [2021-12-14 19:38:35,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 378 states, 330 states have (on average 1.621212121212121) internal successors, (535), 377 states have internal predecessors, (535), 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 19:38:35,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 535 transitions. [2021-12-14 19:38:35,250 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 535 transitions. Word has length 30 [2021-12-14 19:38:35,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:38:35,250 INFO L470 AbstractCegarLoop]: Abstraction has 378 states and 535 transitions. [2021-12-14 19:38:35,250 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 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 19:38:35,250 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 535 transitions. [2021-12-14 19:38:35,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-12-14 19:38:35,251 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:38:35,251 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:38:35,251 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-12-14 19:38:35,251 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr98ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-14 19:38:35,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:38:35,252 INFO L85 PathProgramCache]: Analyzing trace with hash -2130437780, now seen corresponding path program 1 times [2021-12-14 19:38:35,252 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:38:35,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942894758] [2021-12-14 19:38:35,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:38:35,252 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:38:35,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:38:35,308 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 19:38:35,308 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:38:35,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942894758] [2021-12-14 19:38:35,308 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942894758] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:38:35,309 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:38:35,309 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-14 19:38:35,309 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937521005] [2021-12-14 19:38:35,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:38:35,309 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-14 19:38:35,309 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:38:35,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-14 19:38:35,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-12-14 19:38:35,309 INFO L87 Difference]: Start difference. First operand 378 states and 535 transitions. Second operand has 9 states, 8 states have (on average 3.875) internal successors, (31), 9 states have internal predecessors, (31), 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 19:38:35,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:38:35,664 INFO L93 Difference]: Finished difference Result 532 states and 738 transitions. [2021-12-14 19:38:35,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-14 19:38:35,664 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.875) internal successors, (31), 9 states have internal predecessors, (31), 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 31 [2021-12-14 19:38:35,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:38:35,665 INFO L225 Difference]: With dead ends: 532 [2021-12-14 19:38:35,665 INFO L226 Difference]: Without dead ends: 532 [2021-12-14 19:38:35,666 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2021-12-14 19:38:35,666 INFO L933 BasicCegarLoop]: 119 mSDtfsCounter, 251 mSDsluCounter, 650 mSDsCounter, 0 mSdLazyCounter, 733 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 769 SdHoareTripleChecker+Invalid, 761 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 733 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-14 19:38:35,666 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [251 Valid, 769 Invalid, 761 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 733 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-14 19:38:35,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2021-12-14 19:38:35,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 379. [2021-12-14 19:38:35,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 379 states, 331 states have (on average 1.6193353474320242) internal successors, (536), 378 states have internal predecessors, (536), 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 19:38:35,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 536 transitions. [2021-12-14 19:38:35,670 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 536 transitions. Word has length 31 [2021-12-14 19:38:35,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:38:35,670 INFO L470 AbstractCegarLoop]: Abstraction has 379 states and 536 transitions. [2021-12-14 19:38:35,670 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.875) internal successors, (31), 9 states have internal predecessors, (31), 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 19:38:35,671 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 536 transitions. [2021-12-14 19:38:35,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-12-14 19:38:35,671 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:38:35,671 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:38:35,671 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-12-14 19:38:35,671 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr99ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-14 19:38:35,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:38:35,671 INFO L85 PathProgramCache]: Analyzing trace with hash -1619061392, now seen corresponding path program 1 times [2021-12-14 19:38:35,671 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:38:35,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341723] [2021-12-14 19:38:35,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:38:35,672 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:38:35,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:38:35,694 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 19:38:35,695 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:38:35,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341723] [2021-12-14 19:38:35,695 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341723] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:38:35,695 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:38:35,695 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-14 19:38:35,695 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820277620] [2021-12-14 19:38:35,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:38:35,695 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-14 19:38:35,695 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:38:35,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 19:38:35,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-14 19:38:35,696 INFO L87 Difference]: Start difference. First operand 379 states and 536 transitions. Second operand has 5 states, 4 states have (on average 8.0) internal successors, (32), 5 states have internal predecessors, (32), 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 19:38:35,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:38:35,830 INFO L93 Difference]: Finished difference Result 378 states and 532 transitions. [2021-12-14 19:38:35,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-14 19:38:35,830 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.0) internal successors, (32), 5 states have internal predecessors, (32), 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 32 [2021-12-14 19:38:35,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:38:35,831 INFO L225 Difference]: With dead ends: 378 [2021-12-14 19:38:35,831 INFO L226 Difference]: Without dead ends: 378 [2021-12-14 19:38:35,832 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-14 19:38:35,832 INFO L933 BasicCegarLoop]: 150 mSDtfsCounter, 23 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:38:35,832 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 365 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 274 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 19:38:35,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2021-12-14 19:38:35,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 378. [2021-12-14 19:38:35,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 378 states, 331 states have (on average 1.607250755287009) internal successors, (532), 377 states have internal predecessors, (532), 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 19:38:35,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 532 transitions. [2021-12-14 19:38:35,836 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 532 transitions. Word has length 32 [2021-12-14 19:38:35,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:38:35,836 INFO L470 AbstractCegarLoop]: Abstraction has 378 states and 532 transitions. [2021-12-14 19:38:35,836 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.0) internal successors, (32), 5 states have internal predecessors, (32), 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 19:38:35,836 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 532 transitions. [2021-12-14 19:38:35,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-12-14 19:38:35,836 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:38:35,836 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:38:35,836 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-12-14 19:38:35,836 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr88REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-14 19:38:35,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:38:35,837 INFO L85 PathProgramCache]: Analyzing trace with hash 1381121302, now seen corresponding path program 1 times [2021-12-14 19:38:35,837 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:38:35,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642945611] [2021-12-14 19:38:35,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:38:35,837 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:38:35,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:38:35,997 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 19:38:35,997 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:38:35,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642945611] [2021-12-14 19:38:35,997 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642945611] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:38:35,997 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:38:35,998 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-12-14 19:38:35,998 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852620378] [2021-12-14 19:38:35,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:38:35,998 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-12-14 19:38:35,998 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:38:35,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-12-14 19:38:35,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2021-12-14 19:38:35,999 INFO L87 Difference]: Start difference. First operand 378 states and 532 transitions. Second operand has 16 states, 15 states have (on average 2.2) internal successors, (33), 16 states have internal predecessors, (33), 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 19:38:36,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:38:36,690 INFO L93 Difference]: Finished difference Result 666 states and 895 transitions. [2021-12-14 19:38:36,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-12-14 19:38:36,692 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.2) internal successors, (33), 16 states have internal predecessors, (33), 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 19:38:36,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:38:36,693 INFO L225 Difference]: With dead ends: 666 [2021-12-14 19:38:36,693 INFO L226 Difference]: Without dead ends: 666 [2021-12-14 19:38:36,694 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=135, Invalid=795, Unknown=0, NotChecked=0, Total=930 [2021-12-14 19:38:36,694 INFO L933 BasicCegarLoop]: 141 mSDtfsCounter, 515 mSDsluCounter, 1123 mSDsCounter, 0 mSdLazyCounter, 1372 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 515 SdHoareTripleChecker+Valid, 1264 SdHoareTripleChecker+Invalid, 1415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 1372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-14 19:38:36,694 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [515 Valid, 1264 Invalid, 1415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 1372 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-14 19:38:36,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2021-12-14 19:38:36,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 383. [2021-12-14 19:38:36,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 383 states, 336 states have (on average 1.6011904761904763) internal successors, (538), 382 states have internal predecessors, (538), 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 19:38:36,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 538 transitions. [2021-12-14 19:38:36,698 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 538 transitions. Word has length 33 [2021-12-14 19:38:36,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:38:36,698 INFO L470 AbstractCegarLoop]: Abstraction has 383 states and 538 transitions. [2021-12-14 19:38:36,698 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.2) internal successors, (33), 16 states have internal predecessors, (33), 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 19:38:36,698 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 538 transitions. [2021-12-14 19:38:36,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-12-14 19:38:36,699 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:38:36,699 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:38:36,699 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-12-14 19:38:36,699 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr89REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-14 19:38:36,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:38:36,700 INFO L85 PathProgramCache]: Analyzing trace with hash 1381121303, now seen corresponding path program 1 times [2021-12-14 19:38:36,700 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:38:36,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484878884] [2021-12-14 19:38:36,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:38:36,701 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:38:36,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:38:36,806 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 19:38:36,806 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:38:36,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484878884] [2021-12-14 19:38:36,807 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484878884] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:38:36,807 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:38:36,807 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-12-14 19:38:36,807 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687086021] [2021-12-14 19:38:36,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:38:36,807 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-14 19:38:36,808 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:38:36,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-14 19:38:36,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2021-12-14 19:38:36,809 INFO L87 Difference]: Start difference. First operand 383 states and 538 transitions. Second operand has 12 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 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 19:38:37,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:38:37,295 INFO L93 Difference]: Finished difference Result 518 states and 719 transitions. [2021-12-14 19:38:37,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-14 19:38:37,295 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 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 19:38:37,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:38:37,297 INFO L225 Difference]: With dead ends: 518 [2021-12-14 19:38:37,297 INFO L226 Difference]: Without dead ends: 518 [2021-12-14 19:38:37,297 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=410, Unknown=0, NotChecked=0, Total=506 [2021-12-14 19:38:37,297 INFO L933 BasicCegarLoop]: 125 mSDtfsCounter, 267 mSDsluCounter, 910 mSDsCounter, 0 mSdLazyCounter, 871 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 1035 SdHoareTripleChecker+Invalid, 897 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 871 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-14 19:38:37,298 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [267 Valid, 1035 Invalid, 897 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 871 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-14 19:38:37,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2021-12-14 19:38:37,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 378. [2021-12-14 19:38:37,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 378 states, 331 states have (on average 1.6042296072507554) internal successors, (531), 377 states have internal predecessors, (531), 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 19:38:37,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 531 transitions. [2021-12-14 19:38:37,302 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 531 transitions. Word has length 33 [2021-12-14 19:38:37,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:38:37,302 INFO L470 AbstractCegarLoop]: Abstraction has 378 states and 531 transitions. [2021-12-14 19:38:37,302 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 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 19:38:37,302 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 531 transitions. [2021-12-14 19:38:37,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-12-14 19:38:37,303 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:38:37,303 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:38:37,303 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-12-14 19:38:37,303 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr101ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-14 19:38:37,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:38:37,303 INFO L85 PathProgramCache]: Analyzing trace with hash -1139825358, now seen corresponding path program 1 times [2021-12-14 19:38:37,304 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:38:37,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051214764] [2021-12-14 19:38:37,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:38:37,304 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:38:37,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:38:37,327 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 19:38:37,327 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:38:37,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051214764] [2021-12-14 19:38:37,327 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051214764] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:38:37,328 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:38:37,328 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 19:38:37,328 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635058587] [2021-12-14 19:38:37,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:38:37,328 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-14 19:38:37,328 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:38:37,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-14 19:38:37,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-14 19:38:37,329 INFO L87 Difference]: Start difference. First operand 378 states and 531 transitions. Second operand has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 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 19:38:37,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:38:37,447 INFO L93 Difference]: Finished difference Result 535 states and 669 transitions. [2021-12-14 19:38:37,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-14 19:38:37,448 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 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 34 [2021-12-14 19:38:37,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:38:37,449 INFO L225 Difference]: With dead ends: 535 [2021-12-14 19:38:37,449 INFO L226 Difference]: Without dead ends: 535 [2021-12-14 19:38:37,449 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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 19:38:37,449 INFO L933 BasicCegarLoop]: 160 mSDtfsCounter, 326 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 326 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:38:37,449 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [326 Valid, 336 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 19:38:37,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2021-12-14 19:38:37,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 400. [2021-12-14 19:38:37,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 400 states, 353 states have (on average 1.6203966005665722) internal successors, (572), 399 states have internal predecessors, (572), 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 19:38:37,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 572 transitions. [2021-12-14 19:38:37,454 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 572 transitions. Word has length 34 [2021-12-14 19:38:37,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:38:37,454 INFO L470 AbstractCegarLoop]: Abstraction has 400 states and 572 transitions. [2021-12-14 19:38:37,454 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 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 19:38:37,454 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 572 transitions. [2021-12-14 19:38:37,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-12-14 19:38:37,455 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:38:37,455 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:38:37,455 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2021-12-14 19:38:37,455 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr49REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-14 19:38:37,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:38:37,455 INFO L85 PathProgramCache]: Analyzing trace with hash -1046400092, now seen corresponding path program 1 times [2021-12-14 19:38:37,455 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:38:37,455 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127634264] [2021-12-14 19:38:37,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:38:37,456 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:38:37,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:38:37,500 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 19:38:37,501 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:38:37,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127634264] [2021-12-14 19:38:37,501 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127634264] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:38:37,501 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:38:37,501 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-14 19:38:37,501 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116155035] [2021-12-14 19:38:37,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:38:37,501 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-14 19:38:37,501 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:38:37,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 19:38:37,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-14 19:38:37,502 INFO L87 Difference]: Start difference. First operand 400 states and 572 transitions. Second operand has 5 states, 4 states have (on average 8.5) internal successors, (34), 5 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 19:38:37,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:38:37,627 INFO L93 Difference]: Finished difference Result 399 states and 571 transitions. [2021-12-14 19:38:37,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 19:38:37,627 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.5) internal successors, (34), 5 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 34 [2021-12-14 19:38:37,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:38:37,628 INFO L225 Difference]: With dead ends: 399 [2021-12-14 19:38:37,628 INFO L226 Difference]: Without dead ends: 399 [2021-12-14 19:38:37,628 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-14 19:38:37,629 INFO L933 BasicCegarLoop]: 161 mSDtfsCounter, 5 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:38:37,629 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 409 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 19:38:37,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2021-12-14 19:38:37,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 399. [2021-12-14 19:38:37,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 399 states, 353 states have (on average 1.6175637393767706) internal successors, (571), 398 states have internal predecessors, (571), 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 19:38:37,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 571 transitions. [2021-12-14 19:38:37,633 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 571 transitions. Word has length 34 [2021-12-14 19:38:37,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:38:37,633 INFO L470 AbstractCegarLoop]: Abstraction has 399 states and 571 transitions. [2021-12-14 19:38:37,633 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.5) internal successors, (34), 5 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 19:38:37,633 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 571 transitions. [2021-12-14 19:38:37,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-12-14 19:38:37,633 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:38:37,633 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:38:37,634 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2021-12-14 19:38:37,634 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr48REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-14 19:38:37,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:38:37,634 INFO L85 PathProgramCache]: Analyzing trace with hash -1046400093, now seen corresponding path program 1 times [2021-12-14 19:38:37,634 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:38:37,634 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344426496] [2021-12-14 19:38:37,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:38:37,634 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:38:37,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:38:37,660 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 19:38:37,660 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:38:37,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344426496] [2021-12-14 19:38:37,660 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344426496] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:38:37,660 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:38:37,660 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-14 19:38:37,660 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065022837] [2021-12-14 19:38:37,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:38:37,660 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-14 19:38:37,660 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:38:37,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 19:38:37,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-14 19:38:37,661 INFO L87 Difference]: Start difference. First operand 399 states and 571 transitions. Second operand has 5 states, 4 states have (on average 8.5) internal successors, (34), 5 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 19:38:37,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:38:37,764 INFO L93 Difference]: Finished difference Result 398 states and 570 transitions. [2021-12-14 19:38:37,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 19:38:37,764 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.5) internal successors, (34), 5 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 34 [2021-12-14 19:38:37,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:38:37,765 INFO L225 Difference]: With dead ends: 398 [2021-12-14 19:38:37,765 INFO L226 Difference]: Without dead ends: 398 [2021-12-14 19:38:37,766 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-14 19:38:37,766 INFO L933 BasicCegarLoop]: 161 mSDtfsCounter, 3 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:38:37,766 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 439 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 19:38:37,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2021-12-14 19:38:37,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 398. [2021-12-14 19:38:37,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 398 states, 353 states have (on average 1.614730878186969) internal successors, (570), 397 states have internal predecessors, (570), 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 19:38:37,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 570 transitions. [2021-12-14 19:38:37,770 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 570 transitions. Word has length 34 [2021-12-14 19:38:37,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:38:37,770 INFO L470 AbstractCegarLoop]: Abstraction has 398 states and 570 transitions. [2021-12-14 19:38:37,770 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.5) internal successors, (34), 5 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 19:38:37,770 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 570 transitions. [2021-12-14 19:38:37,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-12-14 19:38:37,770 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:38:37,770 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:38:37,770 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2021-12-14 19:38:37,770 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-14 19:38:37,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:38:37,771 INFO L85 PathProgramCache]: Analyzing trace with hash 191313679, now seen corresponding path program 1 times [2021-12-14 19:38:37,771 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:38:37,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083484826] [2021-12-14 19:38:37,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:38:37,771 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:38:37,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:38:37,912 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:38:37,912 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:38:37,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083484826] [2021-12-14 19:38:37,913 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083484826] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:38:37,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [255994419] [2021-12-14 19:38:37,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:38:37,913 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:38:37,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:38:37,914 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 19:38:37,915 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 19:38:38,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:38:38,044 INFO L263 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 68 conjunts are in the unsatisfiable core [2021-12-14 19:38:38,046 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:38:38,053 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 19:38:38,076 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-14 19:38:38,079 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-14 19:38:38,102 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:38:38,102 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 21 treesize of output 20 [2021-12-14 19:38:38,107 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:38:38,108 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 21 treesize of output 20 [2021-12-14 19:38:38,143 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-14 19:38:38,143 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 11 treesize of output 11 [2021-12-14 19:38:38,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:38:38,179 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:38:38,180 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:38:38,181 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 30 treesize of output 32 [2021-12-14 19:38:38,188 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:38:38,189 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:38:38,190 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:38:38,191 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2021-12-14 19:38:38,308 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 19:38:38,308 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2021-12-14 19:38:38,312 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 36 [2021-12-14 19:38:38,374 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-14 19:38:38,375 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 11 treesize of output 11 [2021-12-14 19:38:38,506 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 44 treesize of output 40 [2021-12-14 19:38:38,511 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 30 [2021-12-14 19:38:38,649 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 19:38:38,649 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2021-12-14 19:38:38,653 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 36 [2021-12-14 19:38:38,833 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2021-12-14 19:38:38,904 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:38:38,904 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:38:39,108 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1487 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1487) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|))) (or (and (= .cse0 0) (forall ((v_ArrVal_1488 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1488) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|) 0))) (= (select |c_#valid| .cse0) 1)))) is different from false [2021-12-14 19:38:39,125 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1487 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~tree~0#1.offset|)) v_ArrVal_1487) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|))) (or (= (select |c_#valid| .cse0) 1) (and (= .cse0 0) (forall ((v_ArrVal_1488 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~tree~0#1.offset|)) v_ArrVal_1488) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|) 0)))))) is different from false [2021-12-14 19:38:39,165 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1487 (Array Int Int)) (v_ArrVal_1486 (Array Int Int))) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_1486))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~tree~0#1.offset|)) v_ArrVal_1487)) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|))) (or (= (select |c_#valid| .cse0) 1) (and (forall ((v_ArrVal_1488 (Array Int Int)) (v_ArrVal_1485 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_1485) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_1486) |c_ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~tree~0#1.offset|)) v_ArrVal_1488) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|) 0)) (= .cse0 0))))) is different from false [2021-12-14 19:38:39,175 INFO L354 Elim1Store]: treesize reduction 5, result has 81.5 percent of original size [2021-12-14 19:38:39,176 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 31 treesize of output 30 [2021-12-14 19:38:39,193 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1487 (Array Int Int)) (v_ArrVal_1486 (Array Int Int))) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_1486))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~tree~0#1.offset|)) v_ArrVal_1487)) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|))) (or (= .cse0 |c_ULTIMATE.start_main_#t~mem9#1.base|) (and (forall ((v_ArrVal_1488 (Array Int Int)) (v_ArrVal_1485 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_1485) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_1486) |c_ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~tree~0#1.offset|)) v_ArrVal_1488) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|) 0)) (= .cse0 0))))) is different from false [2021-12-14 19:38:39,212 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1487 (Array Int Int)) (v_ArrVal_1486 (Array Int Int))) (let ((.cse1 (+ 8 |c_ULTIMATE.start_main_~tree~0#1.offset|))) (let ((.cse0 (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_1486))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1) v_ArrVal_1487)) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|))) (or (= .cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1)) (and (forall ((v_ArrVal_1488 (Array Int Int)) (v_ArrVal_1485 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_1485) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_1486) |c_ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~tree~0#1.offset|)) v_ArrVal_1488) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|) 0)) (= .cse0 0)))))) is different from false [2021-12-14 19:38:39,839 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-14 19:38:39,840 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 13 treesize of output 12 [2021-12-14 19:38:39,905 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1487 (Array Int Int)) (v_ArrVal_1486 (Array Int Int)) (|v_ULTIMATE.start_main_~tmpList~0#1.base_28| Int) (v_ArrVal_1484 (Array Int Int))) (let ((.cse3 (+ 8 |c_ULTIMATE.start_main_~tree~0#1.offset|))) (let ((.cse2 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tree~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tree~0#1.base|) .cse3 |c_ULTIMATE.start_main_#t~malloc4#1.base|)) |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_1484))) (let ((.cse0 (select (select (let ((.cse4 (store .cse2 |v_ULTIMATE.start_main_~tmpList~0#1.base_28| v_ArrVal_1486))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse3) v_ArrVal_1487)) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|))) (or (= |v_ULTIMATE.start_main_~tmpList~0#1.base_28| |c_ULTIMATE.start_main_~tree~0#1.base|) (and (= 0 .cse0) (forall ((v_ArrVal_1488 (Array Int Int)) (v_ArrVal_1485 (Array Int Int)) (v_ArrVal_1483 (Array Int Int))) (= (select (select (let ((.cse1 (+ 8 |c_ULTIMATE.start_main_~tree~0#1.offset|))) (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tree~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1 |c_ULTIMATE.start_main_#t~malloc4#1.offset|)) |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_1483) |v_ULTIMATE.start_main_~tmpList~0#1.base_28| v_ArrVal_1485) (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tree~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1 |c_ULTIMATE.start_main_#t~malloc4#1.base|)) |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_1484) |v_ULTIMATE.start_main_~tmpList~0#1.base_28| v_ArrVal_1486) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1) v_ArrVal_1488)) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|) 0))) (= (select (select .cse2 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse3) .cse0)))))) is different from false [2021-12-14 19:38:40,555 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1487 (Array Int Int)) (v_ArrVal_1486 (Array Int Int)) (|v_ULTIMATE.start_main_~tmpList~0#1.base_28| Int) (v_ArrVal_1484 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc4#1.base_12| Int)) (let ((.cse2 (+ 8 |c_ULTIMATE.start_main_~tree~0#1.offset|))) (let ((.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tree~0#1.base| (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tree~0#1.base|) (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 4) 0) .cse2 |v_ULTIMATE.start_main_#t~malloc4#1.base_12|)) |v_ULTIMATE.start_main_#t~malloc4#1.base_12| v_ArrVal_1484))) (let ((.cse0 (select (select (let ((.cse5 (store .cse1 |v_ULTIMATE.start_main_~tmpList~0#1.base_28| v_ArrVal_1486))) (store .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse2) v_ArrVal_1487)) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|))) (or (= .cse0 (select (select .cse1 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse2)) (= |v_ULTIMATE.start_main_~tmpList~0#1.base_28| |c_ULTIMATE.start_main_~tree~0#1.base|) (and (= .cse0 0) (forall ((v_ArrVal_1488 (Array Int Int)) (v_ArrVal_1485 (Array Int Int)) (v_ArrVal_1483 (Array Int Int))) (= (select (select (let ((.cse3 (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 4)) (.cse4 (+ 8 |c_ULTIMATE.start_main_~tree~0#1.offset|))) (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tree~0#1.base| (store (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tree~0#1.base|) .cse3 0) .cse4 0)) |v_ULTIMATE.start_main_#t~malloc4#1.base_12| v_ArrVal_1483) |v_ULTIMATE.start_main_~tmpList~0#1.base_28| v_ArrVal_1485) (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tree~0#1.base| (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tree~0#1.base|) .cse3 0) .cse4 |v_ULTIMATE.start_main_#t~malloc4#1.base_12|)) |v_ULTIMATE.start_main_#t~malloc4#1.base_12| v_ArrVal_1484) |v_ULTIMATE.start_main_~tmpList~0#1.base_28| v_ArrVal_1486) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse4) v_ArrVal_1488)) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|) 0))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc4#1.base_12|) 0))))))) is different from false [2021-12-14 19:38:40,582 INFO L354 Elim1Store]: treesize reduction 74, result has 28.2 percent of original size [2021-12-14 19:38:40,582 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 221 treesize of output 141 [2021-12-14 19:38:40,603 INFO L354 Elim1Store]: treesize reduction 74, result has 28.2 percent of original size [2021-12-14 19:38:40,604 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 141 treesize of output 151 [2021-12-14 19:38:40,607 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:38:40,612 INFO L354 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2021-12-14 19:38:40,613 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 591 treesize of output 461 [2021-12-14 19:38:40,618 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:38:40,623 INFO L354 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2021-12-14 19:38:40,624 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 545 treesize of output 521 [2021-12-14 19:38:40,656 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-12-14 19:38:40,656 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 521 treesize of output 435 [2021-12-14 19:38:40,661 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 435 treesize of output 423 [2021-12-14 19:38:40,674 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 48 [2021-12-14 19:38:40,678 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 48 treesize of output 46 [2021-12-14 19:38:40,726 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:38:40,726 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [255994419] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 19:38:40,726 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 19:38:40,727 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 16, 20] total 45 [2021-12-14 19:38:40,727 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791546853] [2021-12-14 19:38:40,727 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 19:38:40,727 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2021-12-14 19:38:40,727 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:38:40,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2021-12-14 19:38:40,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=1227, Unknown=22, NotChecked=546, Total=1980 [2021-12-14 19:38:40,728 INFO L87 Difference]: Start difference. First operand 398 states and 570 transitions. Second operand has 45 states, 45 states have (on average 2.1555555555555554) internal successors, (97), 45 states have internal predecessors, (97), 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 19:38:40,776 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tree~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 4)) (.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tree~0#1.base|))) (and (= |c_ULTIMATE.start_main_~tree~0#1.offset| 0) (= (select .cse0 .cse1) 0) (= |c_ULTIMATE.start_main_#t~malloc4#1.offset| 0) (= (select .cse2 |c_ULTIMATE.start_main_~tree~0#1.offset|) 0) (= (select .cse2 .cse1) 0) (= (select .cse0 |c_ULTIMATE.start_main_~tree~0#1.offset|) 0) (not (= |c_ULTIMATE.start_main_#t~malloc4#1.base| |c_ULTIMATE.start_main_~tree~0#1.base|)) (forall ((v_ArrVal_1487 (Array Int Int)) (v_ArrVal_1486 (Array Int Int)) (|v_ULTIMATE.start_main_~tmpList~0#1.base_28| Int) (v_ArrVal_1484 (Array Int Int))) (let ((.cse6 (+ 8 |c_ULTIMATE.start_main_~tree~0#1.offset|))) (let ((.cse5 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tree~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tree~0#1.base|) .cse6 |c_ULTIMATE.start_main_#t~malloc4#1.base|)) |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_1484))) (let ((.cse3 (select (select (let ((.cse7 (store .cse5 |v_ULTIMATE.start_main_~tmpList~0#1.base_28| v_ArrVal_1486))) (store .cse7 (select (select .cse7 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse6) v_ArrVal_1487)) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|))) (or (= |v_ULTIMATE.start_main_~tmpList~0#1.base_28| |c_ULTIMATE.start_main_~tree~0#1.base|) (and (= 0 .cse3) (forall ((v_ArrVal_1488 (Array Int Int)) (v_ArrVal_1485 (Array Int Int)) (v_ArrVal_1483 (Array Int Int))) (= (select (select (let ((.cse4 (+ 8 |c_ULTIMATE.start_main_~tree~0#1.offset|))) (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tree~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tree~0#1.base|) .cse4 |c_ULTIMATE.start_main_#t~malloc4#1.offset|)) |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_1483) |v_ULTIMATE.start_main_~tmpList~0#1.base_28| v_ArrVal_1485) (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tree~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tree~0#1.base|) .cse4 |c_ULTIMATE.start_main_#t~malloc4#1.base|)) |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_1484) |v_ULTIMATE.start_main_~tmpList~0#1.base_28| v_ArrVal_1486) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse4) v_ArrVal_1488)) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|) 0))) (= (select (select .cse5 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse6) .cse3)))))))) is different from false [2021-12-14 19:38:42,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:38:42,525 INFO L93 Difference]: Finished difference Result 665 states and 873 transitions. [2021-12-14 19:38:42,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2021-12-14 19:38:42,526 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 2.1555555555555554) internal successors, (97), 45 states have internal predecessors, (97), 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 35 [2021-12-14 19:38:42,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:38:42,527 INFO L225 Difference]: With dead ends: 665 [2021-12-14 19:38:42,527 INFO L226 Difference]: Without dead ends: 665 [2021-12-14 19:38:42,528 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 41 SyntacticMatches, 6 SemanticMatches, 68 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 1013 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=557, Invalid=3234, Unknown=23, NotChecked=1016, Total=4830 [2021-12-14 19:38:42,528 INFO L933 BasicCegarLoop]: 117 mSDtfsCounter, 1075 mSDsluCounter, 1921 mSDsCounter, 0 mSdLazyCounter, 2288 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1075 SdHoareTripleChecker+Valid, 2038 SdHoareTripleChecker+Invalid, 5801 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 2288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3417 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2021-12-14 19:38:42,528 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1075 Valid, 2038 Invalid, 5801 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 2288 Invalid, 0 Unknown, 3417 Unchecked, 1.0s Time] [2021-12-14 19:38:42,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2021-12-14 19:38:42,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 495. [2021-12-14 19:38:42,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 495 states, 450 states have (on average 1.6022222222222222) internal successors, (721), 494 states have internal predecessors, (721), 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 19:38:42,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 721 transitions. [2021-12-14 19:38:42,535 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 721 transitions. Word has length 35 [2021-12-14 19:38:42,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:38:42,535 INFO L470 AbstractCegarLoop]: Abstraction has 495 states and 721 transitions. [2021-12-14 19:38:42,535 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 2.1555555555555554) internal successors, (97), 45 states have internal predecessors, (97), 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 19:38:42,535 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 721 transitions. [2021-12-14 19:38:42,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-12-14 19:38:42,535 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:38:42,535 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:38:42,555 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 19:38:42,752 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:38:42,752 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-14 19:38:42,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:38:42,752 INFO L85 PathProgramCache]: Analyzing trace with hash -1262484393, now seen corresponding path program 1 times [2021-12-14 19:38:42,752 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:38:42,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825168] [2021-12-14 19:38:42,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:38:42,753 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:38:42,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:38:42,893 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:38:42,893 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:38:42,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825168] [2021-12-14 19:38:42,894 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825168] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:38:42,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1107039970] [2021-12-14 19:38:42,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:38:42,894 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:38:42,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:38:42,895 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 19:38:42,895 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 19:38:43,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:38:43,019 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 62 conjunts are in the unsatisfiable core [2021-12-14 19:38:43,023 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:38:43,030 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 19:38:43,046 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-14 19:38:43,050 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-14 19:38:43,075 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:38:43,075 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 21 treesize of output 20 [2021-12-14 19:38:43,080 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:38:43,081 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 21 treesize of output 20 [2021-12-14 19:38:43,114 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-14 19:38:43,114 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 11 treesize of output 11 [2021-12-14 19:38:43,160 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:38:43,161 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:38:43,162 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:38:43,162 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2021-12-14 19:38:43,169 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:38:43,170 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:38:43,170 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:38:43,171 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 30 treesize of output 32 [2021-12-14 19:38:43,298 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 19:38:43,299 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2021-12-14 19:38:43,302 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 29 [2021-12-14 19:38:43,347 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-14 19:38:43,348 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 11 treesize of output 11 [2021-12-14 19:38:43,476 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 44 treesize of output 40 [2021-12-14 19:38:43,480 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2021-12-14 19:38:43,589 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 19:38:43,589 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2021-12-14 19:38:43,593 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 29 [2021-12-14 19:38:43,749 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2021-12-14 19:38:43,825 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:38:43,825 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:38:44,032 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1591 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1591) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|))) (or (= (select |c_#valid| .cse0) 1) (and (forall ((v_ArrVal_1590 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1590) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|) 0)) (= .cse0 0))))) is different from false [2021-12-14 19:38:44,047 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1591 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~tree~0#1.offset|)) v_ArrVal_1591) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|))) (or (= (select |c_#valid| .cse0) 1) (and (forall ((v_ArrVal_1590 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~tree~0#1.offset|)) v_ArrVal_1590) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|) 0)) (= .cse0 0))))) is different from false [2021-12-14 19:38:44,099 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1589 (Array Int Int)) (v_ArrVal_1591 (Array Int Int))) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_1589))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~tree~0#1.offset|)) v_ArrVal_1591)) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|))) (or (and (= 0 .cse0) (forall ((v_ArrVal_1588 (Array Int Int)) (v_ArrVal_1590 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_1588) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_1589) |c_ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~tree~0#1.offset|)) v_ArrVal_1590) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|) 0))) (= (select |c_#valid| .cse0) 1)))) is different from false [2021-12-14 19:38:44,109 INFO L354 Elim1Store]: treesize reduction 5, result has 81.5 percent of original size [2021-12-14 19:38:44,110 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 31 treesize of output 30 [2021-12-14 19:38:44,127 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1589 (Array Int Int)) (v_ArrVal_1591 (Array Int Int))) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_1589))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~tree~0#1.offset|)) v_ArrVal_1591)) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|))) (or (= |c_ULTIMATE.start_main_#t~mem9#1.base| .cse0) (and (= 0 .cse0) (forall ((v_ArrVal_1588 (Array Int Int)) (v_ArrVal_1590 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_1588) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_1589) |c_ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~tree~0#1.offset|)) v_ArrVal_1590) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|) 0)))))) is different from false [2021-12-14 19:38:44,148 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1589 (Array Int Int)) (v_ArrVal_1591 (Array Int Int))) (let ((.cse1 (+ 8 |c_ULTIMATE.start_main_~tree~0#1.offset|))) (let ((.cse0 (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_1589))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1) v_ArrVal_1591)) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|))) (or (and (= 0 .cse0) (forall ((v_ArrVal_1588 (Array Int Int)) (v_ArrVal_1590 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_1588) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_1589) |c_ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~tree~0#1.offset|)) v_ArrVal_1590) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|) 0))) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1) .cse0))))) is different from false [2021-12-14 19:38:44,753 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-14 19:38:44,753 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 13 treesize of output 12 [2021-12-14 19:38:44,864 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~tmpList~0#1.base_30| Int) (v_ArrVal_1589 (Array Int Int)) (v_ArrVal_1587 (Array Int Int)) (v_ArrVal_1591 (Array Int Int))) (let ((.cse3 (+ 8 |c_ULTIMATE.start_main_~tree~0#1.offset|))) (let ((.cse2 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tree~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tree~0#1.base|) .cse3 |c_ULTIMATE.start_main_#t~malloc4#1.base|)) |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_1587))) (let ((.cse0 (select (select (let ((.cse4 (store .cse2 |v_ULTIMATE.start_main_~tmpList~0#1.base_30| v_ArrVal_1589))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse3) v_ArrVal_1591)) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|))) (or (and (= .cse0 0) (forall ((v_ArrVal_1582 Int) (v_ArrVal_1588 (Array Int Int)) (v_ArrVal_1586 (Array Int Int)) (v_ArrVal_1590 (Array Int Int))) (= (select (select (let ((.cse1 (+ 8 |c_ULTIMATE.start_main_~tree~0#1.offset|))) (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tree~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1 v_ArrVal_1582)) |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_1586) |v_ULTIMATE.start_main_~tmpList~0#1.base_30| v_ArrVal_1588) (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tree~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1 |c_ULTIMATE.start_main_#t~malloc4#1.base|)) |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_1587) |v_ULTIMATE.start_main_~tmpList~0#1.base_30| v_ArrVal_1589) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1) v_ArrVal_1590)) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|) 0))) (= |v_ULTIMATE.start_main_~tmpList~0#1.base_30| |c_ULTIMATE.start_main_~tree~0#1.base|) (= (select (select .cse2 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse3) .cse0)))))) is different from false [2021-12-14 19:38:45,723 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~tmpList~0#1.base_30| Int) (v_ArrVal_1589 (Array Int Int)) (v_ArrVal_1587 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc4#1.base_15| Int) (v_ArrVal_1591 (Array Int Int))) (let ((.cse2 (+ 8 |c_ULTIMATE.start_main_~tree~0#1.offset|))) (let ((.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tree~0#1.base| (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tree~0#1.base|) (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 4) 0) .cse2 |v_ULTIMATE.start_main_#t~malloc4#1.base_15|)) |v_ULTIMATE.start_main_#t~malloc4#1.base_15| v_ArrVal_1587))) (let ((.cse0 (select (select (let ((.cse5 (store .cse1 |v_ULTIMATE.start_main_~tmpList~0#1.base_30| v_ArrVal_1589))) (store .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse2) v_ArrVal_1591)) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|))) (or (= .cse0 (select (select .cse1 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse2)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc4#1.base_15|) 0)) (and (forall ((v_ArrVal_1582 Int) (v_ArrVal_1588 (Array Int Int)) (v_ArrVal_1586 (Array Int Int)) (v_ArrVal_1590 (Array Int Int))) (= (select (select (let ((.cse3 (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 4)) (.cse4 (+ 8 |c_ULTIMATE.start_main_~tree~0#1.offset|))) (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tree~0#1.base| (store (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tree~0#1.base|) .cse3 0) .cse4 v_ArrVal_1582)) |v_ULTIMATE.start_main_#t~malloc4#1.base_15| v_ArrVal_1586) |v_ULTIMATE.start_main_~tmpList~0#1.base_30| v_ArrVal_1588) (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tree~0#1.base| (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tree~0#1.base|) .cse3 0) .cse4 |v_ULTIMATE.start_main_#t~malloc4#1.base_15|)) |v_ULTIMATE.start_main_#t~malloc4#1.base_15| v_ArrVal_1587) |v_ULTIMATE.start_main_~tmpList~0#1.base_30| v_ArrVal_1589) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse4) v_ArrVal_1590)) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|) 0)) (= .cse0 0)) (= |v_ULTIMATE.start_main_~tmpList~0#1.base_30| |c_ULTIMATE.start_main_~tree~0#1.base|)))))) is different from false [2021-12-14 19:38:45,748 INFO L354 Elim1Store]: treesize reduction 74, result has 28.2 percent of original size [2021-12-14 19:38:45,748 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 221 treesize of output 141 [2021-12-14 19:38:45,766 INFO L354 Elim1Store]: treesize reduction 74, result has 28.2 percent of original size [2021-12-14 19:38:45,766 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 141 treesize of output 151 [2021-12-14 19:38:45,769 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:38:45,774 INFO L354 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2021-12-14 19:38:45,774 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 499 treesize of output 393 [2021-12-14 19:38:45,778 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:38:45,783 INFO L354 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2021-12-14 19:38:45,783 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 547 treesize of output 519 [2021-12-14 19:38:45,797 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-12-14 19:38:45,798 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 519 treesize of output 441 [2021-12-14 19:38:45,806 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 441 treesize of output 429 [2021-12-14 19:38:45,841 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 120 treesize of output 112 [2021-12-14 19:38:45,845 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 112 treesize of output 108 [2021-12-14 19:38:45,914 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:38:45,915 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1107039970] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 19:38:45,915 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 19:38:45,915 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 16, 20] total 45 [2021-12-14 19:38:45,915 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956735821] [2021-12-14 19:38:45,915 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 19:38:45,915 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2021-12-14 19:38:45,915 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:38:45,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2021-12-14 19:38:45,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=1227, Unknown=22, NotChecked=546, Total=1980 [2021-12-14 19:38:45,916 INFO L87 Difference]: Start difference. First operand 495 states and 721 transitions. Second operand has 45 states, 45 states have (on average 2.1333333333333333) internal successors, (96), 45 states have internal predecessors, (96), 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 19:38:45,963 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tree~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 4)) (.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tree~0#1.base|))) (and (= |c_ULTIMATE.start_main_~tree~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_main_~tree~0#1.base|) 1) (= (select .cse0 .cse1) 0) (forall ((|v_ULTIMATE.start_main_~tmpList~0#1.base_30| Int) (v_ArrVal_1589 (Array Int Int)) (v_ArrVal_1587 (Array Int Int)) (v_ArrVal_1591 (Array Int Int))) (let ((.cse5 (+ 8 |c_ULTIMATE.start_main_~tree~0#1.offset|))) (let ((.cse4 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tree~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tree~0#1.base|) .cse5 |c_ULTIMATE.start_main_#t~malloc4#1.base|)) |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_1587))) (let ((.cse2 (select (select (let ((.cse6 (store .cse4 |v_ULTIMATE.start_main_~tmpList~0#1.base_30| v_ArrVal_1589))) (store .cse6 (select (select .cse6 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse5) v_ArrVal_1591)) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|))) (or (and (= .cse2 0) (forall ((v_ArrVal_1582 Int) (v_ArrVal_1588 (Array Int Int)) (v_ArrVal_1586 (Array Int Int)) (v_ArrVal_1590 (Array Int Int))) (= (select (select (let ((.cse3 (+ 8 |c_ULTIMATE.start_main_~tree~0#1.offset|))) (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tree~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tree~0#1.base|) .cse3 v_ArrVal_1582)) |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_1586) |v_ULTIMATE.start_main_~tmpList~0#1.base_30| v_ArrVal_1588) (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tree~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tree~0#1.base|) .cse3 |c_ULTIMATE.start_main_#t~malloc4#1.base|)) |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_1587) |v_ULTIMATE.start_main_~tmpList~0#1.base_30| v_ArrVal_1589) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse3) v_ArrVal_1590)) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|) 0))) (= |v_ULTIMATE.start_main_~tmpList~0#1.base_30| |c_ULTIMATE.start_main_~tree~0#1.base|) (= (select (select .cse4 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse5) .cse2)))))) (= (select .cse7 |c_ULTIMATE.start_main_~tree~0#1.offset|) 0) (= (select .cse7 .cse1) 0) (= (select .cse0 |c_ULTIMATE.start_main_~tree~0#1.offset|) 0) (not (= |c_ULTIMATE.start_main_#t~malloc4#1.base| |c_ULTIMATE.start_main_~tree~0#1.base|)))) is different from false [2021-12-14 19:38:47,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:38:47,464 INFO L93 Difference]: Finished difference Result 876 states and 1186 transitions. [2021-12-14 19:38:47,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2021-12-14 19:38:47,464 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 2.1333333333333333) internal successors, (96), 45 states have internal predecessors, (96), 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 35 [2021-12-14 19:38:47,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:38:47,466 INFO L225 Difference]: With dead ends: 876 [2021-12-14 19:38:47,466 INFO L226 Difference]: Without dead ends: 876 [2021-12-14 19:38:47,467 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 45 SyntacticMatches, 5 SemanticMatches, 67 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 905 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=651, Invalid=3018, Unknown=23, NotChecked=1000, Total=4692 [2021-12-14 19:38:47,467 INFO L933 BasicCegarLoop]: 116 mSDtfsCounter, 1656 mSDsluCounter, 1880 mSDsCounter, 0 mSdLazyCounter, 2043 mSolverCounterSat, 160 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1656 SdHoareTripleChecker+Valid, 1996 SdHoareTripleChecker+Invalid, 5258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 160 IncrementalHoareTripleChecker+Valid, 2043 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3055 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2021-12-14 19:38:47,467 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1656 Valid, 1996 Invalid, 5258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [160 Valid, 2043 Invalid, 0 Unknown, 3055 Unchecked, 0.9s Time] [2021-12-14 19:38:47,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 876 states. [2021-12-14 19:38:47,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 876 to 484. [2021-12-14 19:38:47,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 484 states, 439 states have (on average 1.5899772209567198) internal successors, (698), 483 states have internal predecessors, (698), 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 19:38:47,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 698 transitions. [2021-12-14 19:38:47,473 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 698 transitions. Word has length 35 [2021-12-14 19:38:47,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:38:47,473 INFO L470 AbstractCegarLoop]: Abstraction has 484 states and 698 transitions. [2021-12-14 19:38:47,473 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 2.1333333333333333) internal successors, (96), 45 states have internal predecessors, (96), 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 19:38:47,473 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 698 transitions. [2021-12-14 19:38:47,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-12-14 19:38:47,473 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:38:47,474 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:38:47,490 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2021-12-14 19:38:47,689 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:38:47,690 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr102ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-14 19:38:47,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:38:47,690 INFO L85 PathProgramCache]: Analyzing trace with hash -974847376, now seen corresponding path program 1 times [2021-12-14 19:38:47,690 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:38:47,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405937426] [2021-12-14 19:38:47,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:38:47,690 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:38:47,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:38:47,898 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 19:38:47,899 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:38:47,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405937426] [2021-12-14 19:38:47,899 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405937426] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:38:47,899 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:38:47,899 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-12-14 19:38:47,899 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590354879] [2021-12-14 19:38:47,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:38:47,899 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-12-14 19:38:47,899 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:38:47,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-12-14 19:38:47,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2021-12-14 19:38:47,900 INFO L87 Difference]: Start difference. First operand 484 states and 698 transitions. Second operand has 15 states, 14 states have (on average 2.5) internal successors, (35), 15 states have internal predecessors, (35), 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 19:38:48,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:38:48,899 INFO L93 Difference]: Finished difference Result 827 states and 1106 transitions. [2021-12-14 19:38:48,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-12-14 19:38:48,899 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.5) internal successors, (35), 15 states have internal predecessors, (35), 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 35 [2021-12-14 19:38:48,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:38:48,901 INFO L225 Difference]: With dead ends: 827 [2021-12-14 19:38:48,901 INFO L226 Difference]: Without dead ends: 827 [2021-12-14 19:38:48,902 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=240, Invalid=950, Unknown=0, NotChecked=0, Total=1190 [2021-12-14 19:38:48,902 INFO L933 BasicCegarLoop]: 90 mSDtfsCounter, 806 mSDsluCounter, 785 mSDsCounter, 0 mSdLazyCounter, 1653 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 806 SdHoareTripleChecker+Valid, 875 SdHoareTripleChecker+Invalid, 1717 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 1653 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-12-14 19:38:48,902 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [806 Valid, 875 Invalid, 1717 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 1653 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2021-12-14 19:38:48,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 827 states. [2021-12-14 19:38:48,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 827 to 517. [2021-12-14 19:38:48,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 517 states, 472 states have (on average 1.5847457627118644) internal successors, (748), 516 states have internal predecessors, (748), 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 19:38:48,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 748 transitions. [2021-12-14 19:38:48,907 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 748 transitions. Word has length 35 [2021-12-14 19:38:48,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:38:48,908 INFO L470 AbstractCegarLoop]: Abstraction has 517 states and 748 transitions. [2021-12-14 19:38:48,908 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.5) internal successors, (35), 15 states have internal predecessors, (35), 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 19:38:48,908 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 748 transitions. [2021-12-14 19:38:48,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-14 19:38:48,908 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:38:48,908 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:38:48,908 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2021-12-14 19:38:48,908 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-14 19:38:48,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:38:48,909 INFO L85 PathProgramCache]: Analyzing trace with hash 1222038395, now seen corresponding path program 1 times [2021-12-14 19:38:48,909 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:38:48,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31747923] [2021-12-14 19:38:48,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:38:48,909 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:38:48,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:38:49,094 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:38:49,094 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:38:49,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31747923] [2021-12-14 19:38:49,094 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31747923] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:38:49,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [563642775] [2021-12-14 19:38:49,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:38:49,094 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:38:49,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:38:49,095 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 19:38:49,096 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 19:38:49,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:38:49,244 INFO L263 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 34 conjunts are in the unsatisfiable core [2021-12-14 19:38:49,246 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:38:49,251 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 19:38:49,272 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-14 19:38:49,272 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 11 treesize of output 11 [2021-12-14 19:38:49,289 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-14 19:38:49,350 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 19:38:49,351 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 26 [2021-12-14 19:38:49,370 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-14 19:38:49,371 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 11 treesize of output 11 [2021-12-14 19:38:49,439 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 28 treesize of output 28 [2021-12-14 19:38:49,492 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 19:38:49,492 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 35 [2021-12-14 19:38:49,674 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:38:49,676 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:38:49,676 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 31 treesize of output 16 [2021-12-14 19:38:49,679 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:38:49,679 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:38:50,657 INFO L354 Elim1Store]: treesize reduction 5, result has 82.8 percent of original size [2021-12-14 19:38:50,657 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 33 treesize of output 32 [2021-12-14 19:38:50,665 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~tmp~0#1.offset_59| Int) (v_ArrVal_1710 (Array Int Int)) (v_ArrVal_1709 (Array Int Int))) (or (< |c_ULTIMATE.start_main_~tree~0#1.offset| |v_ULTIMATE.start_main_~tmp~0#1.offset_59|) (= |c_ULTIMATE.start_main_#t~mem9#1.base| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_1709))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~tree~0#1.offset|)) v_ArrVal_1710)) |c_ULTIMATE.start_main_~tree~0#1.base|) (+ |v_ULTIMATE.start_main_~tmp~0#1.offset_59| 8))) (< |v_ULTIMATE.start_main_~tmp~0#1.offset_59| 0))) is different from false [2021-12-14 19:38:50,676 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~tmp~0#1.offset_59| Int) (v_ArrVal_1710 (Array Int Int)) (v_ArrVal_1709 (Array Int Int))) (or (< |c_ULTIMATE.start_main_~tree~0#1.offset| |v_ULTIMATE.start_main_~tmp~0#1.offset_59|) (let ((.cse0 (+ 8 |c_ULTIMATE.start_main_~tree~0#1.offset|))) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tree~0#1.base|) .cse0) (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_1709))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse0) v_ArrVal_1710)) |c_ULTIMATE.start_main_~tree~0#1.base|) (+ |v_ULTIMATE.start_main_~tmp~0#1.offset_59| 8)))) (< |v_ULTIMATE.start_main_~tmp~0#1.offset_59| 0))) is different from false [2021-12-14 19:38:50,960 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:38:50,960 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 50 [2021-12-14 19:38:50,962 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:38:50,967 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:38:50,968 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 498 treesize of output 396 [2021-12-14 19:38:51,014 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 326 treesize of output 294 [2021-12-14 19:38:51,023 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:38:51,023 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 294 treesize of output 234 [2021-12-14 19:38:51,033 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-14 19:38:51,033 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 13 treesize of output 12 [2021-12-14 19:38:53,288 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:38:53,288 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [563642775] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 19:38:53,288 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 19:38:53,288 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 15] total 34 [2021-12-14 19:38:53,288 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207155105] [2021-12-14 19:38:53,288 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 19:38:53,288 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-12-14 19:38:53,288 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:38:53,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-12-14 19:38:53,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=923, Unknown=31, NotChecked=126, Total=1190 [2021-12-14 19:38:53,289 INFO L87 Difference]: Start difference. First operand 517 states and 748 transitions. Second operand has 35 states, 34 states have (on average 2.823529411764706) internal successors, (96), 35 states have internal predecessors, (96), 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 19:38:54,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:38:54,159 INFO L93 Difference]: Finished difference Result 545 states and 780 transitions. [2021-12-14 19:38:54,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-12-14 19:38:54,162 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.823529411764706) internal successors, (96), 35 states have internal predecessors, (96), 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 36 [2021-12-14 19:38:54,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:38:54,163 INFO L225 Difference]: With dead ends: 545 [2021-12-14 19:38:54,163 INFO L226 Difference]: Without dead ends: 545 [2021-12-14 19:38:54,164 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 456 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=407, Invalid=2016, Unknown=35, NotChecked=194, Total=2652 [2021-12-14 19:38:54,164 INFO L933 BasicCegarLoop]: 139 mSDtfsCounter, 318 mSDsluCounter, 2229 mSDsCounter, 0 mSdLazyCounter, 1083 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 2368 SdHoareTripleChecker+Invalid, 2100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 1083 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 964 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-14 19:38:54,164 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [318 Valid, 2368 Invalid, 2100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 1083 Invalid, 0 Unknown, 964 Unchecked, 0.4s Time] [2021-12-14 19:38:54,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2021-12-14 19:38:54,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 528. [2021-12-14 19:38:54,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 528 states, 483 states have (on average 1.5776397515527951) internal successors, (762), 527 states have internal predecessors, (762), 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 19:38:54,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 762 transitions. [2021-12-14 19:38:54,169 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 762 transitions. Word has length 36 [2021-12-14 19:38:54,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:38:54,169 INFO L470 AbstractCegarLoop]: Abstraction has 528 states and 762 transitions. [2021-12-14 19:38:54,169 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.823529411764706) internal successors, (96), 35 states have internal predecessors, (96), 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 19:38:54,169 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 762 transitions. [2021-12-14 19:38:54,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-14 19:38:54,170 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:38:54,170 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:38:54,199 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 19:38:54,383 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:38:54,383 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-14 19:38:54,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:38:54,384 INFO L85 PathProgramCache]: Analyzing trace with hash 1222038396, now seen corresponding path program 1 times [2021-12-14 19:38:54,384 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:38:54,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984629890] [2021-12-14 19:38:54,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:38:54,384 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:38:54,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:38:54,642 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:38:54,642 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:38:54,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984629890] [2021-12-14 19:38:54,642 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984629890] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:38:54,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [282038177] [2021-12-14 19:38:54,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:38:54,643 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:38:54,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:38:54,643 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 19:38:54,644 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 19:38:54,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:38:54,766 INFO L263 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 45 conjunts are in the unsatisfiable core [2021-12-14 19:38:54,768 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:38:54,772 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 19:38:54,796 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-14 19:38:54,796 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 11 treesize of output 11 [2021-12-14 19:38:54,834 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-14 19:38:54,839 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-14 19:38:54,919 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 19:38:54,920 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 36 [2021-12-14 19:38:54,925 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 22 treesize of output 24 [2021-12-14 19:38:54,956 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-14 19:38:54,957 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 11 treesize of output 11 [2021-12-14 19:38:55,034 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 16 treesize of output 18 [2021-12-14 19:38:55,037 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 28 treesize of output 28 [2021-12-14 19:38:55,102 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 19:38:55,102 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2021-12-14 19:38:55,105 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 22 treesize of output 24 [2021-12-14 19:38:55,312 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:38:55,312 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2021-12-14 19:38:55,315 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:38:55,315 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 19 treesize of output 7 [2021-12-14 19:38:55,337 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:38:55,337 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:38:55,952 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:38:55,952 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 80 treesize of output 84 [2021-12-14 19:39:00,197 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:39:00,197 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 170 treesize of output 161 [2021-12-14 19:39:00,204 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:39:00,204 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 161 treesize of output 121 [2021-12-14 19:39:00,206 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:39:00,214 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:39:00,215 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 488 treesize of output 398 [2021-12-14 19:39:00,220 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:39:00,228 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:39:00,228 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 734 treesize of output 704 [2021-12-14 19:39:00,250 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-14 19:39:00,251 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 13 treesize of output 12 [2021-12-14 19:39:00,288 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 603 treesize of output 587 [2021-12-14 19:39:00,294 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 587 treesize of output 571 [2021-12-14 19:39:00,299 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 571 treesize of output 539 [2021-12-14 19:39:00,304 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 539 treesize of output 523 [2021-12-14 19:39:00,309 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 523 treesize of output 515 [2021-12-14 19:39:00,314 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 515 treesize of output 499 [2021-12-14 19:39:00,324 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:39:00,324 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 499 treesize of output 456 [2021-12-14 19:39:00,330 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 443 treesize of output 419 [2021-12-14 19:39:02,735 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:39:02,736 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [282038177] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 19:39:02,736 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 19:39:02,736 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 15] total 39 [2021-12-14 19:39:02,736 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221525101] [2021-12-14 19:39:02,736 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 19:39:02,736 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2021-12-14 19:39:02,736 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:39:02,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2021-12-14 19:39:02,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=1381, Unknown=46, NotChecked=0, Total=1560 [2021-12-14 19:39:02,737 INFO L87 Difference]: Start difference. First operand 528 states and 762 transitions. Second operand has 40 states, 39 states have (on average 2.717948717948718) internal successors, (106), 40 states have internal predecessors, (106), 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 19:39:04,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:39:04,041 INFO L93 Difference]: Finished difference Result 617 states and 870 transitions. [2021-12-14 19:39:04,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-12-14 19:39:04,041 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 2.717948717948718) internal successors, (106), 40 states have internal predecessors, (106), 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 36 [2021-12-14 19:39:04,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:39:04,042 INFO L225 Difference]: With dead ends: 617 [2021-12-14 19:39:04,042 INFO L226 Difference]: Without dead ends: 617 [2021-12-14 19:39:04,043 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 743 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=462, Invalid=2798, Unknown=46, NotChecked=0, Total=3306 [2021-12-14 19:39:04,043 INFO L933 BasicCegarLoop]: 172 mSDtfsCounter, 550 mSDsluCounter, 2459 mSDsCounter, 0 mSdLazyCounter, 1347 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 550 SdHoareTripleChecker+Valid, 2631 SdHoareTripleChecker+Invalid, 2282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 1347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 870 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-12-14 19:39:04,043 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [550 Valid, 2631 Invalid, 2282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 1347 Invalid, 0 Unknown, 870 Unchecked, 0.6s Time] [2021-12-14 19:39:04,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2021-12-14 19:39:04,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 528. [2021-12-14 19:39:04,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 528 states, 483 states have (on average 1.5755693581780539) internal successors, (761), 527 states have internal predecessors, (761), 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 19:39:04,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 761 transitions. [2021-12-14 19:39:04,048 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 761 transitions. Word has length 36 [2021-12-14 19:39:04,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:39:04,049 INFO L470 AbstractCegarLoop]: Abstraction has 528 states and 761 transitions. [2021-12-14 19:39:04,049 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 2.717948717948718) internal successors, (106), 40 states have internal predecessors, (106), 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 19:39:04,049 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 761 transitions. [2021-12-14 19:39:04,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-12-14 19:39:04,049 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:39:04,049 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:39:04,071 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 19:39:04,266 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:39:04,266 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-14 19:39:04,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:39:04,267 INFO L85 PathProgramCache]: Analyzing trace with hash -751292082, now seen corresponding path program 1 times [2021-12-14 19:39:04,267 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:39:04,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244727993] [2021-12-14 19:39:04,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:39:04,267 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:39:04,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:39:04,453 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:39:04,453 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:39:04,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244727993] [2021-12-14 19:39:04,453 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244727993] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:39:04,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1282973532] [2021-12-14 19:39:04,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:39:04,453 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:39:04,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:39:04,454 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 19:39:04,455 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 19:39:04,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:39:04,587 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 44 conjunts are in the unsatisfiable core [2021-12-14 19:39:04,589 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:39:04,593 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 19:39:04,613 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-14 19:39:04,618 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-14 19:39:04,642 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-14 19:39:04,642 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 11 treesize of output 11 [2021-12-14 19:39:04,670 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:39:04,671 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-12-14 19:39:04,676 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:39:04,676 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 23 treesize of output 22 [2021-12-14 19:39:04,767 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 19:39:04,768 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2021-12-14 19:39:04,771 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 22 treesize of output 24 [2021-12-14 19:39:04,809 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-14 19:39:04,809 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 11 treesize of output 11 [2021-12-14 19:39:04,858 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 16 treesize of output 18 [2021-12-14 19:39:04,863 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 26 treesize of output 26 [2021-12-14 19:39:04,929 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 19:39:04,929 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2021-12-14 19:39:04,932 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 22 treesize of output 24 [2021-12-14 19:39:05,073 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:39:05,073 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:39:05,074 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 11 [2021-12-14 19:39:05,077 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:39:05,078 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:39:05,078 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 19 treesize of output 10 [2021-12-14 19:39:05,089 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:39:05,089 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:39:08,514 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-14 19:39:08,514 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 13 treesize of output 12