./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety/test-0513.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c3fed411 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/test-0513.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 aaec9a71c2206d3d9fbfa56b3c6172e3ff60aad385f0ad346fdbde53f8ce1a2e --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-16 05:52:06,316 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-16 05:52:06,319 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-16 05:52:06,378 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-16 05:52:06,378 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-16 05:52:06,379 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-16 05:52:06,382 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-16 05:52:06,385 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-16 05:52:06,387 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-16 05:52:06,391 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-16 05:52:06,392 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-16 05:52:06,393 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-16 05:52:06,393 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-16 05:52:06,394 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-16 05:52:06,395 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-16 05:52:06,396 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-16 05:52:06,397 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-16 05:52:06,397 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-16 05:52:06,401 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-16 05:52:06,405 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-16 05:52:06,406 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-16 05:52:06,407 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-16 05:52:06,409 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-16 05:52:06,410 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-16 05:52:06,417 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-16 05:52:06,417 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-16 05:52:06,418 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-16 05:52:06,419 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-16 05:52:06,419 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-16 05:52:06,420 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-16 05:52:06,420 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-16 05:52:06,421 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-16 05:52:06,423 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-16 05:52:06,423 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-16 05:52:06,425 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-16 05:52:06,425 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-16 05:52:06,425 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-16 05:52:06,426 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-16 05:52:06,426 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-16 05:52:06,427 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-16 05:52:06,428 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-16 05:52:06,429 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2021-12-16 05:52:06,463 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-16 05:52:06,464 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-16 05:52:06,464 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-16 05:52:06,465 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-16 05:52:06,466 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-16 05:52:06,466 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-16 05:52:06,466 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-16 05:52:06,466 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-16 05:52:06,467 INFO L138 SettingsManager]: * Use SBE=true [2021-12-16 05:52:06,467 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-16 05:52:06,468 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-16 05:52:06,468 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-16 05:52:06,468 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-16 05:52:06,468 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-16 05:52:06,468 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-16 05:52:06,469 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-16 05:52:06,469 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-16 05:52:06,469 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-12-16 05:52:06,469 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-16 05:52:06,469 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-16 05:52:06,470 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-16 05:52:06,470 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-16 05:52:06,470 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-16 05:52:06,470 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-16 05:52:06,470 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-16 05:52:06,471 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-16 05:52:06,471 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-16 05:52:06,471 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-16 05:52:06,471 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-16 05:52:06,471 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-16 05:52:06,472 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-16 05:52:06,472 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 -> aaec9a71c2206d3d9fbfa56b3c6172e3ff60aad385f0ad346fdbde53f8ce1a2e [2021-12-16 05:52:06,719 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-16 05:52:06,749 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-16 05:52:06,762 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-16 05:52:06,763 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-16 05:52:06,764 INFO L275 PluginConnector]: CDTParser initialized [2021-12-16 05:52:06,765 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety/test-0513.i [2021-12-16 05:52:06,838 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/951cf1fba/285410a5853e455980af308c96d72205/FLAGa87f87ea2 [2021-12-16 05:52:07,287 INFO L306 CDTParser]: Found 1 translation units. [2021-12-16 05:52:07,288 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/test-0513.i [2021-12-16 05:52:07,303 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/951cf1fba/285410a5853e455980af308c96d72205/FLAGa87f87ea2 [2021-12-16 05:52:07,641 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/951cf1fba/285410a5853e455980af308c96d72205 [2021-12-16 05:52:07,645 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-16 05:52:07,647 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-16 05:52:07,650 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-16 05:52:07,650 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-16 05:52:07,653 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-16 05:52:07,654 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 05:52:07" (1/1) ... [2021-12-16 05:52:07,655 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63b83eea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:52:07, skipping insertion in model container [2021-12-16 05:52:07,656 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 05:52:07" (1/1) ... [2021-12-16 05:52:07,663 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-16 05:52:07,705 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-16 05:52:07,979 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-16 05:52:07,987 INFO L203 MainTranslator]: Completed pre-run [2021-12-16 05:52:08,037 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-16 05:52:08,056 INFO L208 MainTranslator]: Completed translation [2021-12-16 05:52:08,057 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:52:08 WrapperNode [2021-12-16 05:52:08,057 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-16 05:52:08,058 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-16 05:52:08,058 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-16 05:52:08,059 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-16 05:52:08,064 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:52:08" (1/1) ... [2021-12-16 05:52:08,087 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:52:08" (1/1) ... [2021-12-16 05:52:08,112 INFO L137 Inliner]: procedures = 123, calls = 37, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 124 [2021-12-16 05:52:08,113 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-16 05:52:08,114 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-16 05:52:08,114 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-16 05:52:08,114 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-16 05:52:08,120 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:52:08" (1/1) ... [2021-12-16 05:52:08,120 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:52:08" (1/1) ... [2021-12-16 05:52:08,128 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:52:08" (1/1) ... [2021-12-16 05:52:08,129 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:52:08" (1/1) ... [2021-12-16 05:52:08,134 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:52:08" (1/1) ... [2021-12-16 05:52:08,137 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:52:08" (1/1) ... [2021-12-16 05:52:08,141 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:52:08" (1/1) ... [2021-12-16 05:52:08,142 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-16 05:52:08,143 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-16 05:52:08,159 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-16 05:52:08,159 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-16 05:52:08,160 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:52:08" (1/1) ... [2021-12-16 05:52:08,166 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-16 05:52:08,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 05:52:08,185 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-16 05:52:08,216 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-16 05:52:08,233 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-16 05:52:08,234 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-16 05:52:08,235 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-16 05:52:08,235 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-16 05:52:08,235 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-16 05:52:08,235 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-16 05:52:08,235 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-16 05:52:08,235 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-16 05:52:08,235 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-16 05:52:08,235 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-16 05:52:08,372 INFO L236 CfgBuilder]: Building ICFG [2021-12-16 05:52:08,373 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-16 05:52:08,673 INFO L277 CfgBuilder]: Performing block encoding [2021-12-16 05:52:08,678 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-16 05:52:08,678 INFO L301 CfgBuilder]: Removed 4 assume(true) statements. [2021-12-16 05:52:08,680 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 05:52:08 BoogieIcfgContainer [2021-12-16 05:52:08,680 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-16 05:52:08,681 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-16 05:52:08,681 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-16 05:52:08,683 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-16 05:52:08,684 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 05:52:07" (1/3) ... [2021-12-16 05:52:08,684 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47534da7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 05:52:08, skipping insertion in model container [2021-12-16 05:52:08,684 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:52:08" (2/3) ... [2021-12-16 05:52:08,685 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47534da7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 05:52:08, skipping insertion in model container [2021-12-16 05:52:08,685 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 05:52:08" (3/3) ... [2021-12-16 05:52:08,687 INFO L111 eAbstractionObserver]: Analyzing ICFG test-0513.i [2021-12-16 05:52:08,691 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-16 05:52:08,691 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 62 error locations. [2021-12-16 05:52:08,732 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-16 05:52:08,739 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=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-16 05:52:08,739 INFO L340 AbstractCegarLoop]: Starting to check reachability of 62 error locations. [2021-12-16 05:52:08,753 INFO L276 IsEmpty]: Start isEmpty. Operand has 132 states, 69 states have (on average 2.101449275362319) internal successors, (145), 131 states have internal predecessors, (145), 0 states have call successors, (0), 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-16 05:52:08,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-12-16 05:52:08,759 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:52:08,759 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-12-16 05:52:08,760 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 58 more)] === [2021-12-16 05:52:08,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:52:08,764 INFO L85 PathProgramCache]: Analyzing trace with hash 28740643, now seen corresponding path program 1 times [2021-12-16 05:52:08,770 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:52:08,770 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945002747] [2021-12-16 05:52:08,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:52:08,771 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:52:08,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:52:08,862 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-16 05:52:08,863 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:52:08,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945002747] [2021-12-16 05:52:08,864 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945002747] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:52:08,864 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:52:08,864 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-16 05:52:08,865 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683417384] [2021-12-16 05:52:08,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:52:08,869 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-16 05:52:08,870 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:52:08,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-16 05:52:08,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-16 05:52:08,895 INFO L87 Difference]: Start difference. First operand has 132 states, 69 states have (on average 2.101449275362319) internal successors, (145), 131 states have internal predecessors, (145), 0 states have call successors, (0), 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 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 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-16 05:52:08,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:52:08,916 INFO L93 Difference]: Finished difference Result 132 states and 140 transitions. [2021-12-16 05:52:08,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-16 05:52:08,918 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 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 5 [2021-12-16 05:52:08,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:52:08,925 INFO L225 Difference]: With dead ends: 132 [2021-12-16 05:52:08,926 INFO L226 Difference]: Without dead ends: 130 [2021-12-16 05:52:08,928 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-16 05:52:08,931 INFO L933 BasicCegarLoop]: 140 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-16 05:52:08,932 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 05:52:08,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2021-12-16 05:52:08,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2021-12-16 05:52:08,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 68 states have (on average 2.0294117647058822) internal successors, (138), 129 states have internal predecessors, (138), 0 states have call successors, (0), 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-16 05:52:08,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 138 transitions. [2021-12-16 05:52:08,972 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 138 transitions. Word has length 5 [2021-12-16 05:52:08,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:52:08,972 INFO L470 AbstractCegarLoop]: Abstraction has 130 states and 138 transitions. [2021-12-16 05:52:08,972 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 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-16 05:52:08,973 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 138 transitions. [2021-12-16 05:52:08,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-12-16 05:52:08,973 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:52:08,973 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-12-16 05:52:08,974 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-16 05:52:08,974 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 58 more)] === [2021-12-16 05:52:08,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:52:08,975 INFO L85 PathProgramCache]: Analyzing trace with hash 889570808, now seen corresponding path program 1 times [2021-12-16 05:52:08,975 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:52:08,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137297255] [2021-12-16 05:52:08,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:52:08,976 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:52:08,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:52:09,030 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-16 05:52:09,030 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:52:09,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137297255] [2021-12-16 05:52:09,031 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137297255] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:52:09,031 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:52:09,032 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-16 05:52:09,032 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596380622] [2021-12-16 05:52:09,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:52:09,033 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-16 05:52:09,033 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:52:09,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 05:52:09,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-16 05:52:09,034 INFO L87 Difference]: Start difference. First operand 130 states and 138 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 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-16 05:52:09,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:52:09,188 INFO L93 Difference]: Finished difference Result 176 states and 186 transitions. [2021-12-16 05:52:09,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 05:52:09,188 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 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-16 05:52:09,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:52:09,190 INFO L225 Difference]: With dead ends: 176 [2021-12-16 05:52:09,190 INFO L226 Difference]: Without dead ends: 175 [2021-12-16 05:52:09,190 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-16 05:52:09,192 INFO L933 BasicCegarLoop]: 117 mSDtfsCounter, 42 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 05:52:09,192 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 192 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-16 05:52:09,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2021-12-16 05:52:09,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 133. [2021-12-16 05:52:09,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 71 states have (on average 2.0) internal successors, (142), 132 states have internal predecessors, (142), 0 states have call successors, (0), 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-16 05:52:09,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 142 transitions. [2021-12-16 05:52:09,200 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 142 transitions. Word has length 6 [2021-12-16 05:52:09,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:52:09,201 INFO L470 AbstractCegarLoop]: Abstraction has 133 states and 142 transitions. [2021-12-16 05:52:09,201 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 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-16 05:52:09,201 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 142 transitions. [2021-12-16 05:52:09,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-12-16 05:52:09,202 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:52:09,202 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-12-16 05:52:09,202 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-16 05:52:09,202 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 58 more)] === [2021-12-16 05:52:09,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:52:09,203 INFO L85 PathProgramCache]: Analyzing trace with hash 889570732, now seen corresponding path program 1 times [2021-12-16 05:52:09,203 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:52:09,203 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240284185] [2021-12-16 05:52:09,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:52:09,204 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:52:09,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:52:09,261 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-16 05:52:09,261 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:52:09,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240284185] [2021-12-16 05:52:09,262 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240284185] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:52:09,262 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:52:09,262 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-16 05:52:09,262 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712387456] [2021-12-16 05:52:09,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:52:09,263 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-16 05:52:09,263 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:52:09,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 05:52:09,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-16 05:52:09,264 INFO L87 Difference]: Start difference. First operand 133 states and 142 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 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-16 05:52:09,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:52:09,311 INFO L93 Difference]: Finished difference Result 145 states and 152 transitions. [2021-12-16 05:52:09,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 05:52:09,312 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 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-16 05:52:09,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:52:09,312 INFO L225 Difference]: With dead ends: 145 [2021-12-16 05:52:09,312 INFO L226 Difference]: Without dead ends: 144 [2021-12-16 05:52:09,313 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-16 05:52:09,313 INFO L933 BasicCegarLoop]: 137 mSDtfsCounter, 15 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-16 05:52:09,314 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 229 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 05:52:09,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2021-12-16 05:52:09,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 138. [2021-12-16 05:52:09,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 76 states have (on average 1.9736842105263157) internal successors, (150), 137 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:52:09,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 150 transitions. [2021-12-16 05:52:09,318 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 150 transitions. Word has length 6 [2021-12-16 05:52:09,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:52:09,318 INFO L470 AbstractCegarLoop]: Abstraction has 138 states and 150 transitions. [2021-12-16 05:52:09,318 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 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-16 05:52:09,319 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 150 transitions. [2021-12-16 05:52:09,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-12-16 05:52:09,319 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:52:09,319 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-12-16 05:52:09,319 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-16 05:52:09,319 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 58 more)] === [2021-12-16 05:52:09,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:52:09,320 INFO L85 PathProgramCache]: Analyzing trace with hash 889571339, now seen corresponding path program 1 times [2021-12-16 05:52:09,320 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:52:09,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61555429] [2021-12-16 05:52:09,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:52:09,320 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:52:09,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:52:09,355 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-16 05:52:09,356 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:52:09,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61555429] [2021-12-16 05:52:09,356 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61555429] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:52:09,356 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:52:09,356 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-16 05:52:09,356 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545688770] [2021-12-16 05:52:09,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:52:09,357 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-16 05:52:09,357 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:52:09,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 05:52:09,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-16 05:52:09,357 INFO L87 Difference]: Start difference. First operand 138 states and 150 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 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-16 05:52:09,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:52:09,435 INFO L93 Difference]: Finished difference Result 169 states and 183 transitions. [2021-12-16 05:52:09,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 05:52:09,436 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 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-16 05:52:09,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:52:09,437 INFO L225 Difference]: With dead ends: 169 [2021-12-16 05:52:09,438 INFO L226 Difference]: Without dead ends: 169 [2021-12-16 05:52:09,438 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-16 05:52:09,443 INFO L933 BasicCegarLoop]: 127 mSDtfsCounter, 75 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 05:52:09,446 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [75 Valid, 167 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-16 05:52:09,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2021-12-16 05:52:09,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 139. [2021-12-16 05:52:09,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 80 states have (on average 1.9125) internal successors, (153), 138 states have internal predecessors, (153), 0 states have call successors, (0), 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-16 05:52:09,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 153 transitions. [2021-12-16 05:52:09,460 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 153 transitions. Word has length 6 [2021-12-16 05:52:09,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:52:09,460 INFO L470 AbstractCegarLoop]: Abstraction has 139 states and 153 transitions. [2021-12-16 05:52:09,461 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 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-16 05:52:09,461 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 153 transitions. [2021-12-16 05:52:09,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-12-16 05:52:09,462 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:52:09,462 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-12-16 05:52:09,462 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-16 05:52:09,462 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 58 more)] === [2021-12-16 05:52:09,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:52:09,463 INFO L85 PathProgramCache]: Analyzing trace with hash 889571340, now seen corresponding path program 1 times [2021-12-16 05:52:09,463 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:52:09,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350299999] [2021-12-16 05:52:09,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:52:09,463 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:52:09,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:52:09,494 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-16 05:52:09,494 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:52:09,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350299999] [2021-12-16 05:52:09,495 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350299999] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:52:09,495 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:52:09,495 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-16 05:52:09,495 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593282015] [2021-12-16 05:52:09,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:52:09,495 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-16 05:52:09,496 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:52:09,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 05:52:09,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-16 05:52:09,496 INFO L87 Difference]: Start difference. First operand 139 states and 153 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 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-16 05:52:09,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:52:09,570 INFO L93 Difference]: Finished difference Result 137 states and 149 transitions. [2021-12-16 05:52:09,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 05:52:09,571 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 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-16 05:52:09,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:52:09,571 INFO L225 Difference]: With dead ends: 137 [2021-12-16 05:52:09,571 INFO L226 Difference]: Without dead ends: 137 [2021-12-16 05:52:09,572 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-16 05:52:09,574 INFO L933 BasicCegarLoop]: 119 mSDtfsCounter, 22 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 05:52:09,574 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 173 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-16 05:52:09,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2021-12-16 05:52:09,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2021-12-16 05:52:09,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 80 states have (on average 1.8625) internal successors, (149), 136 states have internal predecessors, (149), 0 states have call successors, (0), 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-16 05:52:09,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 149 transitions. [2021-12-16 05:52:09,581 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 149 transitions. Word has length 6 [2021-12-16 05:52:09,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:52:09,582 INFO L470 AbstractCegarLoop]: Abstraction has 137 states and 149 transitions. [2021-12-16 05:52:09,582 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 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-16 05:52:09,582 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 149 transitions. [2021-12-16 05:52:09,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-16 05:52:09,582 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:52:09,582 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 05:52:09,583 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-16 05:52:09,583 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 58 more)] === [2021-12-16 05:52:09,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:52:09,583 INFO L85 PathProgramCache]: Analyzing trace with hash -2119659887, now seen corresponding path program 1 times [2021-12-16 05:52:09,583 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:52:09,583 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460150476] [2021-12-16 05:52:09,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:52:09,584 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:52:09,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:52:09,626 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-16 05:52:09,627 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:52:09,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460150476] [2021-12-16 05:52:09,627 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460150476] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:52:09,627 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:52:09,627 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-16 05:52:09,627 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694795177] [2021-12-16 05:52:09,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:52:09,628 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-16 05:52:09,628 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:52:09,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 05:52:09,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-16 05:52:09,629 INFO L87 Difference]: Start difference. First operand 137 states and 149 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:52:09,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:52:09,684 INFO L93 Difference]: Finished difference Result 133 states and 145 transitions. [2021-12-16 05:52:09,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 05:52:09,684 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-12-16 05:52:09,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:52:09,685 INFO L225 Difference]: With dead ends: 133 [2021-12-16 05:52:09,685 INFO L226 Difference]: Without dead ends: 133 [2021-12-16 05:52:09,685 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-16 05:52:09,687 INFO L933 BasicCegarLoop]: 113 mSDtfsCounter, 23 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 05:52:09,687 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 168 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-16 05:52:09,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2021-12-16 05:52:09,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2021-12-16 05:52:09,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 80 states have (on average 1.8125) internal successors, (145), 132 states have internal predecessors, (145), 0 states have call successors, (0), 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-16 05:52:09,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 145 transitions. [2021-12-16 05:52:09,689 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 145 transitions. Word has length 11 [2021-12-16 05:52:09,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:52:09,689 INFO L470 AbstractCegarLoop]: Abstraction has 133 states and 145 transitions. [2021-12-16 05:52:09,689 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:52:09,690 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 145 transitions. [2021-12-16 05:52:09,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-16 05:52:09,690 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:52:09,690 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 05:52:09,690 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-16 05:52:09,690 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 58 more)] === [2021-12-16 05:52:09,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:52:09,691 INFO L85 PathProgramCache]: Analyzing trace with hash -2119659886, now seen corresponding path program 1 times [2021-12-16 05:52:09,691 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:52:09,691 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850432679] [2021-12-16 05:52:09,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:52:09,691 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:52:09,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:52:09,741 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-16 05:52:09,741 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:52:09,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850432679] [2021-12-16 05:52:09,741 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850432679] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:52:09,742 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:52:09,742 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-16 05:52:09,742 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010728440] [2021-12-16 05:52:09,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:52:09,742 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-16 05:52:09,742 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:52:09,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 05:52:09,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-16 05:52:09,743 INFO L87 Difference]: Start difference. First operand 133 states and 145 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:52:09,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:52:09,807 INFO L93 Difference]: Finished difference Result 130 states and 142 transitions. [2021-12-16 05:52:09,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 05:52:09,808 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-12-16 05:52:09,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:52:09,809 INFO L225 Difference]: With dead ends: 130 [2021-12-16 05:52:09,809 INFO L226 Difference]: Without dead ends: 130 [2021-12-16 05:52:09,809 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-16 05:52:09,809 INFO L933 BasicCegarLoop]: 118 mSDtfsCounter, 12 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 05:52:09,810 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 179 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-16 05:52:09,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2021-12-16 05:52:09,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2021-12-16 05:52:09,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 80 states have (on average 1.775) internal successors, (142), 129 states have internal predecessors, (142), 0 states have call successors, (0), 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-16 05:52:09,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 142 transitions. [2021-12-16 05:52:09,812 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 142 transitions. Word has length 11 [2021-12-16 05:52:09,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:52:09,812 INFO L470 AbstractCegarLoop]: Abstraction has 130 states and 142 transitions. [2021-12-16 05:52:09,812 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:52:09,812 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 142 transitions. [2021-12-16 05:52:09,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-12-16 05:52:09,813 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:52:09,813 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 05:52:09,813 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-16 05:52:09,813 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 58 more)] === [2021-12-16 05:52:09,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:52:09,814 INFO L85 PathProgramCache]: Analyzing trace with hash -967503371, now seen corresponding path program 1 times [2021-12-16 05:52:09,814 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:52:09,814 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628158935] [2021-12-16 05:52:09,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:52:09,814 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:52:09,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:52:09,856 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 05:52:09,856 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:52:09,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628158935] [2021-12-16 05:52:09,856 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628158935] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:52:09,857 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:52:09,857 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-16 05:52:09,857 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166779910] [2021-12-16 05:52:09,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:52:09,857 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-16 05:52:09,857 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:52:09,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-16 05:52:09,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-16 05:52:09,858 INFO L87 Difference]: Start difference. First operand 130 states and 142 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 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-16 05:52:09,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:52:09,945 INFO L93 Difference]: Finished difference Result 228 states and 248 transitions. [2021-12-16 05:52:09,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-16 05:52:09,945 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-12-16 05:52:09,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:52:09,946 INFO L225 Difference]: With dead ends: 228 [2021-12-16 05:52:09,946 INFO L226 Difference]: Without dead ends: 228 [2021-12-16 05:52:09,946 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-16 05:52:09,947 INFO L933 BasicCegarLoop]: 92 mSDtfsCounter, 126 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 05:52:09,947 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [126 Valid, 251 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-16 05:52:09,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2021-12-16 05:52:09,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 130. [2021-12-16 05:52:09,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 80 states have (on average 1.75) internal successors, (140), 129 states have internal predecessors, (140), 0 states have call successors, (0), 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-16 05:52:09,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 140 transitions. [2021-12-16 05:52:09,949 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 140 transitions. Word has length 18 [2021-12-16 05:52:09,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:52:09,950 INFO L470 AbstractCegarLoop]: Abstraction has 130 states and 140 transitions. [2021-12-16 05:52:09,950 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 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-16 05:52:09,950 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 140 transitions. [2021-12-16 05:52:09,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-12-16 05:52:09,951 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:52:09,951 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 05:52:09,951 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-16 05:52:09,951 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 58 more)] === [2021-12-16 05:52:09,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:52:09,952 INFO L85 PathProgramCache]: Analyzing trace with hash -967503447, now seen corresponding path program 1 times [2021-12-16 05:52:09,952 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:52:09,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046548460] [2021-12-16 05:52:09,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:52:09,952 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:52:09,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:52:10,009 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 05:52:10,010 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:52:10,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046548460] [2021-12-16 05:52:10,010 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046548460] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:52:10,010 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:52:10,010 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-16 05:52:10,010 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102910148] [2021-12-16 05:52:10,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:52:10,011 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-16 05:52:10,011 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:52:10,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-16 05:52:10,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-16 05:52:10,012 INFO L87 Difference]: Start difference. First operand 130 states and 140 transitions. Second operand has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 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-16 05:52:10,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:52:10,140 INFO L93 Difference]: Finished difference Result 124 states and 134 transitions. [2021-12-16 05:52:10,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-16 05:52:10,140 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-12-16 05:52:10,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:52:10,141 INFO L225 Difference]: With dead ends: 124 [2021-12-16 05:52:10,141 INFO L226 Difference]: Without dead ends: 124 [2021-12-16 05:52:10,141 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-16 05:52:10,141 INFO L933 BasicCegarLoop]: 86 mSDtfsCounter, 46 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 05:52:10,141 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 213 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-16 05:52:10,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2021-12-16 05:52:10,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 123. [2021-12-16 05:52:10,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 81 states have (on average 1.654320987654321) internal successors, (134), 122 states have internal predecessors, (134), 0 states have call successors, (0), 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-16 05:52:10,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 134 transitions. [2021-12-16 05:52:10,143 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 134 transitions. Word has length 18 [2021-12-16 05:52:10,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:52:10,143 INFO L470 AbstractCegarLoop]: Abstraction has 123 states and 134 transitions. [2021-12-16 05:52:10,143 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 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-16 05:52:10,143 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 134 transitions. [2021-12-16 05:52:10,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-12-16 05:52:10,144 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:52:10,144 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 05:52:10,144 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-16 05:52:10,144 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 58 more)] === [2021-12-16 05:52:10,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:52:10,144 INFO L85 PathProgramCache]: Analyzing trace with hash -967503446, now seen corresponding path program 1 times [2021-12-16 05:52:10,144 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:52:10,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990986941] [2021-12-16 05:52:10,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:52:10,144 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:52:10,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:52:10,196 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 05:52:10,197 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:52:10,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990986941] [2021-12-16 05:52:10,197 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990986941] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:52:10,197 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:52:10,197 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-16 05:52:10,197 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360575619] [2021-12-16 05:52:10,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:52:10,198 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-16 05:52:10,198 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:52:10,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-16 05:52:10,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-16 05:52:10,198 INFO L87 Difference]: Start difference. First operand 123 states and 134 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 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-16 05:52:10,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:52:10,319 INFO L93 Difference]: Finished difference Result 204 states and 223 transitions. [2021-12-16 05:52:10,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-16 05:52:10,319 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-12-16 05:52:10,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:52:10,320 INFO L225 Difference]: With dead ends: 204 [2021-12-16 05:52:10,320 INFO L226 Difference]: Without dead ends: 204 [2021-12-16 05:52:10,320 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-16 05:52:10,321 INFO L933 BasicCegarLoop]: 71 mSDtfsCounter, 100 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 05:52:10,321 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [100 Valid, 168 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-16 05:52:10,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2021-12-16 05:52:10,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 162. [2021-12-16 05:52:10,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 122 states have (on average 1.680327868852459) internal successors, (205), 161 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-16 05:52:10,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 205 transitions. [2021-12-16 05:52:10,324 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 205 transitions. Word has length 18 [2021-12-16 05:52:10,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:52:10,324 INFO L470 AbstractCegarLoop]: Abstraction has 162 states and 205 transitions. [2021-12-16 05:52:10,324 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 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-16 05:52:10,324 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 205 transitions. [2021-12-16 05:52:10,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-12-16 05:52:10,325 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:52:10,325 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 05:52:10,325 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-16 05:52:10,325 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 58 more)] === [2021-12-16 05:52:10,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:52:10,326 INFO L85 PathProgramCache]: Analyzing trace with hash 199814016, now seen corresponding path program 1 times [2021-12-16 05:52:10,326 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:52:10,326 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958157587] [2021-12-16 05:52:10,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:52:10,326 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:52:10,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:52:10,365 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 05:52:10,365 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:52:10,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958157587] [2021-12-16 05:52:10,365 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958157587] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:52:10,366 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:52:10,366 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-16 05:52:10,366 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356577654] [2021-12-16 05:52:10,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:52:10,366 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-16 05:52:10,366 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:52:10,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-16 05:52:10,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-16 05:52:10,367 INFO L87 Difference]: Start difference. First operand 162 states and 205 transitions. Second operand has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 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-16 05:52:10,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:52:10,454 INFO L93 Difference]: Finished difference Result 205 states and 224 transitions. [2021-12-16 05:52:10,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-16 05:52:10,455 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 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-16 05:52:10,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:52:10,456 INFO L225 Difference]: With dead ends: 205 [2021-12-16 05:52:10,456 INFO L226 Difference]: Without dead ends: 205 [2021-12-16 05:52:10,456 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2021-12-16 05:52:10,457 INFO L933 BasicCegarLoop]: 121 mSDtfsCounter, 225 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 05:52:10,457 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [225 Valid, 309 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-16 05:52:10,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2021-12-16 05:52:10,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 163. [2021-12-16 05:52:10,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 123 states have (on average 1.6747967479674797) internal successors, (206), 162 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-16 05:52:10,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 206 transitions. [2021-12-16 05:52:10,459 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 206 transitions. Word has length 23 [2021-12-16 05:52:10,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:52:10,460 INFO L470 AbstractCegarLoop]: Abstraction has 163 states and 206 transitions. [2021-12-16 05:52:10,460 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 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-16 05:52:10,460 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 206 transitions. [2021-12-16 05:52:10,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-12-16 05:52:10,460 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:52:10,461 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 05:52:10,461 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-16 05:52:10,461 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 58 more)] === [2021-12-16 05:52:10,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:52:10,461 INFO L85 PathProgramCache]: Analyzing trace with hash 198674982, now seen corresponding path program 1 times [2021-12-16 05:52:10,461 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:52:10,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398272694] [2021-12-16 05:52:10,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:52:10,462 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:52:10,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:52:10,561 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 05:52:10,562 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:52:10,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398272694] [2021-12-16 05:52:10,562 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398272694] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:52:10,562 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:52:10,562 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-16 05:52:10,562 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411037539] [2021-12-16 05:52:10,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:52:10,563 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-16 05:52:10,563 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:52:10,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-16 05:52:10,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-16 05:52:10,564 INFO L87 Difference]: Start difference. First operand 163 states and 206 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 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-16 05:52:10,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:52:10,672 INFO L93 Difference]: Finished difference Result 191 states and 235 transitions. [2021-12-16 05:52:10,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-16 05:52:10,673 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 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-16 05:52:10,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:52:10,675 INFO L225 Difference]: With dead ends: 191 [2021-12-16 05:52:10,675 INFO L226 Difference]: Without dead ends: 191 [2021-12-16 05:52:10,675 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-16 05:52:10,675 INFO L933 BasicCegarLoop]: 108 mSDtfsCounter, 23 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 05:52:10,676 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 399 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-16 05:52:10,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2021-12-16 05:52:10,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 170. [2021-12-16 05:52:10,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 130 states have (on average 1.646153846153846) internal successors, (214), 169 states have internal predecessors, (214), 0 states have call successors, (0), 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-16 05:52:10,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 214 transitions. [2021-12-16 05:52:10,679 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 214 transitions. Word has length 23 [2021-12-16 05:52:10,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:52:10,680 INFO L470 AbstractCegarLoop]: Abstraction has 170 states and 214 transitions. [2021-12-16 05:52:10,680 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 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-16 05:52:10,680 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 214 transitions. [2021-12-16 05:52:10,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-16 05:52:10,682 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:52:10,682 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] [2021-12-16 05:52:10,682 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-16 05:52:10,682 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr56REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 58 more)] === [2021-12-16 05:52:10,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:52:10,683 INFO L85 PathProgramCache]: Analyzing trace with hash -165115758, now seen corresponding path program 1 times [2021-12-16 05:52:10,683 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:52:10,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439198844] [2021-12-16 05:52:10,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:52:10,683 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:52:10,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:52:10,870 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 05:52:10,871 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:52:10,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439198844] [2021-12-16 05:52:10,871 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439198844] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:52:10,871 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:52:10,871 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-16 05:52:10,871 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359438559] [2021-12-16 05:52:10,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:52:10,872 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-16 05:52:10,872 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:52:10,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-16 05:52:10,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2021-12-16 05:52:10,872 INFO L87 Difference]: Start difference. First operand 170 states and 214 transitions. Second operand has 11 states, 10 states have (on average 2.6) internal successors, (26), 11 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-16 05:52:11,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:52:11,347 INFO L93 Difference]: Finished difference Result 228 states and 279 transitions. [2021-12-16 05:52:11,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-16 05:52:11,347 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.6) internal successors, (26), 11 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-16 05:52:11,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:52:11,348 INFO L225 Difference]: With dead ends: 228 [2021-12-16 05:52:11,348 INFO L226 Difference]: Without dead ends: 228 [2021-12-16 05:52:11,348 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2021-12-16 05:52:11,349 INFO L933 BasicCegarLoop]: 100 mSDtfsCounter, 127 mSDsluCounter, 391 mSDsCounter, 0 mSdLazyCounter, 791 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 813 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-16 05:52:11,349 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [127 Valid, 491 Invalid, 813 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 791 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-16 05:52:11,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2021-12-16 05:52:11,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 177. [2021-12-16 05:52:11,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 137 states have (on average 1.6277372262773722) internal successors, (223), 176 states have internal predecessors, (223), 0 states have call successors, (0), 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-16 05:52:11,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 223 transitions. [2021-12-16 05:52:11,354 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 223 transitions. Word has length 26 [2021-12-16 05:52:11,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:52:11,355 INFO L470 AbstractCegarLoop]: Abstraction has 177 states and 223 transitions. [2021-12-16 05:52:11,355 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.6) internal successors, (26), 11 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-16 05:52:11,355 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 223 transitions. [2021-12-16 05:52:11,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-16 05:52:11,356 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:52:11,356 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] [2021-12-16 05:52:11,356 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-16 05:52:11,356 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr57REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 58 more)] === [2021-12-16 05:52:11,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:52:11,357 INFO L85 PathProgramCache]: Analyzing trace with hash -165115757, now seen corresponding path program 1 times [2021-12-16 05:52:11,357 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:52:11,357 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847091661] [2021-12-16 05:52:11,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:52:11,358 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:52:11,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:52:11,515 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 05:52:11,516 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:52:11,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847091661] [2021-12-16 05:52:11,516 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847091661] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:52:11,516 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:52:11,516 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-16 05:52:11,516 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611058377] [2021-12-16 05:52:11,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:52:11,517 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-16 05:52:11,517 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:52:11,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-16 05:52:11,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-12-16 05:52:11,518 INFO L87 Difference]: Start difference. First operand 177 states and 223 transitions. Second operand has 10 states, 9 states have (on average 2.888888888888889) 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-16 05:52:11,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:52:11,985 INFO L93 Difference]: Finished difference Result 207 states and 251 transitions. [2021-12-16 05:52:11,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-16 05:52:11,986 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.888888888888889) 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-16 05:52:11,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:52:12,000 INFO L225 Difference]: With dead ends: 207 [2021-12-16 05:52:12,000 INFO L226 Difference]: Without dead ends: 207 [2021-12-16 05:52:12,001 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2021-12-16 05:52:12,001 INFO L933 BasicCegarLoop]: 94 mSDtfsCounter, 94 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 462 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 462 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-16 05:52:12,002 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [94 Valid, 354 Invalid, 480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 462 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-16 05:52:12,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2021-12-16 05:52:12,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 177. [2021-12-16 05:52:12,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 137 states have (on average 1.6204379562043796) internal successors, (222), 176 states have internal predecessors, (222), 0 states have call successors, (0), 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-16 05:52:12,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 222 transitions. [2021-12-16 05:52:12,005 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 222 transitions. Word has length 26 [2021-12-16 05:52:12,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:52:12,006 INFO L470 AbstractCegarLoop]: Abstraction has 177 states and 222 transitions. [2021-12-16 05:52:12,006 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.888888888888889) 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-16 05:52:12,006 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 222 transitions. [2021-12-16 05:52:12,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-12-16 05:52:12,007 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:52:12,007 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] [2021-12-16 05:52:12,007 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-16 05:52:12,007 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 58 more)] === [2021-12-16 05:52:12,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:52:12,008 INFO L85 PathProgramCache]: Analyzing trace with hash -823622550, now seen corresponding path program 1 times [2021-12-16 05:52:12,008 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:52:12,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774216874] [2021-12-16 05:52:12,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:52:12,008 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:52:12,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:52:12,114 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 05:52:12,114 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:52:12,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774216874] [2021-12-16 05:52:12,115 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774216874] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:52:12,115 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:52:12,115 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-16 05:52:12,115 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251430829] [2021-12-16 05:52:12,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:52:12,116 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-16 05:52:12,116 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:52:12,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-16 05:52:12,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-12-16 05:52:12,116 INFO L87 Difference]: Start difference. First operand 177 states and 222 transitions. Second operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 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-16 05:52:12,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:52:12,267 INFO L93 Difference]: Finished difference Result 194 states and 238 transitions. [2021-12-16 05:52:12,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-16 05:52:12,268 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 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-16 05:52:12,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:52:12,268 INFO L225 Difference]: With dead ends: 194 [2021-12-16 05:52:12,269 INFO L226 Difference]: Without dead ends: 194 [2021-12-16 05:52:12,269 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2021-12-16 05:52:12,269 INFO L933 BasicCegarLoop]: 99 mSDtfsCounter, 48 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 05:52:12,269 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 412 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-16 05:52:12,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2021-12-16 05:52:12,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 177. [2021-12-16 05:52:12,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 137 states have (on average 1.6131386861313868) internal successors, (221), 176 states have internal predecessors, (221), 0 states have call successors, (0), 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-16 05:52:12,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 221 transitions. [2021-12-16 05:52:12,275 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 221 transitions. Word has length 27 [2021-12-16 05:52:12,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:52:12,276 INFO L470 AbstractCegarLoop]: Abstraction has 177 states and 221 transitions. [2021-12-16 05:52:12,276 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 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-16 05:52:12,276 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 221 transitions. [2021-12-16 05:52:12,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-12-16 05:52:12,276 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:52:12,276 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] [2021-12-16 05:52:12,276 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-12-16 05:52:12,277 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 58 more)] === [2021-12-16 05:52:12,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:52:12,277 INFO L85 PathProgramCache]: Analyzing trace with hash 237551634, now seen corresponding path program 1 times [2021-12-16 05:52:12,277 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:52:12,277 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080300434] [2021-12-16 05:52:12,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:52:12,277 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:52:12,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:52:12,381 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 05:52:12,382 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:52:12,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080300434] [2021-12-16 05:52:12,382 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080300434] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:52:12,382 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:52:12,382 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-16 05:52:12,382 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162705064] [2021-12-16 05:52:12,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:52:12,382 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-16 05:52:12,383 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:52:12,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-16 05:52:12,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2021-12-16 05:52:12,383 INFO L87 Difference]: Start difference. First operand 177 states and 221 transitions. Second operand has 9 states, 8 states have (on average 3.5) internal successors, (28), 9 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-16 05:52:12,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:52:12,620 INFO L93 Difference]: Finished difference Result 229 states and 275 transitions. [2021-12-16 05:52:12,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-16 05:52:12,620 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.5) internal successors, (28), 9 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-16 05:52:12,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:52:12,621 INFO L225 Difference]: With dead ends: 229 [2021-12-16 05:52:12,622 INFO L226 Difference]: Without dead ends: 229 [2021-12-16 05:52:12,622 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2021-12-16 05:52:12,622 INFO L933 BasicCegarLoop]: 112 mSDtfsCounter, 198 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-16 05:52:12,623 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [198 Valid, 463 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-16 05:52:12,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2021-12-16 05:52:12,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 179. [2021-12-16 05:52:12,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 139 states have (on average 1.60431654676259) internal successors, (223), 178 states have internal predecessors, (223), 0 states have call successors, (0), 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-16 05:52:12,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 223 transitions. [2021-12-16 05:52:12,627 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 223 transitions. Word has length 28 [2021-12-16 05:52:12,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:52:12,627 INFO L470 AbstractCegarLoop]: Abstraction has 179 states and 223 transitions. [2021-12-16 05:52:12,627 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.5) internal successors, (28), 9 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-16 05:52:12,627 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 223 transitions. [2021-12-16 05:52:12,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-16 05:52:12,628 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:52:12,628 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] [2021-12-16 05:52:12,628 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-16 05:52:12,628 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 58 more)] === [2021-12-16 05:52:12,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:52:12,629 INFO L85 PathProgramCache]: Analyzing trace with hash -1225833714, now seen corresponding path program 1 times [2021-12-16 05:52:12,629 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:52:12,629 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333155262] [2021-12-16 05:52:12,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:52:12,629 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:52:12,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:52:12,733 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 05:52:12,733 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:52:12,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333155262] [2021-12-16 05:52:12,733 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333155262] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:52:12,733 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:52:12,733 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-16 05:52:12,734 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363737973] [2021-12-16 05:52:12,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:52:12,734 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-16 05:52:12,734 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:52:12,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-16 05:52:12,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-12-16 05:52:12,735 INFO L87 Difference]: Start difference. First operand 179 states and 223 transitions. Second operand has 9 states, 8 states have (on average 3.625) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:52:12,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:52:12,946 INFO L93 Difference]: Finished difference Result 200 states and 244 transitions. [2021-12-16 05:52:12,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-16 05:52:12,947 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-12-16 05:52:12,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:52:12,947 INFO L225 Difference]: With dead ends: 200 [2021-12-16 05:52:12,947 INFO L226 Difference]: Without dead ends: 200 [2021-12-16 05:52:12,948 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2021-12-16 05:52:12,948 INFO L933 BasicCegarLoop]: 94 mSDtfsCounter, 54 mSDsluCounter, 410 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 504 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-16 05:52:12,948 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [54 Valid, 504 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-16 05:52:12,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2021-12-16 05:52:12,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 180. [2021-12-16 05:52:12,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 140 states have (on average 1.6) internal successors, (224), 179 states have internal predecessors, (224), 0 states have call successors, (0), 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-16 05:52:12,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 224 transitions. [2021-12-16 05:52:12,952 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 224 transitions. Word has length 29 [2021-12-16 05:52:12,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:52:12,953 INFO L470 AbstractCegarLoop]: Abstraction has 180 states and 224 transitions. [2021-12-16 05:52:12,953 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:52:12,953 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 224 transitions. [2021-12-16 05:52:12,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-12-16 05:52:12,953 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:52:12,954 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] [2021-12-16 05:52:12,954 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-12-16 05:52:12,954 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 58 more)] === [2021-12-16 05:52:12,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:52:12,954 INFO L85 PathProgramCache]: Analyzing trace with hash 653860756, now seen corresponding path program 1 times [2021-12-16 05:52:12,955 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:52:12,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906445192] [2021-12-16 05:52:12,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:52:12,955 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:52:12,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:52:12,989 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-16 05:52:12,989 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:52:12,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906445192] [2021-12-16 05:52:12,990 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906445192] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:52:12,990 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:52:12,990 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-16 05:52:12,990 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320771469] [2021-12-16 05:52:12,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:52:12,990 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-16 05:52:12,991 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:52:12,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-16 05:52:12,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-16 05:52:12,991 INFO L87 Difference]: Start difference. First operand 180 states and 224 transitions. Second operand has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:52:13,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:52:13,126 INFO L93 Difference]: Finished difference Result 251 states and 315 transitions. [2021-12-16 05:52:13,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-16 05:52:13,127 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-12-16 05:52:13,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:52:13,128 INFO L225 Difference]: With dead ends: 251 [2021-12-16 05:52:13,128 INFO L226 Difference]: Without dead ends: 251 [2021-12-16 05:52:13,128 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-16 05:52:13,128 INFO L933 BasicCegarLoop]: 127 mSDtfsCounter, 77 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 05:52:13,129 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [77 Valid, 230 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-16 05:52:13,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2021-12-16 05:52:13,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 184. [2021-12-16 05:52:13,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 146 states have (on average 1.6095890410958904) internal successors, (235), 183 states have internal predecessors, (235), 0 states have call successors, (0), 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-16 05:52:13,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 235 transitions. [2021-12-16 05:52:13,133 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 235 transitions. Word has length 30 [2021-12-16 05:52:13,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:52:13,134 INFO L470 AbstractCegarLoop]: Abstraction has 184 states and 235 transitions. [2021-12-16 05:52:13,134 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:52:13,134 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 235 transitions. [2021-12-16 05:52:13,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-12-16 05:52:13,134 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:52:13,135 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 05:52:13,135 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-12-16 05:52:13,135 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr56REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 58 more)] === [2021-12-16 05:52:13,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:52:13,135 INFO L85 PathProgramCache]: Analyzing trace with hash 1294968215, now seen corresponding path program 1 times [2021-12-16 05:52:13,135 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:52:13,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185141403] [2021-12-16 05:52:13,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:52:13,136 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:52:13,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:52:13,432 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 05:52:13,432 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:52:13,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185141403] [2021-12-16 05:52:13,433 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185141403] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 05:52:13,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1083657579] [2021-12-16 05:52:13,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:52:13,433 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 05:52:13,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 05:52:13,435 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-16 05:52:13,447 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-16 05:52:13,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:52:13,522 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 48 conjunts are in the unsatisfiable core [2021-12-16 05:52:13,527 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 05:52:13,579 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-16 05:52:13,583 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-16 05:52:13,661 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 19 treesize of output 18 [2021-12-16 05:52:13,666 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 19 treesize of output 18 [2021-12-16 05:52:13,781 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-16 05:52:13,782 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2021-12-16 05:52:13,813 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-16 05:52:13,814 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2021-12-16 05:52:13,899 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-16 05:52:13,900 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 24 [2021-12-16 05:52:13,906 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-16 05:52:14,198 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-16 05:52:14,663 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-16 05:52:14,675 INFO L354 Elim1Store]: treesize reduction 19, result has 29.6 percent of original size [2021-12-16 05:52:14,675 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 76 treesize of output 48 [2021-12-16 05:52:14,688 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-16 05:52:14,689 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 19 [2021-12-16 05:52:14,699 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-16 05:52:14,699 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-16 05:52:14,800 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 05:52:14,800 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 05:52:15,002 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 10 treesize of output 8 [2021-12-16 05:52:15,509 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~lItem~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~lItem~0#1.base|) (+ |c_ULTIMATE.start_main_~lItem~0#1.offset| 4) |c_ULTIMATE.start_main_~item~0#1.base|)))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~data~0#1.base|) 4))) (let ((.cse2 (= .cse1 |c_ULTIMATE.start_main_~data~0#1.base|))) (and (or (= (select (select .cse0 .cse1) 0) 0) .cse2) (or (forall ((v_ArrVal_422 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_422) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~lItem~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~lItem~0#1.base|) (+ |c_ULTIMATE.start_main_~lItem~0#1.offset| 4) |c_ULTIMATE.start_main_~item~0#1.base|)) |c_ULTIMATE.start_main_~data~0#1.base|) 4)) 0) 0)) .cse2))))) is different from false [2021-12-16 05:52:15,602 INFO L354 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2021-12-16 05:52:15,602 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 67 treesize of output 72 [2021-12-16 05:52:15,833 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 57 treesize of output 53 [2021-12-16 05:52:16,044 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_arrayElimCell_16 Int) (v_ArrVal_422 (Array Int Int))) (let ((.cse2 (= 0 |c_ULTIMATE.start_main_~lItem~0#1.offset|))) (let ((.cse1 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_422)) (.cse0 (not .cse2))) (or (and .cse0 (= v_arrayElimCell_16 |ULTIMATE.start_main_~lItem~0#1.base|)) (and (= (select (select .cse1 |c_ULTIMATE.start_main_~item~0#1.base|) 0) 0) .cse2) (and (= |c_ULTIMATE.start_main_~item~0#1.base| |ULTIMATE.start_main_~lItem~0#1.base|) .cse2) (and (= (select (select .cse1 v_arrayElimCell_16) 0) 0) .cse0))))) (forall ((v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int)) (let ((.cse3 (select v_arrayElimArr_1 4))) (or (not (= (select v_arrayElimArr_1 (+ |c_ULTIMATE.start_main_~lItem~0#1.offset| 4)) |c_ULTIMATE.start_main_~item~0#1.base|)) (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1) .cse3) 0) 0) (= .cse3 |ULTIMATE.start_main_~lItem~0#1.base|))))) is different from false [2021-12-16 05:52:16,320 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int)) (let ((.cse0 (select v_arrayElimArr_1 4))) (or (not (= .cse0 |c_ULTIMATE.start_main_~item~0#1.base|)) (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1) .cse0) 0) 0) (= .cse0 |ULTIMATE.start_main_~lItem~0#1.base|)))) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_ArrVal_422 (Array Int Int))) (or (= (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_422) |c_ULTIMATE.start_main_~item~0#1.base|) 0) 0) (= |c_ULTIMATE.start_main_~item~0#1.base| |ULTIMATE.start_main_~lItem~0#1.base|)))) is different from false [2021-12-16 05:52:16,345 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_ArrVal_415 Int) (v_ArrVal_422 (Array Int Int))) (or (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base|) (+ |c_ULTIMATE.start_main_~item~0#1.offset| 4) v_ArrVal_415)) |ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_422) |c_ULTIMATE.start_main_~item~0#1.base|) 0) 0) (= |c_ULTIMATE.start_main_~item~0#1.base| |ULTIMATE.start_main_~lItem~0#1.base|))) (forall ((v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_ArrVal_418 Int)) (let ((.cse0 (select v_arrayElimArr_1 4))) (or (not (= .cse0 |c_ULTIMATE.start_main_~item~0#1.base|)) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) (+ |c_ULTIMATE.start_main_~item~0#1.offset| 4) v_ArrVal_418)) |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1) .cse0) 0) 0) (= .cse0 |ULTIMATE.start_main_~lItem~0#1.base|))))) is different from false [2021-12-16 05:52:16,389 INFO L354 Elim1Store]: treesize reduction 23, result has 50.0 percent of original size [2021-12-16 05:52:16,389 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 2 case distinctions, treesize of input 29 treesize of output 35 [2021-12-16 05:52:16,394 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-16 05:52:16,398 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-16 05:52:16,398 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 11 [2021-12-16 05:52:16,403 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-16 05:52:16,406 INFO L354 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2021-12-16 05:52:16,406 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 1 [2021-12-16 05:52:16,413 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 05:52:16,413 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1083657579] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 05:52:16,413 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-16 05:52:16,413 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 18, 18] total 41 [2021-12-16 05:52:16,414 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921206178] [2021-12-16 05:52:16,414 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-16 05:52:16,414 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2021-12-16 05:52:16,414 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:52:16,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2021-12-16 05:52:16,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=1173, Unknown=4, NotChecked=292, Total=1640 [2021-12-16 05:52:16,415 INFO L87 Difference]: Start difference. First operand 184 states and 235 transitions. Second operand has 41 states, 41 states have (on average 1.8048780487804879) internal successors, (74), 41 states have internal predecessors, (74), 0 states have call successors, (0), 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-16 05:52:16,436 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_ArrVal_415 Int) (v_ArrVal_422 (Array Int Int))) (or (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base|) (+ |c_ULTIMATE.start_main_~item~0#1.offset| 4) v_ArrVal_415)) |ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_422) |c_ULTIMATE.start_main_~item~0#1.base|) 0) 0) (= |c_ULTIMATE.start_main_~item~0#1.base| |ULTIMATE.start_main_~lItem~0#1.base|))) (forall ((v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_ArrVal_418 Int)) (let ((.cse0 (select v_arrayElimArr_1 4))) (or (not (= .cse0 |c_ULTIMATE.start_main_~item~0#1.base|)) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) (+ |c_ULTIMATE.start_main_~item~0#1.offset| 4) v_ArrVal_418)) |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1) .cse0) 0) 0) (= .cse0 |ULTIMATE.start_main_~lItem~0#1.base|)))) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (= 1 (select |c_#valid| |c_ULTIMATE.start_main_~item~0#1.base|)) (= |c_ULTIMATE.start_main_~item~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0)) is different from false [2021-12-16 05:52:16,440 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int)) (let ((.cse0 (select v_arrayElimArr_1 4))) (or (not (= .cse0 |c_ULTIMATE.start_main_~item~0#1.base|)) (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1) .cse0) 0) 0) (= .cse0 |ULTIMATE.start_main_~lItem~0#1.base|)))) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_ArrVal_422 (Array Int Int))) (or (= (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_422) |c_ULTIMATE.start_main_~item~0#1.base|) 0) 0) (= |c_ULTIMATE.start_main_~item~0#1.base| |ULTIMATE.start_main_~lItem~0#1.base|))) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (= 1 (select |c_#valid| |c_ULTIMATE.start_main_~item~0#1.base|)) (= |c_ULTIMATE.start_main_~item~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0)) is different from false [2021-12-16 05:52:16,442 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_arrayElimCell_16 Int) (v_ArrVal_422 (Array Int Int))) (let ((.cse2 (= 0 |c_ULTIMATE.start_main_~lItem~0#1.offset|))) (let ((.cse1 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_422)) (.cse0 (not .cse2))) (or (and .cse0 (= v_arrayElimCell_16 |ULTIMATE.start_main_~lItem~0#1.base|)) (and (= (select (select .cse1 |c_ULTIMATE.start_main_~item~0#1.base|) 0) 0) .cse2) (and (= |c_ULTIMATE.start_main_~item~0#1.base| |ULTIMATE.start_main_~lItem~0#1.base|) .cse2) (and (= (select (select .cse1 v_arrayElimCell_16) 0) 0) .cse0))))) (not (= |c_ULTIMATE.start_main_~item~0#1.base| |c_ULTIMATE.start_main_~lItem~0#1.base|)) (= |c_ULTIMATE.start_main_~item~0#1.offset| 0) (= |c_ULTIMATE.start_main_~lItem~0#1.offset| 0) (forall ((v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int)) (let ((.cse3 (select v_arrayElimArr_1 4))) (or (not (= (select v_arrayElimArr_1 (+ |c_ULTIMATE.start_main_~lItem~0#1.offset| 4)) |c_ULTIMATE.start_main_~item~0#1.base|)) (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1) .cse3) 0) 0) (= .cse3 |ULTIMATE.start_main_~lItem~0#1.base|)))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0)) is different from false [2021-12-16 05:52:16,568 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0)) (.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~data~0#1.base|) (+ |c_ULTIMATE.start_main_~data~0#1.offset| 4))) (.cse3 (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0))) (and (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_ArrVal_415 Int) (v_ArrVal_422 (Array Int Int))) (or (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base|) (+ |c_ULTIMATE.start_main_~item~0#1.offset| 4) v_ArrVal_415)) |ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_422) |c_ULTIMATE.start_main_~item~0#1.base|) 0) 0) (= |c_ULTIMATE.start_main_~item~0#1.base| |ULTIMATE.start_main_~lItem~0#1.base|))) (= (select (select |c_#memory_$Pointer$.base| .cse0) 0) 0) (forall ((v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_ArrVal_418 Int)) (let ((.cse1 (select v_arrayElimArr_1 4))) (or (not (= .cse1 |c_ULTIMATE.start_main_~item~0#1.base|)) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) (+ |c_ULTIMATE.start_main_~item~0#1.offset| 4) v_ArrVal_418)) |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1) .cse1) 0) 0) (= .cse1 |ULTIMATE.start_main_~lItem~0#1.base|)))) .cse2 (or (and .cse2 .cse3) (not (= 0 |c_ULTIMATE.start_main_~item~0#1.offset|))) (= |c_ULTIMATE.start_main_~data~0#1.offset| 0) (= 1 (select |c_#valid| |c_ULTIMATE.start_main_~item~0#1.base|)) (= |c_ULTIMATE.start_main_~item~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| .cse0) 0) 0) .cse3)) is different from false [2021-12-16 05:52:16,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:52:16,958 INFO L93 Difference]: Finished difference Result 209 states and 261 transitions. [2021-12-16 05:52:16,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-12-16 05:52:16,958 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 1.8048780487804879) internal successors, (74), 41 states have internal predecessors, (74), 0 states have call successors, (0), 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-16 05:52:16,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:52:16,959 INFO L225 Difference]: With dead ends: 209 [2021-12-16 05:52:16,959 INFO L226 Difference]: Without dead ends: 209 [2021-12-16 05:52:16,960 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 38 SyntacticMatches, 5 SemanticMatches, 52 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 716 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=287, Invalid=1807, Unknown=8, NotChecked=760, Total=2862 [2021-12-16 05:52:16,960 INFO L933 BasicCegarLoop]: 99 mSDtfsCounter, 194 mSDsluCounter, 1081 mSDsCounter, 0 mSdLazyCounter, 442 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 1180 SdHoareTripleChecker+Invalid, 1335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 854 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-16 05:52:16,960 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [194 Valid, 1180 Invalid, 1335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 442 Invalid, 0 Unknown, 854 Unchecked, 0.2s Time] [2021-12-16 05:52:16,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2021-12-16 05:52:16,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 186. [2021-12-16 05:52:16,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 148 states have (on average 1.6013513513513513) internal successors, (237), 185 states have internal predecessors, (237), 0 states have call successors, (0), 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-16 05:52:16,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 237 transitions. [2021-12-16 05:52:16,963 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 237 transitions. Word has length 32 [2021-12-16 05:52:16,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:52:16,963 INFO L470 AbstractCegarLoop]: Abstraction has 186 states and 237 transitions. [2021-12-16 05:52:16,973 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 1.8048780487804879) internal successors, (74), 41 states have internal predecessors, (74), 0 states have call successors, (0), 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-16 05:52:16,973 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 237 transitions. [2021-12-16 05:52:16,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-12-16 05:52:16,973 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:52:16,974 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] [2021-12-16 05:52:17,007 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-16 05:52:17,183 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 05:52:17,184 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 58 more)] === [2021-12-16 05:52:17,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:52:17,184 INFO L85 PathProgramCache]: Analyzing trace with hash 1489307653, now seen corresponding path program 1 times [2021-12-16 05:52:17,184 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:52:17,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341870281] [2021-12-16 05:52:17,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:52:17,184 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:52:17,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:52:17,528 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-16 05:52:17,528 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:52:17,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341870281] [2021-12-16 05:52:17,528 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341870281] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 05:52:17,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [678642360] [2021-12-16 05:52:17,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:52:17,528 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 05:52:17,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 05:52:17,529 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-16 05:52:17,530 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-16 05:52:17,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:52:17,611 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 32 conjunts are in the unsatisfiable core [2021-12-16 05:52:17,615 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 05:52:17,770 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-16 05:52:17,909 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-16 05:52:17,909 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 44 treesize of output 36 [2021-12-16 05:52:18,390 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-16 05:52:18,390 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 05:52:18,863 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 118 treesize of output 100 [2021-12-16 05:52:18,999 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 92 treesize of output 80 [2021-12-16 05:52:39,687 WARN L227 SmtUtils]: Spent 20.10s on a formula simplification. DAG size of input: 50 DAG size of output: 47 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-16 05:52:45,778 WARN L227 SmtUtils]: Spent 6.02s on a formula simplification that was a NOOP. DAG size: 45 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-16 05:52:46,155 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-16 05:52:46,155 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [678642360] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 05:52:46,155 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-16 05:52:46,155 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 14] total 35 [2021-12-16 05:52:46,155 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675900651] [2021-12-16 05:52:46,156 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-16 05:52:46,156 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2021-12-16 05:52:46,156 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:52:46,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2021-12-16 05:52:46,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=1124, Unknown=0, NotChecked=0, Total=1260 [2021-12-16 05:52:46,157 INFO L87 Difference]: Start difference. First operand 186 states and 237 transitions. Second operand has 36 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 36 states have internal predecessors, (88), 0 states have call successors, (0), 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-16 05:52:46,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:52:46,704 INFO L93 Difference]: Finished difference Result 188 states and 238 transitions. [2021-12-16 05:52:46,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-16 05:52:46,705 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 36 states have internal predecessors, (88), 0 states have call successors, (0), 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-16 05:52:46,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:52:46,705 INFO L225 Difference]: With dead ends: 188 [2021-12-16 05:52:46,705 INFO L226 Difference]: Without dead ends: 171 [2021-12-16 05:52:46,706 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 41 SyntacticMatches, 4 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 452 ImplicationChecksByTransitivity, 27.1s TimeCoverageRelationStatistics Valid=183, Invalid=1539, Unknown=0, NotChecked=0, Total=1722 [2021-12-16 05:52:46,707 INFO L933 BasicCegarLoop]: 94 mSDtfsCounter, 11 mSDsluCounter, 921 mSDsCounter, 0 mSdLazyCounter, 540 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 1015 SdHoareTripleChecker+Invalid, 1138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 540 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 593 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-16 05:52:46,707 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 1015 Invalid, 1138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 540 Invalid, 0 Unknown, 593 Unchecked, 0.3s Time] [2021-12-16 05:52:46,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2021-12-16 05:52:46,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2021-12-16 05:52:46,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 133 states have (on average 1.6616541353383458) internal successors, (221), 170 states have internal predecessors, (221), 0 states have call successors, (0), 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-16 05:52:46,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 221 transitions. [2021-12-16 05:52:46,710 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 221 transitions. Word has length 33 [2021-12-16 05:52:46,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:52:46,710 INFO L470 AbstractCegarLoop]: Abstraction has 171 states and 221 transitions. [2021-12-16 05:52:46,710 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 2.5142857142857142) internal successors, (88), 36 states have internal predecessors, (88), 0 states have call successors, (0), 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-16 05:52:46,711 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 221 transitions. [2021-12-16 05:52:46,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-12-16 05:52:46,711 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:52:46,711 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 05:52:46,739 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-16 05:52:46,912 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,SelfDestructingSolverStorable19 [2021-12-16 05:52:46,912 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 58 more)] === [2021-12-16 05:52:46,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:52:46,912 INFO L85 PathProgramCache]: Analyzing trace with hash -1756679628, now seen corresponding path program 1 times [2021-12-16 05:52:46,912 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:52:46,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855367231] [2021-12-16 05:52:46,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:52:46,913 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:52:46,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:52:47,031 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 05:52:47,031 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:52:47,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855367231] [2021-12-16 05:52:47,031 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855367231] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 05:52:47,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [828333143] [2021-12-16 05:52:47,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:52:47,032 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 05:52:47,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 05:52:47,033 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-16 05:52:47,033 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-16 05:52:47,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:52:47,161 INFO L263 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 33 conjunts are in the unsatisfiable core [2021-12-16 05:52:47,164 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 05:52:47,178 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-16 05:52:47,207 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-16 05:52:47,207 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-16 05:52:47,223 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-16 05:52:47,231 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-16 05:52:47,231 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-16 05:52:47,278 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 11 treesize of output 7 [2021-12-16 05:52:47,282 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 11 treesize of output 7 [2021-12-16 05:52:47,312 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-16 05:52:47,313 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 38 treesize of output 37 [2021-12-16 05:52:47,317 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2021-12-16 05:52:47,406 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 25 treesize of output 13 [2021-12-16 05:52:47,409 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-16 05:52:47,424 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 05:52:47,424 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 05:52:47,505 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_623 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_623) |c_ULTIMATE.start_main_~data~0#1.base|) |c_ULTIMATE.start_main_~data~0#1.offset|) 4))) (forall ((v_ArrVal_623 (Array Int Int)) (v_ArrVal_624 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_623) |c_ULTIMATE.start_main_~data~0#1.base|) |c_ULTIMATE.start_main_~data~0#1.offset|) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_624) |c_ULTIMATE.start_main_~data~0#1.base|) |c_ULTIMATE.start_main_~data~0#1.offset|))))) is different from false [2021-12-16 05:52:47,515 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-16 05:52:47,516 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 37 treesize of output 38 [2021-12-16 05:52:47,521 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-16 05:52:47,522 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 29 treesize of output 30 [2021-12-16 05:52:47,526 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 52 treesize of output 44 [2021-12-16 05:52:47,530 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 82 treesize of output 70 [2021-12-16 05:52:47,533 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 34 treesize of output 30 [2021-12-16 05:52:47,540 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 62 treesize of output 58 [2021-12-16 05:52:47,570 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-16 05:52:47,571 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 1 case distinctions, treesize of input 20 treesize of output 21 [2021-12-16 05:52:47,572 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-16 05:52:47,574 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 18 treesize of output 10 [2021-12-16 05:52:47,686 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2021-12-16 05:52:47,686 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [828333143] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 05:52:47,686 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-16 05:52:47,687 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 18 [2021-12-16 05:52:47,688 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174170502] [2021-12-16 05:52:47,688 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-16 05:52:47,688 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-12-16 05:52:47,688 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:52:47,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-12-16 05:52:47,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=254, Unknown=1, NotChecked=32, Total=342 [2021-12-16 05:52:47,689 INFO L87 Difference]: Start difference. First operand 171 states and 221 transitions. Second operand has 19 states, 18 states have (on average 4.888888888888889) internal successors, (88), 19 states have internal predecessors, (88), 0 states have call successors, (0), 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-16 05:52:48,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:52:48,163 INFO L93 Difference]: Finished difference Result 190 states and 236 transitions. [2021-12-16 05:52:48,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-16 05:52:48,164 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 4.888888888888889) internal successors, (88), 19 states have internal predecessors, (88), 0 states have call successors, (0), 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 37 [2021-12-16 05:52:48,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:52:48,165 INFO L225 Difference]: With dead ends: 190 [2021-12-16 05:52:48,165 INFO L226 Difference]: Without dead ends: 190 [2021-12-16 05:52:48,165 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 64 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=133, Invalid=518, Unknown=3, NotChecked=48, Total=702 [2021-12-16 05:52:48,166 INFO L933 BasicCegarLoop]: 84 mSDtfsCounter, 170 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 623 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 539 SdHoareTripleChecker+Invalid, 755 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 112 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-16 05:52:48,166 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [170 Valid, 539 Invalid, 755 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 623 Invalid, 0 Unknown, 112 Unchecked, 0.3s Time] [2021-12-16 05:52:48,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2021-12-16 05:52:48,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 171. [2021-12-16 05:52:48,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 133 states have (on average 1.6541353383458646) internal successors, (220), 170 states have internal predecessors, (220), 0 states have call successors, (0), 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-16 05:52:48,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 220 transitions. [2021-12-16 05:52:48,170 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 220 transitions. Word has length 37 [2021-12-16 05:52:48,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:52:48,170 INFO L470 AbstractCegarLoop]: Abstraction has 171 states and 220 transitions. [2021-12-16 05:52:48,171 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 4.888888888888889) internal successors, (88), 19 states have internal predecessors, (88), 0 states have call successors, (0), 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-16 05:52:48,171 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 220 transitions. [2021-12-16 05:52:48,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-12-16 05:52:48,171 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:52:48,171 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 05:52:48,195 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-16 05:52:48,395 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 05:52:48,395 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 58 more)] === [2021-12-16 05:52:48,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:52:48,395 INFO L85 PathProgramCache]: Analyzing trace with hash -1756679629, now seen corresponding path program 1 times [2021-12-16 05:52:48,396 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:52:48,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923286814] [2021-12-16 05:52:48,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:52:48,396 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:52:48,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:52:48,464 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 05:52:48,464 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:52:48,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923286814] [2021-12-16 05:52:48,464 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923286814] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 05:52:48,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [199499221] [2021-12-16 05:52:48,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:52:48,465 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 05:52:48,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 05:52:48,466 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-16 05:52:48,467 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-16 05:52:48,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:52:48,582 INFO L263 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 25 conjunts are in the unsatisfiable core [2021-12-16 05:52:48,594 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 05:52:48,607 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-16 05:52:48,634 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-16 05:52:48,634 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-16 05:52:48,656 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-16 05:52:48,656 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-16 05:52:48,697 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 11 treesize of output 7 [2021-12-16 05:52:48,726 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-16 05:52:48,727 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 28 treesize of output 29 [2021-12-16 05:52:48,800 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 25 treesize of output 13 [2021-12-16 05:52:48,816 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 05:52:48,816 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 05:52:48,817 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [199499221] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:52:48,817 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-16 05:52:48,817 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 13 [2021-12-16 05:52:48,817 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499046264] [2021-12-16 05:52:48,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:52:48,817 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-16 05:52:48,817 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:52:48,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-16 05:52:48,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2021-12-16 05:52:48,818 INFO L87 Difference]: Start difference. First operand 171 states and 220 transitions. Second operand has 8 states, 7 states have (on average 5.285714285714286) internal successors, (37), 8 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:52:48,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:52:48,980 INFO L93 Difference]: Finished difference Result 176 states and 222 transitions. [2021-12-16 05:52:48,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-16 05:52:48,982 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.285714285714286) internal successors, (37), 8 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-12-16 05:52:48,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:52:48,983 INFO L225 Difference]: With dead ends: 176 [2021-12-16 05:52:48,983 INFO L226 Difference]: Without dead ends: 176 [2021-12-16 05:52:48,983 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2021-12-16 05:52:48,984 INFO L933 BasicCegarLoop]: 87 mSDtfsCounter, 84 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 66 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 05:52:48,984 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [84 Valid, 256 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 204 Invalid, 0 Unknown, 66 Unchecked, 0.1s Time] [2021-12-16 05:52:48,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2021-12-16 05:52:48,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 171. [2021-12-16 05:52:48,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 133 states have (on average 1.6466165413533835) internal successors, (219), 170 states have internal predecessors, (219), 0 states have call successors, (0), 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-16 05:52:48,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 219 transitions. [2021-12-16 05:52:48,987 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 219 transitions. Word has length 37 [2021-12-16 05:52:48,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:52:48,988 INFO L470 AbstractCegarLoop]: Abstraction has 171 states and 219 transitions. [2021-12-16 05:52:48,988 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.285714285714286) internal successors, (37), 8 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 05:52:48,988 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 219 transitions. [2021-12-16 05:52:48,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-12-16 05:52:48,988 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:52:48,989 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 05:52:49,012 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2021-12-16 05:52:49,212 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 05:52:49,212 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr56REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 58 more)] === [2021-12-16 05:52:49,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:52:49,212 INFO L85 PathProgramCache]: Analyzing trace with hash 507133380, now seen corresponding path program 1 times [2021-12-16 05:52:49,212 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:52:49,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128599904] [2021-12-16 05:52:49,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:52:49,213 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:52:49,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:52:49,306 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 05:52:49,307 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:52:49,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128599904] [2021-12-16 05:52:49,307 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128599904] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 05:52:49,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [922223234] [2021-12-16 05:52:49,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:52:49,308 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 05:52:49,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 05:52:49,316 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-16 05:52:49,346 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-16 05:52:49,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:52:49,446 INFO L263 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 21 conjunts are in the unsatisfiable core [2021-12-16 05:52:49,448 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 05:52:49,458 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-16 05:52:49,481 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-16 05:52:49,482 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-16 05:52:49,505 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-16 05:52:49,505 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-16 05:52:49,519 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 11 treesize of output 7 [2021-12-16 05:52:49,529 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-16 05:52:49,529 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 22 [2021-12-16 05:52:49,543 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 16 treesize of output 8 [2021-12-16 05:52:49,553 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 05:52:49,553 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 05:52:49,587 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_887 (Array Int Int))) (not (= |c_ULTIMATE.start_main_~data~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_887) |c_ULTIMATE.start_main_~data~0#1.base|) |c_ULTIMATE.start_main_~data~0#1.offset|)))) is different from false [2021-12-16 05:52:49,592 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-16 05:52:49,592 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 19 treesize of output 20 [2021-12-16 05:52:49,594 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 25 [2021-12-16 05:52:49,596 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 6 treesize of output 4 [2021-12-16 05:52:49,659 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2021-12-16 05:52:49,660 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [922223234] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 05:52:49,660 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-16 05:52:49,660 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 12 [2021-12-16 05:52:49,660 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162680840] [2021-12-16 05:52:49,660 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-16 05:52:49,660 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-16 05:52:49,660 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:52:49,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-16 05:52:49,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=84, Unknown=1, NotChecked=18, Total=132 [2021-12-16 05:52:49,661 INFO L87 Difference]: Start difference. First operand 171 states and 219 transitions. Second operand has 12 states, 12 states have (on average 5.0) internal successors, (60), 12 states have internal predecessors, (60), 0 states have call successors, (0), 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-16 05:52:49,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:52:49,865 INFO L93 Difference]: Finished difference Result 171 states and 216 transitions. [2021-12-16 05:52:49,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-16 05:52:49,865 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.0) internal successors, (60), 12 states have internal predecessors, (60), 0 states have call successors, (0), 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 40 [2021-12-16 05:52:49,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:52:49,866 INFO L225 Difference]: With dead ends: 171 [2021-12-16 05:52:49,866 INFO L226 Difference]: Without dead ends: 171 [2021-12-16 05:52:49,866 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 76 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=251, Unknown=1, NotChecked=34, Total=380 [2021-12-16 05:52:49,866 INFO L933 BasicCegarLoop]: 88 mSDtfsCounter, 139 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 507 SdHoareTripleChecker+Invalid, 451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 88 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 05:52:49,867 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [139 Valid, 507 Invalid, 451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 342 Invalid, 0 Unknown, 88 Unchecked, 0.1s Time] [2021-12-16 05:52:49,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2021-12-16 05:52:49,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 167. [2021-12-16 05:52:49,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 129 states have (on average 1.6589147286821706) internal successors, (214), 166 states have internal predecessors, (214), 0 states have call successors, (0), 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-16 05:52:49,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 214 transitions. [2021-12-16 05:52:49,869 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 214 transitions. Word has length 40 [2021-12-16 05:52:49,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:52:49,869 INFO L470 AbstractCegarLoop]: Abstraction has 167 states and 214 transitions. [2021-12-16 05:52:49,870 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.0) internal successors, (60), 12 states have internal predecessors, (60), 0 states have call successors, (0), 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-16 05:52:49,870 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 214 transitions. [2021-12-16 05:52:49,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-12-16 05:52:49,870 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:52:49,870 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 05:52:49,888 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-12-16 05:52:50,083 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2021-12-16 05:52:50,083 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 58 more)] === [2021-12-16 05:52:50,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:52:50,084 INFO L85 PathProgramCache]: Analyzing trace with hash -1119299147, now seen corresponding path program 1 times [2021-12-16 05:52:50,084 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:52:50,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533266845] [2021-12-16 05:52:50,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:52:50,084 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:52:50,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:52:50,142 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-12-16 05:52:50,142 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:52:50,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533266845] [2021-12-16 05:52:50,143 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533266845] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:52:50,143 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 05:52:50,143 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-16 05:52:50,143 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668160855] [2021-12-16 05:52:50,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:52:50,143 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-16 05:52:50,143 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:52:50,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-16 05:52:50,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-16 05:52:50,144 INFO L87 Difference]: Start difference. First operand 167 states and 214 transitions. Second operand has 6 states, 5 states have (on average 6.2) internal successors, (31), 6 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-16 05:52:50,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:52:50,261 INFO L93 Difference]: Finished difference Result 166 states and 212 transitions. [2021-12-16 05:52:50,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-16 05:52:50,262 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.2) internal successors, (31), 6 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 41 [2021-12-16 05:52:50,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:52:50,262 INFO L225 Difference]: With dead ends: 166 [2021-12-16 05:52:50,262 INFO L226 Difference]: Without dead ends: 166 [2021-12-16 05:52:50,262 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-12-16 05:52:50,263 INFO L933 BasicCegarLoop]: 93 mSDtfsCounter, 25 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 05:52:50,263 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 305 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-16 05:52:50,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2021-12-16 05:52:50,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2021-12-16 05:52:50,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 129 states have (on average 1.6434108527131783) internal successors, (212), 165 states have internal predecessors, (212), 0 states have call successors, (0), 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-16 05:52:50,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 212 transitions. [2021-12-16 05:52:50,265 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 212 transitions. Word has length 41 [2021-12-16 05:52:50,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:52:50,265 INFO L470 AbstractCegarLoop]: Abstraction has 166 states and 212 transitions. [2021-12-16 05:52:50,266 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.2) internal successors, (31), 6 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-16 05:52:50,266 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 212 transitions. [2021-12-16 05:52:50,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-12-16 05:52:50,266 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:52:50,266 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 05:52:50,266 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-12-16 05:52:50,266 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 58 more)] === [2021-12-16 05:52:50,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:52:50,266 INFO L85 PathProgramCache]: Analyzing trace with hash -1119299146, now seen corresponding path program 1 times [2021-12-16 05:52:50,266 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:52:50,266 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15558281] [2021-12-16 05:52:50,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:52:50,266 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:52:50,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:52:50,402 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 05:52:50,402 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:52:50,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15558281] [2021-12-16 05:52:50,403 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15558281] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 05:52:50,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1489591420] [2021-12-16 05:52:50,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:52:50,403 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 05:52:50,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 05:52:50,404 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-16 05:52:50,405 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-16 05:52:50,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:52:50,516 INFO L263 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 28 conjunts are in the unsatisfiable core [2021-12-16 05:52:50,522 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 05:52:50,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 11 treesize of output 7 [2021-12-16 05:52:50,655 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-12-16 05:52:50,655 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 25 treesize of output 23 [2021-12-16 05:52:50,778 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 23 treesize of output 15 [2021-12-16 05:52:50,783 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2021-12-16 05:52:50,816 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 05:52:50,816 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 05:52:50,816 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1489591420] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 05:52:50,816 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-16 05:52:50,816 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [11] total 21 [2021-12-16 05:52:50,816 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478705926] [2021-12-16 05:52:50,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 05:52:50,817 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-16 05:52:50,817 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:52:50,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-16 05:52:50,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=393, Unknown=0, NotChecked=0, Total=462 [2021-12-16 05:52:50,817 INFO L87 Difference]: Start difference. First operand 166 states and 212 transitions. Second operand has 12 states, 11 states have (on average 3.727272727272727) internal successors, (41), 12 states have internal predecessors, (41), 0 states have call successors, (0), 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-16 05:52:51,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:52:51,142 INFO L93 Difference]: Finished difference Result 226 states and 253 transitions. [2021-12-16 05:52:51,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-16 05:52:51,142 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.727272727272727) internal successors, (41), 12 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2021-12-16 05:52:51,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:52:51,143 INFO L225 Difference]: With dead ends: 226 [2021-12-16 05:52:51,143 INFO L226 Difference]: Without dead ends: 226 [2021-12-16 05:52:51,143 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=152, Invalid=660, Unknown=0, NotChecked=0, Total=812 [2021-12-16 05:52:51,144 INFO L933 BasicCegarLoop]: 77 mSDtfsCounter, 493 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 493 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-16 05:52:51,144 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [493 Valid, 423 Invalid, 383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-16 05:52:51,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2021-12-16 05:52:51,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 166. [2021-12-16 05:52:51,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 129 states have (on average 1.627906976744186) internal successors, (210), 165 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-16 05:52:51,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 210 transitions. [2021-12-16 05:52:51,146 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 210 transitions. Word has length 41 [2021-12-16 05:52:51,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:52:51,146 INFO L470 AbstractCegarLoop]: Abstraction has 166 states and 210 transitions. [2021-12-16 05:52:51,146 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.727272727272727) internal successors, (41), 12 states have internal predecessors, (41), 0 states have call successors, (0), 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-16 05:52:51,146 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 210 transitions. [2021-12-16 05:52:51,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-12-16 05:52:51,146 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:52:51,146 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 05:52:51,166 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-16 05:52:51,351 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 05:52:51,351 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 58 more)] === [2021-12-16 05:52:51,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:52:51,352 INFO L85 PathProgramCache]: Analyzing trace with hash -716785192, now seen corresponding path program 1 times [2021-12-16 05:52:51,352 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:52:51,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109396066] [2021-12-16 05:52:51,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:52:51,352 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:52:51,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:52:51,452 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 05:52:51,452 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:52:51,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109396066] [2021-12-16 05:52:51,452 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109396066] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 05:52:51,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1819385595] [2021-12-16 05:52:51,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:52:51,453 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 05:52:51,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 05:52:51,453 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-16 05:52:51,454 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-16 05:52:51,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:52:51,589 INFO L263 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-16 05:52:51,591 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 05:52:51,677 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-16 05:52:51,699 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 05:52:51,700 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-16 05:52:51,772 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-16 05:52:51,788 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 05:52:51,789 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 05:52:51,945 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 05:52:51,945 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1819385595] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 05:52:51,945 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-16 05:52:51,946 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18 [2021-12-16 05:52:51,946 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880817139] [2021-12-16 05:52:51,946 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-16 05:52:51,946 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-12-16 05:52:51,946 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 05:52:51,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-12-16 05:52:51,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2021-12-16 05:52:51,947 INFO L87 Difference]: Start difference. First operand 166 states and 210 transitions. Second operand has 19 states, 18 states have (on average 5.277777777777778) internal successors, (95), 19 states have internal predecessors, (95), 0 states have call successors, (0), 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-16 05:52:52,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 05:52:52,354 INFO L93 Difference]: Finished difference Result 184 states and 210 transitions. [2021-12-16 05:52:52,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-12-16 05:52:52,354 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 5.277777777777778) internal successors, (95), 19 states have internal predecessors, (95), 0 states have call successors, (0), 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 45 [2021-12-16 05:52:52,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 05:52:52,355 INFO L225 Difference]: With dead ends: 184 [2021-12-16 05:52:52,355 INFO L226 Difference]: Without dead ends: 184 [2021-12-16 05:52:52,355 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 83 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 385 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=327, Invalid=1155, Unknown=0, NotChecked=0, Total=1482 [2021-12-16 05:52:52,356 INFO L933 BasicCegarLoop]: 85 mSDtfsCounter, 746 mSDsluCounter, 567 mSDsCounter, 0 mSdLazyCounter, 430 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 746 SdHoareTripleChecker+Valid, 652 SdHoareTripleChecker+Invalid, 563 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 74 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-16 05:52:52,356 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [746 Valid, 652 Invalid, 563 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 430 Invalid, 0 Unknown, 74 Unchecked, 0.2s Time] [2021-12-16 05:52:52,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2021-12-16 05:52:52,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 166. [2021-12-16 05:52:52,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 129 states have (on average 1.62015503875969) internal successors, (209), 165 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-16 05:52:52,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 209 transitions. [2021-12-16 05:52:52,358 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 209 transitions. Word has length 45 [2021-12-16 05:52:52,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 05:52:52,359 INFO L470 AbstractCegarLoop]: Abstraction has 166 states and 209 transitions. [2021-12-16 05:52:52,359 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 5.277777777777778) internal successors, (95), 19 states have internal predecessors, (95), 0 states have call successors, (0), 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-16 05:52:52,359 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 209 transitions. [2021-12-16 05:52:52,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-12-16 05:52:52,359 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 05:52:52,359 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 05:52:52,376 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2021-12-16 05:52:52,575 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 05:52:52,576 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 58 more)] === [2021-12-16 05:52:52,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 05:52:52,576 INFO L85 PathProgramCache]: Analyzing trace with hash 829868235, now seen corresponding path program 1 times [2021-12-16 05:52:52,576 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 05:52:52,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530878379] [2021-12-16 05:52:52,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:52:52,576 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 05:52:52,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:52:52,897 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 05:52:52,897 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 05:52:52,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530878379] [2021-12-16 05:52:52,897 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530878379] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 05:52:52,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1879180193] [2021-12-16 05:52:52,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 05:52:52,897 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 05:52:52,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 05:52:52,898 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-16 05:52:52,899 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-16 05:52:53,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 05:52:53,019 INFO L263 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 59 conjunts are in the unsatisfiable core [2021-12-16 05:52:53,022 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 05:52:53,029 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-16 05:52:53,046 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-16 05:52:53,046 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2021-12-16 05:52:53,110 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-16 05:52:53,186 INFO L354 Elim1Store]: treesize reduction 60, result has 31.0 percent of original size [2021-12-16 05:52:53,186 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 26 treesize of output 41 [2021-12-16 05:52:53,253 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 24 treesize of output 24 [2021-12-16 05:52:53,280 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 24 treesize of output 24 [2021-12-16 05:52:53,348 INFO L354 Elim1Store]: treesize reduction 78, result has 31.6 percent of original size [2021-12-16 05:52:53,348 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 31 treesize of output 53 [2021-12-16 05:52:53,475 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2021-12-16 05:52:53,530 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 05:52:53,531 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 28 [2021-12-16 05:52:53,595 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 05:52:53,597 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 05:52:53,604 INFO L354 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2021-12-16 05:52:53,604 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 48 [2021-12-16 05:52:54,080 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-16 05:52:54,081 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 05:52:54,081 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 28 [2021-12-16 05:52:54,085 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-12-16 05:52:54,435 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-12-16 05:52:54,435 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 30 [2021-12-16 05:52:54,503 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 05:52:54,503 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 05:52:54,810 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2021-12-16 05:52:59,989 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-16 05:52:59,989 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 306 treesize of output 196 [2021-12-16 05:52:59,999 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-16 05:53:00,010 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-16 05:53:00,011 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 1702 treesize of output 1688 [2021-12-16 05:53:00,025 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-16 05:53:00,029 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-16 05:53:00,030 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 2160 treesize of output 2000 [2021-12-16 05:53:00,044 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-16 05:53:00,048 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 1201 treesize of output 1169 [2021-12-16 05:53:00,069 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 8 treesize of output 4 [2021-12-16 05:53:00,088 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-16 05:53:00,097 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-16 05:53:00,098 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 2220 treesize of output 2196