./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/forester-heap/dll-simple-white-blue-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 839c364b Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/forester-heap/dll-simple-white-blue-2.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 9d8386495cfc7d925686020c12a2509d702f4bf2aed1f5dea2d7da468cac3b6e --- Real Ultimate output --- This is Ultimate 0.2.2-839c364b5d67a0f615c82cb70ab247790648d4a9-839c364 [2021-12-14 19:46:09,305 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-14 19:46:09,307 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-14 19:46:09,368 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-14 19:46:09,369 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-14 19:46:09,372 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-14 19:46:09,373 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-14 19:46:09,375 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-14 19:46:09,376 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-14 19:46:09,379 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-14 19:46:09,380 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-14 19:46:09,381 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-14 19:46:09,381 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-14 19:46:09,383 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-14 19:46:09,384 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-14 19:46:09,386 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-14 19:46:09,387 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-14 19:46:09,388 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-14 19:46:09,390 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-14 19:46:09,394 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-14 19:46:09,395 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-14 19:46:09,396 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-14 19:46:09,397 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-14 19:46:09,397 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-14 19:46:09,401 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-14 19:46:09,402 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-14 19:46:09,402 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-14 19:46:09,403 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-14 19:46:09,403 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-14 19:46:09,404 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-14 19:46:09,404 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-14 19:46:09,404 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-14 19:46:09,406 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-14 19:46:09,406 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-14 19:46:09,407 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-14 19:46:09,407 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-14 19:46:09,408 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-14 19:46:09,409 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-14 19:46:09,409 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-14 19:46:09,409 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-14 19:46:09,410 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-14 19:46:09,410 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2021-12-14 19:46:09,433 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-14 19:46:09,433 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-14 19:46:09,433 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-14 19:46:09,433 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-14 19:46:09,434 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-14 19:46:09,434 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-14 19:46:09,435 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-14 19:46:09,435 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-14 19:46:09,435 INFO L138 SettingsManager]: * Use SBE=true [2021-12-14 19:46:09,435 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-14 19:46:09,436 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-14 19:46:09,436 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-14 19:46:09,436 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-14 19:46:09,436 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-14 19:46:09,436 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-14 19:46:09,436 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-14 19:46:09,437 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-14 19:46:09,437 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-12-14 19:46:09,437 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-14 19:46:09,437 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-14 19:46:09,437 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-14 19:46:09,437 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-14 19:46:09,437 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-14 19:46:09,438 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-14 19:46:09,438 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-14 19:46:09,438 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 19:46:09,438 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-14 19:46:09,439 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-14 19:46:09,439 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-14 19:46:09,439 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-14 19:46:09,439 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-14 19:46:09,440 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 -> 9d8386495cfc7d925686020c12a2509d702f4bf2aed1f5dea2d7da468cac3b6e [2021-12-14 19:46:09,623 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-14 19:46:09,637 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-14 19:46:09,643 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-14 19:46:09,644 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-14 19:46:09,645 INFO L275 PluginConnector]: CDTParser initialized [2021-12-14 19:46:09,645 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/dll-simple-white-blue-2.i [2021-12-14 19:46:09,716 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4fb8a7bec/88c8fcd9505f4443a1b07dc7c766673c/FLAGe037bad47 [2021-12-14 19:46:10,185 INFO L306 CDTParser]: Found 1 translation units. [2021-12-14 19:46:10,186 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-simple-white-blue-2.i [2021-12-14 19:46:10,201 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4fb8a7bec/88c8fcd9505f4443a1b07dc7c766673c/FLAGe037bad47 [2021-12-14 19:46:10,213 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4fb8a7bec/88c8fcd9505f4443a1b07dc7c766673c [2021-12-14 19:46:10,215 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-14 19:46:10,217 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-14 19:46:10,220 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-14 19:46:10,220 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-14 19:46:10,222 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-14 19:46:10,223 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 07:46:10" (1/1) ... [2021-12-14 19:46:10,224 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@bad75b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:46:10, skipping insertion in model container [2021-12-14 19:46:10,224 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 07:46:10" (1/1) ... [2021-12-14 19:46:10,229 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-14 19:46:10,269 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-14 19:46:10,557 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-simple-white-blue-2.i[22778,22791] [2021-12-14 19:46:10,585 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 19:46:10,592 INFO L203 MainTranslator]: Completed pre-run [2021-12-14 19:46:10,628 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-simple-white-blue-2.i[22778,22791] [2021-12-14 19:46:10,629 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 19:46:10,646 INFO L208 MainTranslator]: Completed translation [2021-12-14 19:46:10,646 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:46:10 WrapperNode [2021-12-14 19:46:10,647 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-14 19:46:10,648 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-14 19:46:10,648 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-14 19:46:10,648 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-14 19:46:10,653 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:46:10" (1/1) ... [2021-12-14 19:46:10,663 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:46:10" (1/1) ... [2021-12-14 19:46:10,690 INFO L137 Inliner]: procedures = 119, calls = 38, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 121 [2021-12-14 19:46:10,690 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-14 19:46:10,691 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-14 19:46:10,692 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-14 19:46:10,692 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-14 19:46:10,698 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:46:10" (1/1) ... [2021-12-14 19:46:10,698 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:46:10" (1/1) ... [2021-12-14 19:46:10,714 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:46:10" (1/1) ... [2021-12-14 19:46:10,715 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:46:10" (1/1) ... [2021-12-14 19:46:10,728 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:46:10" (1/1) ... [2021-12-14 19:46:10,736 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:46:10" (1/1) ... [2021-12-14 19:46:10,739 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:46:10" (1/1) ... [2021-12-14 19:46:10,749 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-14 19:46:10,750 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-14 19:46:10,750 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-14 19:46:10,750 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-14 19:46:10,751 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:46:10" (1/1) ... [2021-12-14 19:46:10,759 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 19:46:10,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:46:10,778 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-14 19:46:10,805 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-14 19:46:10,825 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-14 19:46:10,826 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-14 19:46:10,826 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-14 19:46:10,826 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-14 19:46:10,826 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-14 19:46:10,826 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-14 19:46:10,826 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-14 19:46:10,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-14 19:46:10,827 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-14 19:46:10,827 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-14 19:46:10,930 INFO L236 CfgBuilder]: Building ICFG [2021-12-14 19:46:10,944 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-14 19:46:11,179 INFO L277 CfgBuilder]: Performing block encoding [2021-12-14 19:46:11,183 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-14 19:46:11,184 INFO L301 CfgBuilder]: Removed 8 assume(true) statements. [2021-12-14 19:46:11,185 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 07:46:11 BoogieIcfgContainer [2021-12-14 19:46:11,185 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-14 19:46:11,186 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-14 19:46:11,186 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-14 19:46:11,188 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-14 19:46:11,189 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 07:46:10" (1/3) ... [2021-12-14 19:46:11,189 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52f59ba2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 07:46:11, skipping insertion in model container [2021-12-14 19:46:11,189 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:46:10" (2/3) ... [2021-12-14 19:46:11,189 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52f59ba2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 07:46:11, skipping insertion in model container [2021-12-14 19:46:11,190 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 07:46:11" (3/3) ... [2021-12-14 19:46:11,190 INFO L111 eAbstractionObserver]: Analyzing ICFG dll-simple-white-blue-2.i [2021-12-14 19:46:11,193 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-14 19:46:11,193 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 59 error locations. [2021-12-14 19:46:11,217 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-14 19:46:11,221 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-14 19:46:11,221 INFO L340 AbstractCegarLoop]: Starting to check reachability of 59 error locations. [2021-12-14 19:46:11,231 INFO L276 IsEmpty]: Start isEmpty. Operand has 123 states, 63 states have (on average 2.2063492063492065) internal successors, (139), 122 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:46:11,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-12-14 19:46:11,235 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:46:11,235 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-12-14 19:46:11,236 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 55 more)] === [2021-12-14 19:46:11,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:46:11,242 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2021-12-14 19:46:11,247 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:46:11,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757505944] [2021-12-14 19:46:11,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:46:11,248 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:46:11,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:46:11,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:46:11,367 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:46:11,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757505944] [2021-12-14 19:46:11,367 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757505944] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:46:11,367 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:46:11,368 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-14 19:46:11,369 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544861996] [2021-12-14 19:46:11,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:46:11,371 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 19:46:11,372 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:46:11,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 19:46:11,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:46:11,393 INFO L87 Difference]: Start difference. First operand has 123 states, 63 states have (on average 2.2063492063492065) internal successors, (139), 122 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:46:11,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:46:11,538 INFO L93 Difference]: Finished difference Result 150 states and 159 transitions. [2021-12-14 19:46:11,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 19:46:11,540 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2021-12-14 19:46:11,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:46:11,548 INFO L225 Difference]: With dead ends: 150 [2021-12-14 19:46:11,548 INFO L226 Difference]: Without dead ends: 146 [2021-12-14 19:46:11,549 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:46:11,552 INFO L933 BasicCegarLoop]: 98 mSDtfsCounter, 109 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:46:11,552 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [109 Valid, 120 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 19:46:11,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2021-12-14 19:46:11,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 117. [2021-12-14 19:46:11,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 61 states have (on average 2.0327868852459017) internal successors, (124), 116 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:46:11,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 124 transitions. [2021-12-14 19:46:11,587 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 124 transitions. Word has length 3 [2021-12-14 19:46:11,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:46:11,587 INFO L470 AbstractCegarLoop]: Abstraction has 117 states and 124 transitions. [2021-12-14 19:46:11,588 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:46:11,588 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 124 transitions. [2021-12-14 19:46:11,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-12-14 19:46:11,588 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:46:11,588 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-12-14 19:46:11,588 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-14 19:46:11,589 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 55 more)] === [2021-12-14 19:46:11,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:46:11,591 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2021-12-14 19:46:11,591 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:46:11,591 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423241383] [2021-12-14 19:46:11,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:46:11,591 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:46:11,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:46:11,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:46:11,637 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:46:11,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423241383] [2021-12-14 19:46:11,637 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423241383] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:46:11,637 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:46:11,637 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-14 19:46:11,638 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045206257] [2021-12-14 19:46:11,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:46:11,638 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 19:46:11,639 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:46:11,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 19:46:11,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:46:11,639 INFO L87 Difference]: Start difference. First operand 117 states and 124 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:46:11,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:46:11,728 INFO L93 Difference]: Finished difference Result 143 states and 152 transitions. [2021-12-14 19:46:11,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 19:46:11,729 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2021-12-14 19:46:11,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:46:11,731 INFO L225 Difference]: With dead ends: 143 [2021-12-14 19:46:11,732 INFO L226 Difference]: Without dead ends: 143 [2021-12-14 19:46:11,733 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:46:11,734 INFO L933 BasicCegarLoop]: 96 mSDtfsCounter, 104 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:46:11,734 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [104 Valid, 116 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 19:46:11,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2021-12-14 19:46:11,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 114. [2021-12-14 19:46:11,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 61 states have (on average 1.9836065573770492) internal successors, (121), 113 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:46:11,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 121 transitions. [2021-12-14 19:46:11,739 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 121 transitions. Word has length 3 [2021-12-14 19:46:11,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:46:11,739 INFO L470 AbstractCegarLoop]: Abstraction has 114 states and 121 transitions. [2021-12-14 19:46:11,739 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:46:11,739 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 121 transitions. [2021-12-14 19:46:11,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-12-14 19:46:11,740 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:46:11,740 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:46:11,740 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-14 19:46:11,740 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 55 more)] === [2021-12-14 19:46:11,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:46:11,741 INFO L85 PathProgramCache]: Analyzing trace with hash 1837112042, now seen corresponding path program 1 times [2021-12-14 19:46:11,741 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:46:11,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371704831] [2021-12-14 19:46:11,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:46:11,741 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:46:11,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:46:11,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:46:11,796 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:46:11,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371704831] [2021-12-14 19:46:11,797 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371704831] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:46:11,797 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:46:11,797 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 19:46:11,797 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255560977] [2021-12-14 19:46:11,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:46:11,798 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-14 19:46:11,798 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:46:11,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-14 19:46:11,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-14 19:46:11,799 INFO L87 Difference]: Start difference. First operand 114 states and 121 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:46:11,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:46:11,919 INFO L93 Difference]: Finished difference Result 114 states and 121 transitions. [2021-12-14 19:46:11,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-14 19:46:11,919 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2021-12-14 19:46:11,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:46:11,920 INFO L225 Difference]: With dead ends: 114 [2021-12-14 19:46:11,920 INFO L226 Difference]: Without dead ends: 114 [2021-12-14 19:46:11,920 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-14 19:46:11,921 INFO L933 BasicCegarLoop]: 38 mSDtfsCounter, 161 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:46:11,921 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [161 Valid, 47 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 19:46:11,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2021-12-14 19:46:11,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 106. [2021-12-14 19:46:11,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 69 states have (on average 1.7246376811594204) internal successors, (119), 105 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:46:11,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 119 transitions. [2021-12-14 19:46:11,926 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 119 transitions. Word has length 9 [2021-12-14 19:46:11,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:46:11,926 INFO L470 AbstractCegarLoop]: Abstraction has 106 states and 119 transitions. [2021-12-14 19:46:11,926 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:46:11,926 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 119 transitions. [2021-12-14 19:46:11,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-12-14 19:46:11,927 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:46:11,927 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:46:11,927 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-14 19:46:11,927 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 55 more)] === [2021-12-14 19:46:11,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:46:11,928 INFO L85 PathProgramCache]: Analyzing trace with hash 1837112043, now seen corresponding path program 1 times [2021-12-14 19:46:11,928 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:46:11,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110380379] [2021-12-14 19:46:11,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:46:11,928 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:46:11,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:46:12,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:46:12,028 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:46:12,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110380379] [2021-12-14 19:46:12,028 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110380379] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:46:12,028 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:46:12,028 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-14 19:46:12,028 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492062573] [2021-12-14 19:46:12,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:46:12,029 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 19:46:12,029 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:46:12,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 19:46:12,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-14 19:46:12,030 INFO L87 Difference]: Start difference. First operand 106 states and 119 transitions. Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:46:12,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:46:12,196 INFO L93 Difference]: Finished difference Result 149 states and 162 transitions. [2021-12-14 19:46:12,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-14 19:46:12,196 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2021-12-14 19:46:12,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:46:12,197 INFO L225 Difference]: With dead ends: 149 [2021-12-14 19:46:12,197 INFO L226 Difference]: Without dead ends: 149 [2021-12-14 19:46:12,198 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-12-14 19:46:12,199 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 349 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 349 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 19:46:12,199 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [349 Valid, 62 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 19:46:12,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2021-12-14 19:46:12,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 126. [2021-12-14 19:46:12,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 92 states have (on average 1.565217391304348) internal successors, (144), 125 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:46:12,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 144 transitions. [2021-12-14 19:46:12,204 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 144 transitions. Word has length 9 [2021-12-14 19:46:12,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:46:12,204 INFO L470 AbstractCegarLoop]: Abstraction has 126 states and 144 transitions. [2021-12-14 19:46:12,204 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:46:12,204 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 144 transitions. [2021-12-14 19:46:12,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-12-14 19:46:12,205 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:46:12,205 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:46:12,205 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-14 19:46:12,205 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 55 more)] === [2021-12-14 19:46:12,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:46:12,206 INFO L85 PathProgramCache]: Analyzing trace with hash -1363413642, now seen corresponding path program 1 times [2021-12-14 19:46:12,206 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:46:12,206 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109359279] [2021-12-14 19:46:12,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:46:12,206 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:46:12,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:46:12,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:46:12,260 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:46:12,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109359279] [2021-12-14 19:46:12,260 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109359279] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:46:12,260 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:46:12,261 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-14 19:46:12,261 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46457576] [2021-12-14 19:46:12,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:46:12,261 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-14 19:46:12,261 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:46:12,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 19:46:12,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-14 19:46:12,262 INFO L87 Difference]: Start difference. First operand 126 states and 144 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:46:12,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:46:12,386 INFO L93 Difference]: Finished difference Result 125 states and 142 transitions. [2021-12-14 19:46:12,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 19:46:12,387 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 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 12 [2021-12-14 19:46:12,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:46:12,388 INFO L225 Difference]: With dead ends: 125 [2021-12-14 19:46:12,388 INFO L226 Difference]: Without dead ends: 125 [2021-12-14 19:46:12,388 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-14 19:46:12,389 INFO L933 BasicCegarLoop]: 95 mSDtfsCounter, 6 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:46:12,389 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 216 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 19:46:12,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2021-12-14 19:46:12,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2021-12-14 19:46:12,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 92 states have (on average 1.5434782608695652) internal successors, (142), 124 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-14 19:46:12,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 142 transitions. [2021-12-14 19:46:12,394 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 142 transitions. Word has length 12 [2021-12-14 19:46:12,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:46:12,394 INFO L470 AbstractCegarLoop]: Abstraction has 125 states and 142 transitions. [2021-12-14 19:46:12,394 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:46:12,394 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 142 transitions. [2021-12-14 19:46:12,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-12-14 19:46:12,395 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:46:12,395 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:46:12,395 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-14 19:46:12,395 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 55 more)] === [2021-12-14 19:46:12,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:46:12,396 INFO L85 PathProgramCache]: Analyzing trace with hash -1363413643, now seen corresponding path program 1 times [2021-12-14 19:46:12,396 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:46:12,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512627574] [2021-12-14 19:46:12,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:46:12,396 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:46:12,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:46:12,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:46:12,456 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:46:12,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512627574] [2021-12-14 19:46:12,456 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512627574] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:46:12,456 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:46:12,456 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-14 19:46:12,457 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668770634] [2021-12-14 19:46:12,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:46:12,457 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-14 19:46:12,457 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:46:12,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 19:46:12,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-14 19:46:12,458 INFO L87 Difference]: Start difference. First operand 125 states and 142 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:46:12,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:46:12,562 INFO L93 Difference]: Finished difference Result 124 states and 140 transitions. [2021-12-14 19:46:12,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-14 19:46:12,563 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 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 12 [2021-12-14 19:46:12,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:46:12,563 INFO L225 Difference]: With dead ends: 124 [2021-12-14 19:46:12,563 INFO L226 Difference]: Without dead ends: 124 [2021-12-14 19:46:12,564 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-14 19:46:12,564 INFO L933 BasicCegarLoop]: 94 mSDtfsCounter, 7 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:46:12,565 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 226 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 19:46:12,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2021-12-14 19:46:12,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2021-12-14 19:46:12,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 92 states have (on average 1.5217391304347827) internal successors, (140), 123 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-14 19:46:12,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 140 transitions. [2021-12-14 19:46:12,568 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 140 transitions. Word has length 12 [2021-12-14 19:46:12,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:46:12,569 INFO L470 AbstractCegarLoop]: Abstraction has 124 states and 140 transitions. [2021-12-14 19:46:12,569 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:46:12,569 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 140 transitions. [2021-12-14 19:46:12,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-14 19:46:12,569 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:46:12,570 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:46:12,570 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-14 19:46:12,570 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 55 more)] === [2021-12-14 19:46:12,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:46:12,570 INFO L85 PathProgramCache]: Analyzing trace with hash -1478309260, now seen corresponding path program 1 times [2021-12-14 19:46:12,570 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:46:12,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293801272] [2021-12-14 19:46:12,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:46:12,571 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:46:12,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:46:12,626 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:46:12,626 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:46:12,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293801272] [2021-12-14 19:46:12,627 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293801272] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:46:12,627 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:46:12,627 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-14 19:46:12,627 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8586282] [2021-12-14 19:46:12,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:46:12,628 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-14 19:46:12,628 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:46:12,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 19:46:12,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-14 19:46:12,629 INFO L87 Difference]: Start difference. First operand 124 states and 140 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:46:12,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:46:12,732 INFO L93 Difference]: Finished difference Result 132 states and 149 transitions. [2021-12-14 19:46:12,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-14 19:46:12,733 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-12-14 19:46:12,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:46:12,734 INFO L225 Difference]: With dead ends: 132 [2021-12-14 19:46:12,734 INFO L226 Difference]: Without dead ends: 132 [2021-12-14 19:46:12,734 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-12-14 19:46:12,735 INFO L933 BasicCegarLoop]: 89 mSDtfsCounter, 17 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:46:12,736 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 266 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 19:46:12,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2021-12-14 19:46:12,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 128. [2021-12-14 19:46:12,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 96 states have (on average 1.5104166666666667) internal successors, (145), 127 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-14 19:46:12,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 145 transitions. [2021-12-14 19:46:12,740 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 145 transitions. Word has length 16 [2021-12-14 19:46:12,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:46:12,740 INFO L470 AbstractCegarLoop]: Abstraction has 128 states and 145 transitions. [2021-12-14 19:46:12,740 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:46:12,740 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 145 transitions. [2021-12-14 19:46:12,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-14 19:46:12,741 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:46:12,741 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:46:12,741 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-14 19:46:12,741 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 55 more)] === [2021-12-14 19:46:12,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:46:12,742 INFO L85 PathProgramCache]: Analyzing trace with hash 1546362871, now seen corresponding path program 1 times [2021-12-14 19:46:12,742 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:46:12,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466499895] [2021-12-14 19:46:12,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:46:12,743 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:46:12,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:46:12,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:46:12,837 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:46:12,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466499895] [2021-12-14 19:46:12,837 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466499895] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:46:12,837 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:46:12,837 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-14 19:46:12,837 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122590803] [2021-12-14 19:46:12,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:46:12,838 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-14 19:46:12,838 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:46:12,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-14 19:46:12,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-12-14 19:46:12,839 INFO L87 Difference]: Start difference. First operand 128 states and 145 transitions. Second operand has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:46:13,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:46:13,111 INFO L93 Difference]: Finished difference Result 132 states and 147 transitions. [2021-12-14 19:46:13,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-14 19:46:13,112 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-12-14 19:46:13,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:46:13,113 INFO L225 Difference]: With dead ends: 132 [2021-12-14 19:46:13,113 INFO L226 Difference]: Without dead ends: 132 [2021-12-14 19:46:13,113 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2021-12-14 19:46:13,113 INFO L933 BasicCegarLoop]: 38 mSDtfsCounter, 148 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 447 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 447 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 19:46:13,114 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [148 Valid, 167 Invalid, 480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 447 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 19:46:13,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2021-12-14 19:46:13,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 127. [2021-12-14 19:46:13,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 96 states have (on average 1.5) internal successors, (144), 126 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:46:13,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 144 transitions. [2021-12-14 19:46:13,116 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 144 transitions. Word has length 16 [2021-12-14 19:46:13,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:46:13,116 INFO L470 AbstractCegarLoop]: Abstraction has 127 states and 144 transitions. [2021-12-14 19:46:13,116 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:46:13,116 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 144 transitions. [2021-12-14 19:46:13,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-14 19:46:13,117 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:46:13,117 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:46:13,117 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-14 19:46:13,118 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 55 more)] === [2021-12-14 19:46:13,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:46:13,118 INFO L85 PathProgramCache]: Analyzing trace with hash 1546362872, now seen corresponding path program 1 times [2021-12-14 19:46:13,118 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:46:13,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371421852] [2021-12-14 19:46:13,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:46:13,118 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:46:13,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:46:13,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:46:13,220 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:46:13,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371421852] [2021-12-14 19:46:13,221 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371421852] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:46:13,221 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:46:13,221 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-14 19:46:13,221 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187133032] [2021-12-14 19:46:13,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:46:13,222 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-14 19:46:13,222 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:46:13,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-14 19:46:13,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-12-14 19:46:13,223 INFO L87 Difference]: Start difference. First operand 127 states and 144 transitions. Second operand has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 10 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:46:13,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:46:13,602 INFO L93 Difference]: Finished difference Result 128 states and 143 transitions. [2021-12-14 19:46:13,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-14 19:46:13,602 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 10 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-12-14 19:46:13,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:46:13,603 INFO L225 Difference]: With dead ends: 128 [2021-12-14 19:46:13,603 INFO L226 Difference]: Without dead ends: 128 [2021-12-14 19:46:13,603 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=140, Invalid=366, Unknown=0, NotChecked=0, Total=506 [2021-12-14 19:46:13,604 INFO L933 BasicCegarLoop]: 43 mSDtfsCounter, 151 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 465 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 19:46:13,604 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [151 Valid, 182 Invalid, 502 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 465 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 19:46:13,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2021-12-14 19:46:13,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 116. [2021-12-14 19:46:13,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 90 states have (on average 1.4777777777777779) internal successors, (133), 115 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:46:13,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 133 transitions. [2021-12-14 19:46:13,607 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 133 transitions. Word has length 16 [2021-12-14 19:46:13,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:46:13,607 INFO L470 AbstractCegarLoop]: Abstraction has 116 states and 133 transitions. [2021-12-14 19:46:13,607 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 10 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:46:13,607 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 133 transitions. [2021-12-14 19:46:13,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-12-14 19:46:13,608 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:46:13,608 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:46:13,608 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-14 19:46:13,608 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 55 more)] === [2021-12-14 19:46:13,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:46:13,608 INFO L85 PathProgramCache]: Analyzing trace with hash 1695296497, now seen corresponding path program 1 times [2021-12-14 19:46:13,609 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:46:13,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693664608] [2021-12-14 19:46:13,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:46:13,609 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:46:13,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:46:13,684 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:46:13,684 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:46:13,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693664608] [2021-12-14 19:46:13,685 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693664608] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:46:13,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1623270266] [2021-12-14 19:46:13,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:46:13,685 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:46:13,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:46:13,693 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 19:46:13,725 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-14 19:46:13,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:46:13,777 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 19 conjunts are in the unsatisfiable core [2021-12-14 19:46:13,781 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:46:13,838 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-14 19:46:13,888 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:46:13,889 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-14 19:46:13,905 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:46: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-14 19:46:14,014 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:46:14,014 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-14 19:46:14,085 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:46:14,085 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 19:46:14,086 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1623270266] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:46:14,086 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-14 19:46:14,086 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [7] total 14 [2021-12-14 19:46:14,086 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721965506] [2021-12-14 19:46:14,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:46:14,087 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-14 19:46:14,087 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:46:14,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-14 19:46:14,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2021-12-14 19:46:14,087 INFO L87 Difference]: Start difference. First operand 116 states and 133 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:46:14,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:46:14,152 INFO L93 Difference]: Finished difference Result 122 states and 139 transitions. [2021-12-14 19:46:14,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-14 19:46:14,153 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 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 20 [2021-12-14 19:46:14,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:46:14,153 INFO L225 Difference]: With dead ends: 122 [2021-12-14 19:46:14,154 INFO L226 Difference]: Without dead ends: 121 [2021-12-14 19:46:14,154 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2021-12-14 19:46:14,155 INFO L933 BasicCegarLoop]: 85 mSDtfsCounter, 6 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 42 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:46:14,156 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 190 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 66 Invalid, 0 Unknown, 42 Unchecked, 0.1s Time] [2021-12-14 19:46:14,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2021-12-14 19:46:14,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 119. [2021-12-14 19:46:14,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 93 states have (on average 1.4623655913978495) internal successors, (136), 118 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:46:14,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 136 transitions. [2021-12-14 19:46:14,158 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 136 transitions. Word has length 20 [2021-12-14 19:46:14,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:46:14,159 INFO L470 AbstractCegarLoop]: Abstraction has 119 states and 136 transitions. [2021-12-14 19:46:14,159 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:46:14,159 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 136 transitions. [2021-12-14 19:46:14,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-12-14 19:46:14,159 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:46:14,160 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:46:14,188 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-14 19:46:14,371 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-12-14 19:46:14,372 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 55 more)] === [2021-12-14 19:46:14,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:46:14,372 INFO L85 PathProgramCache]: Analyzing trace with hash 1116806667, now seen corresponding path program 1 times [2021-12-14 19:46:14,373 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:46:14,373 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933695569] [2021-12-14 19:46:14,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:46:14,373 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:46:14,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:46:14,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:46:14,451 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:46:14,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933695569] [2021-12-14 19:46:14,451 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933695569] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:46:14,451 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:46:14,451 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 19:46:14,452 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196113578] [2021-12-14 19:46:14,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:46:14,452 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 19:46:14,454 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:46:14,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 19:46:14,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-14 19:46:14,454 INFO L87 Difference]: Start difference. First operand 119 states and 136 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:46:14,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:46:14,592 INFO L93 Difference]: Finished difference Result 185 states and 207 transitions. [2021-12-14 19:46:14,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 19:46:14,593 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 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 20 [2021-12-14 19:46:14,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:46:14,593 INFO L225 Difference]: With dead ends: 185 [2021-12-14 19:46:14,593 INFO L226 Difference]: Without dead ends: 185 [2021-12-14 19:46:14,594 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-12-14 19:46:14,594 INFO L933 BasicCegarLoop]: 122 mSDtfsCounter, 51 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:46:14,594 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [51 Valid, 416 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 19:46:14,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2021-12-14 19:46:14,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 132. [2021-12-14 19:46:14,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 106 states have (on average 1.4433962264150944) internal successors, (153), 131 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-14 19:46:14,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 153 transitions. [2021-12-14 19:46:14,597 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 153 transitions. Word has length 20 [2021-12-14 19:46:14,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:46:14,597 INFO L470 AbstractCegarLoop]: Abstraction has 132 states and 153 transitions. [2021-12-14 19:46:14,597 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:46:14,597 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 153 transitions. [2021-12-14 19:46:14,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-12-14 19:46:14,597 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:46:14,597 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:46:14,597 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-14 19:46:14,597 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr48REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 55 more)] === [2021-12-14 19:46:14,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:46:14,598 INFO L85 PathProgramCache]: Analyzing trace with hash 1012953034, now seen corresponding path program 1 times [2021-12-14 19:46:14,598 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:46:14,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50104667] [2021-12-14 19:46:14,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:46:14,598 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:46:14,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:46:14,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:46:14,696 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:46:14,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50104667] [2021-12-14 19:46:14,696 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50104667] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:46:14,696 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:46:14,697 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-14 19:46:14,697 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950240612] [2021-12-14 19:46:14,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:46:14,697 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-14 19:46:14,697 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:46:14,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-14 19:46:14,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-12-14 19:46:14,698 INFO L87 Difference]: Start difference. First operand 132 states and 153 transitions. Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:46:14,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:46:14,888 INFO L93 Difference]: Finished difference Result 161 states and 183 transitions. [2021-12-14 19:46:14,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-14 19:46:14,889 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-12-14 19:46:14,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:46:14,889 INFO L225 Difference]: With dead ends: 161 [2021-12-14 19:46:14,889 INFO L226 Difference]: Without dead ends: 161 [2021-12-14 19:46:14,889 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2021-12-14 19:46:14,890 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 213 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:46:14,890 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [213 Valid, 119 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 19:46:14,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2021-12-14 19:46:14,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 133. [2021-12-14 19:46:14,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 108 states have (on average 1.4351851851851851) internal successors, (155), 132 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:46:14,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 155 transitions. [2021-12-14 19:46:14,892 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 155 transitions. Word has length 21 [2021-12-14 19:46:14,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:46:14,893 INFO L470 AbstractCegarLoop]: Abstraction has 133 states and 155 transitions. [2021-12-14 19:46:14,893 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:46:14,893 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 155 transitions. [2021-12-14 19:46:14,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-12-14 19:46:14,893 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:46:14,893 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:46:14,893 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-14 19:46:14,893 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr49REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 55 more)] === [2021-12-14 19:46:14,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:46:14,894 INFO L85 PathProgramCache]: Analyzing trace with hash 1012953035, now seen corresponding path program 1 times [2021-12-14 19:46:14,894 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:46:14,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772056524] [2021-12-14 19:46:14,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:46:14,894 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:46:14,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:46:15,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:46:15,028 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:46:15,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772056524] [2021-12-14 19:46:15,028 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772056524] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:46:15,028 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:46:15,028 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 19:46:15,028 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805574208] [2021-12-14 19:46:15,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:46:15,029 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-14 19:46:15,029 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:46:15,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-14 19:46:15,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-14 19:46:15,030 INFO L87 Difference]: Start difference. First operand 133 states and 155 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:46:15,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:46:15,298 INFO L93 Difference]: Finished difference Result 192 states and 211 transitions. [2021-12-14 19:46:15,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-14 19:46:15,298 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-12-14 19:46:15,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:46:15,299 INFO L225 Difference]: With dead ends: 192 [2021-12-14 19:46:15,299 INFO L226 Difference]: Without dead ends: 192 [2021-12-14 19:46:15,299 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2021-12-14 19:46:15,300 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 242 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 19:46:15,300 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [242 Valid, 154 Invalid, 356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 317 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 19:46:15,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2021-12-14 19:46:15,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 135. [2021-12-14 19:46:15,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 110 states have (on average 1.4272727272727272) internal successors, (157), 134 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:46:15,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 157 transitions. [2021-12-14 19:46:15,303 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 157 transitions. Word has length 21 [2021-12-14 19:46:15,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:46:15,303 INFO L470 AbstractCegarLoop]: Abstraction has 135 states and 157 transitions. [2021-12-14 19:46:15,303 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:46:15,303 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 157 transitions. [2021-12-14 19:46:15,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-12-14 19:46:15,303 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:46:15,303 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:46:15,303 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-14 19:46:15,304 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 55 more)] === [2021-12-14 19:46:15,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:46:15,304 INFO L85 PathProgramCache]: Analyzing trace with hash -1509706513, now seen corresponding path program 1 times [2021-12-14 19:46:15,304 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:46:15,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214299985] [2021-12-14 19:46:15,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:46:15,304 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:46:15,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:46:15,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:46:15,461 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:46:15,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214299985] [2021-12-14 19:46:15,461 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214299985] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:46:15,461 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:46:15,461 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-12-14 19:46:15,461 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724098643] [2021-12-14 19:46:15,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:46:15,462 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-14 19:46:15,462 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:46:15,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-14 19:46:15,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-12-14 19:46:15,463 INFO L87 Difference]: Start difference. First operand 135 states and 157 transitions. Second operand has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 12 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:46:15,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:46:15,930 INFO L93 Difference]: Finished difference Result 202 states and 226 transitions. [2021-12-14 19:46:15,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-14 19:46:15,931 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 12 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-12-14 19:46:15,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:46:15,932 INFO L225 Difference]: With dead ends: 202 [2021-12-14 19:46:15,932 INFO L226 Difference]: Without dead ends: 202 [2021-12-14 19:46:15,932 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=343, Unknown=0, NotChecked=0, Total=420 [2021-12-14 19:46:15,932 INFO L933 BasicCegarLoop]: 61 mSDtfsCounter, 147 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 682 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 719 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 682 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-14 19:46:15,933 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [147 Valid, 409 Invalid, 719 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 682 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-14 19:46:15,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2021-12-14 19:46:15,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 147. [2021-12-14 19:46:15,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 122 states have (on average 1.3934426229508197) internal successors, (170), 146 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:46:15,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 170 transitions. [2021-12-14 19:46:15,935 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 170 transitions. Word has length 23 [2021-12-14 19:46:15,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:46:15,936 INFO L470 AbstractCegarLoop]: Abstraction has 147 states and 170 transitions. [2021-12-14 19:46:15,936 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 12 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:46:15,936 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 170 transitions. [2021-12-14 19:46:15,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-12-14 19:46:15,937 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:46:15,937 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:46:15,937 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-14 19:46:15,937 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 55 more)] === [2021-12-14 19:46:15,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:46:15,937 INFO L85 PathProgramCache]: Analyzing trace with hash 442909652, now seen corresponding path program 1 times [2021-12-14 19:46:15,938 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:46:15,938 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548392608] [2021-12-14 19:46:15,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:46:15,938 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:46:15,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:46:15,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:46:15,964 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:46:15,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548392608] [2021-12-14 19:46:15,965 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548392608] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:46:15,965 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:46:15,965 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-14 19:46:15,965 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7790508] [2021-12-14 19:46:15,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:46:15,965 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-14 19:46:15,966 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:46:15,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-14 19:46:15,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-14 19:46:15,966 INFO L87 Difference]: Start difference. First operand 147 states and 170 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:46:16,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:46:16,039 INFO L93 Difference]: Finished difference Result 172 states and 192 transitions. [2021-12-14 19:46:16,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-14 19:46:16,040 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2021-12-14 19:46:16,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:46:16,041 INFO L225 Difference]: With dead ends: 172 [2021-12-14 19:46:16,041 INFO L226 Difference]: Without dead ends: 172 [2021-12-14 19:46:16,041 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-14 19:46:16,041 INFO L933 BasicCegarLoop]: 62 mSDtfsCounter, 156 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:46:16,042 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [156 Valid, 102 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 19:46:16,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2021-12-14 19:46:16,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 147. [2021-12-14 19:46:16,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 122 states have (on average 1.3852459016393444) internal successors, (169), 146 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:46:16,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 169 transitions. [2021-12-14 19:46:16,044 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 169 transitions. Word has length 24 [2021-12-14 19:46:16,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:46:16,044 INFO L470 AbstractCegarLoop]: Abstraction has 147 states and 169 transitions. [2021-12-14 19:46:16,045 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:46:16,045 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 169 transitions. [2021-12-14 19:46:16,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-12-14 19:46:16,045 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:46:16,045 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:46:16,045 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-12-14 19:46:16,046 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 55 more)] === [2021-12-14 19:46:16,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:46:16,046 INFO L85 PathProgramCache]: Analyzing trace with hash -1972392122, now seen corresponding path program 1 times [2021-12-14 19:46:16,046 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:46:16,046 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227469654] [2021-12-14 19:46:16,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:46:16,046 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:46:16,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:46:16,123 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:46:16,123 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:46:16,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227469654] [2021-12-14 19:46:16,123 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227469654] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:46:16,124 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:46:16,124 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-14 19:46:16,124 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73141508] [2021-12-14 19:46:16,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:46:16,124 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-14 19:46:16,124 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:46:16,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-14 19:46:16,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-12-14 19:46:16,125 INFO L87 Difference]: Start difference. First operand 147 states and 169 transitions. Second operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:46:16,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:46:16,324 INFO L93 Difference]: Finished difference Result 207 states and 229 transitions. [2021-12-14 19:46:16,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 19:46:16,325 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-12-14 19:46:16,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:46:16,326 INFO L225 Difference]: With dead ends: 207 [2021-12-14 19:46:16,326 INFO L226 Difference]: Without dead ends: 207 [2021-12-14 19:46:16,326 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-12-14 19:46:16,327 INFO L933 BasicCegarLoop]: 89 mSDtfsCounter, 194 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 19:46:16,327 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [194 Valid, 275 Invalid, 340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 312 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 19:46:16,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2021-12-14 19:46:16,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 151. [2021-12-14 19:46:16,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 126 states have (on average 1.373015873015873) internal successors, (173), 150 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:46:16,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 173 transitions. [2021-12-14 19:46:16,330 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 173 transitions. Word has length 25 [2021-12-14 19:46:16,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:46:16,330 INFO L470 AbstractCegarLoop]: Abstraction has 151 states and 173 transitions. [2021-12-14 19:46:16,330 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:46:16,330 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 173 transitions. [2021-12-14 19:46:16,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-14 19:46:16,331 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:46:16,331 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:46:16,331 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-14 19:46:16,332 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 55 more)] === [2021-12-14 19:46:16,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:46:16,332 INFO L85 PathProgramCache]: Analyzing trace with hash 435867832, now seen corresponding path program 1 times [2021-12-14 19:46:16,332 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:46:16,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790021345] [2021-12-14 19:46:16,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:46:16,333 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:46:16,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:46:16,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:46:16,368 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:46:16,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790021345] [2021-12-14 19:46:16,369 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [790021345] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:46:16,369 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:46:16,369 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 19:46:16,369 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433044085] [2021-12-14 19:46:16,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:46:16,370 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-14 19:46:16,370 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:46:16,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-14 19:46:16,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-14 19:46:16,371 INFO L87 Difference]: Start difference. First operand 151 states and 173 transitions. Second operand has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:46:16,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:46:16,452 INFO L93 Difference]: Finished difference Result 169 states and 189 transitions. [2021-12-14 19:46:16,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-14 19:46:16,453 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-12-14 19:46:16,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:46:16,454 INFO L225 Difference]: With dead ends: 169 [2021-12-14 19:46:16,454 INFO L226 Difference]: Without dead ends: 169 [2021-12-14 19:46:16,454 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-14 19:46:16,455 INFO L933 BasicCegarLoop]: 60 mSDtfsCounter, 151 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:46:16,455 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [151 Valid, 93 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 19:46:16,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2021-12-14 19:46:16,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 152. [2021-12-14 19:46:16,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 127 states have (on average 1.3700787401574803) internal successors, (174), 151 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:46:16,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 174 transitions. [2021-12-14 19:46:16,458 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 174 transitions. Word has length 26 [2021-12-14 19:46:16,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:46:16,459 INFO L470 AbstractCegarLoop]: Abstraction has 152 states and 174 transitions. [2021-12-14 19:46:16,459 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:46:16,459 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 174 transitions. [2021-12-14 19:46:16,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-14 19:46:16,459 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:46:16,459 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-14 19:46:16,460 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-12-14 19:46:16,460 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr48REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 55 more)] === [2021-12-14 19:46:16,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:46:16,463 INFO L85 PathProgramCache]: Analyzing trace with hash 1248965482, now seen corresponding path program 1 times [2021-12-14 19:46:16,464 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:46:16,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730577371] [2021-12-14 19:46:16,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:46:16,464 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:46:16,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:46:16,643 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:46:16,644 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:46:16,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730577371] [2021-12-14 19:46:16,644 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730577371] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:46:16,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [609220843] [2021-12-14 19:46:16,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:46:16,644 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:46:16,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:46:16,645 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 19:46:16,646 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-14 19:46:16,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:46:16,734 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 71 conjunts are in the unsatisfiable core [2021-12-14 19:46:16,741 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:46:16,750 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-14 19:46:16,784 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-14 19:46:16,790 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-14 19:46:16,846 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:46:16,847 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-14 19:46:16,856 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:46:16,857 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-14 19:46:16,880 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:46:16,881 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-14 19:46:16,886 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:46:16,887 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-14 19:46:16,932 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-14 19:46:16,933 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-14 19:46:16,959 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-14 19:46:16,965 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-14 19:46:16,982 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-14 19:46:16,990 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-12-14 19:46:17,019 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:46:17,021 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-12-14 19:46:17,022 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 41 [2021-12-14 19:46:17,026 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:46:17,027 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2021-12-14 19:46:17,361 INFO L354 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2021-12-14 19:46:17,362 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 68 treesize of output 42 [2021-12-14 19:46:17,369 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-14 19:46:17,369 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 19 [2021-12-14 19:46:17,379 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:46:17,379 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:46:17,653 INFO L354 Elim1Store]: treesize reduction 19, result has 44.1 percent of original size [2021-12-14 19:46:17,653 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 172 treesize of output 170 [2021-12-14 19:46:17,657 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:46:17,658 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:46:17,661 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:46:17,661 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 43 [2021-12-14 19:46:17,669 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:46:17,670 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 15 treesize of output 9 [2021-12-14 19:46:17,693 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:46:17,694 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 15 treesize of output 9 [2021-12-14 19:46:17,720 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-12-14 19:46:17,721 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 9 [2021-12-14 19:46:17,725 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-12-14 19:46:17,725 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 9 [2021-12-14 19:46:17,800 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 13 treesize of output 9 [2021-12-14 19:46:17,816 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 13 treesize of output 9 [2021-12-14 19:46:17,838 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-14 19:46:17,862 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 13 treesize of output 9 [2021-12-14 19:46:17,930 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 13 treesize of output 9 [2021-12-14 19:46:17,945 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 13 treesize of output 9 [2021-12-14 19:46:17,968 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 13 treesize of output 9 [2021-12-14 19:46:17,993 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 13 treesize of output 9 [2021-12-14 19:46:18,021 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 13 treesize of output 9 [2021-12-14 19:46:18,036 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 13 treesize of output 9 [2021-12-14 19:46:18,059 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 13 treesize of output 9 [2021-12-14 19:46:18,099 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 13 treesize of output 9 [2021-12-14 19:46:18,128 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 13 treesize of output 9 [2021-12-14 19:46:18,144 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 13 treesize of output 9 [2021-12-14 19:46:18,169 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 13 treesize of output 9 [2021-12-14 19:46:18,210 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 13 treesize of output 9 [2021-12-14 19:46:18,236 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 13 treesize of output 9 [2021-12-14 19:46:18,251 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-14 19:46:18,274 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 13 treesize of output 9 [2021-12-14 19:46:18,301 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 13 treesize of output 9 [2021-12-14 19:46:18,332 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 13 treesize of output 9 [2021-12-14 19:46:18,348 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-14 19:46:18,378 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 13 treesize of output 9 [2021-12-14 19:46:18,393 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 13 treesize of output 9 [2021-12-14 19:46:18,428 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 13 treesize of output 9 [2021-12-14 19:46:18,448 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 13 treesize of output 9 [2021-12-14 19:46:18,542 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 13 treesize of output 9 [2021-12-14 19:46:18,567 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 13 treesize of output 9 [2021-12-14 19:46:18,615 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 13 treesize of output 9 [2021-12-14 19:46:18,637 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 13 treesize of output 9 [2021-12-14 19:46:18,680 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 13 treesize of output 9 [2021-12-14 19:46:18,706 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 13 treesize of output 9 [2021-12-14 19:46:18,810 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:46:18,815 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:46:18,815 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 47 treesize of output 53 [2021-12-14 19:46:18,819 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:46:18,823 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:46:18,823 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 53 treesize of output 58 [2021-12-14 19:46:18,828 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:46:18,828 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 56 [2021-12-14 19:46:18,844 INFO L354 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2021-12-14 19:46:18,844 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 68 treesize of output 73 [2021-12-14 19:46:18,851 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:46:18,851 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 71 [2021-12-14 19:46:18,864 INFO L354 Elim1Store]: treesize reduction 9, result has 47.1 percent of original size [2021-12-14 19:46:18,864 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 83 treesize of output 85 [2021-12-14 19:46:18,932 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:46:18,933 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [609220843] provided 1 perfect and 1 imperfect interpolant sequences [2021-12-14 19:46:18,933 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2021-12-14 19:46:18,933 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [11, 13] total 30 [2021-12-14 19:46:18,933 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7906284] [2021-12-14 19:46:18,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:46:18,933 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-12-14 19:46:18,934 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:46:18,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-12-14 19:46:18,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=752, Unknown=7, NotChecked=0, Total=870 [2021-12-14 19:46:18,934 INFO L87 Difference]: Start difference. First operand 152 states and 174 transitions. Second operand has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:46:19,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:46:19,425 INFO L93 Difference]: Finished difference Result 167 states and 189 transitions. [2021-12-14 19:46:19,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-12-14 19:46:19,425 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-12-14 19:46:19,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:46:19,426 INFO L225 Difference]: With dead ends: 167 [2021-12-14 19:46:19,426 INFO L226 Difference]: Without dead ends: 167 [2021-12-14 19:46:19,427 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 322 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=171, Invalid=1304, Unknown=7, NotChecked=0, Total=1482 [2021-12-14 19:46:19,427 INFO L933 BasicCegarLoop]: 73 mSDtfsCounter, 45 mSDsluCounter, 427 mSDsCounter, 0 mSdLazyCounter, 424 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 500 SdHoareTripleChecker+Invalid, 598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 150 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 19:46:19,427 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [45 Valid, 500 Invalid, 598 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 424 Invalid, 0 Unknown, 150 Unchecked, 0.2s Time] [2021-12-14 19:46:19,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2021-12-14 19:46:19,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 155. [2021-12-14 19:46:19,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 130 states have (on average 1.3615384615384616) internal successors, (177), 154 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:46:19,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 177 transitions. [2021-12-14 19:46:19,429 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 177 transitions. Word has length 26 [2021-12-14 19:46:19,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:46:19,429 INFO L470 AbstractCegarLoop]: Abstraction has 155 states and 177 transitions. [2021-12-14 19:46:19,430 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:46:19,430 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 177 transitions. [2021-12-14 19:46:19,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-14 19:46:19,430 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:46:19,430 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:46:19,450 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-12-14 19:46:19,639 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,SelfDestructingSolverStorable17 [2021-12-14 19:46:19,639 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr48REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 55 more)] === [2021-12-14 19:46:19,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:46:19,640 INFO L85 PathProgramCache]: Analyzing trace with hash -1016244459, now seen corresponding path program 1 times [2021-12-14 19:46:19,640 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:46:19,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087374084] [2021-12-14 19:46:19,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:46:19,640 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:46:19,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:46:19,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:46:19,766 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:46:19,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087374084] [2021-12-14 19:46:19,766 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087374084] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:46:19,766 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:46:19,766 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-14 19:46:19,766 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588004293] [2021-12-14 19:46:19,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:46:19,767 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-14 19:46:19,768 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:46:19,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-14 19:46:19,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2021-12-14 19:46:19,768 INFO L87 Difference]: Start difference. First operand 155 states and 177 transitions. Second operand has 11 states, 11 states have (on average 2.3636363636363638) 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-14 19:46:20,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:46:20,069 INFO L93 Difference]: Finished difference Result 191 states and 211 transitions. [2021-12-14 19:46:20,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-14 19:46:20,069 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.3636363636363638) 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-14 19:46:20,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:46:20,070 INFO L225 Difference]: With dead ends: 191 [2021-12-14 19:46:20,070 INFO L226 Difference]: Without dead ends: 191 [2021-12-14 19:46:20,071 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2021-12-14 19:46:20,071 INFO L933 BasicCegarLoop]: 69 mSDtfsCounter, 68 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 559 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 591 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 559 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 19:46:20,071 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [68 Valid, 365 Invalid, 591 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 559 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 19:46:20,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2021-12-14 19:46:20,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 160. [2021-12-14 19:46:20,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 135 states have (on average 1.348148148148148) internal successors, (182), 159 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:46:20,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 182 transitions. [2021-12-14 19:46:20,074 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 182 transitions. Word has length 26 [2021-12-14 19:46:20,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:46:20,074 INFO L470 AbstractCegarLoop]: Abstraction has 160 states and 182 transitions. [2021-12-14 19:46:20,074 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.3636363636363638) 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-14 19:46:20,074 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 182 transitions. [2021-12-14 19:46:20,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-12-14 19:46:20,074 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:46:20,074 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-14 19:46:20,075 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-12-14 19:46:20,075 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 55 more)] === [2021-12-14 19:46:20,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:46:20,083 INFO L85 PathProgramCache]: Analyzing trace with hash -1528828450, now seen corresponding path program 1 times [2021-12-14 19:46:20,083 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:46:20,083 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856558118] [2021-12-14 19:46:20,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:46:20,084 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:46:20,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:46:20,217 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:46:20,217 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:46:20,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856558118] [2021-12-14 19:46:20,217 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856558118] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:46:20,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1391091164] [2021-12-14 19:46:20,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:46:20,218 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:46:20,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:46:20,232 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 19:46:20,246 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-14 19:46:20,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:46:20,327 INFO L263 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 35 conjunts are in the unsatisfiable core [2021-12-14 19:46:20,328 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:46:20,332 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-14 19:46:20,396 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-14 19:46:20,397 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-14 19:46:20,425 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-14 19:46:20,485 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 19:46:20,486 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-14 19:46:20,544 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 19:46:20,544 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 22 treesize of output 22 [2021-12-14 19:46:20,577 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 19:46:20,577 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-14 19:46:20,651 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-14 19:46:20,655 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:46:20,655 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:46:20,711 INFO L354 Elim1Store]: treesize reduction 5, result has 66.7 percent of original size [2021-12-14 19:46:20,711 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 19 treesize of output 18 [2021-12-14 19:46:20,715 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_799 (Array Int Int))) (= |c_ULTIMATE.start_main_~x~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_799) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) is different from false [2021-12-14 19:46:20,719 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_799 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_799) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_#t~mem5#1.base|)) is different from false [2021-12-14 19:46:20,723 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_799 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (= (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_799) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) .cse0))) is different from false [2021-12-14 19:46:20,731 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_799 (Array Int Int)) (v_ArrVal_797 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_797))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (= (select (select (store .cse0 .cse1 v_ArrVal_799) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) .cse1)))) is different from false [2021-12-14 19:46:20,736 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_799 (Array Int Int)) (v_ArrVal_797 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_797))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (= (select (select (store .cse0 .cse1 v_ArrVal_799) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) .cse1)))) is different from false [2021-12-14 19:46:20,746 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:46:20,746 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 51 treesize of output 36 [2021-12-14 19:46:20,753 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:46:20,754 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 408 treesize of output 343 [2021-12-14 19:46:20,762 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:46:20,762 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 328 treesize of output 300 [2021-12-14 19:46:20,766 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 292 treesize of output 276 [2021-12-14 19:46:21,151 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:46:21,151 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1391091164] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 19:46:21,151 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 19:46:21,152 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 14] total 31 [2021-12-14 19:46:21,152 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766410380] [2021-12-14 19:46:21,152 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 19:46:21,152 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2021-12-14 19:46:21,153 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:46:21,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-12-14 19:46:21,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=617, Unknown=10, NotChecked=270, Total=992 [2021-12-14 19:46:21,153 INFO L87 Difference]: Start difference. First operand 160 states and 182 transitions. Second operand has 32 states, 31 states have (on average 2.161290322580645) internal successors, (67), 32 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:46:21,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:46:21,866 INFO L93 Difference]: Finished difference Result 299 states and 338 transitions. [2021-12-14 19:46:21,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-12-14 19:46:21,867 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 2.161290322580645) internal successors, (67), 32 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-12-14 19:46:21,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:46:21,868 INFO L225 Difference]: With dead ends: 299 [2021-12-14 19:46:21,868 INFO L226 Difference]: Without dead ends: 299 [2021-12-14 19:46:21,868 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 36 SyntacticMatches, 5 SemanticMatches, 40 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=244, Invalid=1098, Unknown=10, NotChecked=370, Total=1722 [2021-12-14 19:46:21,869 INFO L933 BasicCegarLoop]: 70 mSDtfsCounter, 297 mSDsluCounter, 709 mSDsCounter, 0 mSdLazyCounter, 1033 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 779 SdHoareTripleChecker+Invalid, 2208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 1033 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1121 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-14 19:46:21,869 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [297 Valid, 779 Invalid, 2208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 1033 Invalid, 0 Unknown, 1121 Unchecked, 0.4s Time] [2021-12-14 19:46:21,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2021-12-14 19:46:21,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 179. [2021-12-14 19:46:21,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 154 states have (on average 1.3376623376623376) internal successors, (206), 178 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:46:21,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 206 transitions. [2021-12-14 19:46:21,871 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 206 transitions. Word has length 27 [2021-12-14 19:46:21,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:46:21,872 INFO L470 AbstractCegarLoop]: Abstraction has 179 states and 206 transitions. [2021-12-14 19:46:21,872 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 2.161290322580645) internal successors, (67), 32 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:46:21,872 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 206 transitions. [2021-12-14 19:46:21,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-12-14 19:46:21,872 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:46:21,872 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-14 19:46:21,896 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-12-14 19:46:22,079 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:46:22,079 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 55 more)] === [2021-12-14 19:46:22,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:46:22,080 INFO L85 PathProgramCache]: Analyzing trace with hash -1528828449, now seen corresponding path program 1 times [2021-12-14 19:46:22,080 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:46:22,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076721726] [2021-12-14 19:46:22,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:46:22,080 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:46:22,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:46:22,265 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:46:22,265 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:46:22,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076721726] [2021-12-14 19:46:22,265 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076721726] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:46:22,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1455130737] [2021-12-14 19:46:22,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:46:22,265 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:46:22,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:46:22,272 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 19:46:22,273 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-14 19:46:22,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:46:22,360 INFO L263 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 50 conjunts are in the unsatisfiable core [2021-12-14 19:46:22,362 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:46:22,367 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-14 19:46:22,431 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-14 19:46:22,444 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-14 19:46:22,444 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-14 19:46:22,473 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-14 19:46:22,484 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-14 19:46:22,564 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 19:46:22,564 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-14 19:46:22,567 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2021-12-14 19:46:22,657 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 19:46:22,657 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 31 treesize of output 29 [2021-12-14 19:46:22,664 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:46:22,665 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-14 19:46:22,680 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 19:46:22,680 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-14 19:46:22,683 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2021-12-14 19:46:22,782 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-14 19:46:22,784 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-14 19:46:22,822 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:46:22,822 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:46:22,954 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_902 (Array Int Int)) (v_ArrVal_903 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_902) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_903) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((v_ArrVal_902 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_902) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2021-12-14 19:46:22,970 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_902 (Array Int Int)) (v_ArrVal_903 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_902) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_903) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((v_ArrVal_902 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_902) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2021-12-14 19:46:22,979 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_902 (Array Int Int)) (v_ArrVal_903 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_902) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_903) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) (forall ((v_ArrVal_902 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_902) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2021-12-14 19:46:22,996 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_898 (Array Int Int)) (v_ArrVal_899 (Array Int Int)) (v_ArrVal_902 (Array Int Int)) (v_ArrVal_903 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_898))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_899) .cse0 v_ArrVal_902) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 4) (select |c_#length| (select (select (store .cse1 .cse0 v_ArrVal_903) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))) (forall ((v_ArrVal_898 (Array Int Int)) (v_ArrVal_899 (Array Int Int)) (v_ArrVal_902 (Array Int Int))) (<= 0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_899) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_898) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_902) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2021-12-14 19:46:23,007 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_898 (Array Int Int)) (v_ArrVal_899 (Array Int Int)) (v_ArrVal_902 (Array Int Int))) (<= 0 (select (select (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_899) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_898) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_902)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (forall ((v_ArrVal_898 (Array Int Int)) (v_ArrVal_899 (Array Int Int)) (v_ArrVal_902 (Array Int Int)) (v_ArrVal_903 (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_898))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_899) .cse2 v_ArrVal_902) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 4) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_903) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))))) is different from false [2021-12-14 19:46:23,021 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:46:23,022 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 73 treesize of output 74 [2021-12-14 19:46:23,025 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:46:23,026 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 65 treesize of output 50 [2021-12-14 19:46:23,034 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:46:23,034 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 632 treesize of output 567 [2021-12-14 19:46:23,055 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:46:23,056 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 1872 treesize of output 1783 [2021-12-14 19:46:23,075 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1768 treesize of output 1688 [2021-12-14 19:46:23,092 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 1688 treesize of output 1656 [2021-12-14 19:46:23,104 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 1656 treesize of output 1576 [2021-12-14 19:46:23,120 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:46:23,120 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 1576 treesize of output 1436